/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 12:38:06,912 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 12:38:06,915 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 12:38:06,926 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 12:38:06,926 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 12:38:06,927 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 12:38:06,929 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 12:38:06,930 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 12:38:06,932 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 12:38:06,933 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 12:38:06,933 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 12:38:06,934 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 12:38:06,935 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 12:38:06,936 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 12:38:06,937 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 12:38:06,938 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 12:38:06,938 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 12:38:06,939 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 12:38:06,941 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 12:38:06,943 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 12:38:06,944 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 12:38:06,946 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 12:38:06,947 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 12:38:06,948 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 12:38:06,950 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 12:38:06,950 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 12:38:06,951 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 12:38:06,951 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 12:38:06,952 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 12:38:06,953 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 12:38:06,953 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 12:38:06,954 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 12:38:06,954 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 12:38:06,955 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 12:38:06,956 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 12:38:06,956 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 12:38:06,960 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 12:38:06,961 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 12:38:06,961 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 12:38:06,962 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 12:38:06,962 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 12:38:06,963 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-07-01 12:38:06,978 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 12:38:06,978 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 12:38:06,979 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 12:38:06,979 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 12:38:06,980 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 12:38:06,980 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:38:06,980 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 12:38:06,980 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 12:38:06,980 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 12:38:06,980 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 12:38:06,981 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 12:38:06,981 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 12:38:06,981 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 12:38:06,981 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 12:38:06,981 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:38:06,981 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 12:38:06,982 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 12:38:06,982 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 12:38:06,982 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 12:38:06,982 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 12:38:06,982 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 12:38:06,983 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 12:38:06,983 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 12:38:06,983 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 12:38:06,983 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:38:06,983 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 12:38:06,984 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 12:38:06,984 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 12:38:06,984 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 12:38:07,159 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 12:38:07,173 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 12:38:07,177 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 12:38:07,179 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 12:38:07,179 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 12:38:07,180 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 12:38:07,239 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_94YMr0/tmp/059341bd08cf4ea3af7c4e4a6caea5a0/FLAG1edfa84c1 [2020-07-01 12:38:07,596 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 12:38:07,597 INFO L160 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 12:38:07,597 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 12:38:07,604 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_94YMr0/tmp/059341bd08cf4ea3af7c4e4a6caea5a0/FLAG1edfa84c1 [2020-07-01 12:38:08,008 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/BenchExec_run_94YMr0/tmp/059341bd08cf4ea3af7c4e4a6caea5a0 [2020-07-01 12:38:08,020 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 12:38:08,021 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 12:38:08,022 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 12:38:08,022 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 12:38:08,026 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 12:38:08,027 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:38:08" (1/1) ... [2020-07-01 12:38:08,030 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7248e851 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:38:08, skipping insertion in model container [2020-07-01 12:38:08,031 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:38:08" (1/1) ... [2020-07-01 12:38:08,039 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 12:38:08,058 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 12:38:08,306 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:38:08,319 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 12:38:08,340 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:38:08,358 INFO L208 MainTranslator]: Completed translation [2020-07-01 12:38:08,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:38:08 WrapperNode [2020-07-01 12:38:08,359 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 12:38:08,359 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 12:38:08,360 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 12:38:08,360 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 12:38:08,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:38:08" (1/1) ... [2020-07-01 12:38:08,380 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:38:08" (1/1) ... [2020-07-01 12:38:08,406 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 12:38:08,407 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 12:38:08,407 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 12:38:08,407 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 12:38:08,418 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:38:08" (1/1) ... [2020-07-01 12:38:08,418 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:38:08" (1/1) ... [2020-07-01 12:38:08,421 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:38:08" (1/1) ... [2020-07-01 12:38:08,421 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:38:08" (1/1) ... [2020-07-01 12:38:08,430 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:38:08" (1/1) ... [2020-07-01 12:38:08,436 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:38:08" (1/1) ... [2020-07-01 12:38:08,438 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:38:08" (1/1) ... [2020-07-01 12:38:08,440 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 12:38:08,441 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 12:38:08,441 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 12:38:08,441 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 12:38:08,442 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:38:08" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:38:08,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 12:38:08,520 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-01 12:38:08,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 12:38:08,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 12:38:08,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 12:38:08,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-01 12:38:08,521 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 12:38:08,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 12:38:08,890 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 12:38:08,890 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-01 12:38:08,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:38:08 BoogieIcfgContainer [2020-07-01 12:38:08,895 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 12:38:08,896 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 12:38:08,896 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 12:38:08,898 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 12:38:08,899 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:38:08" (1/1) ... [2020-07-01 12:38:08,916 INFO L313 BlockEncoder]: Initial Icfg 52 locations, 59 edges [2020-07-01 12:38:08,918 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 12:38:08,918 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 12:38:08,919 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 12:38:08,919 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:38:08,921 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 12:38:08,922 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 12:38:08,923 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 12:38:08,950 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 12:38:08,984 INFO L200 BlockEncoder]: SBE split 26 edges [2020-07-01 12:38:08,989 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility [2020-07-01 12:38:08,991 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:38:09,045 INFO L100 BaseMinimizeStates]: Removed 18 edges and 9 locations by large block encoding [2020-07-01 12:38:09,048 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-07-01 12:38:09,049 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 12:38:09,050 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:38:09,050 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 12:38:09,051 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 12:38:09,051 INFO L313 BlockEncoder]: Encoded RCFG 42 locations, 75 edges [2020-07-01 12:38:09,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:38:09 BasicIcfg [2020-07-01 12:38:09,052 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 12:38:09,053 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 12:38:09,053 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 12:38:09,056 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 12:38:09,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 12:38:08" (1/4) ... [2020-07-01 12:38:09,058 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@466ad375 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:38:09, skipping insertion in model container [2020-07-01 12:38:09,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:38:08" (2/4) ... [2020-07-01 12:38:09,058 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@466ad375 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:38:09, skipping insertion in model container [2020-07-01 12:38:09,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:38:08" (3/4) ... [2020-07-01 12:38:09,059 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@466ad375 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:38:09, skipping insertion in model container [2020-07-01 12:38:09,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:38:09" (4/4) ... [2020-07-01 12:38:09,061 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:38:09,072 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 12:38:09,080 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. [2020-07-01 12:38:09,094 INFO L251 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2020-07-01 12:38:09,118 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 12:38:09,119 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 12:38:09,119 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:38:09,119 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:38:09,119 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:38:09,119 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 12:38:09,119 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:38:09,120 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 12:38:09,135 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2020-07-01 12:38:09,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:38:09,142 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:38:09,142 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:38:09,143 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:38:09,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:38:09,149 INFO L82 PathProgramCache]: Analyzing trace with hash 249743781, now seen corresponding path program 1 times [2020-07-01 12:38:09,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:38:09,160 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041387575] [2020-07-01 12:38:09,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:38:09,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:38:09,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:38:09,324 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041387575] [2020-07-01 12:38:09,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:38:09,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:38:09,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534594645] [2020-07-01 12:38:09,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:38:09,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:38:09,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:38:09,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:38:09,365 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 3 states. [2020-07-01 12:38:09,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:38:09,508 INFO L93 Difference]: Finished difference Result 80 states and 141 transitions. [2020-07-01 12:38:09,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:38:09,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:38:09,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:38:09,522 INFO L225 Difference]: With dead ends: 80 [2020-07-01 12:38:09,523 INFO L226 Difference]: Without dead ends: 42 [2020-07-01 12:38:09,526 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:38:09,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-01 12:38:09,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-07-01 12:38:09,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-01 12:38:09,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 71 transitions. [2020-07-01 12:38:09,565 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 71 transitions. Word has length 5 [2020-07-01 12:38:09,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:38:09,565 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 71 transitions. [2020-07-01 12:38:09,566 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:38:09,566 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 71 transitions. [2020-07-01 12:38:09,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:38:09,566 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:38:09,566 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:38:09,568 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 12:38:09,568 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:38:09,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:38:09,569 INFO L82 PathProgramCache]: Analyzing trace with hash 249743812, now seen corresponding path program 1 times [2020-07-01 12:38:09,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:38:09,569 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378777426] [2020-07-01 12:38:09,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:38:09,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:38:09,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:38:09,609 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378777426] [2020-07-01 12:38:09,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:38:09,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:38:09,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269544859] [2020-07-01 12:38:09,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:38:09,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:38:09,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:38:09,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:38:09,612 INFO L87 Difference]: Start difference. First operand 42 states and 71 transitions. Second operand 3 states. [2020-07-01 12:38:09,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:38:09,730 INFO L93 Difference]: Finished difference Result 42 states and 71 transitions. [2020-07-01 12:38:09,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:38:09,731 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:38:09,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:38:09,732 INFO L225 Difference]: With dead ends: 42 [2020-07-01 12:38:09,732 INFO L226 Difference]: Without dead ends: 41 [2020-07-01 12:38:09,733 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:38:09,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-07-01 12:38:09,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-07-01 12:38:09,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-01 12:38:09,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 69 transitions. [2020-07-01 12:38:09,740 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 69 transitions. Word has length 5 [2020-07-01 12:38:09,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:38:09,740 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 69 transitions. [2020-07-01 12:38:09,740 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:38:09,740 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 69 transitions. [2020-07-01 12:38:09,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:38:09,741 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:38:09,741 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:38:09,741 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 12:38:09,741 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:38:09,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:38:09,742 INFO L82 PathProgramCache]: Analyzing trace with hash 249743814, now seen corresponding path program 1 times [2020-07-01 12:38:09,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:38:09,742 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542864346] [2020-07-01 12:38:09,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:38:09,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:38:09,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:38:09,784 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542864346] [2020-07-01 12:38:09,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:38:09,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:38:09,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177828017] [2020-07-01 12:38:09,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:38:09,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:38:09,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:38:09,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:38:09,786 INFO L87 Difference]: Start difference. First operand 41 states and 69 transitions. Second operand 4 states. [2020-07-01 12:38:09,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:38:09,874 INFO L93 Difference]: Finished difference Result 42 states and 69 transitions. [2020-07-01 12:38:09,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:38:09,875 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-07-01 12:38:09,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:38:09,876 INFO L225 Difference]: With dead ends: 42 [2020-07-01 12:38:09,876 INFO L226 Difference]: Without dead ends: 41 [2020-07-01 12:38:09,877 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:38:09,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-07-01 12:38:09,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-07-01 12:38:09,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-01 12:38:09,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 68 transitions. [2020-07-01 12:38:09,883 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 68 transitions. Word has length 5 [2020-07-01 12:38:09,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:38:09,883 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 68 transitions. [2020-07-01 12:38:09,883 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:38:09,883 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 68 transitions. [2020-07-01 12:38:09,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:38:09,884 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:38:09,884 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:38:09,884 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 12:38:09,884 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:38:09,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:38:09,885 INFO L82 PathProgramCache]: Analyzing trace with hash 249743815, now seen corresponding path program 1 times [2020-07-01 12:38:09,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:38:09,885 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301623625] [2020-07-01 12:38:09,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:38:09,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:38:09,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:38:09,920 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301623625] [2020-07-01 12:38:09,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:38:09,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:38:09,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385280136] [2020-07-01 12:38:09,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:38:09,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:38:09,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:38:09,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:38:09,922 INFO L87 Difference]: Start difference. First operand 41 states and 68 transitions. Second operand 3 states. [2020-07-01 12:38:10,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:38:10,069 INFO L93 Difference]: Finished difference Result 41 states and 68 transitions. [2020-07-01 12:38:10,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:38:10,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:38:10,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:38:10,071 INFO L225 Difference]: With dead ends: 41 [2020-07-01 12:38:10,071 INFO L226 Difference]: Without dead ends: 40 [2020-07-01 12:38:10,071 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:38:10,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-01 12:38:10,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-07-01 12:38:10,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-01 12:38:10,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 67 transitions. [2020-07-01 12:38:10,077 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 67 transitions. Word has length 5 [2020-07-01 12:38:10,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:38:10,077 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 67 transitions. [2020-07-01 12:38:10,077 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:38:10,078 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 67 transitions. [2020-07-01 12:38:10,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 12:38:10,078 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:38:10,078 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:38:10,078 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 12:38:10,079 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:38:10,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:38:10,079 INFO L82 PathProgramCache]: Analyzing trace with hash -514425440, now seen corresponding path program 1 times [2020-07-01 12:38:10,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:38:10,080 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020015483] [2020-07-01 12:38:10,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:38:10,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:38:10,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:38:10,119 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020015483] [2020-07-01 12:38:10,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:38:10,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:38:10,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835185283] [2020-07-01 12:38:10,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:38:10,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:38:10,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:38:10,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:38:10,121 INFO L87 Difference]: Start difference. First operand 40 states and 67 transitions. Second operand 3 states. [2020-07-01 12:38:10,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:38:10,235 INFO L93 Difference]: Finished difference Result 40 states and 67 transitions. [2020-07-01 12:38:10,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:38:10,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-07-01 12:38:10,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:38:10,236 INFO L225 Difference]: With dead ends: 40 [2020-07-01 12:38:10,236 INFO L226 Difference]: Without dead ends: 34 [2020-07-01 12:38:10,237 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:38:10,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-01 12:38:10,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-07-01 12:38:10,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-01 12:38:10,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 55 transitions. [2020-07-01 12:38:10,241 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 55 transitions. Word has length 7 [2020-07-01 12:38:10,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:38:10,242 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 55 transitions. [2020-07-01 12:38:10,242 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:38:10,242 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 55 transitions. [2020-07-01 12:38:10,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 12:38:10,243 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:38:10,243 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:38:10,243 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 12:38:10,244 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:38:10,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:38:10,244 INFO L82 PathProgramCache]: Analyzing trace with hash -514425438, now seen corresponding path program 1 times [2020-07-01 12:38:10,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:38:10,244 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504957053] [2020-07-01 12:38:10,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:38:10,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:38:10,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:38:10,277 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504957053] [2020-07-01 12:38:10,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:38:10,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:38:10,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839637871] [2020-07-01 12:38:10,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:38:10,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:38:10,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:38:10,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:38:10,280 INFO L87 Difference]: Start difference. First operand 34 states and 55 transitions. Second operand 3 states. [2020-07-01 12:38:10,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:38:10,346 INFO L93 Difference]: Finished difference Result 40 states and 55 transitions. [2020-07-01 12:38:10,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:38:10,347 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-07-01 12:38:10,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:38:10,348 INFO L225 Difference]: With dead ends: 40 [2020-07-01 12:38:10,348 INFO L226 Difference]: Without dead ends: 34 [2020-07-01 12:38:10,348 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:38:10,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-01 12:38:10,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-07-01 12:38:10,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-01 12:38:10,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2020-07-01 12:38:10,353 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 7 [2020-07-01 12:38:10,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:38:10,353 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2020-07-01 12:38:10,354 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:38:10,354 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2020-07-01 12:38:10,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 12:38:10,354 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:38:10,354 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:38:10,355 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 12:38:10,355 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:38:10,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:38:10,355 INFO L82 PathProgramCache]: Analyzing trace with hash -514425437, now seen corresponding path program 1 times [2020-07-01 12:38:10,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:38:10,356 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217556905] [2020-07-01 12:38:10,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:38:10,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:38:10,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:38:10,393 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217556905] [2020-07-01 12:38:10,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:38:10,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:38:10,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736512647] [2020-07-01 12:38:10,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:38:10,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:38:10,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:38:10,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:38:10,394 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 3 states. [2020-07-01 12:38:10,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:38:10,457 INFO L93 Difference]: Finished difference Result 34 states and 49 transitions. [2020-07-01 12:38:10,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:38:10,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-07-01 12:38:10,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:38:10,458 INFO L225 Difference]: With dead ends: 34 [2020-07-01 12:38:10,458 INFO L226 Difference]: Without dead ends: 27 [2020-07-01 12:38:10,459 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:38:10,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-01 12:38:10,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-01 12:38:10,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-01 12:38:10,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 40 transitions. [2020-07-01 12:38:10,463 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 40 transitions. Word has length 7 [2020-07-01 12:38:10,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:38:10,463 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 40 transitions. [2020-07-01 12:38:10,463 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:38:10,463 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 40 transitions. [2020-07-01 12:38:10,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-01 12:38:10,464 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:38:10,464 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:38:10,464 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 12:38:10,464 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:38:10,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:38:10,465 INFO L82 PathProgramCache]: Analyzing trace with hash 738440398, now seen corresponding path program 1 times [2020-07-01 12:38:10,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:38:10,465 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195066861] [2020-07-01 12:38:10,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:38:10,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:38:10,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:38:10,570 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195066861] [2020-07-01 12:38:10,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:38:10,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-01 12:38:10,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308506868] [2020-07-01 12:38:10,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-01 12:38:10,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:38:10,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-01 12:38:10,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-01 12:38:10,571 INFO L87 Difference]: Start difference. First operand 27 states and 40 transitions. Second operand 7 states. [2020-07-01 12:38:10,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:38:10,709 INFO L93 Difference]: Finished difference Result 27 states and 40 transitions. [2020-07-01 12:38:10,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-01 12:38:10,709 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2020-07-01 12:38:10,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:38:10,710 INFO L225 Difference]: With dead ends: 27 [2020-07-01 12:38:10,710 INFO L226 Difference]: Without dead ends: 26 [2020-07-01 12:38:10,710 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2020-07-01 12:38:10,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-01 12:38:10,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-07-01 12:38:10,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-01 12:38:10,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 38 transitions. [2020-07-01 12:38:10,714 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 38 transitions. Word has length 13 [2020-07-01 12:38:10,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:38:10,715 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 38 transitions. [2020-07-01 12:38:10,715 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-01 12:38:10,715 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 38 transitions. [2020-07-01 12:38:10,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-01 12:38:10,716 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:38:10,716 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:38:10,716 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-01 12:38:10,716 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:38:10,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:38:10,717 INFO L82 PathProgramCache]: Analyzing trace with hash 738440400, now seen corresponding path program 1 times [2020-07-01 12:38:10,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:38:10,717 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795376831] [2020-07-01 12:38:10,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:38:10,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:38:10,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:38:10,789 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795376831] [2020-07-01 12:38:10,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:38:10,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-01 12:38:10,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684597891] [2020-07-01 12:38:10,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-01 12:38:10,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:38:10,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-01 12:38:10,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-01 12:38:10,790 INFO L87 Difference]: Start difference. First operand 26 states and 38 transitions. Second operand 7 states. [2020-07-01 12:38:10,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:38:10,938 INFO L93 Difference]: Finished difference Result 34 states and 50 transitions. [2020-07-01 12:38:10,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-01 12:38:10,939 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2020-07-01 12:38:10,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:38:10,941 INFO L225 Difference]: With dead ends: 34 [2020-07-01 12:38:10,942 INFO L226 Difference]: Without dead ends: 33 [2020-07-01 12:38:10,942 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2020-07-01 12:38:10,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-01 12:38:10,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2020-07-01 12:38:10,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-01 12:38:10,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 41 transitions. [2020-07-01 12:38:10,948 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 41 transitions. Word has length 13 [2020-07-01 12:38:10,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:38:10,948 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 41 transitions. [2020-07-01 12:38:10,948 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-01 12:38:10,949 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 41 transitions. [2020-07-01 12:38:10,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-01 12:38:10,949 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:38:10,949 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:38:10,949 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-01 12:38:10,949 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:38:10,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:38:10,950 INFO L82 PathProgramCache]: Analyzing trace with hash 738440401, now seen corresponding path program 1 times [2020-07-01 12:38:10,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:38:10,950 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584306025] [2020-07-01 12:38:10,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:38:10,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:38:11,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:38:11,067 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584306025] [2020-07-01 12:38:11,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:38:11,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-01 12:38:11,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559187144] [2020-07-01 12:38:11,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-01 12:38:11,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:38:11,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-01 12:38:11,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-07-01 12:38:11,069 INFO L87 Difference]: Start difference. First operand 28 states and 41 transitions. Second operand 9 states. [2020-07-01 12:38:11,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:38:11,283 INFO L93 Difference]: Finished difference Result 33 states and 49 transitions. [2020-07-01 12:38:11,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-01 12:38:11,284 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2020-07-01 12:38:11,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:38:11,284 INFO L225 Difference]: With dead ends: 33 [2020-07-01 12:38:11,284 INFO L226 Difference]: Without dead ends: 32 [2020-07-01 12:38:11,285 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2020-07-01 12:38:11,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-01 12:38:11,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2020-07-01 12:38:11,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-01 12:38:11,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2020-07-01 12:38:11,289 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 13 [2020-07-01 12:38:11,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:38:11,290 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2020-07-01 12:38:11,290 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-01 12:38:11,290 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2020-07-01 12:38:11,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-01 12:38:11,291 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:38:11,291 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:38:11,291 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-01 12:38:11,291 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:38:11,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:38:11,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1416812883, now seen corresponding path program 1 times [2020-07-01 12:38:11,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:38:11,292 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230582848] [2020-07-01 12:38:11,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:38:11,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:38:11,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:38:11,392 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230582848] [2020-07-01 12:38:11,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:38:11,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-01 12:38:11,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631942831] [2020-07-01 12:38:11,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-01 12:38:11,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:38:11,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-01 12:38:11,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-01 12:38:11,394 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 7 states. [2020-07-01 12:38:11,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:38:11,562 INFO L93 Difference]: Finished difference Result 33 states and 48 transitions. [2020-07-01 12:38:11,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-01 12:38:11,563 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2020-07-01 12:38:11,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:38:11,563 INFO L225 Difference]: With dead ends: 33 [2020-07-01 12:38:11,563 INFO L226 Difference]: Without dead ends: 32 [2020-07-01 12:38:11,564 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2020-07-01 12:38:11,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-01 12:38:11,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2020-07-01 12:38:11,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-01 12:38:11,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 38 transitions. [2020-07-01 12:38:11,568 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 38 transitions. Word has length 14 [2020-07-01 12:38:11,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:38:11,569 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 38 transitions. [2020-07-01 12:38:11,569 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-01 12:38:11,569 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions. [2020-07-01 12:38:11,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-01 12:38:11,570 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:38:11,570 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:38:11,570 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-01 12:38:11,570 INFO L427 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:38:11,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:38:11,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1416812885, now seen corresponding path program 1 times [2020-07-01 12:38:11,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:38:11,571 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969142326] [2020-07-01 12:38:11,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:38:11,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:38:11,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:38:11,812 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969142326] [2020-07-01 12:38:11,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:38:11,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-01 12:38:11,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881753050] [2020-07-01 12:38:11,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-01 12:38:11,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:38:11,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-01 12:38:11,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-07-01 12:38:11,814 INFO L87 Difference]: Start difference. First operand 27 states and 38 transitions. Second operand 10 states. [2020-07-01 12:38:12,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:38:12,107 INFO L93 Difference]: Finished difference Result 31 states and 44 transitions. [2020-07-01 12:38:12,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-01 12:38:12,108 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 [2020-07-01 12:38:12,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:38:12,108 INFO L225 Difference]: With dead ends: 31 [2020-07-01 12:38:12,109 INFO L226 Difference]: Without dead ends: 30 [2020-07-01 12:38:12,109 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2020-07-01 12:38:12,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-01 12:38:12,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2020-07-01 12:38:12,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-01 12:38:12,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2020-07-01 12:38:12,114 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 14 [2020-07-01 12:38:12,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:38:12,114 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2020-07-01 12:38:12,114 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-01 12:38:12,115 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2020-07-01 12:38:12,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-01 12:38:12,115 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:38:12,115 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:38:12,116 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-01 12:38:12,116 INFO L427 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:38:12,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:38:12,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1416812886, now seen corresponding path program 1 times [2020-07-01 12:38:12,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:38:12,116 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67615649] [2020-07-01 12:38:12,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:38:12,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:38:12,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:38:12,201 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67615649] [2020-07-01 12:38:12,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:38:12,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-01 12:38:12,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352164857] [2020-07-01 12:38:12,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-01 12:38:12,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:38:12,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-01 12:38:12,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-07-01 12:38:12,204 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 9 states. [2020-07-01 12:38:12,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:38:12,379 INFO L93 Difference]: Finished difference Result 29 states and 40 transitions. [2020-07-01 12:38:12,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-01 12:38:12,380 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2020-07-01 12:38:12,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:38:12,381 INFO L225 Difference]: With dead ends: 29 [2020-07-01 12:38:12,381 INFO L226 Difference]: Without dead ends: 28 [2020-07-01 12:38:12,381 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2020-07-01 12:38:12,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-01 12:38:12,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-01 12:38:12,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-01 12:38:12,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2020-07-01 12:38:12,386 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 14 [2020-07-01 12:38:12,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:38:12,386 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2020-07-01 12:38:12,386 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-01 12:38:12,386 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2020-07-01 12:38:12,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-01 12:38:12,387 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:38:12,387 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:38:12,387 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-01 12:38:12,388 INFO L427 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:38:12,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:38:12,388 INFO L82 PathProgramCache]: Analyzing trace with hash -995962776, now seen corresponding path program 1 times [2020-07-01 12:38:12,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:38:12,388 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64292055] [2020-07-01 12:38:12,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:38:12,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:38:12,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:38:12,441 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64292055] [2020-07-01 12:38:12,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:38:12,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 12:38:12,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917870151] [2020-07-01 12:38:12,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 12:38:12,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:38:12,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 12:38:12,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:38:12,443 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand 5 states. [2020-07-01 12:38:12,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:38:12,536 INFO L93 Difference]: Finished difference Result 28 states and 38 transitions. [2020-07-01 12:38:12,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-01 12:38:12,537 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-07-01 12:38:12,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:38:12,537 INFO L225 Difference]: With dead ends: 28 [2020-07-01 12:38:12,538 INFO L226 Difference]: Without dead ends: 27 [2020-07-01 12:38:12,538 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-01 12:38:12,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-01 12:38:12,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-01 12:38:12,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-01 12:38:12,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2020-07-01 12:38:12,542 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 19 [2020-07-01 12:38:12,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:38:12,542 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2020-07-01 12:38:12,543 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 12:38:12,543 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2020-07-01 12:38:12,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-01 12:38:12,543 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:38:12,543 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:38:12,544 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-01 12:38:12,544 INFO L427 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:38:12,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:38:12,544 INFO L82 PathProgramCache]: Analyzing trace with hash -995962774, now seen corresponding path program 1 times [2020-07-01 12:38:12,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:38:12,544 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262898887] [2020-07-01 12:38:12,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:38:12,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:38:12,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:38:12,596 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262898887] [2020-07-01 12:38:12,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:38:12,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 12:38:12,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544696782] [2020-07-01 12:38:12,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 12:38:12,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:38:12,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 12:38:12,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:38:12,598 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand 5 states. [2020-07-01 12:38:12,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:38:12,680 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2020-07-01 12:38:12,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-01 12:38:12,681 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-07-01 12:38:12,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:38:12,681 INFO L225 Difference]: With dead ends: 28 [2020-07-01 12:38:12,681 INFO L226 Difference]: Without dead ends: 27 [2020-07-01 12:38:12,682 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-01 12:38:12,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-01 12:38:12,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-01 12:38:12,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-01 12:38:12,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2020-07-01 12:38:12,686 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 19 [2020-07-01 12:38:12,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:38:12,686 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2020-07-01 12:38:12,686 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 12:38:12,687 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2020-07-01 12:38:12,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-01 12:38:12,687 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:38:12,687 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:38:12,688 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-01 12:38:12,688 INFO L427 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:38:12,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:38:12,688 INFO L82 PathProgramCache]: Analyzing trace with hash -995962773, now seen corresponding path program 1 times [2020-07-01 12:38:12,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:38:12,688 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716339248] [2020-07-01 12:38:12,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:38:12,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:38:12,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:38:12,970 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716339248] [2020-07-01 12:38:12,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:38:12,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-01 12:38:12,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130143937] [2020-07-01 12:38:12,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-01 12:38:12,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:38:12,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-01 12:38:12,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2020-07-01 12:38:12,971 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 13 states. [2020-07-01 12:38:13,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:38:13,543 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2020-07-01 12:38:13,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-01 12:38:13,544 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2020-07-01 12:38:13,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:38:13,544 INFO L225 Difference]: With dead ends: 36 [2020-07-01 12:38:13,544 INFO L226 Difference]: Without dead ends: 35 [2020-07-01 12:38:13,545 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2020-07-01 12:38:13,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-01 12:38:13,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2020-07-01 12:38:13,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-01 12:38:13,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2020-07-01 12:38:13,551 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 19 [2020-07-01 12:38:13,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:38:13,551 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2020-07-01 12:38:13,551 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-01 12:38:13,551 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2020-07-01 12:38:13,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-01 12:38:13,552 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:38:13,552 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:38:13,552 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-01 12:38:13,552 INFO L427 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:38:13,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:38:13,553 INFO L82 PathProgramCache]: Analyzing trace with hash -995962742, now seen corresponding path program 1 times [2020-07-01 12:38:13,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:38:13,553 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010626871] [2020-07-01 12:38:13,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:38:13,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:38:13,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:38:13,593 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010626871] [2020-07-01 12:38:13,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:38:13,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 12:38:13,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177780697] [2020-07-01 12:38:13,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:38:13,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:38:13,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:38:13,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:38:13,594 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. Second operand 4 states. [2020-07-01 12:38:13,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:38:13,649 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2020-07-01 12:38:13,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:38:13,650 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-07-01 12:38:13,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:38:13,650 INFO L225 Difference]: With dead ends: 47 [2020-07-01 12:38:13,650 INFO L226 Difference]: Without dead ends: 43 [2020-07-01 12:38:13,651 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:38:13,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-01 12:38:13,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2020-07-01 12:38:13,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-01 12:38:13,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2020-07-01 12:38:13,658 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 55 transitions. Word has length 19 [2020-07-01 12:38:13,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:38:13,658 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 55 transitions. [2020-07-01 12:38:13,658 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:38:13,658 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2020-07-01 12:38:13,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-01 12:38:13,659 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:38:13,659 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:38:13,659 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-07-01 12:38:13,659 INFO L427 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:38:13,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:38:13,660 INFO L82 PathProgramCache]: Analyzing trace with hash -886674121, now seen corresponding path program 1 times [2020-07-01 12:38:13,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:38:13,660 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451283955] [2020-07-01 12:38:13,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:38:13,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:38:13,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:38:13,700 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451283955] [2020-07-01 12:38:13,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:38:13,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 12:38:13,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288911320] [2020-07-01 12:38:13,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:38:13,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:38:13,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:38:13,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:38:13,702 INFO L87 Difference]: Start difference. First operand 42 states and 55 transitions. Second operand 4 states. [2020-07-01 12:38:13,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:38:13,758 INFO L93 Difference]: Finished difference Result 57 states and 76 transitions. [2020-07-01 12:38:13,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:38:13,759 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-07-01 12:38:13,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:38:13,760 INFO L225 Difference]: With dead ends: 57 [2020-07-01 12:38:13,760 INFO L226 Difference]: Without dead ends: 44 [2020-07-01 12:38:13,760 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:38:13,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-01 12:38:13,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2020-07-01 12:38:13,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-01 12:38:13,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 57 transitions. [2020-07-01 12:38:13,767 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 57 transitions. Word has length 19 [2020-07-01 12:38:13,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:38:13,767 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 57 transitions. [2020-07-01 12:38:13,767 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:38:13,767 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 57 transitions. [2020-07-01 12:38:13,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-01 12:38:13,768 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:38:13,768 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:38:13,768 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-07-01 12:38:13,768 INFO L427 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:38:13,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:38:13,769 INFO L82 PathProgramCache]: Analyzing trace with hash -886673160, now seen corresponding path program 1 times [2020-07-01 12:38:13,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:38:13,769 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651829684] [2020-07-01 12:38:13,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:38:13,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:38:13,849 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:38:13,849 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651829684] [2020-07-01 12:38:13,850 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268830729] [2020-07-01 12:38:13,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:38:13,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:38:13,919 INFO L264 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 12:38:13,925 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:38:13,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:38:13,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:38:13,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4] total 9 [2020-07-01 12:38:13,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771468277] [2020-07-01 12:38:13,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-01 12:38:13,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:38:13,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-01 12:38:13,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-07-01 12:38:13,962 INFO L87 Difference]: Start difference. First operand 44 states and 57 transitions. Second operand 10 states. [2020-07-01 12:38:14,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:38:14,185 INFO L93 Difference]: Finished difference Result 45 states and 57 transitions. [2020-07-01 12:38:14,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-01 12:38:14,186 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2020-07-01 12:38:14,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:38:14,187 INFO L225 Difference]: With dead ends: 45 [2020-07-01 12:38:14,187 INFO L226 Difference]: Without dead ends: 44 [2020-07-01 12:38:14,187 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2020-07-01 12:38:14,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-01 12:38:14,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2020-07-01 12:38:14,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-01 12:38:14,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2020-07-01 12:38:14,193 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 19 [2020-07-01 12:38:14,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:38:14,193 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2020-07-01 12:38:14,194 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-01 12:38:14,194 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2020-07-01 12:38:14,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-01 12:38:14,194 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:38:14,195 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:38:14,395 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:38:14,396 INFO L427 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:38:14,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:38:14,412 INFO L82 PathProgramCache]: Analyzing trace with hash -886673159, now seen corresponding path program 1 times [2020-07-01 12:38:14,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:38:14,412 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682101603] [2020-07-01 12:38:14,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:38:14,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:38:14,565 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:38:14,566 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682101603] [2020-07-01 12:38:14,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:38:14,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-01 12:38:14,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704695575] [2020-07-01 12:38:14,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-01 12:38:14,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:38:14,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-01 12:38:14,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-07-01 12:38:14,567 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand 11 states. [2020-07-01 12:38:14,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:38:14,854 INFO L93 Difference]: Finished difference Result 90 states and 114 transitions. [2020-07-01 12:38:14,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-01 12:38:14,854 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2020-07-01 12:38:14,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:38:14,855 INFO L225 Difference]: With dead ends: 90 [2020-07-01 12:38:14,855 INFO L226 Difference]: Without dead ends: 75 [2020-07-01 12:38:14,856 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2020-07-01 12:38:14,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-07-01 12:38:14,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 64. [2020-07-01 12:38:14,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-07-01 12:38:14,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 78 transitions. [2020-07-01 12:38:14,864 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 78 transitions. Word has length 19 [2020-07-01 12:38:14,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:38:14,864 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 78 transitions. [2020-07-01 12:38:14,864 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-01 12:38:14,865 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 78 transitions. [2020-07-01 12:38:14,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-01 12:38:14,865 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:38:14,866 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:38:14,866 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-07-01 12:38:14,866 INFO L427 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:38:14,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:38:14,866 INFO L82 PathProgramCache]: Analyzing trace with hash -866880023, now seen corresponding path program 1 times [2020-07-01 12:38:14,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:38:14,867 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676325036] [2020-07-01 12:38:14,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:38:14,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:38:14,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:38:14,901 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676325036] [2020-07-01 12:38:14,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:38:14,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-01 12:38:14,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628844910] [2020-07-01 12:38:14,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 12:38:14,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:38:14,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 12:38:14,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:38:14,903 INFO L87 Difference]: Start difference. First operand 64 states and 78 transitions. Second operand 5 states. [2020-07-01 12:38:14,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:38:14,968 INFO L93 Difference]: Finished difference Result 78 states and 96 transitions. [2020-07-01 12:38:14,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 12:38:14,969 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-07-01 12:38:14,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:38:14,969 INFO L225 Difference]: With dead ends: 78 [2020-07-01 12:38:14,969 INFO L226 Difference]: Without dead ends: 47 [2020-07-01 12:38:14,970 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-01 12:38:14,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-07-01 12:38:14,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-07-01 12:38:14,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-01 12:38:14,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2020-07-01 12:38:14,975 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 19 [2020-07-01 12:38:14,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:38:14,976 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2020-07-01 12:38:14,976 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 12:38:14,976 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2020-07-01 12:38:14,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-01 12:38:14,976 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:38:14,977 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:38:14,977 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-07-01 12:38:14,977 INFO L427 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:38:14,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:38:14,977 INFO L82 PathProgramCache]: Analyzing trace with hash 2103066980, now seen corresponding path program 1 times [2020-07-01 12:38:14,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:38:14,978 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896765764] [2020-07-01 12:38:14,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:38:14,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:38:15,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:38:15,249 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896765764] [2020-07-01 12:38:15,249 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533970641] [2020-07-01 12:38:15,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:38:15,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:38:15,320 INFO L264 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 39 conjunts are in the unsatisfiable core [2020-07-01 12:38:15,322 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:38:15,383 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2020-07-01 12:38:15,384 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2020-07-01 12:38:15,385 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:15,393 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:15,395 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 12:38:15,395 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2020-07-01 12:38:15,443 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2020-07-01 12:38:15,443 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:15,456 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:15,458 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-01 12:38:15,458 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:35 [2020-07-01 12:38:15,511 INFO L435 ElimStorePlain]: Different costs {1=[|v_#length_34|], 6=[|v_#valid_49|]} [2020-07-01 12:38:15,522 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 12:38:15,523 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2020-07-01 12:38:15,524 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:15,548 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:15,586 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:15,586 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 69 [2020-07-01 12:38:15,588 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:15,646 INFO L619 ElimStorePlain]: treesize reduction 28, result has 66.7 percent of original size [2020-07-01 12:38:15,651 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-07-01 12:38:15,652 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:55, output treesize:56 [2020-07-01 12:38:15,756 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2020-07-01 12:38:15,756 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:15,778 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:15,785 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2020-07-01 12:38:15,786 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:15,803 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:15,806 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-01 12:38:15,806 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:71, output treesize:33 [2020-07-01 12:38:15,941 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2020-07-01 12:38:15,941 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:15,955 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:15,957 INFO L539 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-07-01 12:38:15,958 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:33 [2020-07-01 12:38:16,095 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:16,096 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2020-07-01 12:38:16,097 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:38:16,100 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 12:38:16,119 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:16,121 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:38:16,124 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-01 12:38:16,125 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-01 12:38:16,127 INFO L539 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 12:38:16,127 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:33 [2020-07-01 12:38:16,232 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:38:16,321 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:38:16,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:38:16,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2020-07-01 12:38:16,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025686173] [2020-07-01 12:38:16,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-07-01 12:38:16,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:38:16,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-07-01 12:38:16,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2020-07-01 12:38:16,323 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand 23 states. [2020-07-01 12:38:16,684 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2020-07-01 12:38:16,861 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 88 [2020-07-01 12:38:17,102 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 95 [2020-07-01 12:38:17,314 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 101 [2020-07-01 12:38:17,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:38:17,768 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2020-07-01 12:38:17,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-01 12:38:17,771 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 19 [2020-07-01 12:38:17,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:38:17,772 INFO L225 Difference]: With dead ends: 53 [2020-07-01 12:38:17,772 INFO L226 Difference]: Without dead ends: 52 [2020-07-01 12:38:17,773 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=196, Invalid=926, Unknown=0, NotChecked=0, Total=1122 [2020-07-01 12:38:17,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-07-01 12:38:17,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2020-07-01 12:38:17,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-07-01 12:38:17,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2020-07-01 12:38:17,779 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 19 [2020-07-01 12:38:17,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:38:17,779 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2020-07-01 12:38:17,780 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-07-01 12:38:17,780 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2020-07-01 12:38:17,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-01 12:38:17,780 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:38:17,780 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:38:17,981 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:38:17,981 INFO L427 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:38:17,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:38:17,982 INFO L82 PathProgramCache]: Analyzing trace with hash 770563874, now seen corresponding path program 1 times [2020-07-01 12:38:17,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:38:17,982 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938150378] [2020-07-01 12:38:17,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:38:18,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:38:18,274 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:38:18,275 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938150378] [2020-07-01 12:38:18,275 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089639358] [2020-07-01 12:38:18,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:38:18,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:38:18,338 INFO L264 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 40 conjunts are in the unsatisfiable core [2020-07-01 12:38:18,340 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:38:18,345 INFO L435 ElimStorePlain]: Different costs {0=[|v_#length_35|], 3=[|v_#valid_50|]} [2020-07-01 12:38:18,350 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 12:38:18,351 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-07-01 12:38:18,351 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:18,361 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:18,375 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2020-07-01 12:38:18,376 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2020-07-01 12:38:18,376 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:18,387 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:18,387 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:38:18,388 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:23 [2020-07-01 12:38:18,451 INFO L435 ElimStorePlain]: Different costs {1=[|v_#length_36|], 6=[|v_#valid_51|]} [2020-07-01 12:38:18,455 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 12:38:18,456 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2020-07-01 12:38:18,457 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:18,471 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:18,507 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:18,508 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 69 [2020-07-01 12:38:18,509 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:18,555 INFO L619 ElimStorePlain]: treesize reduction 28, result has 59.4 percent of original size [2020-07-01 12:38:18,557 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 12:38:18,557 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:41 [2020-07-01 12:38:18,622 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2020-07-01 12:38:18,622 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:18,639 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:18,645 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-01 12:38:18,645 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:18,661 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:18,670 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-01 12:38:18,671 INFO L539 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:18,688 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:18,689 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:38:18,689 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:63, output treesize:30 [2020-07-01 12:38:18,732 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-07-01 12:38:18,733 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:18,743 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:18,746 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-07-01 12:38:18,747 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:18,754 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:18,755 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 12:38:18,755 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2020-07-01 12:38:18,930 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:38:18,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:38:18,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 21 [2020-07-01 12:38:18,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390050717] [2020-07-01 12:38:18,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-07-01 12:38:18,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:38:18,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-07-01 12:38:18,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2020-07-01 12:38:18,932 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand 22 states. [2020-07-01 12:38:19,345 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2020-07-01 12:38:19,480 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 64 [2020-07-01 12:38:21,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:38:21,055 INFO L93 Difference]: Finished difference Result 62 states and 76 transitions. [2020-07-01 12:38:21,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-01 12:38:21,055 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 20 [2020-07-01 12:38:21,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:38:21,056 INFO L225 Difference]: With dead ends: 62 [2020-07-01 12:38:21,056 INFO L226 Difference]: Without dead ends: 61 [2020-07-01 12:38:21,057 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=291, Invalid=1191, Unknown=0, NotChecked=0, Total=1482 [2020-07-01 12:38:21,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-07-01 12:38:21,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2020-07-01 12:38:21,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-01 12:38:21,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 69 transitions. [2020-07-01 12:38:21,064 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 69 transitions. Word has length 20 [2020-07-01 12:38:21,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:38:21,064 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 69 transitions. [2020-07-01 12:38:21,064 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-07-01 12:38:21,064 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 69 transitions. [2020-07-01 12:38:21,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-01 12:38:21,065 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:38:21,065 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:38:21,265 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2020-07-01 12:38:21,266 INFO L427 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:38:21,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:38:21,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1092472924, now seen corresponding path program 1 times [2020-07-01 12:38:21,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:38:21,267 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462128316] [2020-07-01 12:38:21,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:38:21,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:38:21,573 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:38:21,573 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462128316] [2020-07-01 12:38:21,573 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864263325] [2020-07-01 12:38:21,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:38:21,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:38:21,627 INFO L264 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 48 conjunts are in the unsatisfiable core [2020-07-01 12:38:21,629 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:38:21,653 INFO L435 ElimStorePlain]: Different costs {0=[|v_#length_37|], 3=[|v_#valid_52|]} [2020-07-01 12:38:21,658 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 12:38:21,659 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-07-01 12:38:21,659 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:21,670 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:21,686 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2020-07-01 12:38:21,687 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2020-07-01 12:38:21,687 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:21,701 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:21,701 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:38:21,701 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:28 [2020-07-01 12:38:21,797 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:21,797 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 50 [2020-07-01 12:38:21,798 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:38:21,799 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:21,841 INFO L619 ElimStorePlain]: treesize reduction 20, result has 71.4 percent of original size [2020-07-01 12:38:21,863 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:21,864 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 50 [2020-07-01 12:38:21,864 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:21,912 INFO L619 ElimStorePlain]: treesize reduction 28, result has 63.6 percent of original size [2020-07-01 12:38:21,913 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:38:21,914 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 12:38:21,914 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:49 [2020-07-01 12:38:21,915 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:38:21,962 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:38:21,964 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:38:21,965 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:38:21,966 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:38:21,967 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:38:21,967 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:38:21,968 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:38:21,970 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:38:21,971 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:38:21,971 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:38:21,973 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:38:21,974 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:38:21,975 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:38:21,976 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:38:22,038 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 12:38:22,048 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:22,049 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2020-07-01 12:38:22,049 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:22,060 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-01 12:38:22,060 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:22,066 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-01 12:38:22,067 INFO L539 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:22,162 INFO L619 ElimStorePlain]: treesize reduction 59, result has 62.2 percent of original size [2020-07-01 12:38:22,169 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-01 12:38:22,169 INFO L539 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:22,175 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-01 12:38:22,176 INFO L539 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:22,210 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:22,216 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-01 12:38:22,216 INFO L539 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:22,221 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-01 12:38:22,221 INFO L539 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:22,253 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:22,254 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2020-07-01 12:38:22,255 INFO L239 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:191, output treesize:76 [2020-07-01 12:38:22,328 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:38:22,337 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-07-01 12:38:22,337 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:22,342 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-07-01 12:38:22,343 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:22,381 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:22,387 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-07-01 12:38:22,388 INFO L539 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:22,392 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-07-01 12:38:22,393 INFO L539 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:22,426 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:22,428 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2020-07-01 12:38:22,428 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:104, output treesize:43 [2020-07-01 12:38:22,523 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:38:22,524 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:38:22,615 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:38:22,686 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:38:22,688 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:38:22,751 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:38:22,811 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:38:22,812 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:38:22,874 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:38:22,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:38:22,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 26 [2020-07-01 12:38:22,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788987662] [2020-07-01 12:38:22,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-07-01 12:38:22,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:38:22,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-07-01 12:38:22,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=613, Unknown=0, NotChecked=0, Total=702 [2020-07-01 12:38:22,876 INFO L87 Difference]: Start difference. First operand 56 states and 69 transitions. Second operand 27 states. [2020-07-01 12:38:23,241 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2020-07-01 12:38:23,501 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2020-07-01 12:38:23,765 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 65 [2020-07-01 12:38:24,015 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2020-07-01 12:38:24,241 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 61 [2020-07-01 12:38:24,473 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2020-07-01 12:38:24,831 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 63 [2020-07-01 12:38:25,089 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2020-07-01 12:38:25,521 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2020-07-01 12:38:25,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:38:25,865 INFO L93 Difference]: Finished difference Result 73 states and 90 transitions. [2020-07-01 12:38:25,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-07-01 12:38:25,865 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 22 [2020-07-01 12:38:25,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:38:25,866 INFO L225 Difference]: With dead ends: 73 [2020-07-01 12:38:25,866 INFO L226 Difference]: Without dead ends: 72 [2020-07-01 12:38:25,867 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=427, Invalid=2225, Unknown=0, NotChecked=0, Total=2652 [2020-07-01 12:38:25,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-07-01 12:38:25,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 60. [2020-07-01 12:38:25,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-07-01 12:38:25,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 74 transitions. [2020-07-01 12:38:25,875 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 74 transitions. Word has length 22 [2020-07-01 12:38:25,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:38:25,875 INFO L479 AbstractCegarLoop]: Abstraction has 60 states and 74 transitions. [2020-07-01 12:38:25,875 INFO L480 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-07-01 12:38:25,875 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2020-07-01 12:38:25,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-01 12:38:25,876 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:38:25,876 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:38:26,077 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:38:26,077 INFO L427 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:38:26,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:38:26,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1092472893, now seen corresponding path program 1 times [2020-07-01 12:38:26,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:38:26,078 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789290532] [2020-07-01 12:38:26,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:38:26,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:38:26,120 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:38:26,120 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789290532] [2020-07-01 12:38:26,120 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044350361] [2020-07-01 12:38:26,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:38:26,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:38:26,181 INFO L264 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 12:38:26,183 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:38:26,187 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:38:26,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:38:26,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2020-07-01 12:38:26,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630726057] [2020-07-01 12:38:26,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 12:38:26,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:38:26,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 12:38:26,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:38:26,188 INFO L87 Difference]: Start difference. First operand 60 states and 74 transitions. Second operand 5 states. [2020-07-01 12:38:26,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:38:26,265 INFO L93 Difference]: Finished difference Result 70 states and 87 transitions. [2020-07-01 12:38:26,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 12:38:26,266 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2020-07-01 12:38:26,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:38:26,266 INFO L225 Difference]: With dead ends: 70 [2020-07-01 12:38:26,266 INFO L226 Difference]: Without dead ends: 66 [2020-07-01 12:38:26,267 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-01 12:38:26,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-07-01 12:38:26,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2020-07-01 12:38:26,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-07-01 12:38:26,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 80 transitions. [2020-07-01 12:38:26,276 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 80 transitions. Word has length 22 [2020-07-01 12:38:26,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:38:26,276 INFO L479 AbstractCegarLoop]: Abstraction has 65 states and 80 transitions. [2020-07-01 12:38:26,276 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 12:38:26,276 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 80 transitions. [2020-07-01 12:38:26,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-01 12:38:26,277 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:38:26,277 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:38:26,477 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2020-07-01 12:38:26,478 INFO L427 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:38:26,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:38:26,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1401706955, now seen corresponding path program 2 times [2020-07-01 12:38:26,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:38:26,479 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012590440] [2020-07-01 12:38:26,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:38:26,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:38:26,882 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:38:26,882 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012590440] [2020-07-01 12:38:26,882 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201601692] [2020-07-01 12:38:26,882 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:38:26,970 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-01 12:38:26,970 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 12:38:26,972 INFO L264 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 58 conjunts are in the unsatisfiable core [2020-07-01 12:38:26,974 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:38:26,995 INFO L435 ElimStorePlain]: Different costs {0=[|v_#length_39|], 3=[|v_#valid_54|]} [2020-07-01 12:38:26,999 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 12:38:27,000 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-07-01 12:38:27,000 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:27,011 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:27,024 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2020-07-01 12:38:27,024 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2020-07-01 12:38:27,025 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:27,034 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:27,034 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:38:27,034 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:28 [2020-07-01 12:38:27,110 INFO L435 ElimStorePlain]: Different costs {3=[|v_#length_40|], 6=[|v_#valid_55|]} [2020-07-01 12:38:27,115 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 12:38:27,116 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 12:38:27,117 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2020-07-01 12:38:27,118 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:27,140 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:27,150 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 12:38:27,168 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:27,168 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 47 [2020-07-01 12:38:27,169 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:27,210 INFO L619 ElimStorePlain]: treesize reduction 14, result has 76.3 percent of original size [2020-07-01 12:38:27,211 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 12:38:27,212 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:45 [2020-07-01 12:38:27,274 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 12:38:27,275 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2020-07-01 12:38:27,275 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:27,295 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:27,301 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-01 12:38:27,301 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:27,317 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:27,320 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-01 12:38:27,321 INFO L539 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:27,335 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:27,336 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 12:38:27,336 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:67, output treesize:46 [2020-07-01 12:38:27,390 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2020-07-01 12:38:27,390 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:27,402 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:27,405 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-07-01 12:38:27,406 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:27,415 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:27,416 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-01 12:38:27,416 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:57, output treesize:27 [2020-07-01 12:38:27,840 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:38:27,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:38:27,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 30 [2020-07-01 12:38:27,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619129786] [2020-07-01 12:38:27,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2020-07-01 12:38:27,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:38:27,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2020-07-01 12:38:27,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=792, Unknown=0, NotChecked=0, Total=930 [2020-07-01 12:38:27,842 INFO L87 Difference]: Start difference. First operand 65 states and 80 transitions. Second operand 31 states. [2020-07-01 12:38:28,232 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2020-07-01 12:38:28,506 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2020-07-01 12:38:28,771 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 75 [2020-07-01 12:38:29,217 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2020-07-01 12:38:29,773 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2020-07-01 12:38:30,029 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2020-07-01 12:38:30,427 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2020-07-01 12:38:30,625 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 67 [2020-07-01 12:38:31,059 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2020-07-01 12:38:31,298 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 67 [2020-07-01 12:38:31,685 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2020-07-01 12:38:32,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:38:32,654 INFO L93 Difference]: Finished difference Result 106 states and 129 transitions. [2020-07-01 12:38:32,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2020-07-01 12:38:32,655 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 25 [2020-07-01 12:38:32,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:38:32,656 INFO L225 Difference]: With dead ends: 106 [2020-07-01 12:38:32,656 INFO L226 Difference]: Without dead ends: 105 [2020-07-01 12:38:32,657 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1251 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=889, Invalid=4223, Unknown=0, NotChecked=0, Total=5112 [2020-07-01 12:38:32,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-07-01 12:38:32,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 86. [2020-07-01 12:38:32,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-07-01 12:38:32,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 107 transitions. [2020-07-01 12:38:32,670 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 107 transitions. Word has length 25 [2020-07-01 12:38:32,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:38:32,670 INFO L479 AbstractCegarLoop]: Abstraction has 86 states and 107 transitions. [2020-07-01 12:38:32,670 INFO L480 AbstractCegarLoop]: Interpolant automaton has 31 states. [2020-07-01 12:38:32,670 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 107 transitions. [2020-07-01 12:38:32,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-01 12:38:32,671 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:38:32,671 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:38:32,872 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:38:32,872 INFO L427 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:38:32,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:38:32,872 INFO L82 PathProgramCache]: Analyzing trace with hash -2045484323, now seen corresponding path program 1 times [2020-07-01 12:38:32,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:38:32,873 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106411771] [2020-07-01 12:38:32,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:38:32,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:38:32,913 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:38:32,914 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106411771] [2020-07-01 12:38:32,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:38:32,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-01 12:38:32,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064357305] [2020-07-01 12:38:32,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 12:38:32,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:38:32,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 12:38:32,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:38:32,915 INFO L87 Difference]: Start difference. First operand 86 states and 107 transitions. Second operand 5 states. [2020-07-01 12:38:32,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:38:33,000 INFO L93 Difference]: Finished difference Result 112 states and 142 transitions. [2020-07-01 12:38:33,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 12:38:33,000 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2020-07-01 12:38:33,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:38:33,001 INFO L225 Difference]: With dead ends: 112 [2020-07-01 12:38:33,002 INFO L226 Difference]: Without dead ends: 101 [2020-07-01 12:38:33,002 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:38:33,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-07-01 12:38:33,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 90. [2020-07-01 12:38:33,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-07-01 12:38:33,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 115 transitions. [2020-07-01 12:38:33,014 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 115 transitions. Word has length 25 [2020-07-01 12:38:33,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:38:33,014 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 115 transitions. [2020-07-01 12:38:33,014 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 12:38:33,015 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 115 transitions. [2020-07-01 12:38:33,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-01 12:38:33,015 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:38:33,015 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:38:33,015 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-07-01 12:38:33,015 INFO L427 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:38:33,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:38:33,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1936195701, now seen corresponding path program 1 times [2020-07-01 12:38:33,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:38:33,016 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473284944] [2020-07-01 12:38:33,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:38:33,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:38:33,054 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:38:33,055 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473284944] [2020-07-01 12:38:33,055 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074479779] [2020-07-01 12:38:33,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:38:33,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:38:33,116 INFO L264 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 12:38:33,117 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:38:33,121 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:38:33,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:38:33,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2020-07-01 12:38:33,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838471615] [2020-07-01 12:38:33,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 12:38:33,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:38:33,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 12:38:33,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:38:33,123 INFO L87 Difference]: Start difference. First operand 90 states and 115 transitions. Second operand 5 states. [2020-07-01 12:38:33,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:38:33,183 INFO L93 Difference]: Finished difference Result 108 states and 136 transitions. [2020-07-01 12:38:33,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:38:33,184 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2020-07-01 12:38:33,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:38:33,184 INFO L225 Difference]: With dead ends: 108 [2020-07-01 12:38:33,184 INFO L226 Difference]: Without dead ends: 79 [2020-07-01 12:38:33,185 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-01 12:38:33,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-07-01 12:38:33,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 75. [2020-07-01 12:38:33,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-07-01 12:38:33,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 87 transitions. [2020-07-01 12:38:33,195 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 87 transitions. Word has length 25 [2020-07-01 12:38:33,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:38:33,195 INFO L479 AbstractCegarLoop]: Abstraction has 75 states and 87 transitions. [2020-07-01 12:38:33,195 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 12:38:33,195 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 87 transitions. [2020-07-01 12:38:33,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-01 12:38:33,196 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:38:33,196 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:38:33,396 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2020-07-01 12:38:33,397 INFO L427 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:38:33,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:38:33,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1936194740, now seen corresponding path program 2 times [2020-07-01 12:38:33,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:38:33,398 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90996573] [2020-07-01 12:38:33,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:38:33,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:38:33,818 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:38:33,818 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90996573] [2020-07-01 12:38:33,818 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31699267] [2020-07-01 12:38:33,818 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:38:33,888 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-01 12:38:33,888 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 12:38:33,890 INFO L264 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 53 conjunts are in the unsatisfiable core [2020-07-01 12:38:33,892 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:38:33,897 INFO L435 ElimStorePlain]: Different costs {0=[|v_#length_41|], 3=[|v_#valid_56|]} [2020-07-01 12:38:33,901 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 12:38:33,903 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-07-01 12:38:33,903 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:33,924 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:33,941 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2020-07-01 12:38:33,942 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2020-07-01 12:38:33,942 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:33,955 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:33,955 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:38:33,955 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:23 [2020-07-01 12:38:33,994 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-07-01 12:38:33,995 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:34,003 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:34,003 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:38:34,003 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2020-07-01 12:38:34,041 INFO L435 ElimStorePlain]: Different costs {1=[|v_#length_42|], 6=[|v_#valid_57|]} [2020-07-01 12:38:34,045 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 12:38:34,047 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2020-07-01 12:38:34,047 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:34,063 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:34,093 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:34,093 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 69 [2020-07-01 12:38:34,094 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:34,131 INFO L619 ElimStorePlain]: treesize reduction 28, result has 61.1 percent of original size [2020-07-01 12:38:34,131 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:38:34,132 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:44 [2020-07-01 12:38:34,177 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2020-07-01 12:38:34,177 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:34,191 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:34,193 INFO L435 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_30|], 2=[|v_#memory_int_24|]} [2020-07-01 12:38:34,196 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-01 12:38:34,197 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:34,209 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:34,213 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2020-07-01 12:38:34,213 INFO L539 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:34,223 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:34,224 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:38:34,224 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:70, output treesize:37 [2020-07-01 12:38:34,261 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2020-07-01 12:38:34,261 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:34,269 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:34,269 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:38:34,270 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:29 [2020-07-01 12:38:34,308 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2020-07-01 12:38:34,309 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:34,317 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:34,318 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 12:38:34,318 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:29 [2020-07-01 12:38:34,403 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-07-01 12:38:34,403 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:34,413 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:34,414 INFO L539 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 12:38:34,414 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:40, output treesize:21 [2020-07-01 12:38:34,511 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:34,511 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2020-07-01 12:38:34,512 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:38:34,512 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 12:38:34,523 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:34,524 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:38:34,525 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 12:38:34,525 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:33 [2020-07-01 12:38:34,629 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:38:34,722 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:38:34,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:38:34,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2020-07-01 12:38:34,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913118183] [2020-07-01 12:38:34,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-07-01 12:38:34,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:38:34,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-07-01 12:38:34,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=637, Unknown=0, NotChecked=0, Total=702 [2020-07-01 12:38:34,724 INFO L87 Difference]: Start difference. First operand 75 states and 87 transitions. Second operand 27 states. [2020-07-01 12:38:35,125 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2020-07-01 12:38:35,312 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2020-07-01 12:38:35,686 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 86 [2020-07-01 12:38:36,020 WARN L192 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 91 [2020-07-01 12:38:36,257 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 66 [2020-07-01 12:38:36,870 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2020-07-01 12:38:37,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:38:37,364 INFO L93 Difference]: Finished difference Result 85 states and 97 transitions. [2020-07-01 12:38:37,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-01 12:38:37,365 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 25 [2020-07-01 12:38:37,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:38:37,366 INFO L225 Difference]: With dead ends: 85 [2020-07-01 12:38:37,366 INFO L226 Difference]: Without dead ends: 84 [2020-07-01 12:38:37,367 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=298, Invalid=1508, Unknown=0, NotChecked=0, Total=1806 [2020-07-01 12:38:37,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-07-01 12:38:37,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 74. [2020-07-01 12:38:37,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-07-01 12:38:37,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 85 transitions. [2020-07-01 12:38:37,377 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 85 transitions. Word has length 25 [2020-07-01 12:38:37,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:38:37,377 INFO L479 AbstractCegarLoop]: Abstraction has 74 states and 85 transitions. [2020-07-01 12:38:37,377 INFO L480 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-07-01 12:38:37,377 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2020-07-01 12:38:37,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-01 12:38:37,378 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:38:37,378 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:38:37,578 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2020-07-01 12:38:37,579 INFO L427 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:38:37,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:38:37,579 INFO L82 PathProgramCache]: Analyzing trace with hash 2006196793, now seen corresponding path program 1 times [2020-07-01 12:38:37,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:38:37,579 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553904232] [2020-07-01 12:38:37,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:38:37,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:38:37,971 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:38:37,972 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553904232] [2020-07-01 12:38:37,972 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533653752] [2020-07-01 12:38:37,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:38:38,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:38:38,032 INFO L264 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 69 conjunts are in the unsatisfiable core [2020-07-01 12:38:38,034 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:38:38,038 INFO L435 ElimStorePlain]: Different costs {0=[|v_#length_43|], 3=[|v_#valid_58|]} [2020-07-01 12:38:38,041 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 12:38:38,042 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-07-01 12:38:38,042 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:38,051 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:38,064 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2020-07-01 12:38:38,064 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2020-07-01 12:38:38,065 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:38,074 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:38,074 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:38:38,075 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:23 [2020-07-01 12:38:38,105 INFO L435 ElimStorePlain]: Different costs {1=[|v_#length_44|], 6=[|v_#valid_59|]} [2020-07-01 12:38:38,109 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 12:38:38,110 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2020-07-01 12:38:38,110 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:38,126 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:38,156 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:38,156 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 69 [2020-07-01 12:38:38,157 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:38,197 INFO L619 ElimStorePlain]: treesize reduction 28, result has 59.4 percent of original size [2020-07-01 12:38:38,198 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:38:38,198 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:41 [2020-07-01 12:38:38,244 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2020-07-01 12:38:38,244 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:38,261 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:38,265 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-01 12:38:38,265 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:38,279 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:38,283 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-01 12:38:38,283 INFO L539 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:38,296 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:38,297 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:38:38,297 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:63, output treesize:42 [2020-07-01 12:38:38,338 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2020-07-01 12:38:38,339 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:38,350 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:38,353 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-07-01 12:38:38,354 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:38,363 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:38,364 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 12:38:38,364 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:56, output treesize:26 [2020-07-01 12:38:38,767 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:38:38,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:38:38,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14] total 32 [2020-07-01 12:38:38,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817407172] [2020-07-01 12:38:38,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2020-07-01 12:38:38,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:38:38,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2020-07-01 12:38:38,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=872, Unknown=0, NotChecked=0, Total=1056 [2020-07-01 12:38:38,770 INFO L87 Difference]: Start difference. First operand 74 states and 85 transitions. Second operand 33 states. [2020-07-01 12:38:39,108 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2020-07-01 12:38:39,309 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2020-07-01 12:38:39,488 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 75 [2020-07-01 12:38:42,026 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 64 [2020-07-01 12:38:42,473 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2020-07-01 12:38:44,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:38:44,681 INFO L93 Difference]: Finished difference Result 142 states and 167 transitions. [2020-07-01 12:38:44,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2020-07-01 12:38:44,682 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 28 [2020-07-01 12:38:44,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:38:44,683 INFO L225 Difference]: With dead ends: 142 [2020-07-01 12:38:44,683 INFO L226 Difference]: Without dead ends: 141 [2020-07-01 12:38:44,685 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1400 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1055, Invalid=4495, Unknown=0, NotChecked=0, Total=5550 [2020-07-01 12:38:44,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-07-01 12:38:44,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 114. [2020-07-01 12:38:44,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2020-07-01 12:38:44,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 140 transitions. [2020-07-01 12:38:44,701 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 140 transitions. Word has length 28 [2020-07-01 12:38:44,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:38:44,701 INFO L479 AbstractCegarLoop]: Abstraction has 114 states and 140 transitions. [2020-07-01 12:38:44,701 INFO L480 AbstractCegarLoop]: Interpolant automaton has 33 states. [2020-07-01 12:38:44,701 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 140 transitions. [2020-07-01 12:38:44,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-01 12:38:44,702 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:38:44,702 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:38:44,902 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:38:44,903 INFO L427 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:38:44,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:38:44,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1351605422, now seen corresponding path program 2 times [2020-07-01 12:38:44,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:38:44,903 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698557005] [2020-07-01 12:38:44,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:38:44,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:38:45,300 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:38:45,301 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698557005] [2020-07-01 12:38:45,301 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341879331] [2020-07-01 12:38:45,301 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:38:45,372 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-01 12:38:45,372 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 12:38:45,375 INFO L264 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 53 conjunts are in the unsatisfiable core [2020-07-01 12:38:45,377 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:38:45,381 INFO L435 ElimStorePlain]: Different costs {0=[|v_#length_45|], 3=[|v_#valid_60|]} [2020-07-01 12:38:45,385 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 12:38:45,386 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-07-01 12:38:45,386 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:45,396 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:45,409 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2020-07-01 12:38:45,410 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2020-07-01 12:38:45,410 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:45,420 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:45,420 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:38:45,420 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:23 [2020-07-01 12:38:45,485 INFO L435 ElimStorePlain]: Different costs {1=[|v_#length_46|], 3=[|v_#valid_61|]} [2020-07-01 12:38:45,502 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:45,503 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2020-07-01 12:38:45,503 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:38:45,504 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:45,547 INFO L619 ElimStorePlain]: treesize reduction 10, result has 80.4 percent of original size [2020-07-01 12:38:45,574 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:45,574 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 50 [2020-07-01 12:38:45,575 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:45,621 INFO L619 ElimStorePlain]: treesize reduction 28, result has 58.8 percent of original size [2020-07-01 12:38:45,622 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 12:38:45,622 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:40 [2020-07-01 12:38:45,676 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:38:45,678 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:38:45,717 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-01 12:38:45,718 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:45,726 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 12:38:45,731 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:45,732 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2020-07-01 12:38:45,732 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:45,783 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:45,791 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-01 12:38:45,792 INFO L539 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:45,797 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-01 12:38:45,798 INFO L539 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:45,839 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:45,845 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-01 12:38:45,845 INFO L539 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:45,851 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-01 12:38:45,851 INFO L539 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:45,887 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:45,888 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-07-01 12:38:45,888 INFO L239 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:121, output treesize:63 [2020-07-01 12:38:45,945 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:38:45,953 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-07-01 12:38:45,954 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:45,957 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2020-07-01 12:38:45,958 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:46,001 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:46,005 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-07-01 12:38:46,005 INFO L539 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:46,008 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-07-01 12:38:46,009 INFO L539 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:46,032 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:46,033 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2020-07-01 12:38:46,034 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:91, output treesize:34 [2020-07-01 12:38:46,095 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:38:46,096 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:38:46,155 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:38:46,215 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:38:46,216 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:38:46,275 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:38:46,330 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:38:46,331 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:38:46,386 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:38:46,438 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:38:46,541 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:38:46,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:38:46,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 30 [2020-07-01 12:38:46,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553445052] [2020-07-01 12:38:46,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2020-07-01 12:38:46,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:38:46,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2020-07-01 12:38:46,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=811, Unknown=0, NotChecked=0, Total=930 [2020-07-01 12:38:46,544 INFO L87 Difference]: Start difference. First operand 114 states and 140 transitions. Second operand 31 states. [2020-07-01 12:38:46,845 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2020-07-01 12:38:47,027 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 58 [2020-07-01 12:38:47,204 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2020-07-01 12:38:47,485 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2020-07-01 12:38:47,647 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 52 [2020-07-01 12:38:47,956 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2020-07-01 12:38:48,534 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 54 [2020-07-01 12:38:49,030 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2020-07-01 12:38:49,522 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2020-07-01 12:38:49,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:38:49,926 INFO L93 Difference]: Finished difference Result 115 states and 140 transitions. [2020-07-01 12:38:49,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-07-01 12:38:49,926 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 32 [2020-07-01 12:38:49,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:38:49,927 INFO L225 Difference]: With dead ends: 115 [2020-07-01 12:38:49,927 INFO L226 Difference]: Without dead ends: 114 [2020-07-01 12:38:49,929 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 567 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=476, Invalid=2386, Unknown=0, NotChecked=0, Total=2862 [2020-07-01 12:38:49,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-07-01 12:38:49,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2020-07-01 12:38:49,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2020-07-01 12:38:49,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 139 transitions. [2020-07-01 12:38:49,944 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 139 transitions. Word has length 32 [2020-07-01 12:38:49,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:38:49,944 INFO L479 AbstractCegarLoop]: Abstraction has 114 states and 139 transitions. [2020-07-01 12:38:49,944 INFO L480 AbstractCegarLoop]: Interpolant automaton has 31 states. [2020-07-01 12:38:49,944 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 139 transitions. [2020-07-01 12:38:49,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-01 12:38:49,945 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:38:49,945 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:38:50,145 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:38:50,146 INFO L427 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:38:50,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:38:50,146 INFO L82 PathProgramCache]: Analyzing trace with hash -246236566, now seen corresponding path program 3 times [2020-07-01 12:38:50,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:38:50,147 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783500015] [2020-07-01 12:38:50,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:38:50,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:38:50,631 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:38:50,632 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783500015] [2020-07-01 12:38:50,632 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464852261] [2020-07-01 12:38:50,632 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:38:50,823 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2020-07-01 12:38:50,823 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 12:38:50,826 INFO L264 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 65 conjunts are in the unsatisfiable core [2020-07-01 12:38:50,829 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:38:50,832 INFO L435 ElimStorePlain]: Different costs {0=[|v_#length_47|], 3=[|v_#valid_62|]} [2020-07-01 12:38:50,837 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 12:38:50,838 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-07-01 12:38:50,838 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:50,849 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:50,864 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2020-07-01 12:38:50,865 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2020-07-01 12:38:50,865 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:50,876 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:50,877 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:38:50,877 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:23 [2020-07-01 12:38:50,938 INFO L435 ElimStorePlain]: Different costs {1=[|v_#length_48|], 3=[|v_#valid_63|]} [2020-07-01 12:38:50,942 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 12:38:50,943 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2020-07-01 12:38:50,943 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:50,957 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:50,972 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:50,973 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2020-07-01 12:38:50,973 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:50,985 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:50,986 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:38:50,986 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2020-07-01 12:38:51,031 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-01 12:38:51,031 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:51,048 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:51,052 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-01 12:38:51,059 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:51,075 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:51,076 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:38:51,076 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:42 [2020-07-01 12:38:51,124 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2020-07-01 12:38:51,125 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:51,142 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:51,146 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-07-01 12:38:51,146 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:51,158 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:51,159 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 12:38:51,159 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:56, output treesize:26 [2020-07-01 12:38:51,667 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:38:51,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:38:51,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 33 [2020-07-01 12:38:51,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654992606] [2020-07-01 12:38:51,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2020-07-01 12:38:51,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:38:51,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2020-07-01 12:38:51,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=961, Unknown=0, NotChecked=0, Total=1122 [2020-07-01 12:38:51,669 INFO L87 Difference]: Start difference. First operand 114 states and 139 transitions. Second operand 34 states. [2020-07-01 12:38:52,220 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2020-07-01 12:38:52,388 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 69 [2020-07-01 12:38:54,857 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2020-07-01 12:38:56,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:38:56,996 INFO L93 Difference]: Finished difference Result 115 states and 139 transitions. [2020-07-01 12:38:56,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2020-07-01 12:38:56,996 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 38 [2020-07-01 12:38:56,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:38:56,997 INFO L225 Difference]: With dead ends: 115 [2020-07-01 12:38:56,997 INFO L226 Difference]: Without dead ends: 114 [2020-07-01 12:38:56,999 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1235 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=822, Invalid=4148, Unknown=0, NotChecked=0, Total=4970 [2020-07-01 12:38:56,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-07-01 12:38:57,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2020-07-01 12:38:57,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2020-07-01 12:38:57,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 136 transitions. [2020-07-01 12:38:57,014 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 136 transitions. Word has length 38 [2020-07-01 12:38:57,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:38:57,014 INFO L479 AbstractCegarLoop]: Abstraction has 114 states and 136 transitions. [2020-07-01 12:38:57,015 INFO L480 AbstractCegarLoop]: Interpolant automaton has 34 states. [2020-07-01 12:38:57,015 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 136 transitions. [2020-07-01 12:38:57,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-07-01 12:38:57,015 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:38:57,015 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:38:57,216 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2020-07-01 12:38:57,216 INFO L427 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:38:57,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:38:57,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1180318229, now seen corresponding path program 3 times [2020-07-01 12:38:57,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:38:57,217 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126946082] [2020-07-01 12:38:57,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:38:57,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:38:58,054 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 64 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:38:58,054 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126946082] [2020-07-01 12:38:58,055 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736708603] [2020-07-01 12:38:58,055 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:38:58,750 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2020-07-01 12:38:58,750 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 12:38:58,755 INFO L264 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 124 conjunts are in the unsatisfiable core [2020-07-01 12:38:58,758 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:38:58,793 INFO L435 ElimStorePlain]: Different costs {0=[|v_#length_49|], 3=[|v_#valid_64|]} [2020-07-01 12:38:58,797 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 12:38:58,798 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-07-01 12:38:58,798 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:58,811 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:58,826 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2020-07-01 12:38:58,827 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2020-07-01 12:38:58,827 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:58,840 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:58,840 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:38:58,840 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:31 [2020-07-01 12:38:58,893 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-01 12:38:58,893 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:58,906 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:58,906 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:38:58,906 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2020-07-01 12:38:58,958 INFO L435 ElimStorePlain]: Different costs {3=[|v_#length_50|], 6=[|v_#valid_65|]} [2020-07-01 12:38:58,962 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 12:38:58,963 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 12:38:58,964 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2020-07-01 12:38:58,965 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:58,989 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:58,994 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 12:38:59,010 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:59,011 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 47 [2020-07-01 12:38:59,011 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:59,055 INFO L619 ElimStorePlain]: treesize reduction 14, result has 78.8 percent of original size [2020-07-01 12:38:59,056 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:38:59,056 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:52 [2020-07-01 12:38:59,130 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 12:38:59,131 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2020-07-01 12:38:59,131 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:59,161 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:59,162 INFO L435 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_34|, |v_#memory_$Pointer$.offset_33|], 2=[|v_#memory_int_28|]} [2020-07-01 12:38:59,167 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-01 12:38:59,167 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:59,194 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:59,198 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-01 12:38:59,199 INFO L539 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:59,223 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:59,227 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 12:38:59,228 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2020-07-01 12:38:59,228 INFO L539 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:59,247 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:59,247 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:38:59,247 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:89, output treesize:53 [2020-07-01 12:38:59,314 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2020-07-01 12:38:59,314 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:59,332 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:59,336 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-07-01 12:38:59,336 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:59,350 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:59,351 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:38:59,351 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:67, output treesize:37 [2020-07-01 12:38:59,426 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 12:38:59,427 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2020-07-01 12:38:59,427 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:59,440 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:59,440 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 12:38:59,440 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:34 [2020-07-01 12:38:59,594 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-07-01 12:38:59,595 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:38:59,607 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:38:59,608 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-01 12:38:59,608 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:30 [2020-07-01 12:39:01,299 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:39:01,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:39:01,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29] total 58 [2020-07-01 12:39:01,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604113837] [2020-07-01 12:39:01,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2020-07-01 12:39:01,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:39:01,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2020-07-01 12:39:01,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=2939, Unknown=0, NotChecked=0, Total=3422 [2020-07-01 12:39:01,302 INFO L87 Difference]: Start difference. First operand 114 states and 136 transitions. Second operand 59 states. [2020-07-01 12:39:01,888 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 77 [2020-07-01 12:39:02,245 WARN L192 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 93 [2020-07-01 12:39:02,594 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 95 [2020-07-01 12:39:02,931 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 75 [2020-07-01 12:39:03,242 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 79 [2020-07-01 12:39:03,555 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2020-07-01 12:39:03,847 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2020-07-01 12:39:04,217 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 85 [2020-07-01 12:39:04,616 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 89 [2020-07-01 12:39:04,966 WARN L192 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 97 [2020-07-01 12:39:05,387 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2020-07-01 12:39:05,709 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 79 [2020-07-01 12:39:06,085 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 87 [2020-07-01 12:39:06,487 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 77 [2020-07-01 12:39:06,843 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 79 [2020-07-01 12:39:07,238 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 88 [2020-07-01 12:39:07,678 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 77 [2020-07-01 12:39:08,012 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 79 [2020-07-01 12:39:08,401 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 88 [2020-07-01 12:39:08,837 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 77 [2020-07-01 12:39:09,214 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 79 [2020-07-01 12:39:09,619 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 88 [2020-07-01 12:39:10,071 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 77 [2020-07-01 12:39:10,424 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 79 [2020-07-01 12:39:10,822 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 88 [2020-07-01 12:39:11,253 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 77 [2020-07-01 12:39:11,645 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 79 [2020-07-01 12:39:12,066 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 87 [2020-07-01 12:39:12,531 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2020-07-01 12:39:12,911 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 78 [2020-07-01 12:39:13,320 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 87 [2020-07-01 12:39:13,768 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2020-07-01 12:39:14,289 WARN L192 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 82 [2020-07-01 12:39:14,720 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 72 [2020-07-01 12:39:15,196 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2020-07-01 12:39:15,555 WARN L192 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2020-07-01 12:39:15,811 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 75 [2020-07-01 12:39:16,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:39:16,559 INFO L93 Difference]: Finished difference Result 149 states and 173 transitions. [2020-07-01 12:39:16,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2020-07-01 12:39:16,560 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 43 [2020-07-01 12:39:16,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:39:16,561 INFO L225 Difference]: With dead ends: 149 [2020-07-01 12:39:16,561 INFO L226 Difference]: Without dead ends: 69 [2020-07-01 12:39:16,566 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5240 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=2817, Invalid=16089, Unknown=0, NotChecked=0, Total=18906 [2020-07-01 12:39:16,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-07-01 12:39:16,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2020-07-01 12:39:16,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-07-01 12:39:16,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2020-07-01 12:39:16,574 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 80 transitions. Word has length 43 [2020-07-01 12:39:16,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:39:16,574 INFO L479 AbstractCegarLoop]: Abstraction has 69 states and 80 transitions. [2020-07-01 12:39:16,574 INFO L480 AbstractCegarLoop]: Interpolant automaton has 59 states. [2020-07-01 12:39:16,574 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2020-07-01 12:39:16,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-07-01 12:39:16,575 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:39:16,575 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:39:16,776 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:39:16,776 INFO L427 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:39:16,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:39:16,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1119726670, now seen corresponding path program 4 times [2020-07-01 12:39:16,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:39:16,777 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247504637] [2020-07-01 12:39:16,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:39:16,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:39:17,604 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:39:17,604 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247504637] [2020-07-01 12:39:17,604 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314463078] [2020-07-01 12:39:17,604 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:39:17,684 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-01 12:39:17,685 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 12:39:17,688 INFO L264 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 81 conjunts are in the unsatisfiable core [2020-07-01 12:39:17,691 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:39:17,695 INFO L435 ElimStorePlain]: Different costs {0=[|v_#length_51|], 3=[|v_#valid_66|]} [2020-07-01 12:39:17,699 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 12:39:17,700 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-07-01 12:39:17,700 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:39:17,712 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:39:17,730 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2020-07-01 12:39:17,730 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2020-07-01 12:39:17,730 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:39:17,742 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:39:17,743 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:39:17,743 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:23 [2020-07-01 12:39:17,830 INFO L435 ElimStorePlain]: Different costs {1=[|v_#length_52|], 3=[|v_#valid_67|]} [2020-07-01 12:39:17,850 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:39:17,850 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2020-07-01 12:39:17,851 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:39:17,851 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:39:17,903 INFO L619 ElimStorePlain]: treesize reduction 10, result has 80.4 percent of original size [2020-07-01 12:39:17,940 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:39:17,940 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 50 [2020-07-01 12:39:17,941 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:39:17,997 INFO L619 ElimStorePlain]: treesize reduction 28, result has 58.8 percent of original size [2020-07-01 12:39:17,998 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 12:39:17,998 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:40 [2020-07-01 12:39:18,056 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:39:18,057 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:39:18,097 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-01 12:39:18,098 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:39:18,106 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 12:39:18,110 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:39:18,111 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2020-07-01 12:39:18,111 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:39:18,164 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:39:18,172 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-01 12:39:18,172 INFO L539 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-01 12:39:18,178 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-01 12:39:18,178 INFO L539 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-07-01 12:39:18,221 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:39:18,228 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-01 12:39:18,228 INFO L539 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-07-01 12:39:18,234 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-01 12:39:18,234 INFO L539 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-07-01 12:39:18,274 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:39:18,274 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-07-01 12:39:18,275 INFO L239 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:121, output treesize:63 [2020-07-01 12:39:18,341 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:39:18,347 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-07-01 12:39:18,348 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:39:18,352 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2020-07-01 12:39:18,352 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:39:18,387 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:39:18,392 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-07-01 12:39:18,392 INFO L539 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-01 12:39:18,396 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-07-01 12:39:18,396 INFO L539 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-07-01 12:39:18,423 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:39:18,424 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2020-07-01 12:39:18,424 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:91, output treesize:34 [2020-07-01 12:39:18,491 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:39:18,492 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:39:18,555 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:39:18,613 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:39:18,614 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:39:18,678 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:39:18,738 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:39:18,739 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:39:18,805 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:39:18,867 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:39:18,868 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:39:18,932 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:39:18,998 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:39:18,999 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:39:19,079 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:39:19,154 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:39:19,155 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:39:19,223 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:39:19,292 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:39:19,293 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:39:19,361 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:39:19,428 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:39:19,572 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:39:19,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:39:19,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 22] total 46 [2020-07-01 12:39:19,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270848151] [2020-07-01 12:39:19,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2020-07-01 12:39:19,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:39:19,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2020-07-01 12:39:19,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=319, Invalid=1843, Unknown=0, NotChecked=0, Total=2162 [2020-07-01 12:39:19,574 INFO L87 Difference]: Start difference. First operand 69 states and 80 transitions. Second operand 47 states. [2020-07-01 12:39:19,905 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2020-07-01 12:39:20,116 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 58 [2020-07-01 12:39:20,331 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2020-07-01 12:39:20,509 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2020-07-01 12:39:20,706 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2020-07-01 12:39:20,940 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2020-07-01 12:39:21,318 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2020-07-01 12:39:21,491 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2020-07-01 12:39:21,724 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2020-07-01 12:39:22,159 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2020-07-01 12:39:22,331 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2020-07-01 12:39:22,509 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2020-07-01 12:39:22,938 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2020-07-01 12:39:23,111 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2020-07-01 12:39:23,290 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2020-07-01 12:39:23,721 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2020-07-01 12:39:23,893 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2020-07-01 12:39:24,069 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2020-07-01 12:39:24,294 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2020-07-01 12:39:24,505 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2020-07-01 12:39:24,680 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2020-07-01 12:39:24,861 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2020-07-01 12:39:25,082 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2020-07-01 12:39:25,284 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2020-07-01 12:39:25,453 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2020-07-01 12:39:25,622 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2020-07-01 12:39:26,042 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2020-07-01 12:39:26,212 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2020-07-01 12:39:26,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:39:26,504 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2020-07-01 12:39:26,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2020-07-01 12:39:26,505 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 56 [2020-07-01 12:39:26,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:39:26,506 INFO L225 Difference]: With dead ends: 70 [2020-07-01 12:39:26,506 INFO L226 Difference]: Without dead ends: 69 [2020-07-01 12:39:26,508 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1964 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=1013, Invalid=5959, Unknown=0, NotChecked=0, Total=6972 [2020-07-01 12:39:26,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-07-01 12:39:26,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2020-07-01 12:39:26,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-07-01 12:39:26,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2020-07-01 12:39:26,516 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 79 transitions. Word has length 56 [2020-07-01 12:39:26,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:39:26,516 INFO L479 AbstractCegarLoop]: Abstraction has 69 states and 79 transitions. [2020-07-01 12:39:26,516 INFO L480 AbstractCegarLoop]: Interpolant automaton has 47 states. [2020-07-01 12:39:26,516 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2020-07-01 12:39:26,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-07-01 12:39:26,517 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:39:26,517 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:39:26,717 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2020-07-01 12:39:26,718 INFO L427 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:39:26,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:39:26,718 INFO L82 PathProgramCache]: Analyzing trace with hash -619240758, now seen corresponding path program 5 times [2020-07-01 12:39:26,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:39:26,718 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480764398] [2020-07-01 12:39:26,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:39:26,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:39:26,964 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2020-07-01 12:39:26,964 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480764398] [2020-07-01 12:39:26,964 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071173709] [2020-07-01 12:39:26,965 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:39:27,489 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2020-07-01 12:39:27,490 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 12:39:27,496 INFO L264 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 125 conjunts are in the unsatisfiable core [2020-07-01 12:39:27,499 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:39:27,502 INFO L435 ElimStorePlain]: Different costs {0=[|v_#length_53|], 3=[|v_#valid_68|]} [2020-07-01 12:39:27,506 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 12:39:27,507 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-07-01 12:39:27,508 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:39:27,519 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:39:27,534 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2020-07-01 12:39:27,535 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2020-07-01 12:39:27,535 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:39:27,546 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:39:27,547 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:39:27,547 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:23 [2020-07-01 12:39:27,577 INFO L435 ElimStorePlain]: Different costs {1=[|v_#length_54|], 6=[|v_#valid_69|]} [2020-07-01 12:39:27,581 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 12:39:27,582 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2020-07-01 12:39:27,583 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:39:27,598 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:39:27,636 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:39:27,636 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 69 [2020-07-01 12:39:27,637 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:39:27,682 INFO L619 ElimStorePlain]: treesize reduction 28, result has 59.4 percent of original size [2020-07-01 12:39:27,683 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:39:27,683 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:41 [2020-07-01 12:39:27,729 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-01 12:39:27,729 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:39:27,751 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:39:27,756 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-01 12:39:27,756 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:39:27,777 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:39:27,778 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:39:27,778 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:63, output treesize:61 [2020-07-01 12:39:27,829 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 22 [2020-07-01 12:39:27,830 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:39:27,851 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:39:27,854 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-07-01 12:39:27,855 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:39:27,871 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:39:27,872 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 12:39:27,872 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:75, output treesize:41 [2020-07-01 12:39:28,728 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2020-07-01 12:39:28,729 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:39:28,740 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:39:28,741 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 12:39:28,741 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:20 [2020-07-01 12:39:29,095 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:39:29,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:39:29,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 25] total 36 [2020-07-01 12:39:29,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622085643] [2020-07-01 12:39:29,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2020-07-01 12:39:29,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:39:29,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2020-07-01 12:39:29,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1209, Unknown=0, NotChecked=0, Total=1332 [2020-07-01 12:39:29,097 INFO L87 Difference]: Start difference. First operand 69 states and 79 transitions. Second operand 37 states. [2020-07-01 12:39:29,495 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2020-07-01 12:39:29,729 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 81 [2020-07-01 12:39:29,952 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 83 [2020-07-01 12:39:30,295 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2020-07-01 12:39:30,504 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2020-07-01 12:39:30,856 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2020-07-01 12:39:31,024 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2020-07-01 12:39:31,209 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2020-07-01 12:39:31,614 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2020-07-01 12:39:31,787 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2020-07-01 12:39:31,972 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 69 [2020-07-01 12:39:32,193 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2020-07-01 12:39:32,395 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2020-07-01 12:39:32,565 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2020-07-01 12:39:32,748 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 69 [2020-07-01 12:39:33,154 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2020-07-01 12:39:33,320 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2020-07-01 12:39:33,503 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 69 [2020-07-01 12:39:33,721 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2020-07-01 12:39:33,913 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2020-07-01 12:39:34,090 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2020-07-01 12:39:34,274 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 69 [2020-07-01 12:39:34,691 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2020-07-01 12:39:34,866 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2020-07-01 12:39:35,047 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 69 [2020-07-01 12:39:37,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:39:37,276 INFO L93 Difference]: Finished difference Result 75 states and 88 transitions. [2020-07-01 12:39:37,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2020-07-01 12:39:37,277 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 62 [2020-07-01 12:39:37,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:39:37,277 INFO L225 Difference]: With dead ends: 75 [2020-07-01 12:39:37,278 INFO L226 Difference]: Without dead ends: 74 [2020-07-01 12:39:37,278 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1619 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=797, Invalid=5845, Unknown=0, NotChecked=0, Total=6642 [2020-07-01 12:39:37,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-07-01 12:39:37,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 68. [2020-07-01 12:39:37,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-07-01 12:39:37,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2020-07-01 12:39:37,287 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 62 [2020-07-01 12:39:37,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:39:37,287 INFO L479 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2020-07-01 12:39:37,287 INFO L480 AbstractCegarLoop]: Interpolant automaton has 37 states. [2020-07-01 12:39:37,287 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2020-07-01 12:39:37,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-07-01 12:39:37,288 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:39:37,288 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:39:37,488 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:39:37,489 INFO L427 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:39:37,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:39:37,489 INFO L82 PathProgramCache]: Analyzing trace with hash 501950486, now seen corresponding path program 1 times [2020-07-01 12:39:37,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:39:37,489 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244650333] [2020-07-01 12:39:37,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:39:37,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:39:38,768 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 123 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:39:38,768 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244650333] [2020-07-01 12:39:38,769 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444215729] [2020-07-01 12:39:38,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:39:38,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:39:38,878 INFO L264 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 96 conjunts are in the unsatisfiable core [2020-07-01 12:39:38,880 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:39:38,884 INFO L435 ElimStorePlain]: Different costs {0=[|v_#length_55|], 3=[|v_#valid_70|]} [2020-07-01 12:39:38,888 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 12:39:38,889 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-07-01 12:39:38,889 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:39:38,900 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:39:38,916 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2020-07-01 12:39:38,916 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2020-07-01 12:39:38,925 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:39:38,937 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:39:38,938 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:39:38,938 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:23 [2020-07-01 12:39:39,041 INFO L435 ElimStorePlain]: Different costs {1=[|v_#length_56|], 6=[|v_#valid_71|]} [2020-07-01 12:39:39,045 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 12:39:39,046 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2020-07-01 12:39:39,047 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:39:39,063 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:39:39,104 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:39:39,104 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 69 [2020-07-01 12:39:39,105 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:39:39,152 INFO L619 ElimStorePlain]: treesize reduction 28, result has 59.4 percent of original size [2020-07-01 12:39:39,153 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 12:39:39,153 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:41 [2020-07-01 12:39:39,228 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2020-07-01 12:39:39,229 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:39:39,249 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:39:39,254 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-01 12:39:39,254 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:39:39,271 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:39:39,275 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-01 12:39:39,275 INFO L539 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-01 12:39:39,290 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:39:39,291 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:39:39,291 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:63, output treesize:30 [2020-07-01 12:39:39,350 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-07-01 12:39:39,350 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:39:39,361 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:39:39,365 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-07-01 12:39:39,365 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:39:39,373 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:39:39,374 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 12:39:39,374 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2020-07-01 12:39:41,057 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:39:41,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:39:41,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 25] total 53 [2020-07-01 12:39:41,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862967644] [2020-07-01 12:39:41,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2020-07-01 12:39:41,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:39:41,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2020-07-01 12:39:41,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=471, Invalid=2391, Unknown=0, NotChecked=0, Total=2862 [2020-07-01 12:39:41,059 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand 54 states. [2020-07-01 12:39:41,712 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 64 [2020-07-01 12:39:41,996 WARN L192 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2020-07-01 12:39:42,379 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2020-07-01 12:39:42,993 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 54 [2020-07-01 12:39:43,604 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 55 [2020-07-01 12:39:44,213 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2020-07-01 12:39:44,813 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2020-07-01 12:39:45,429 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2020-07-01 12:39:46,037 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2020-07-01 12:39:46,643 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2020-07-01 12:39:47,255 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2020-07-01 12:39:47,690 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2020-07-01 12:39:47,886 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2020-07-01 12:39:48,365 WARN L192 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2020-07-01 12:39:48,858 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2020-07-01 12:39:49,044 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2020-07-01 12:39:49,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:39:49,193 INFO L93 Difference]: Finished difference Result 81 states and 93 transitions. [2020-07-01 12:39:49,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2020-07-01 12:39:49,194 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 67 [2020-07-01 12:39:49,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:39:49,194 INFO L225 Difference]: With dead ends: 81 [2020-07-01 12:39:49,194 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 12:39:49,195 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1962 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=1544, Invalid=7386, Unknown=0, NotChecked=0, Total=8930 [2020-07-01 12:39:49,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 12:39:49,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 12:39:49,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 12:39:49,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 12:39:49,196 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 67 [2020-07-01 12:39:49,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:39:49,196 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 12:39:49,196 INFO L480 AbstractCegarLoop]: Interpolant automaton has 54 states. [2020-07-01 12:39:49,196 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 12:39:49,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 12:39:49,397 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2020-07-01 12:39:49,400 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 12:39:50,002 WARN L192 SmtUtils]: Spent 587.00 ms on a formula simplification. DAG size of input: 332 DAG size of output: 293 [2020-07-01 12:39:50,253 WARN L192 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 330 DAG size of output: 257 [2020-07-01 12:39:52,096 WARN L192 SmtUtils]: Spent 1.84 s on a formula simplification. DAG size of input: 286 DAG size of output: 97 [2020-07-01 12:39:53,757 WARN L192 SmtUtils]: Spent 1.66 s on a formula simplification. DAG size of input: 255 DAG size of output: 135 [2020-07-01 12:39:53,761 INFO L268 CegarLoopResult]: For program point L15(line 15) no Hoare annotation was computed. [2020-07-01 12:39:53,761 INFO L268 CegarLoopResult]: For program point L32-1(lines 32 34) no Hoare annotation was computed. [2020-07-01 12:39:53,761 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 12:39:53,761 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 12:39:53,761 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-07-01 12:39:53,762 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:39:53,762 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:39:53,762 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:39:53,762 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:39:53,762 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 12:39:53,762 INFO L268 CegarLoopResult]: For program point L12(line 12) no Hoare annotation was computed. [2020-07-01 12:39:53,762 INFO L268 CegarLoopResult]: For program point L12-1(line 12) no Hoare annotation was computed. [2020-07-01 12:39:53,762 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:39:53,762 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 37) no Hoare annotation was computed. [2020-07-01 12:39:53,763 INFO L268 CegarLoopResult]: For program point L8(lines 8 22) no Hoare annotation was computed. [2020-07-01 12:39:53,763 INFO L268 CegarLoopResult]: For program point L8-1(lines 8 22) no Hoare annotation was computed. [2020-07-01 12:39:53,763 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(lines 5 24) no Hoare annotation was computed. [2020-07-01 12:39:53,763 INFO L268 CegarLoopResult]: For program point L37(line 37) no Hoare annotation was computed. [2020-07-01 12:39:53,763 INFO L268 CegarLoopResult]: For program point L37-1(line 37) no Hoare annotation was computed. [2020-07-01 12:39:53,763 INFO L268 CegarLoopResult]: For program point L29(lines 29 31) no Hoare annotation was computed. [2020-07-01 12:39:53,763 INFO L268 CegarLoopResult]: For program point L29-2(lines 26 40) no Hoare annotation was computed. [2020-07-01 12:39:53,763 INFO L268 CegarLoopResult]: For program point L17(lines 17 18) no Hoare annotation was computed. [2020-07-01 12:39:53,764 INFO L264 CegarLoopResult]: At program point L17-2(lines 15 18) the Hoare annotation is: (let ((.cse0 (select |#length| ULTIMATE.start_main_~nondetString~0.base))) (and (= 1 (select |#valid| ULTIMATE.start_cstpncpy_~src.base)) (= ULTIMATE.start_main_~length~0 .cse0) (= |ULTIMATE.start_cstpncpy_~#dst.offset| 0) (<= 1 |ULTIMATE.start_cstpncpy_#in~n|) (= 1 (select |#valid| ULTIMATE.start_cstpncpy_~s~0.base)) (<= 1 |#StackHeapBarrier|) (= 1 (select |#valid| |ULTIMATE.start_cstpncpy_~#dst.base|)) (= (select |#valid| ULTIMATE.start_main_~nondetArea~0.base) 1) (= 0 (select (select |#memory_int| ULTIMATE.start_cstpncpy_~s~0.base) (+ (select |#length| ULTIMATE.start_cstpncpy_~s~0.base) (- 1)))) (= 0 ULTIMATE.start_cstpncpy_~src.offset) (not (= |ULTIMATE.start_cstpncpy_~#dst.base| ULTIMATE.start_cstpncpy_~s~0.base)) (<= (+ ULTIMATE.start_main_~nondetString~0.offset 1) .cse0) (= 1 (select |#valid| ULTIMATE.start_main_~nondetString~0.base)) (= 0 |ULTIMATE.start_cstpncpy_#in~src.offset|) (<= |ULTIMATE.start_cstpncpy_#in~n| (select |#length| |ULTIMATE.start_cstpncpy_#in~dst.base|)) (<= (+ ULTIMATE.start_cstpncpy_~n ULTIMATE.start_cstpncpy_~d~0.offset) (+ (select |#length| ULTIMATE.start_cstpncpy_~d~0.base) 1)) (<= 1 (select |#length| ULTIMATE.start_cstpncpy_~src.base)) (= 0 ULTIMATE.start_main_~nondetArea~0.offset) (<= 1 (select |#length| |ULTIMATE.start_cstpncpy_#in~src.base|)) (= 0 ULTIMATE.start_main_~nondetString~0.offset) (not (= ULTIMATE.start_main_~nondetString~0.base ULTIMATE.start_main_~nondetArea~0.base)) (= ULTIMATE.start_main_~n~0 (select |#length| ULTIMATE.start_main_~nondetArea~0.base)) (= 8 (select |#length| |ULTIMATE.start_cstpncpy_~#dst.base|)) (not (= |ULTIMATE.start_cstpncpy_~#dst.base| ULTIMATE.start_cstpncpy_~d~0.base)) (<= 1 ULTIMATE.start_main_~n~0) (= 1 (select |#valid| |ULTIMATE.start_cstpncpy_#in~dst.base|)) (not (= |ULTIMATE.start_cstpncpy_~#dst.base| |ULTIMATE.start_cstpncpy_#in~dst.base|)) (= 1 (select |#valid| |ULTIMATE.start_cstpncpy_#in~src.base|)) (not (= |ULTIMATE.start_cstpncpy_#in~src.base| |ULTIMATE.start_cstpncpy_#in~dst.base|)) (= |ULTIMATE.start_cstpncpy_#in~dst.offset| 0) (not (= |ULTIMATE.start_cstpncpy_#in~src.base| |ULTIMATE.start_cstpncpy_~#dst.base|)) (<= 1 ULTIMATE.start_cstpncpy_~s~0.offset) (<= 1 ULTIMATE.start_cstpncpy_~d~0.offset) (not (= ULTIMATE.start_cstpncpy_~d~0.base ULTIMATE.start_cstpncpy_~s~0.base)) (= 1 (select |#valid| ULTIMATE.start_cstpncpy_~d~0.base)) (<= 1 ULTIMATE.start_cstpncpy_~n))) [2020-07-01 12:39:53,764 INFO L268 CegarLoopResult]: For program point L13-1(lines 13 21) no Hoare annotation was computed. [2020-07-01 12:39:53,764 INFO L268 CegarLoopResult]: For program point L13-2(lines 13 21) no Hoare annotation was computed. [2020-07-01 12:39:53,764 INFO L268 CegarLoopResult]: For program point L9(line 9) no Hoare annotation was computed. [2020-07-01 12:39:53,765 INFO L264 CegarLoopResult]: At program point L13-4(lines 13 21) the Hoare annotation is: (let ((.cse19 (= 8 (select |#length| |ULTIMATE.start_cstpncpy_~#dst.base|))) (.cse35 (= |ULTIMATE.start_cstpncpy_~#dst.base| |ULTIMATE.start_cstpncpy_#in~dst.base|)) (.cse34 (select |#length| ULTIMATE.start_cstpncpy_~s~0.base)) (.cse31 (select |#length| ULTIMATE.start_main_~nondetString~0.base))) (let ((.cse0 (= 1 (select |#valid| ULTIMATE.start_cstpncpy_~src.base))) (.cse1 (= ULTIMATE.start_main_~length~0 .cse31)) (.cse2 (= |ULTIMATE.start_cstpncpy_~#dst.offset| 0)) (.cse3 (= 1 (select |#valid| ULTIMATE.start_cstpncpy_~s~0.base))) (.cse5 (<= 1 |#StackHeapBarrier|)) (.cse4 (<= 1 |ULTIMATE.start_cstpncpy_#in~n|)) (.cse6 (= 1 (select |#valid| |ULTIMATE.start_cstpncpy_~#dst.base|))) (.cse7 (= (select |#valid| ULTIMATE.start_main_~nondetArea~0.base) 1)) (.cse8 (= 0 (select (select |#memory_int| ULTIMATE.start_cstpncpy_~s~0.base) (+ .cse34 (- 1))))) (.cse9 (= 0 ULTIMATE.start_cstpncpy_~src.offset)) (.cse12 (<= (+ ULTIMATE.start_main_~nondetString~0.offset 1) .cse31)) (.cse13 (= 0 |ULTIMATE.start_cstpncpy_#in~src.offset|)) (.cse11 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString~0.base))) (.cse10 (not (= |ULTIMATE.start_cstpncpy_~#dst.base| ULTIMATE.start_cstpncpy_~s~0.base))) (.cse15 (= 0 ULTIMATE.start_main_~nondetArea~0.offset)) (.cse14 (select |#length| |ULTIMATE.start_cstpncpy_#in~src.base|)) (.cse16 (= 0 ULTIMATE.start_main_~nondetString~0.offset)) (.cse17 (not (= ULTIMATE.start_main_~nondetString~0.base ULTIMATE.start_main_~nondetArea~0.base))) (.cse18 (= ULTIMATE.start_main_~n~0 (select |#length| ULTIMATE.start_main_~nondetArea~0.base))) (.cse20 (not (= |ULTIMATE.start_cstpncpy_~#dst.base| ULTIMATE.start_cstpncpy_~d~0.base))) (.cse21 (<= 1 ULTIMATE.start_main_~n~0)) (.cse22 (= 1 (select |#valid| |ULTIMATE.start_cstpncpy_#in~dst.base|))) (.cse23 (not .cse35)) (.cse24 (<= (+ ULTIMATE.start_cstpncpy_~n ULTIMATE.start_cstpncpy_~d~0.offset) (select |#length| ULTIMATE.start_cstpncpy_~d~0.base))) (.cse25 (= 1 (select |#valid| |ULTIMATE.start_cstpncpy_#in~src.base|))) (.cse26 (not (= |ULTIMATE.start_cstpncpy_#in~src.base| |ULTIMATE.start_cstpncpy_#in~dst.base|))) (.cse28 (= |ULTIMATE.start_cstpncpy_#in~dst.offset| 0)) (.cse27 (not (= |ULTIMATE.start_cstpncpy_#in~src.base| |ULTIMATE.start_cstpncpy_~#dst.base|))) (.cse29 (or (and .cse19 .cse35) (<= |ULTIMATE.start_cstpncpy_#in~n| (select |#length| |ULTIMATE.start_cstpncpy_#in~dst.base|)))) (.cse30 (not (= ULTIMATE.start_cstpncpy_~d~0.base ULTIMATE.start_cstpncpy_~s~0.base))) (.cse33 (= 1 (select |#valid| ULTIMATE.start_cstpncpy_~d~0.base))) (.cse32 (<= 1 ULTIMATE.start_cstpncpy_~n))) (or (and (= 0 ULTIMATE.start_cstpncpy_~s~0.offset) .cse0 (not (= ULTIMATE.start_cstpncpy_~src.base |ULTIMATE.start_cstpncpy_~#dst.base|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (exists ((ULTIMATE.start_main_~length~0 Int) (ULTIMATE.start_main_~nondetString~0.offset Int)) (and (<= ULTIMATE.start_cstpncpy_~s~0.offset ULTIMATE.start_main_~nondetString~0.offset) (<= 1 ULTIMATE.start_main_~length~0) (<= (+ ULTIMATE.start_main_~length~0 ULTIMATE.start_main_~nondetString~0.offset) (select |#length| ULTIMATE.start_cstpncpy_~s~0.base)) (= (select (select |#memory_int| ULTIMATE.start_cstpncpy_~s~0.base) (+ ULTIMATE.start_main_~length~0 ULTIMATE.start_main_~nondetString~0.offset (- 1))) 0))) (= 0 (select (select |#memory_int| |ULTIMATE.start_cstpncpy_#in~src.base|) (+ .cse14 (- 1)))) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 (<= ULTIMATE.start_cstpncpy_~d~0.offset 0) .cse26 .cse27 .cse28 .cse29 .cse30 (= 0 (select (select |#memory_int| ULTIMATE.start_main_~nondetString~0.base) (+ .cse31 (- 1)))) (<= 0 ULTIMATE.start_cstpncpy_~d~0.offset) (exists ((ULTIMATE.start_main_~length~0 Int) (ULTIMATE.start_main_~nondetString~0.offset Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_cstpncpy_~src.base) (+ ULTIMATE.start_main_~length~0 ULTIMATE.start_main_~nondetString~0.offset (- 1)))) (<= ULTIMATE.start_cstpncpy_~src.offset ULTIMATE.start_main_~nondetString~0.offset) (<= 1 ULTIMATE.start_main_~length~0) (<= (+ ULTIMATE.start_main_~length~0 ULTIMATE.start_main_~nondetString~0.offset) (select |#length| ULTIMATE.start_cstpncpy_~src.base)))) (exists ((ULTIMATE.start_main_~length~0 Int) (ULTIMATE.start_main_~nondetString~0.offset Int)) (and (<= |ULTIMATE.start_cstpncpy_#in~src.offset| ULTIMATE.start_main_~nondetString~0.offset) (<= (+ ULTIMATE.start_main_~length~0 ULTIMATE.start_main_~nondetString~0.offset) (select |#length| |ULTIMATE.start_cstpncpy_#in~src.base|)) (<= 1 ULTIMATE.start_main_~length~0) (= 0 (select (select |#memory_int| |ULTIMATE.start_cstpncpy_#in~src.base|) (+ ULTIMATE.start_main_~length~0 ULTIMATE.start_main_~nondetString~0.offset (- 1)))))) .cse32 .cse33) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse4 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse11 .cse10 (<= 1 (select |#length| ULTIMATE.start_cstpncpy_~src.base)) .cse15 (<= 1 .cse14) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 (<= (+ ULTIMATE.start_cstpncpy_~s~0.offset 1) .cse34) .cse26 (<= 1 ULTIMATE.start_cstpncpy_~s~0.offset) .cse28 .cse27 .cse29 (<= 1 ULTIMATE.start_cstpncpy_~d~0.offset) .cse30 .cse33 .cse32)))) [2020-07-01 12:39:53,765 INFO L268 CegarLoopResult]: For program point L5(lines 5 24) no Hoare annotation was computed. [2020-07-01 12:39:53,765 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-07-01 12:39:53,765 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:39:53,765 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 12:39:53,765 INFO L268 CegarLoopResult]: For program point L18(line 18) no Hoare annotation was computed. [2020-07-01 12:39:53,765 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:39:53,765 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:39:53,765 INFO L268 CegarLoopResult]: For program point L14(line 14) no Hoare annotation was computed. [2020-07-01 12:39:53,766 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:39:53,766 INFO L268 CegarLoopResult]: For program point L14-1(line 14) no Hoare annotation was computed. [2020-07-01 12:39:53,766 INFO L268 CegarLoopResult]: For program point L14-2(lines 14 20) no Hoare annotation was computed. [2020-07-01 12:39:53,766 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:39:53,766 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(lines 5 24) no Hoare annotation was computed. [2020-07-01 12:39:53,766 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 12:39:53,766 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 37) no Hoare annotation was computed. [2020-07-01 12:39:53,769 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 12:39:53,781 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:53,782 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:39:53,782 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:39:53,783 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:53,783 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:53,783 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:53,784 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:53,784 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:53,784 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:53,784 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:53,785 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:53,794 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:53,794 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:39:53,795 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:39:53,795 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:53,795 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:53,796 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:53,796 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:53,796 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:53,796 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:53,797 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:53,797 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:53,802 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:39:53,803 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-07-01 12:39:53,803 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-07-01 12:39:53,803 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:39:53,804 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-07-01 12:39:53,804 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:39:53,805 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-07-01 12:39:53,805 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:39:53,805 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:39:53,806 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-07-01 12:39:53,806 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-07-01 12:39:53,806 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:39:53,806 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:39:53,806 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-07-01 12:39:53,807 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:39:53,807 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-07-01 12:39:53,807 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-07-01 12:39:53,807 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:39:53,811 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:53,811 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:39:53,811 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:39:53,812 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:53,812 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:53,812 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:53,813 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:39:53,813 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:39:53,813 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:53,814 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:53,814 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:53,814 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:53,814 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:53,815 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:53,815 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:39:53,815 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:53,815 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:39:53,816 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:53,816 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:53,816 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:39:53,816 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:53,817 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:39:53,817 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:39:53,817 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:53,818 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:53,818 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:53,818 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:53,819 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:53,819 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:53,819 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:53,819 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:53,819 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:53,820 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:53,822 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:39:53,822 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-07-01 12:39:53,822 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-07-01 12:39:53,823 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:39:53,823 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-07-01 12:39:53,823 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:39:53,824 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-07-01 12:39:53,824 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:39:53,824 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:39:53,825 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-07-01 12:39:53,825 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-07-01 12:39:53,825 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:39:53,825 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:39:53,825 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-07-01 12:39:53,826 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:39:53,826 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-07-01 12:39:53,826 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-07-01 12:39:53,826 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:39:53,829 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:53,829 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:39:53,829 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:39:53,830 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:53,830 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:53,830 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:53,831 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:39:53,831 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:39:53,831 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:53,832 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:53,832 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:53,832 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:53,832 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:53,833 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:53,833 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:39:53,833 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:53,833 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:39:53,833 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:53,834 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:53,834 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:39:53,834 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:53,834 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:39:53,835 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:39:53,835 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:53,835 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:53,836 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:53,836 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:53,836 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:53,836 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:53,837 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:53,837 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:53,837 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:53,837 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:53,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:39:53 BasicIcfg [2020-07-01 12:39:53,840 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 12:39:53,841 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 12:39:53,841 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 12:39:53,845 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 12:39:53,846 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:39:53,846 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 12:38:08" (1/5) ... [2020-07-01 12:39:53,846 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1b02649c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:39:53, skipping insertion in model container [2020-07-01 12:39:53,846 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:39:53,847 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:38:08" (2/5) ... [2020-07-01 12:39:53,847 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1b02649c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:39:53, skipping insertion in model container [2020-07-01 12:39:53,847 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:39:53,847 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:38:08" (3/5) ... [2020-07-01 12:39:53,847 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1b02649c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:39:53, skipping insertion in model container [2020-07-01 12:39:53,847 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:39:53,847 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:38:09" (4/5) ... [2020-07-01 12:39:53,848 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1b02649c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:39:53, skipping insertion in model container [2020-07-01 12:39:53,848 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:39:53,848 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:39:53" (5/5) ... [2020-07-01 12:39:53,849 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:39:53,878 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 12:39:53,878 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 12:39:53,878 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:39:53,878 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:39:53,878 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:39:53,878 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 12:39:53,878 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:39:53,878 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 12:39:53,882 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states. [2020-07-01 12:39:53,887 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-07-01 12:39:53,887 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:39:53,887 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:39:53,891 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:39:53,892 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:39:53,892 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 12:39:53,892 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states. [2020-07-01 12:39:53,894 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-07-01 12:39:53,894 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:39:53,894 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:39:53,894 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:39:53,894 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:39:53,900 INFO L794 eck$LassoCheckResult]: Stem: 38#ULTIMATE.startENTRYtrue [236] ULTIMATE.startENTRY-->L29: Formula: (and (< 0 |v_#StackHeapBarrier_4|) (= 0 |v_#NULL.base_2|) (= |v_#valid_33| (store |v_#valid_34| 0 0)) (= 0 |v_#NULL.offset_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #valid=|v_#valid_34|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_6|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_4, ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_6, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_4, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_5|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_5|, ULTIMATE.start_main_#t~ret13.base=|v_ULTIMATE.start_main_#t~ret13.base_4|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_5|, ULTIMATE.start_main_#t~ret13.offset=|v_ULTIMATE.start_main_#t~ret13.offset_4|, #StackHeapBarrier=|v_#StackHeapBarrier_4|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_33|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~nondetArea~0.base, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_#t~malloc12.base, #NULL.offset, ULTIMATE.start_main_#t~malloc11.base, ULTIMATE.start_main_#t~ret13.base, #NULL.base, ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~ret13.offset, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~length~0] 9#L29true [154] L29-->L29-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 5#L29-2true [95] L29-2-->L32-1: Formula: (and (< v_ULTIMATE.start_main_~n~0_5 1) (= v_ULTIMATE.start_main_~n~0_4 1)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~n~0] 14#L32-1true [185] L32-1-->L37: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc11.base_2| 1))) (and (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_2| 1) |v_#valid_3|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc11.base_2|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc12.base_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc11.offset_2|) (= v_ULTIMATE.start_main_~nondetArea~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_2|) (= v_ULTIMATE.start_main_~nondetString~0.base_2 |v_ULTIMATE.start_main_#t~malloc12.base_2|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_2|)) (> 0 |v_ULTIMATE.start_main_#t~malloc11.base_2|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc11.base_2|)) (= 0 |v_ULTIMATE.start_main_#t~malloc12.offset_2|) (= v_ULTIMATE.start_main_~nondetString~0.offset_2 |v_ULTIMATE.start_main_#t~malloc12.offset_2|) (= v_ULTIMATE.start_main_~nondetArea~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_2|) (< 0 |v_ULTIMATE.start_main_#t~malloc12.base_2|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc11.base_2| v_ULTIMATE.start_main_~n~0_7) |v_ULTIMATE.start_main_#t~malloc12.base_2| v_ULTIMATE.start_main_~length~0_7)))) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_2, ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_2|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_2, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_2, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_2|, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_2, #valid=|v_#valid_3|, #length=|v_#length_1|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_~nondetString~0.offset, #valid, ULTIMATE.start_main_~nondetArea~0.base, ULTIMATE.start_main_#t~malloc12.base, ULTIMATE.start_main_#t~malloc11.base, #length] 28#L37true [117] L37-->L37-1: Formula: (let ((.cse1 (+ v_ULTIMATE.start_main_~nondetString~0.offset_3 v_ULTIMATE.start_main_~length~0_8 (- 1))) (.cse0 (+ v_ULTIMATE.start_main_~nondetString~0.offset_3 v_ULTIMATE.start_main_~length~0_8))) (and (<= .cse0 (select |v_#length_4| v_ULTIMATE.start_main_~nondetString~0.base_3)) (= |v_#memory_$Pointer$.base_1| (store |v_#memory_$Pointer$.base_2| v_ULTIMATE.start_main_~nondetString~0.base_3 (store (select |v_#memory_$Pointer$.base_2| v_ULTIMATE.start_main_~nondetString~0.base_3) .cse1 (select (select |v_#memory_$Pointer$.base_1| v_ULTIMATE.start_main_~nondetString~0.base_3) .cse1)))) (= |v_#memory_$Pointer$.offset_1| (store |v_#memory_$Pointer$.offset_2| v_ULTIMATE.start_main_~nondetString~0.base_3 (store (select |v_#memory_$Pointer$.offset_2| v_ULTIMATE.start_main_~nondetString~0.base_3) .cse1 (select (select |v_#memory_$Pointer$.offset_1| v_ULTIMATE.start_main_~nondetString~0.base_3) .cse1)))) (= 1 (select |v_#valid_6| v_ULTIMATE.start_main_~nondetString~0.base_3)) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString~0.base_3) .cse1 0))) (<= 1 .cse0))) InVars {#memory_$Pointer$.base=|v_#memory_$Pointer$.base_2|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_3, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_2|, #length=|v_#length_4|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_2|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_8} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_1|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_3, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_8} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] 43#L37-1true [191] L37-1-->L5: Formula: (and (= |v_ULTIMATE.start_cstpncpy_#in~dst.base_1| v_ULTIMATE.start_main_~nondetArea~0.base_3) (> |v_ULTIMATE.start_cstpncpy_~#dst.base_1| 0) (= (store |v_#length_7| |v_ULTIMATE.start_cstpncpy_~#dst.base_1| 8) |v_#length_6|) (= 0 (select |v_#valid_9| |v_ULTIMATE.start_cstpncpy_~#dst.base_1|)) (= |v_ULTIMATE.start_cstpncpy_#in~dst.offset_1| v_ULTIMATE.start_main_~nondetArea~0.offset_3) (= 0 |v_ULTIMATE.start_cstpncpy_~#dst.offset_1|) (= |v_ULTIMATE.start_cstpncpy_#in~n_1| v_ULTIMATE.start_main_~n~0_8) (= |v_ULTIMATE.start_cstpncpy_#in~src.offset_1| v_ULTIMATE.start_main_~nondetString~0.offset_5) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_cstpncpy_~#dst.base_1|) (= |v_#valid_8| (store |v_#valid_9| |v_ULTIMATE.start_cstpncpy_~#dst.base_1| 1)) (= |v_ULTIMATE.start_cstpncpy_#in~src.base_1| v_ULTIMATE.start_main_~nondetString~0.base_6)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_3, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_6, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_5, #valid=|v_#valid_9|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_3, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, #length=|v_#length_7|} OutVars{ULTIMATE.start_cstpncpy_~d~0.base=v_ULTIMATE.start_cstpncpy_~d~0.base_1, ULTIMATE.start_cstpncpy_#t~mem8.base=|v_ULTIMATE.start_cstpncpy_#t~mem8.base_1|, ULTIMATE.start_cstpncpy_#t~post7.offset=|v_ULTIMATE.start_cstpncpy_#t~post7.offset_1|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_3, ULTIMATE.start_cstpncpy_#t~post4.offset=|v_ULTIMATE.start_cstpncpy_#t~post4.offset_1|, ULTIMATE.start_cstpncpy_#in~src.offset=|v_ULTIMATE.start_cstpncpy_#in~src.offset_1|, ULTIMATE.start_cstpncpy_#t~mem0.offset=|v_ULTIMATE.start_cstpncpy_#t~mem0.offset_1|, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_1|, ULTIMATE.start_cstpncpy_~src.base=v_ULTIMATE.start_cstpncpy_~src.base_1, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_5, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_3, ULTIMATE.start_cstpncpy_#in~dst.base=|v_ULTIMATE.start_cstpncpy_#in~dst.base_1|, ULTIMATE.start_cstpncpy_#t~mem5=|v_ULTIMATE.start_cstpncpy_#t~mem5_1|, ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_1, ULTIMATE.start_cstpncpy_~s~0.offset=v_ULTIMATE.start_cstpncpy_~s~0.offset_1, ULTIMATE.start_cstpncpy_#t~mem1.base=|v_ULTIMATE.start_cstpncpy_#t~mem1.base_1|, ULTIMATE.start_cstpncpy_#t~mem0.base=|v_ULTIMATE.start_cstpncpy_#t~mem0.base_1|, ULTIMATE.start_cstpncpy_#t~pre2=|v_ULTIMATE.start_cstpncpy_#t~pre2_1|, #length=|v_#length_6|, ULTIMATE.start_cstpncpy_#t~pre6=|v_ULTIMATE.start_cstpncpy_#t~pre6_1|, ULTIMATE.start_cstpncpy_#in~n=|v_ULTIMATE.start_cstpncpy_#in~n_1|, ULTIMATE.start_cstpncpy_~s~0.base=v_ULTIMATE.start_cstpncpy_~s~0.base_1, ULTIMATE.start_cstpncpy_#t~mem1.offset=|v_ULTIMATE.start_cstpncpy_#t~mem1.offset_1|, ULTIMATE.start_cstpncpy_#t~post4.base=|v_ULTIMATE.start_cstpncpy_#t~post4.base_1|, ULTIMATE.start_cstpncpy_#t~post3.base=|v_ULTIMATE.start_cstpncpy_#t~post3.base_1|, ULTIMATE.start_cstpncpy_#res.base=|v_ULTIMATE.start_cstpncpy_#res.base_1|, ULTIMATE.start_cstpncpy_#in~src.base=|v_ULTIMATE.start_cstpncpy_#in~src.base_1|, ULTIMATE.start_cstpncpy_#res.offset=|v_ULTIMATE.start_cstpncpy_#res.offset_1|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_1|, ULTIMATE.start_cstpncpy_#t~mem8.offset=|v_ULTIMATE.start_cstpncpy_#t~mem8.offset_1|, ULTIMATE.start_cstpncpy_~src.offset=v_ULTIMATE.start_cstpncpy_~src.offset_1, ULTIMATE.start_cstpncpy_~d~0.offset=v_ULTIMATE.start_cstpncpy_~d~0.offset_1, #StackHeapBarrier=|v_#StackHeapBarrier_3|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_6, #valid=|v_#valid_8|, ULTIMATE.start_cstpncpy_#t~post3.offset=|v_ULTIMATE.start_cstpncpy_#t~post3.offset_1|, ULTIMATE.start_cstpncpy_#in~dst.offset=|v_ULTIMATE.start_cstpncpy_#in~dst.offset_1|, ULTIMATE.start_cstpncpy_#t~post7.base=|v_ULTIMATE.start_cstpncpy_#t~post7.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_~d~0.base, ULTIMATE.start_cstpncpy_#t~mem8.base, ULTIMATE.start_cstpncpy_#t~post7.offset, ULTIMATE.start_cstpncpy_#t~post4.offset, ULTIMATE.start_cstpncpy_#in~src.offset, ULTIMATE.start_cstpncpy_#t~mem0.offset, ULTIMATE.start_cstpncpy_~#dst.offset, ULTIMATE.start_cstpncpy_~src.base, ULTIMATE.start_cstpncpy_#in~dst.base, ULTIMATE.start_cstpncpy_#t~mem5, ULTIMATE.start_cstpncpy_~n, ULTIMATE.start_cstpncpy_~s~0.offset, ULTIMATE.start_cstpncpy_#t~mem1.base, ULTIMATE.start_cstpncpy_#t~mem0.base, ULTIMATE.start_cstpncpy_#t~pre2, #length, ULTIMATE.start_cstpncpy_#t~pre6, ULTIMATE.start_cstpncpy_#in~n, ULTIMATE.start_cstpncpy_~s~0.base, ULTIMATE.start_cstpncpy_#t~mem1.offset, ULTIMATE.start_cstpncpy_#t~post4.base, ULTIMATE.start_cstpncpy_#t~post3.base, ULTIMATE.start_cstpncpy_#res.base, ULTIMATE.start_cstpncpy_#in~src.base, ULTIMATE.start_cstpncpy_#res.offset, ULTIMATE.start_cstpncpy_~#dst.base, ULTIMATE.start_cstpncpy_#t~mem8.offset, ULTIMATE.start_cstpncpy_~src.offset, ULTIMATE.start_cstpncpy_~d~0.offset, #valid, ULTIMATE.start_cstpncpy_#t~post3.offset, ULTIMATE.start_cstpncpy_#in~dst.offset, ULTIMATE.start_cstpncpy_#t~post7.base] 4#L5true [237] L5-->L8: Formula: (and (= v_ULTIMATE.start_cstpncpy_~src.offset_4 |v_ULTIMATE.start_cstpncpy_#in~src.offset_3|) (= (store |v_#memory_$Pointer$.offset_17| |v_ULTIMATE.start_cstpncpy_~#dst.base_23| (store (select |v_#memory_$Pointer$.offset_17| |v_ULTIMATE.start_cstpncpy_~#dst.base_23|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_17| |v_ULTIMATE.start_cstpncpy_#in~dst.offset_3|)) |v_#memory_$Pointer$.offset_16|) (<= (+ |v_ULTIMATE.start_cstpncpy_~#dst.offset_17| 8) (select |v_#length_26| |v_ULTIMATE.start_cstpncpy_~#dst.base_23|)) (= (store |v_#memory_$Pointer$.base_17| |v_ULTIMATE.start_cstpncpy_~#dst.base_23| (store (select |v_#memory_$Pointer$.base_17| |v_ULTIMATE.start_cstpncpy_~#dst.base_23|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_17| |v_ULTIMATE.start_cstpncpy_#in~dst.base_3|)) |v_#memory_$Pointer$.base_16|) (= v_ULTIMATE.start_cstpncpy_~src.base_4 |v_ULTIMATE.start_cstpncpy_#in~src.base_3|) (= v_ULTIMATE.start_cstpncpy_~n_10 |v_ULTIMATE.start_cstpncpy_#in~n_3|) (<= 0 |v_ULTIMATE.start_cstpncpy_~#dst.offset_17|) (= (store |v_#memory_int_15| |v_ULTIMATE.start_cstpncpy_~#dst.base_23| (store (select |v_#memory_int_15| |v_ULTIMATE.start_cstpncpy_~#dst.base_23|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_17| (select (select |v_#memory_int_14| |v_ULTIMATE.start_cstpncpy_~#dst.base_23|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_17|))) |v_#memory_int_14|) (= 1 (select |v_#valid_35| |v_ULTIMATE.start_cstpncpy_~#dst.base_23|))) InVars {ULTIMATE.start_cstpncpy_#in~src.offset=|v_ULTIMATE.start_cstpncpy_#in~src.offset_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_17|, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_17|, ULTIMATE.start_cstpncpy_#in~src.base=|v_ULTIMATE.start_cstpncpy_#in~src.base_3|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_cstpncpy_#in~dst.base=|v_ULTIMATE.start_cstpncpy_#in~dst.base_3|, ULTIMATE.start_cstpncpy_#in~dst.offset=|v_ULTIMATE.start_cstpncpy_#in~dst.offset_3|, #length=|v_#length_26|, ULTIMATE.start_cstpncpy_#in~n=|v_ULTIMATE.start_cstpncpy_#in~n_3|, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_23|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_17|} OutVars{ULTIMATE.start_cstpncpy_#in~src.offset=|v_ULTIMATE.start_cstpncpy_#in~src.offset_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_16|, ULTIMATE.start_cstpncpy_~src.base=v_ULTIMATE.start_cstpncpy_~src.base_4, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_17|, ULTIMATE.start_cstpncpy_#in~src.base=|v_ULTIMATE.start_cstpncpy_#in~src.base_3|, ULTIMATE.start_cstpncpy_#in~dst.base=|v_ULTIMATE.start_cstpncpy_#in~dst.base_3|, ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_10, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_23|, ULTIMATE.start_cstpncpy_~src.offset=v_ULTIMATE.start_cstpncpy_~src.offset_4, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_cstpncpy_#in~dst.offset=|v_ULTIMATE.start_cstpncpy_#in~dst.offset_3|, #length=|v_#length_26|, ULTIMATE.start_cstpncpy_#in~n=|v_ULTIMATE.start_cstpncpy_#in~n_3|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_16|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_~src.offset, #memory_$Pointer$.base, ULTIMATE.start_cstpncpy_~src.base, #memory_int, ULTIMATE.start_cstpncpy_~n, #memory_$Pointer$.offset] 34#L8true [197] L8-->L9: Formula: (< v_ULTIMATE.start_cstpncpy_~n_3 0) InVars {ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_3} OutVars{ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_3} AuxVars[] AssignedVars[] 11#L9true [239] L9-->L12: Formula: (and (= (select (select |v_#memory_$Pointer$.base_19| |v_ULTIMATE.start_cstpncpy_~#dst.base_26|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_20|) v_ULTIMATE.start_cstpncpy_~d~0.base_8) (<= 0 |v_ULTIMATE.start_cstpncpy_~#dst.offset_20|) (<= (+ |v_ULTIMATE.start_cstpncpy_~#dst.offset_20| 8) (select |v_#length_28| |v_ULTIMATE.start_cstpncpy_~#dst.base_26|)) (= v_ULTIMATE.start_cstpncpy_~d~0.offset_8 (select (select |v_#memory_$Pointer$.offset_19| |v_ULTIMATE.start_cstpncpy_~#dst.base_26|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_20|)) (= 1 (select |v_#valid_38| |v_ULTIMATE.start_cstpncpy_~#dst.base_26|)) (= v_ULTIMATE.start_cstpncpy_~src.offset_5 v_ULTIMATE.start_cstpncpy_~s~0.offset_5) (= v_ULTIMATE.start_cstpncpy_~src.base_5 v_ULTIMATE.start_cstpncpy_~s~0.base_5)) InVars {ULTIMATE.start_cstpncpy_~src.offset=v_ULTIMATE.start_cstpncpy_~src.offset_5, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_19|, ULTIMATE.start_cstpncpy_~src.base=v_ULTIMATE.start_cstpncpy_~src.base_5, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_20|, #valid=|v_#valid_38|, #length=|v_#length_28|, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_26|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_19|} OutVars{ULTIMATE.start_cstpncpy_~d~0.base=v_ULTIMATE.start_cstpncpy_~d~0.base_8, ULTIMATE.start_cstpncpy_#t~mem0.offset=|v_ULTIMATE.start_cstpncpy_#t~mem0.offset_5|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_19|, ULTIMATE.start_cstpncpy_~src.base=v_ULTIMATE.start_cstpncpy_~src.base_5, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_20|, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_26|, ULTIMATE.start_cstpncpy_~s~0.offset=v_ULTIMATE.start_cstpncpy_~s~0.offset_5, ULTIMATE.start_cstpncpy_~src.offset=v_ULTIMATE.start_cstpncpy_~src.offset_5, ULTIMATE.start_cstpncpy_~d~0.offset=v_ULTIMATE.start_cstpncpy_~d~0.offset_8, ULTIMATE.start_cstpncpy_#t~mem0.base=|v_ULTIMATE.start_cstpncpy_#t~mem0.base_5|, #valid=|v_#valid_38|, #length=|v_#length_28|, ULTIMATE.start_cstpncpy_~s~0.base=v_ULTIMATE.start_cstpncpy_~s~0.base_5, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_19|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_~d~0.base, ULTIMATE.start_cstpncpy_~d~0.offset, ULTIMATE.start_cstpncpy_#t~mem0.base, ULTIMATE.start_cstpncpy_#t~mem0.offset, ULTIMATE.start_cstpncpy_~s~0.base, ULTIMATE.start_cstpncpy_~s~0.offset] 19#L12true [141] L12-->L12-1: Formula: (and (<= (+ |v_ULTIMATE.start_cstpncpy_~#dst.offset_7| 8) (select |v_#length_12| |v_ULTIMATE.start_cstpncpy_~#dst.base_9|)) (= (select (select |v_#memory_$Pointer$.base_6| |v_ULTIMATE.start_cstpncpy_~#dst.base_9|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_7|) |v_ULTIMATE.start_cstpncpy_#t~mem1.base_2|) (= (select (select |v_#memory_$Pointer$.offset_6| |v_ULTIMATE.start_cstpncpy_~#dst.base_9|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_7|) |v_ULTIMATE.start_cstpncpy_#t~mem1.offset_2|) (= 1 (select |v_#valid_14| |v_ULTIMATE.start_cstpncpy_~#dst.base_9|)) (<= 0 |v_ULTIMATE.start_cstpncpy_~#dst.offset_7|)) InVars {#memory_$Pointer$.base=|v_#memory_$Pointer$.base_6|, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_7|, #valid=|v_#valid_14|, #length=|v_#length_12|, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_9|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_6|} OutVars{ULTIMATE.start_cstpncpy_#t~mem1.base=|v_ULTIMATE.start_cstpncpy_#t~mem1.base_2|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_6|, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_7|, #valid=|v_#valid_14|, #length=|v_#length_12|, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_9|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_6|, ULTIMATE.start_cstpncpy_#t~mem1.offset=|v_ULTIMATE.start_cstpncpy_#t~mem1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_#t~mem1.base, ULTIMATE.start_cstpncpy_#t~mem1.offset] 17#L12-1true [243] L12-1-->L13-4: Formula: (and (= (store |v_#memory_int_17| |v_ULTIMATE.start_cstpncpy_~#dst.base_33| (store (select |v_#memory_int_17| |v_ULTIMATE.start_cstpncpy_~#dst.base_33|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_27| (select (select |v_#memory_int_16| |v_ULTIMATE.start_cstpncpy_~#dst.base_33|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_27|))) |v_#memory_int_16|) (<= (+ |v_ULTIMATE.start_cstpncpy_~#dst.offset_27| 8) (select |v_#length_32| |v_ULTIMATE.start_cstpncpy_~#dst.base_33|)) (= 1 (select |v_#valid_46| |v_ULTIMATE.start_cstpncpy_~#dst.base_33|)) (= (store |v_#memory_$Pointer$.offset_24| |v_ULTIMATE.start_cstpncpy_~#dst.base_33| (store (select |v_#memory_$Pointer$.offset_24| |v_ULTIMATE.start_cstpncpy_~#dst.base_33|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_27| (+ (mod v_ULTIMATE.start_cstpncpy_~n_11 4294967296) |v_ULTIMATE.start_cstpncpy_#t~mem1.offset_6|))) |v_#memory_$Pointer$.offset_23|) (<= 0 |v_ULTIMATE.start_cstpncpy_~#dst.offset_27|) (= (store |v_#memory_$Pointer$.base_24| |v_ULTIMATE.start_cstpncpy_~#dst.base_33| (store (select |v_#memory_$Pointer$.base_24| |v_ULTIMATE.start_cstpncpy_~#dst.base_33|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_27| |v_ULTIMATE.start_cstpncpy_#t~mem1.base_6|)) |v_#memory_$Pointer$.base_23|)) InVars {ULTIMATE.start_cstpncpy_#t~mem1.base=|v_ULTIMATE.start_cstpncpy_#t~mem1.base_6|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_24|, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_27|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, #length=|v_#length_32|, ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_11, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_33|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_24|, ULTIMATE.start_cstpncpy_#t~mem1.offset=|v_ULTIMATE.start_cstpncpy_#t~mem1.offset_6|} OutVars{ULTIMATE.start_cstpncpy_#t~mem1.base=|v_ULTIMATE.start_cstpncpy_#t~mem1.base_5|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_23|, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_27|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_16|, #length=|v_#length_32|, ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_11, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_33|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_23|, ULTIMATE.start_cstpncpy_#t~mem1.offset=|v_ULTIMATE.start_cstpncpy_#t~mem1.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_#t~mem1.base, #memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset, ULTIMATE.start_cstpncpy_#t~mem1.offset] 12#L13-4true [2020-07-01 12:39:53,900 INFO L796 eck$LassoCheckResult]: Loop: 12#L13-4true [134] L13-4-->L14: Formula: (and (= v_ULTIMATE.start_cstpncpy_~s~0.offset_3 (+ |v_ULTIMATE.start_cstpncpy_#t~post4.offset_2| 1)) (= v_ULTIMATE.start_cstpncpy_~d~0.offset_3 (+ |v_ULTIMATE.start_cstpncpy_#t~post3.offset_2| 1)) (= |v_ULTIMATE.start_cstpncpy_#t~post3.offset_2| v_ULTIMATE.start_cstpncpy_~d~0.offset_4) (= |v_ULTIMATE.start_cstpncpy_#t~post4.offset_2| v_ULTIMATE.start_cstpncpy_~s~0.offset_4) (= |v_ULTIMATE.start_cstpncpy_#t~post3.base_2| v_ULTIMATE.start_cstpncpy_~d~0.base_4) (= v_ULTIMATE.start_cstpncpy_~s~0.base_3 |v_ULTIMATE.start_cstpncpy_#t~post4.base_2|) (= v_ULTIMATE.start_cstpncpy_~d~0.base_3 |v_ULTIMATE.start_cstpncpy_#t~post3.base_2|) (= |v_ULTIMATE.start_cstpncpy_#t~post4.base_2| v_ULTIMATE.start_cstpncpy_~s~0.base_4)) InVars {ULTIMATE.start_cstpncpy_~d~0.base=v_ULTIMATE.start_cstpncpy_~d~0.base_4, ULTIMATE.start_cstpncpy_~d~0.offset=v_ULTIMATE.start_cstpncpy_~d~0.offset_4, ULTIMATE.start_cstpncpy_~s~0.base=v_ULTIMATE.start_cstpncpy_~s~0.base_4, ULTIMATE.start_cstpncpy_~s~0.offset=v_ULTIMATE.start_cstpncpy_~s~0.offset_4} OutVars{ULTIMATE.start_cstpncpy_~d~0.base=v_ULTIMATE.start_cstpncpy_~d~0.base_3, ULTIMATE.start_cstpncpy_~d~0.offset=v_ULTIMATE.start_cstpncpy_~d~0.offset_3, ULTIMATE.start_cstpncpy_#t~post4.offset=|v_ULTIMATE.start_cstpncpy_#t~post4.offset_2|, ULTIMATE.start_cstpncpy_#t~post4.base=|v_ULTIMATE.start_cstpncpy_#t~post4.base_2|, ULTIMATE.start_cstpncpy_#t~post3.base=|v_ULTIMATE.start_cstpncpy_#t~post3.base_2|, ULTIMATE.start_cstpncpy_#t~post3.offset=|v_ULTIMATE.start_cstpncpy_#t~post3.offset_2|, ULTIMATE.start_cstpncpy_~s~0.base=v_ULTIMATE.start_cstpncpy_~s~0.base_3, ULTIMATE.start_cstpncpy_~s~0.offset=v_ULTIMATE.start_cstpncpy_~s~0.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_~d~0.base, ULTIMATE.start_cstpncpy_~d~0.offset, ULTIMATE.start_cstpncpy_#t~post4.offset, ULTIMATE.start_cstpncpy_#t~post4.base, ULTIMATE.start_cstpncpy_#t~post3.base, ULTIMATE.start_cstpncpy_#t~post3.offset, ULTIMATE.start_cstpncpy_~s~0.base, ULTIMATE.start_cstpncpy_~s~0.offset] 24#L14true [111] L14-->L14-1: Formula: (and (<= 0 |v_ULTIMATE.start_cstpncpy_#t~post4.offset_3|) (= (select |v_#valid_18| |v_ULTIMATE.start_cstpncpy_#t~post4.base_3|) 1) (= (select (select |v_#memory_int_7| |v_ULTIMATE.start_cstpncpy_#t~post4.base_3|) |v_ULTIMATE.start_cstpncpy_#t~post4.offset_3|) |v_ULTIMATE.start_cstpncpy_#t~mem5_2|) (<= (+ |v_ULTIMATE.start_cstpncpy_#t~post4.offset_3| 1) (select |v_#length_16| |v_ULTIMATE.start_cstpncpy_#t~post4.base_3|))) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_16|, ULTIMATE.start_cstpncpy_#t~post4.base=|v_ULTIMATE.start_cstpncpy_#t~post4.base_3|, ULTIMATE.start_cstpncpy_#t~post4.offset=|v_ULTIMATE.start_cstpncpy_#t~post4.offset_3|, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_cstpncpy_#t~post4.base=|v_ULTIMATE.start_cstpncpy_#t~post4.base_3|, ULTIMATE.start_cstpncpy_#t~post4.offset=|v_ULTIMATE.start_cstpncpy_#t~post4.offset_3|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_cstpncpy_#t~mem5=|v_ULTIMATE.start_cstpncpy_#t~mem5_2|, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_#t~mem5] 22#L14-1true [107] L14-1-->L14-2: Formula: (and (= 1 (select |v_#valid_20| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|)) (= (store |v_#memory_$Pointer$.base_10| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3| (store (select |v_#memory_$Pointer$.base_10| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|) |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3| (select (select |v_#memory_$Pointer$.base_9| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|) |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3|))) |v_#memory_$Pointer$.base_9|) (= (store |v_#memory_$Pointer$.offset_10| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3| (store (select |v_#memory_$Pointer$.offset_10| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|) |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3| (select (select |v_#memory_$Pointer$.offset_9| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|) |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3|))) |v_#memory_$Pointer$.offset_9|) (<= 0 |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3|) (<= (+ |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3| 1) (select |v_#length_18| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|)) (= |v_#memory_int_8| (store |v_#memory_int_9| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3| (store (select |v_#memory_int_9| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|) |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3| |v_ULTIMATE.start_cstpncpy_#t~mem5_3|)))) InVars {ULTIMATE.start_cstpncpy_#t~post3.base=|v_ULTIMATE.start_cstpncpy_#t~post3.base_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_10|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_cstpncpy_#t~post3.offset=|v_ULTIMATE.start_cstpncpy_#t~post3.offset_3|, ULTIMATE.start_cstpncpy_#t~mem5=|v_ULTIMATE.start_cstpncpy_#t~mem5_3|, #length=|v_#length_18|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_10|} OutVars{ULTIMATE.start_cstpncpy_#t~post3.base=|v_ULTIMATE.start_cstpncpy_#t~post3.base_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_9|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_cstpncpy_#t~post3.offset=|v_ULTIMATE.start_cstpncpy_#t~post3.offset_3|, ULTIMATE.start_cstpncpy_#t~mem5=|v_ULTIMATE.start_cstpncpy_#t~mem5_3|, #length=|v_#length_18|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_9|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] 20#L14-2true [222] L14-2-->L13-1: Formula: (< 0 |v_ULTIMATE.start_cstpncpy_#t~mem5_7|) InVars {ULTIMATE.start_cstpncpy_#t~mem5=|v_ULTIMATE.start_cstpncpy_#t~mem5_7|} OutVars{ULTIMATE.start_cstpncpy_#t~post3.offset=|v_ULTIMATE.start_cstpncpy_#t~post3.offset_6|, ULTIMATE.start_cstpncpy_#t~mem5=|v_ULTIMATE.start_cstpncpy_#t~mem5_6|, ULTIMATE.start_cstpncpy_#t~post3.base=|v_ULTIMATE.start_cstpncpy_#t~post3.base_7|, ULTIMATE.start_cstpncpy_#t~post4.offset=|v_ULTIMATE.start_cstpncpy_#t~post4.offset_6|, ULTIMATE.start_cstpncpy_#t~post4.base=|v_ULTIMATE.start_cstpncpy_#t~post4.base_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_#t~post3.base, ULTIMATE.start_cstpncpy_#t~post4.offset, ULTIMATE.start_cstpncpy_#t~post4.base, ULTIMATE.start_cstpncpy_#t~post3.offset, ULTIMATE.start_cstpncpy_#t~mem5] 41#L13-1true [153] L13-1-->L13-2: Formula: (let ((.cse0 (+ v_ULTIMATE.start_cstpncpy_~n_8 (- 1)))) (and (= v_ULTIMATE.start_cstpncpy_~n_7 .cse0) (= |v_ULTIMATE.start_cstpncpy_#t~pre2_2| .cse0))) InVars {ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_8} OutVars{ULTIMATE.start_cstpncpy_#t~pre2=|v_ULTIMATE.start_cstpncpy_#t~pre2_2|, ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_7} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_#t~pre2, ULTIMATE.start_cstpncpy_~n] 39#L13-2true [228] L13-2-->L13-4: Formula: (> 0 |v_ULTIMATE.start_cstpncpy_#t~pre2_6|) InVars {ULTIMATE.start_cstpncpy_#t~pre2=|v_ULTIMATE.start_cstpncpy_#t~pre2_6|} OutVars{ULTIMATE.start_cstpncpy_#t~pre2=|v_ULTIMATE.start_cstpncpy_#t~pre2_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_#t~pre2] 12#L13-4true [2020-07-01 12:39:53,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:39:53,901 INFO L82 PathProgramCache]: Analyzing trace with hash -698175350, now seen corresponding path program 1 times [2020-07-01 12:39:53,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:39:53,901 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272554026] [2020-07-01 12:39:53,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:39:53,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:39:53,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:39:53,915 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272554026] [2020-07-01 12:39:53,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:39:53,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:39:53,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320819698] [2020-07-01 12:39:53,916 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 12:39:53,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:39:53,916 INFO L82 PathProgramCache]: Analyzing trace with hash 534759400, now seen corresponding path program 1 times [2020-07-01 12:39:53,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:39:53,917 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900092935] [2020-07-01 12:39:53,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:39:53,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:39:53,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:39:53,941 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:39:54,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:39:54,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:39:54,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:39:54,084 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 3 states. [2020-07-01 12:39:54,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:39:54,179 INFO L93 Difference]: Finished difference Result 42 states and 71 transitions. [2020-07-01 12:39:54,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:39:54,183 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: unknown kind of automaton at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.toString(AutomatonDefinitionPrinter.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.TermcompProofBenchmark.reportFiniteModule(TermcompProofBenchmark.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:978) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-01 12:39:54,187 INFO L168 Benchmark]: Toolchain (without parser) took 106165.77 ms. Allocated memory was 649.6 MB in the beginning and 895.0 MB in the end (delta: 245.4 MB). Free memory was 562.5 MB in the beginning and 518.7 MB in the end (delta: 43.7 MB). Peak memory consumption was 289.1 MB. Max. memory is 50.3 GB. [2020-07-01 12:39:54,188 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 583.2 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:39:54,188 INFO L168 Benchmark]: CACSL2BoogieTranslator took 336.70 ms. Allocated memory was 649.6 MB in the beginning and 692.6 MB in the end (delta: 43.0 MB). Free memory was 562.5 MB in the beginning and 655.3 MB in the end (delta: -92.9 MB). Peak memory consumption was 29.2 MB. Max. memory is 50.3 GB. [2020-07-01 12:39:54,188 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.19 ms. Allocated memory is still 692.6 MB. Free memory was 655.3 MB in the beginning and 653.2 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-07-01 12:39:54,189 INFO L168 Benchmark]: Boogie Preprocessor took 33.40 ms. Allocated memory is still 692.6 MB. Free memory was 653.2 MB in the beginning and 651.0 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-07-01 12:39:54,189 INFO L168 Benchmark]: RCFGBuilder took 454.50 ms. Allocated memory is still 692.6 MB. Free memory was 651.0 MB in the beginning and 619.1 MB in the end (delta: 31.9 MB). Peak memory consumption was 31.9 MB. Max. memory is 50.3 GB. [2020-07-01 12:39:54,189 INFO L168 Benchmark]: BlockEncodingV2 took 156.36 ms. Allocated memory is still 692.6 MB. Free memory was 619.1 MB in the beginning and 606.2 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 50.3 GB. [2020-07-01 12:39:54,190 INFO L168 Benchmark]: TraceAbstraction took 104787.29 ms. Allocated memory was 692.6 MB in the beginning and 895.0 MB in the end (delta: 202.4 MB). Free memory was 605.1 MB in the beginning and 557.7 MB in the end (delta: 47.4 MB). Peak memory consumption was 466.1 MB. Max. memory is 50.3 GB. [2020-07-01 12:39:54,190 INFO L168 Benchmark]: BuchiAutomizer took 344.31 ms. Allocated memory is still 895.0 MB. Free memory was 557.7 MB in the beginning and 518.7 MB in the end (delta: 39.0 MB). Peak memory consumption was 39.0 MB. Max. memory is 50.3 GB. [2020-07-01 12:39:54,192 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 52 locations, 59 edges - StatisticsResult: Encoded RCFG 42 locations, 75 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 583.2 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 336.70 ms. Allocated memory was 649.6 MB in the beginning and 692.6 MB in the end (delta: 43.0 MB). Free memory was 562.5 MB in the beginning and 655.3 MB in the end (delta: -92.9 MB). Peak memory consumption was 29.2 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 47.19 ms. Allocated memory is still 692.6 MB. Free memory was 655.3 MB in the beginning and 653.2 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 33.40 ms. Allocated memory is still 692.6 MB. Free memory was 653.2 MB in the beginning and 651.0 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * RCFGBuilder took 454.50 ms. Allocated memory is still 692.6 MB. Free memory was 651.0 MB in the beginning and 619.1 MB in the end (delta: 31.9 MB). Peak memory consumption was 31.9 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 156.36 ms. Allocated memory is still 692.6 MB. Free memory was 619.1 MB in the beginning and 606.2 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 50.3 GB. * TraceAbstraction took 104787.29 ms. Allocated memory was 692.6 MB in the beginning and 895.0 MB in the end (delta: 202.4 MB). Free memory was 605.1 MB in the beginning and 557.7 MB in the end (delta: 47.4 MB). Peak memory consumption was 466.1 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 344.31 ms. Allocated memory is still 895.0 MB. Free memory was 557.7 MB in the beginning and 518.7 MB in the end (delta: 39.0 MB). Peak memory consumption was 39.0 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 37]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 37]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 5]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 5]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 20 specifications checked. All of them hold - InvariantResult [Line: 15]: Loop Invariant [2020-07-01 12:39:54,202 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:54,202 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:39:54,203 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:39:54,203 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:54,203 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:54,203 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:54,204 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:54,204 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:54,204 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:54,204 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:54,205 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:54,206 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:54,206 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:39:54,207 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:39:54,207 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:54,207 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:54,207 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:54,208 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:54,208 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:54,208 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:54,208 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:54,209 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((((((((((((((((((((((((((1 == \valid[src] && length == unknown-#length-unknown[nondetString]) && dst == 0) && 1 <= \old(n)) && 1 == \valid[s]) && 1 <= unknown-#StackHeapBarrier-unknown) && 1 == \valid[dst]) && \valid[nondetArea] == 1) && 0 == unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + -1]) && 0 == src) && !(dst == s)) && nondetString + 1 <= unknown-#length-unknown[nondetString]) && 1 == \valid[nondetString]) && 0 == src) && \old(n) <= unknown-#length-unknown[dst]) && n + d <= unknown-#length-unknown[d] + 1) && 1 <= unknown-#length-unknown[src]) && 0 == nondetArea) && 1 <= unknown-#length-unknown[src]) && 0 == nondetString) && !(nondetString == nondetArea)) && n == unknown-#length-unknown[nondetArea]) && 8 == unknown-#length-unknown[dst]) && !(dst == d)) && 1 <= n) && 1 == \valid[dst]) && !(dst == dst)) && 1 == \valid[src]) && !(src == dst)) && dst == 0) && !(src == dst)) && 1 <= s) && 1 <= d) && !(d == s)) && 1 == \valid[d]) && 1 <= n - InvariantResult [Line: 13]: Loop Invariant [2020-07-01 12:39:54,209 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:39:54,210 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-07-01 12:39:54,210 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-07-01 12:39:54,210 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:39:54,210 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-07-01 12:39:54,211 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:39:54,211 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-07-01 12:39:54,211 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:39:54,212 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:39:54,212 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-07-01 12:39:54,212 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-07-01 12:39:54,212 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:39:54,212 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:39:54,212 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-07-01 12:39:54,212 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:39:54,213 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-07-01 12:39:54,213 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-07-01 12:39:54,213 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:39:54,215 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:54,215 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:39:54,215 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:39:54,216 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:54,216 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:54,216 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:54,216 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:39:54,217 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:39:54,217 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:54,217 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:54,217 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:54,218 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:54,218 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:54,218 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:54,218 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:39:54,218 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:54,219 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:39:54,219 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:54,219 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:54,219 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:39:54,219 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:54,220 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:39:54,220 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:39:54,220 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:54,220 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:54,221 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:54,221 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:54,221 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:54,221 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:54,222 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:54,222 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:54,222 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:54,222 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:54,223 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:39:54,224 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-07-01 12:39:54,224 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-07-01 12:39:54,224 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:39:54,224 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-07-01 12:39:54,225 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:39:54,225 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-07-01 12:39:54,225 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:39:54,226 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:39:54,226 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-07-01 12:39:54,226 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-07-01 12:39:54,226 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:39:54,226 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:39:54,226 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-07-01 12:39:54,227 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:39:54,227 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-07-01 12:39:54,227 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-07-01 12:39:54,227 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:39:54,228 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:54,229 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:39:54,229 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:39:54,229 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:54,230 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:54,230 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:54,230 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:39:54,231 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:39:54,231 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:54,231 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:54,231 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:54,232 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:54,232 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:54,232 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:54,232 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:39:54,232 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:54,233 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:39:54,233 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:54,233 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:54,233 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:39:54,233 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:54,234 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:39:54,234 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:39:54,234 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:54,234 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:54,235 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:54,235 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:54,235 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:54,235 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:54,236 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:54,236 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:54,236 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:39:54,236 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((0 == s && 1 == \valid[src]) && !(src == dst)) && length == unknown-#length-unknown[nondetString]) && dst == 0) && 1 == \valid[s]) && 1 <= \old(n)) && 1 <= unknown-#StackHeapBarrier-unknown) && 1 == \valid[dst]) && \valid[nondetArea] == 1) && 0 == unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + -1]) && 0 == src) && !(dst == s)) && 1 == \valid[nondetString]) && nondetString + 1 <= unknown-#length-unknown[nondetString]) && 0 == src) && (\exists ULTIMATE.start_main_~length~0 : int, ULTIMATE.start_main_~nondetString~0.offset : int :: ((s <= ULTIMATE.start_main_~nondetString~0.offset && 1 <= ULTIMATE.start_main_~length~0) && ULTIMATE.start_main_~length~0 + ULTIMATE.start_main_~nondetString~0.offset <= unknown-#length-unknown[s]) && unknown-#memory_int-unknown[s][ULTIMATE.start_main_~length~0 + ULTIMATE.start_main_~nondetString~0.offset + -1] == 0)) && 0 == unknown-#memory_int-unknown[src][unknown-#length-unknown[src] + -1]) && 0 == nondetArea) && 0 == nondetString) && !(nondetString == nondetArea)) && n == unknown-#length-unknown[nondetArea]) && 8 == unknown-#length-unknown[dst]) && !(dst == d)) && 1 <= n) && 1 == \valid[dst]) && !(dst == dst)) && n + d <= unknown-#length-unknown[d]) && 1 == \valid[src]) && d <= 0) && !(src == dst)) && !(src == dst)) && dst == 0) && ((8 == unknown-#length-unknown[dst] && dst == dst) || \old(n) <= unknown-#length-unknown[dst])) && !(d == s)) && 0 == unknown-#memory_int-unknown[nondetString][unknown-#length-unknown[nondetString] + -1]) && 0 <= d) && (\exists ULTIMATE.start_main_~length~0 : int, ULTIMATE.start_main_~nondetString~0.offset : int :: ((0 == unknown-#memory_int-unknown[src][ULTIMATE.start_main_~length~0 + ULTIMATE.start_main_~nondetString~0.offset + -1] && src <= ULTIMATE.start_main_~nondetString~0.offset) && 1 <= ULTIMATE.start_main_~length~0) && ULTIMATE.start_main_~length~0 + ULTIMATE.start_main_~nondetString~0.offset <= unknown-#length-unknown[src])) && (\exists ULTIMATE.start_main_~length~0 : int, ULTIMATE.start_main_~nondetString~0.offset : int :: ((src <= ULTIMATE.start_main_~nondetString~0.offset && ULTIMATE.start_main_~length~0 + ULTIMATE.start_main_~nondetString~0.offset <= unknown-#length-unknown[src]) && 1 <= ULTIMATE.start_main_~length~0) && 0 == unknown-#memory_int-unknown[src][ULTIMATE.start_main_~length~0 + ULTIMATE.start_main_~nondetString~0.offset + -1])) && 1 <= n) && 1 == \valid[d]) || ((((((((((((((((((((((((((((((((((((1 == \valid[src] && length == unknown-#length-unknown[nondetString]) && dst == 0) && 1 == \valid[s]) && 1 <= unknown-#StackHeapBarrier-unknown) && 1 <= \old(n)) && 1 == \valid[dst]) && \valid[nondetArea] == 1) && 0 == unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + -1]) && 0 == src) && nondetString + 1 <= unknown-#length-unknown[nondetString]) && 0 == src) && 1 == \valid[nondetString]) && !(dst == s)) && 1 <= unknown-#length-unknown[src]) && 0 == nondetArea) && 1 <= unknown-#length-unknown[src]) && 0 == nondetString) && !(nondetString == nondetArea)) && n == unknown-#length-unknown[nondetArea]) && 8 == unknown-#length-unknown[dst]) && !(dst == d)) && 1 <= n) && 1 == \valid[dst]) && !(dst == dst)) && n + d <= unknown-#length-unknown[d]) && 1 == \valid[src]) && s + 1 <= unknown-#length-unknown[s]) && !(src == dst)) && 1 <= s) && dst == 0) && !(src == dst)) && ((8 == unknown-#length-unknown[dst] && dst == dst) || \old(n) <= unknown-#length-unknown[dst])) && 1 <= d) && !(d == s)) && 1 == \valid[d]) && 1 <= n) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 42 locations, 20 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 100.2s, OverallIterations: 36, TraceHistogramMax: 9, AutomataDifference: 70.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 329 SDtfs, 3976 SDslu, 4969 SDs, 0 SdLazy, 14303 SolverSat, 2078 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1324 GetRequests, 353 SyntacticMatches, 3 SemanticMatches, 968 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16440 ImplicationChecksByTransitivity, 69.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=114occurred in iteration=30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 36 MinimizatonAttempts, 129 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 35 NumberOfFragments, 604 HoareAnnotationTreeSize, 2 FomulaSimplifications, 543512 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 2 FomulaSimplificationsInter, 47710 FormulaSimplificationTreeSizeReductionInter, 3.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 22.7s InterpolantComputationTime, 1286 NumberOfCodeBlocks, 1285 NumberOfCodeBlocksAsserted, 74 NumberOfCheckSat, 1235 ConstructedInterpolants, 346 QuantifiedInterpolants, 831557 SizeOfPredicates, 323 NumberOfNonLiveVariables, 3563 ConjunctsInSsa, 865 ConjunctsInUnsatCore, 51 InterpolantComputations, 21 PerfectInterpolantSequences, 355/1572 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: unknown kind of automaton de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: unknown kind of automaton: de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. !SESSION 2020-07-01 12:38:04.653 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp/BenchExec_run_94YMr0/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 12:39:54.476 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check