./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/diff-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/array-memsafety/diff-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4654dbed0e523ad65784c661074162c44d8abe4e ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 03:53:05,030 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 03:53:05,033 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 03:53:05,047 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 03:53:05,047 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 03:53:05,049 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 03:53:05,050 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 03:53:05,052 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 03:53:05,054 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 03:53:05,056 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 03:53:05,057 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 03:53:05,058 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 03:53:05,059 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 03:53:05,060 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 03:53:05,061 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 03:53:05,062 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 03:53:05,064 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 03:53:05,065 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 03:53:05,067 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 03:53:05,069 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 03:53:05,071 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 03:53:05,072 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 03:53:05,073 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 03:53:05,074 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 03:53:05,077 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 03:53:05,077 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 03:53:05,077 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 03:53:05,079 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 03:53:05,079 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 03:53:05,080 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 03:53:05,080 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 03:53:05,081 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 03:53:05,082 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 03:53:05,083 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 03:53:05,084 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 03:53:05,085 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 03:53:05,085 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 03:53:05,086 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 03:53:05,086 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 03:53:05,087 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 03:53:05,088 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 03:53:05,089 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-28 03:53:05,106 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 03:53:05,107 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 03:53:05,108 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 03:53:05,108 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 03:53:05,109 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 03:53:05,109 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 03:53:05,109 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 03:53:05,110 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 03:53:05,110 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 03:53:05,110 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 03:53:05,110 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 03:53:05,111 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 03:53:05,111 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 03:53:05,111 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 03:53:05,112 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 03:53:05,112 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 03:53:05,112 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 03:53:05,112 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 03:53:05,113 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 03:53:05,113 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 03:53:05,113 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 03:53:05,114 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 03:53:05,114 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 03:53:05,114 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 03:53:05,114 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 03:53:05,115 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 03:53:05,115 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 03:53:05,115 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 03:53:05,116 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 03:53:05,116 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 03:53:05,116 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 03:53:05,117 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 03:53:05,118 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4654dbed0e523ad65784c661074162c44d8abe4e [2019-11-28 03:53:05,436 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 03:53:05,450 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 03:53:05,454 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 03:53:05,456 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 03:53:05,457 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 03:53:05,457 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/diff-alloca-2.i [2019-11-28 03:53:05,537 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b9e1d79f/43d5efcd5024437eba0d5f56e643c0e9/FLAG499472bf4 [2019-11-28 03:53:06,116 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 03:53:06,116 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/diff-alloca-2.i [2019-11-28 03:53:06,150 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b9e1d79f/43d5efcd5024437eba0d5f56e643c0e9/FLAG499472bf4 [2019-11-28 03:53:06,382 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b9e1d79f/43d5efcd5024437eba0d5f56e643c0e9 [2019-11-28 03:53:06,386 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 03:53:06,388 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 03:53:06,390 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 03:53:06,392 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 03:53:06,396 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 03:53:06,397 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:53:06" (1/1) ... [2019-11-28 03:53:06,400 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3262172a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:53:06, skipping insertion in model container [2019-11-28 03:53:06,400 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:53:06" (1/1) ... [2019-11-28 03:53:06,409 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 03:53:06,473 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 03:53:06,857 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:53:06,873 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 03:53:06,976 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:53:07,047 INFO L208 MainTranslator]: Completed translation [2019-11-28 03:53:07,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:53:07 WrapperNode [2019-11-28 03:53:07,048 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 03:53:07,050 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 03:53:07,050 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 03:53:07,050 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 03:53:07,059 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:53:07" (1/1) ... [2019-11-28 03:53:07,086 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:53:07" (1/1) ... [2019-11-28 03:53:07,128 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 03:53:07,129 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 03:53:07,130 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 03:53:07,130 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 03:53:07,141 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:53:07" (1/1) ... [2019-11-28 03:53:07,141 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:53:07" (1/1) ... [2019-11-28 03:53:07,159 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:53:07" (1/1) ... [2019-11-28 03:53:07,162 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:53:07" (1/1) ... [2019-11-28 03:53:07,175 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:53:07" (1/1) ... [2019-11-28 03:53:07,186 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:53:07" (1/1) ... [2019-11-28 03:53:07,190 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:53:07" (1/1) ... [2019-11-28 03:53:07,197 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 03:53:07,200 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 03:53:07,201 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 03:53:07,201 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 03:53:07,206 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:53:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:07,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 03:53:07,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 03:53:07,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 03:53:07,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 03:53:07,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 03:53:07,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 03:53:07,687 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 03:53:07,688 INFO L297 CfgBuilder]: Removed 10 assume(true) statements. [2019-11-28 03:53:07,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:53:07 BoogieIcfgContainer [2019-11-28 03:53:07,689 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 03:53:07,690 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 03:53:07,690 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 03:53:07,694 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 03:53:07,695 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:53:07,696 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 03:53:06" (1/3) ... [2019-11-28 03:53:07,697 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4f26e281 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:53:07, skipping insertion in model container [2019-11-28 03:53:07,697 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:53:07,698 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:53:07" (2/3) ... [2019-11-28 03:53:07,699 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4f26e281 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:53:07, skipping insertion in model container [2019-11-28 03:53:07,699 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:53:07,700 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:53:07" (3/3) ... [2019-11-28 03:53:07,703 INFO L371 chiAutomizerObserver]: Analyzing ICFG diff-alloca-2.i [2019-11-28 03:53:07,745 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 03:53:07,745 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 03:53:07,745 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 03:53:07,745 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 03:53:07,745 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 03:53:07,746 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 03:53:07,746 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 03:53:07,746 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 03:53:07,760 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2019-11-28 03:53:07,782 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-28 03:53:07,783 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:53:07,783 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:53:07,790 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 03:53:07,790 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:53:07,790 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 03:53:07,791 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2019-11-28 03:53:07,793 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-28 03:53:07,793 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:53:07,793 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:53:07,794 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 03:53:07,794 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:53:07,800 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 9#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~i~1, main_#t~nondet16, main_#t~post15, main_~i~2, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 18#L539true assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 3#L539-2true assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 14#L542-1true call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~i~1 := 0; 5#L549-3true [2019-11-28 03:53:07,800 INFO L796 eck$LassoCheckResult]: Loop: 5#L549-3true assume !!(main_~i~1 < main_~Alen~0);call write~int(main_#t~nondet14, main_~A~0.base, main_~A~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet14; 4#L549-2true main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 5#L549-3true [2019-11-28 03:53:07,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:07,806 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-11-28 03:53:07,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:07,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418705442] [2019-11-28 03:53:07,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:07,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:07,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:07,969 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:53:07,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:07,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2019-11-28 03:53:07,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:07,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158739588] [2019-11-28 03:53:07,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:08,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:08,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:08,024 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:53:08,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:08,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2019-11-28 03:53:08,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:08,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132334972] [2019-11-28 03:53:08,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:08,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:08,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:08,117 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:53:08,538 WARN L192 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2019-11-28 03:53:08,706 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-11-28 03:53:08,722 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:53:08,723 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:53:08,723 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:53:08,723 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:53:08,724 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:53:08,724 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:08,724 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:53:08,725 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:53:08,725 INFO L133 ssoRankerPreferences]: Filename of dumped script: diff-alloca-2.i_Iteration1_Lasso [2019-11-28 03:53:08,726 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:53:08,726 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:53:08,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:08,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:08,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:08,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:08,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:08,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:08,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:08,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:08,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:08,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:08,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:08,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:08,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:08,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:08,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:09,095 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-11-28 03:53:09,569 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:53:09,575 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:09,589 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:09,592 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:09,592 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:09,593 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:09,594 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:09,594 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:09,596 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:09,597 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:53:09,600 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:09,619 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:09,621 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:09,621 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:09,622 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:09,622 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:09,622 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:09,623 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:09,623 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:09,626 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:09,643 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:09,645 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:09,645 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:09,646 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:09,646 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:09,646 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:09,647 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:09,647 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:09,650 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:09,663 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:09,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:09,666 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:09,666 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:09,666 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:09,670 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:09,671 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:53:09,676 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:09,696 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:09,699 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:09,699 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:09,700 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:09,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:09,703 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:09,703 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:53:09,709 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:09,720 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:09,722 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:09,722 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:09,723 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:09,723 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:09,734 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:09,735 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:09,743 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:09,758 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:09,761 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:09,761 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:09,762 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:09,762 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:09,762 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:09,763 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:09,763 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:09,766 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:09,792 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:09,794 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:09,795 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:09,795 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:09,795 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:09,807 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:09,807 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:09,818 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:09,837 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:09,840 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:09,841 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:09,841 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:09,841 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:09,847 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:09,848 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:09,856 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:09,874 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:09,877 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:09,877 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:09,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:09,877 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:09,878 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:09,878 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:09,879 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:09,881 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:09,891 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:09,894 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:09,894 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:09,894 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:09,895 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:09,897 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:09,898 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:53:09,903 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:09,922 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:09,924 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:09,924 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:09,924 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:09,924 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:09,926 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:09,927 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:53:09,931 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:09,941 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:09,943 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:09,943 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:09,943 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:09,943 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:09,944 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:09,945 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:09,945 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:53:09,947 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:09,960 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:09,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:09,962 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:09,962 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:09,963 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:09,963 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:09,964 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:09,964 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:53:09,966 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:09,984 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:09,986 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:09,987 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:09,987 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:09,987 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:09,992 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:09,992 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:10,000 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:10,012 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:10,015 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:10,015 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:10,016 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:10,016 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:10,024 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:10,025 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:53:10,043 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:53:10,188 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2019-11-28 03:53:10,188 INFO L444 ModelExtractionUtils]: 11 out of 25 variables were initially zero. Simplification set additionally 11 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:10,241 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:53:10,245 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 03:53:10,246 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:53:10,247 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, ULTIMATE.start_main_~Alen~0) = -1*ULTIMATE.start_main_~i~1 + 1*ULTIMATE.start_main_~Alen~0 Supporting invariants [] [2019-11-28 03:53:10,291 INFO L297 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2019-11-28 03:53:10,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:10,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:53:10,341 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:53:10,342 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:53:10,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:53:10,357 INFO L255 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 03:53:10,358 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:53:10,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:53:10,393 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 03:53:10,395 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states. Second operand 3 states. [2019-11-28 03:53:10,458 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states.. Second operand 3 states. Result 48 states and 75 transitions. Complement of second has 7 states. [2019-11-28 03:53:10,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 03:53:10,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 03:53:10,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2019-11-28 03:53:10,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-28 03:53:10,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:53:10,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-28 03:53:10,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:53:10,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-28 03:53:10,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:53:10,468 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 75 transitions. [2019-11-28 03:53:10,472 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-28 03:53:10,477 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 17 states and 25 transitions. [2019-11-28 03:53:10,479 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-28 03:53:10,480 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-28 03:53:10,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 25 transitions. [2019-11-28 03:53:10,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:53:10,481 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2019-11-28 03:53:10,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 25 transitions. [2019-11-28 03:53:10,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-28 03:53:10,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 03:53:10,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2019-11-28 03:53:10,514 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2019-11-28 03:53:10,514 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2019-11-28 03:53:10,515 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 03:53:10,516 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 25 transitions. [2019-11-28 03:53:10,522 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-28 03:53:10,523 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:53:10,523 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:53:10,524 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:53:10,524 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:53:10,524 INFO L794 eck$LassoCheckResult]: Stem: 168#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 165#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~i~1, main_#t~nondet16, main_#t~post15, main_~i~2, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 166#L539 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 156#L539-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 157#L542-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~i~1 := 0; 160#L549-3 assume !(main_~i~1 < main_~Alen~0); 161#L549-4 main_~i~2 := 0; 162#L554-3 [2019-11-28 03:53:10,525 INFO L796 eck$LassoCheckResult]: Loop: 162#L554-3 assume !!(main_~i~2 < main_~Blen~0);call write~int(main_#t~nondet16, main_~B~0.base, main_~B~0.offset + 4 * main_~i~2, 4);havoc main_#t~nondet16; 170#L554-2 main_#t~post15 := main_~i~2;main_~i~2 := 1 + main_#t~post15;havoc main_#t~post15; 162#L554-3 [2019-11-28 03:53:10,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:10,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2019-11-28 03:53:10,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:10,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43539747] [2019-11-28 03:53:10,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:10,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:53:10,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:53:10,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43539747] [2019-11-28 03:53:10,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:53:10,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 03:53:10,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40602373] [2019-11-28 03:53:10,665 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:53:10,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:10,666 INFO L82 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2019-11-28 03:53:10,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:10,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168746834] [2019-11-28 03:53:10,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:10,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:10,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:10,696 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:53:10,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:53:10,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 03:53:10,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 03:53:10,734 INFO L87 Difference]: Start difference. First operand 17 states and 25 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-11-28 03:53:10,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:53:10,768 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2019-11-28 03:53:10,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 03:53:10,771 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 25 transitions. [2019-11-28 03:53:10,772 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-28 03:53:10,775 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 25 transitions. [2019-11-28 03:53:10,776 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-11-28 03:53:10,777 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-28 03:53:10,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2019-11-28 03:53:10,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:53:10,779 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-11-28 03:53:10,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2019-11-28 03:53:10,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-11-28 03:53:10,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 03:53:10,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2019-11-28 03:53:10,782 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-11-28 03:53:10,782 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-11-28 03:53:10,782 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 03:53:10,784 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2019-11-28 03:53:10,787 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-28 03:53:10,787 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:53:10,787 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:53:10,789 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:53:10,789 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:53:10,790 INFO L794 eck$LassoCheckResult]: Stem: 210#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 207#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~i~1, main_#t~nondet16, main_#t~post15, main_~i~2, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 208#L539 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 198#L539-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 199#L542-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~i~1 := 0; 202#L549-3 assume !!(main_~i~1 < main_~Alen~0);call write~int(main_#t~nondet14, main_~A~0.base, main_~A~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet14; 200#L549-2 main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 201#L549-3 assume !(main_~i~1 < main_~Alen~0); 203#L549-4 main_~i~2 := 0; 204#L554-3 [2019-11-28 03:53:10,790 INFO L796 eck$LassoCheckResult]: Loop: 204#L554-3 assume !!(main_~i~2 < main_~Blen~0);call write~int(main_#t~nondet16, main_~B~0.base, main_~B~0.offset + 4 * main_~i~2, 4);havoc main_#t~nondet16; 211#L554-2 main_#t~post15 := main_~i~2;main_~i~2 := 1 + main_#t~post15;havoc main_#t~post15; 204#L554-3 [2019-11-28 03:53:10,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:10,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1298440016, now seen corresponding path program 1 times [2019-11-28 03:53:10,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:10,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853343948] [2019-11-28 03:53:10,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:10,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:10,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:10,857 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:53:10,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:10,858 INFO L82 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 2 times [2019-11-28 03:53:10,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:10,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913107727] [2019-11-28 03:53:10,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:10,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:10,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:10,882 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:53:10,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:10,885 INFO L82 PathProgramCache]: Analyzing trace with hash -2034626574, now seen corresponding path program 1 times [2019-11-28 03:53:10,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:10,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643338996] [2019-11-28 03:53:10,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:10,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:10,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:10,968 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:53:11,343 WARN L192 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 90 [2019-11-28 03:53:11,490 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-11-28 03:53:11,493 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:53:11,493 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:53:11,493 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:53:11,493 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:53:11,493 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:53:11,493 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:11,494 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:53:11,494 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:53:11,494 INFO L133 ssoRankerPreferences]: Filename of dumped script: diff-alloca-2.i_Iteration3_Lasso [2019-11-28 03:53:11,494 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:53:11,494 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:53:11,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:11,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:11,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:11,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:11,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:11,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:11,778 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-11-28 03:53:11,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:11,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:11,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:11,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:11,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:11,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:11,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:11,984 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-11-28 03:53:12,282 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:53:12,283 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:12,298 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:12,302 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:12,302 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:12,303 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:12,303 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:12,303 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:12,304 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:12,304 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:12,306 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:12,322 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:12,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:12,323 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:12,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:12,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:12,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:12,325 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:12,325 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:12,327 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:12,349 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:12,351 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:12,351 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:12,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:12,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:12,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:12,352 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:12,352 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:53:12,354 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:12,368 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:12,370 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:12,370 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:12,370 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:12,370 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:12,372 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:12,372 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:53:12,376 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:12,385 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:12,387 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:12,387 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:12,387 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:12,387 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:12,389 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:12,390 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:12,397 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:12,411 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:12,413 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:12,413 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:12,413 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:12,414 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:12,416 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:12,416 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:12,420 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:12,428 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:12,429 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:12,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:12,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:12,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:12,433 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:12,433 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:53:12,440 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:12,448 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:12,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:12,451 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:12,451 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:12,451 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:12,467 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:12,468 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:12,490 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:53:12,543 INFO L443 ModelExtractionUtils]: Simplification made 17 calls to the SMT solver. [2019-11-28 03:53:12,543 INFO L444 ModelExtractionUtils]: 22 out of 40 variables were initially zero. Simplification set additionally 13 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:12,553 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:53:12,555 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-28 03:53:12,555 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:53:12,555 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_2, ULTIMATE.start_main_~i~2) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_2 - 2*ULTIMATE.start_main_~i~2 Supporting invariants [1*v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_2 - 2*ULTIMATE.start_main_~Blen~0 >= 0] [2019-11-28 03:53:12,619 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2019-11-28 03:53:12,623 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 03:53:12,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:12,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:53:12,681 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 03:53:12,682 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:53:12,727 INFO L404 ElimStorePlain]: Different costs {0=[|v_#length_77|], 2=[|v_#valid_100|]} [2019-11-28 03:53:12,740 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:53:12,741 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:53:12,772 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:53:12,773 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 18 treesize of output 38 [2019-11-28 03:53:12,774 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:53:12,814 INFO L588 ElimStorePlain]: treesize reduction 12, result has 77.4 percent of original size [2019-11-28 03:53:12,826 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 12 [2019-11-28 03:53:12,827 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 03:53:12,854 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:53:12,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:53:12,865 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 03:53:12,865 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:34, output treesize:45 [2019-11-28 03:53:12,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:53:12,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:53:12,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:53:12,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:53:13,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:53:13,003 INFO L255 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 03:53:13,003 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:53:13,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:53:13,022 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2019-11-28 03:53:13,022 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 10 Second operand 5 states. [2019-11-28 03:53:13,096 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 25 states and 39 transitions. Complement of second has 8 states. [2019-11-28 03:53:13,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 03:53:13,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 03:53:13,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2019-11-28 03:53:13,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 9 letters. Loop has 2 letters. [2019-11-28 03:53:13,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:53:13,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 11 letters. Loop has 2 letters. [2019-11-28 03:53:13,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:53:13,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 9 letters. Loop has 4 letters. [2019-11-28 03:53:13,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:53:13,100 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 39 transitions. [2019-11-28 03:53:13,102 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 03:53:13,103 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 18 states and 26 transitions. [2019-11-28 03:53:13,103 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-28 03:53:13,103 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-28 03:53:13,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 26 transitions. [2019-11-28 03:53:13,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:53:13,104 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2019-11-28 03:53:13,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 26 transitions. [2019-11-28 03:53:13,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-11-28 03:53:13,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-28 03:53:13,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 26 transitions. [2019-11-28 03:53:13,107 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2019-11-28 03:53:13,107 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2019-11-28 03:53:13,107 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 03:53:13,108 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 26 transitions. [2019-11-28 03:53:13,108 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 03:53:13,108 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:53:13,109 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:53:13,109 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:53:13,110 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 03:53:13,110 INFO L794 eck$LassoCheckResult]: Stem: 379#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 376#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~i~1, main_#t~nondet16, main_#t~post15, main_~i~2, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 377#L539 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 367#L539-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 368#L542-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~i~1 := 0; 371#L549-3 assume !!(main_~i~1 < main_~Alen~0);call write~int(main_#t~nondet14, main_~A~0.base, main_~A~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet14; 369#L549-2 main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 370#L549-3 assume !(main_~i~1 < main_~Alen~0); 372#L549-4 main_~i~2 := 0; 373#L554-3 assume !(main_~i~2 < main_~Blen~0); 383#L554-4 diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 384#L519-2 [2019-11-28 03:53:13,110 INFO L796 eck$LassoCheckResult]: Loop: 384#L519-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 375#L523-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 378#L522-2 assume 0 == diff_~found~0;call diff_#t~mem5 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call write~int(diff_#t~mem5, diff_~D.base, diff_~D.offset + 4 * diff_~k~0, 4);havoc diff_#t~mem5;diff_#t~post6 := diff_~k~0;diff_~k~0 := 1 + diff_#t~post6;havoc diff_#t~post6; 382#L529-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 384#L519-2 [2019-11-28 03:53:13,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:13,111 INFO L82 PathProgramCache]: Analyzing trace with hash -2034626632, now seen corresponding path program 1 times [2019-11-28 03:53:13,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:13,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636370920] [2019-11-28 03:53:13,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:13,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:53:13,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 03:53:13,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636370920] [2019-11-28 03:53:13,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:53:13,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 03:53:13,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991706794] [2019-11-28 03:53:13,168 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:53:13,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:13,169 INFO L82 PathProgramCache]: Analyzing trace with hash 2531692, now seen corresponding path program 1 times [2019-11-28 03:53:13,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:13,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000330420] [2019-11-28 03:53:13,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:13,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:13,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:13,181 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:53:13,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:53:13,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 03:53:13,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 03:53:13,309 INFO L87 Difference]: Start difference. First operand 18 states and 26 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-11-28 03:53:13,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:53:13,340 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2019-11-28 03:53:13,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 03:53:13,340 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2019-11-28 03:53:13,342 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 03:53:13,342 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 26 transitions. [2019-11-28 03:53:13,343 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-28 03:53:13,343 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-28 03:53:13,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2019-11-28 03:53:13,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:53:13,343 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-11-28 03:53:13,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2019-11-28 03:53:13,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-11-28 03:53:13,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-28 03:53:13,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2019-11-28 03:53:13,346 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-11-28 03:53:13,346 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-11-28 03:53:13,346 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 03:53:13,346 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2019-11-28 03:53:13,346 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 03:53:13,347 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:53:13,347 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:53:13,347 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:53:13,347 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 03:53:13,348 INFO L794 eck$LassoCheckResult]: Stem: 423#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 420#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~i~1, main_#t~nondet16, main_#t~post15, main_~i~2, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 421#L539 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 411#L539-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 412#L542-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~i~1 := 0; 415#L549-3 assume !!(main_~i~1 < main_~Alen~0);call write~int(main_#t~nondet14, main_~A~0.base, main_~A~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet14; 413#L549-2 main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 414#L549-3 assume !(main_~i~1 < main_~Alen~0); 416#L549-4 main_~i~2 := 0; 417#L554-3 assume !!(main_~i~2 < main_~Blen~0);call write~int(main_#t~nondet16, main_~B~0.base, main_~B~0.offset + 4 * main_~i~2, 4);havoc main_#t~nondet16; 424#L554-2 main_#t~post15 := main_~i~2;main_~i~2 := 1 + main_#t~post15;havoc main_#t~post15; 425#L554-3 assume !(main_~i~2 < main_~Blen~0); 427#L554-4 diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 428#L519-2 [2019-11-28 03:53:13,348 INFO L796 eck$LassoCheckResult]: Loop: 428#L519-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 419#L523-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 422#L522-2 assume 0 == diff_~found~0;call diff_#t~mem5 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call write~int(diff_#t~mem5, diff_~D.base, diff_~D.offset + 4 * diff_~k~0, 4);havoc diff_#t~mem5;diff_#t~post6 := diff_~k~0;diff_~k~0 := 1 + diff_#t~post6;havoc diff_#t~post6; 426#L529-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 428#L519-2 [2019-11-28 03:53:13,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:13,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1066016806, now seen corresponding path program 1 times [2019-11-28 03:53:13,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:13,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393265409] [2019-11-28 03:53:13,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:13,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:13,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:13,385 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:53:13,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:13,385 INFO L82 PathProgramCache]: Analyzing trace with hash 2531692, now seen corresponding path program 2 times [2019-11-28 03:53:13,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:13,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836695295] [2019-11-28 03:53:13,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:13,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:13,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:13,397 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:53:13,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:13,398 INFO L82 PathProgramCache]: Analyzing trace with hash -796463931, now seen corresponding path program 1 times [2019-11-28 03:53:13,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:13,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156689343] [2019-11-28 03:53:13,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:13,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:53:13,476 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 03:53:13,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156689343] [2019-11-28 03:53:13,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:53:13,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 03:53:13,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039407482] [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Exception during sending of exit command (exit): Broken pipe [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Exception during sending of exit command (exit): Broken pipe [2019-11-28 03:53:13,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:53:13,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 03:53:13,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 03:53:13,635 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. cyclomatic complexity: 10 Second operand 5 states. [2019-11-28 03:53:13,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:53:13,711 INFO L93 Difference]: Finished difference Result 20 states and 28 transitions. [2019-11-28 03:53:13,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 03:53:13,712 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 28 transitions. [2019-11-28 03:53:13,713 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 03:53:13,720 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 28 transitions. [2019-11-28 03:53:13,722 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-28 03:53:13,722 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-11-28 03:53:13,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 28 transitions. [2019-11-28 03:53:13,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:53:13,725 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2019-11-28 03:53:13,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 28 transitions. [2019-11-28 03:53:13,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-11-28 03:53:13,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-28 03:53:13,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2019-11-28 03:53:13,730 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-11-28 03:53:13,732 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-11-28 03:53:13,732 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 03:53:13,732 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2019-11-28 03:53:13,733 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-28 03:53:13,735 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:53:13,735 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:53:13,736 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:53:13,736 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-28 03:53:13,736 INFO L794 eck$LassoCheckResult]: Stem: 475#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 472#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~i~1, main_#t~nondet16, main_#t~post15, main_~i~2, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 473#L539 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 463#L539-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 464#L542-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~i~1 := 0; 467#L549-3 assume !!(main_~i~1 < main_~Alen~0);call write~int(main_#t~nondet14, main_~A~0.base, main_~A~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet14; 465#L549-2 main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 466#L549-3 assume !(main_~i~1 < main_~Alen~0); 468#L549-4 main_~i~2 := 0; 469#L554-3 assume !!(main_~i~2 < main_~Blen~0);call write~int(main_#t~nondet16, main_~B~0.base, main_~B~0.offset + 4 * main_~i~2, 4);havoc main_#t~nondet16; 476#L554-2 main_#t~post15 := main_~i~2;main_~i~2 := 1 + main_#t~post15;havoc main_#t~post15; 477#L554-3 assume !(main_~i~2 < main_~Blen~0); 480#L554-4 diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 481#L519-2 [2019-11-28 03:53:13,738 INFO L796 eck$LassoCheckResult]: Loop: 481#L519-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 474#L523-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 470#L523 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem3;havoc diff_#t~mem2;diff_~found~0 := 1; 471#L523-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 478#L522-2 assume 0 == diff_~found~0;call diff_#t~mem5 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call write~int(diff_#t~mem5, diff_~D.base, diff_~D.offset + 4 * diff_~k~0, 4);havoc diff_#t~mem5;diff_#t~post6 := diff_~k~0;diff_~k~0 := 1 + diff_#t~post6;havoc diff_#t~post6; 479#L529-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 481#L519-2 [2019-11-28 03:53:13,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:13,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1066016806, now seen corresponding path program 2 times [2019-11-28 03:53:13,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:13,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812844461] [2019-11-28 03:53:13,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:13,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:13,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:13,805 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:53:13,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:13,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1860447319, now seen corresponding path program 1 times [2019-11-28 03:53:13,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:13,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697401043] [2019-11-28 03:53:13,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:13,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:53:13,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:53:13,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697401043] [2019-11-28 03:53:13,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:53:13,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 03:53:13,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015264032] [2019-11-28 03:53:13,845 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:53:13,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:53:13,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 03:53:13,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 03:53:13,846 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. cyclomatic complexity: 10 Second operand 4 states. [2019-11-28 03:53:13,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:53:13,875 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2019-11-28 03:53:13,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 03:53:13,876 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 32 transitions. [2019-11-28 03:53:13,876 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-11-28 03:53:13,877 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 32 transitions. [2019-11-28 03:53:13,877 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2019-11-28 03:53:13,877 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-11-28 03:53:13,877 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 32 transitions. [2019-11-28 03:53:13,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:53:13,881 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2019-11-28 03:53:13,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 32 transitions. [2019-11-28 03:53:13,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2019-11-28 03:53:13,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-28 03:53:13,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2019-11-28 03:53:13,886 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2019-11-28 03:53:13,886 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2019-11-28 03:53:13,886 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 03:53:13,887 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2019-11-28 03:53:13,887 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-28 03:53:13,888 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:53:13,888 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:53:13,888 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:53:13,889 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-28 03:53:13,889 INFO L794 eck$LassoCheckResult]: Stem: 527#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 524#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~i~1, main_#t~nondet16, main_#t~post15, main_~i~2, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 525#L539 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 514#L539-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 515#L542-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~i~1 := 0; 518#L549-3 assume !!(main_~i~1 < main_~Alen~0);call write~int(main_#t~nondet14, main_~A~0.base, main_~A~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet14; 516#L549-2 main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 517#L549-3 assume !(main_~i~1 < main_~Alen~0); 519#L549-4 main_~i~2 := 0; 520#L554-3 assume !!(main_~i~2 < main_~Blen~0);call write~int(main_#t~nondet16, main_~B~0.base, main_~B~0.offset + 4 * main_~i~2, 4);havoc main_#t~nondet16; 528#L554-2 main_#t~post15 := main_~i~2;main_~i~2 := 1 + main_#t~post15;havoc main_#t~post15; 529#L554-3 assume !(main_~i~2 < main_~Blen~0); 531#L554-4 diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 532#L519-2 [2019-11-28 03:53:13,890 INFO L796 eck$LassoCheckResult]: Loop: 532#L519-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 533#L523-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 521#L523 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem3;havoc diff_#t~mem2;diff_~found~0 := 1; 522#L523-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 526#L522-2 assume !(0 == diff_~found~0); 530#L529-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 532#L519-2 [2019-11-28 03:53:13,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:13,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1066016806, now seen corresponding path program 3 times [2019-11-28 03:53:13,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:13,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253489408] [2019-11-28 03:53:13,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:13,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:13,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:13,942 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:53:13,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:13,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1860447257, now seen corresponding path program 1 times [2019-11-28 03:53:13,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:13,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176544158] [2019-11-28 03:53:13,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:13,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:13,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:13,972 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:53:13,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:13,978 INFO L82 PathProgramCache]: Analyzing trace with hash -896094976, now seen corresponding path program 1 times [2019-11-28 03:53:13,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:13,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728560094] [2019-11-28 03:53:13,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:14,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:14,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:14,056 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:53:14,817 WARN L192 SmtUtils]: Spent 641.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 138 [2019-11-28 03:53:15,038 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-11-28 03:53:15,041 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:53:15,041 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:53:15,041 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:53:15,041 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:53:15,041 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:53:15,041 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:15,041 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:53:15,041 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:53:15,041 INFO L133 ssoRankerPreferences]: Filename of dumped script: diff-alloca-2.i_Iteration7_Lasso [2019-11-28 03:53:15,042 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:53:15,042 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:53:15,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:15,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:15,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:15,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:15,629 WARN L192 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 107 [2019-11-28 03:53:15,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:15,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:15,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:15,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:15,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:15,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:15,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:15,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:15,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:15,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:15,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:15,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:15,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:15,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:15,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:15,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:15,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:15,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:16,115 WARN L192 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 78 [2019-11-28 03:53:16,572 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-11-28 03:53:16,817 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:53:16,818 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:16,833 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:16,836 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:16,836 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:16,836 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:16,837 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:16,837 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:16,841 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:16,841 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:16,848 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:16,856 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:16,858 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:16,858 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:16,858 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:16,858 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:16,860 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:16,860 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:16,864 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:16,871 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:16,874 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:16,874 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:16,874 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:16,875 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:16,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:16,876 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:16,876 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:16,879 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:16,887 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:16,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:16,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:16,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:16,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:16,911 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:16,912 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:53:16,947 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:53:16,969 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-11-28 03:53:16,970 INFO L444 ModelExtractionUtils]: 64 out of 76 variables were initially zero. Simplification set additionally 9 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:16,974 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:53:16,976 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 03:53:16,976 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:53:16,976 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~i~0, ULTIMATE.start_diff_~l1~0) = -1*ULTIMATE.start_diff_~i~0 + 1*ULTIMATE.start_diff_~l1~0 Supporting invariants [] [2019-11-28 03:53:17,047 INFO L297 tatePredicateManager]: 21 out of 21 supporting invariants were superfluous and have been removed [2019-11-28 03:53:17,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:17,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:53:17,080 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:53:17,081 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:53:17,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:53:17,093 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 03:53:17,093 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:53:17,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 03:53:17,103 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 03:53:17,103 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-11-28 03:53:17,122 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 29 states and 40 transitions. Complement of second has 4 states. [2019-11-28 03:53:17,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 03:53:17,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 03:53:17,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2019-11-28 03:53:17,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 13 letters. Loop has 6 letters. [2019-11-28 03:53:17,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:53:17,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 19 letters. Loop has 6 letters. [2019-11-28 03:53:17,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:53:17,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 13 letters. Loop has 12 letters. [2019-11-28 03:53:17,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:53:17,125 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 40 transitions. [2019-11-28 03:53:17,125 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:53:17,126 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 25 states and 34 transitions. [2019-11-28 03:53:17,126 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-28 03:53:17,126 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-28 03:53:17,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2019-11-28 03:53:17,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:53:17,127 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2019-11-28 03:53:17,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2019-11-28 03:53:17,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-11-28 03:53:17,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-28 03:53:17,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2019-11-28 03:53:17,131 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-11-28 03:53:17,131 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-11-28 03:53:17,131 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-28 03:53:17,131 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2019-11-28 03:53:17,131 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:53:17,132 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:53:17,132 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:53:17,132 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:53:17,132 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:53:17,133 INFO L794 eck$LassoCheckResult]: Stem: 740#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 737#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~i~1, main_#t~nondet16, main_#t~post15, main_~i~2, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 738#L539 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 725#L539-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 726#L542-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~i~1 := 0; 729#L549-3 assume !!(main_~i~1 < main_~Alen~0);call write~int(main_#t~nondet14, main_~A~0.base, main_~A~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet14; 727#L549-2 main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 728#L549-3 assume !(main_~i~1 < main_~Alen~0); 730#L549-4 main_~i~2 := 0; 731#L554-3 assume !!(main_~i~2 < main_~Blen~0);call write~int(main_#t~nondet16, main_~B~0.base, main_~B~0.offset + 4 * main_~i~2, 4);havoc main_#t~nondet16; 743#L554-2 main_#t~post15 := main_~i~2;main_~i~2 := 1 + main_#t~post15;havoc main_#t~post15; 744#L554-3 assume !(main_~i~2 < main_~Blen~0); 745#L554-4 diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 746#L519-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 733#L523-2 [2019-11-28 03:53:17,133 INFO L796 eck$LassoCheckResult]: Loop: 733#L523-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 732#L523 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem3;havoc diff_#t~mem2;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 733#L523-2 [2019-11-28 03:53:17,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:17,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1313217434, now seen corresponding path program 1 times [2019-11-28 03:53:17,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:17,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742732823] [2019-11-28 03:53:17,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:17,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:17,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:17,156 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:53:17,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:17,157 INFO L82 PathProgramCache]: Analyzing trace with hash 2918, now seen corresponding path program 1 times [2019-11-28 03:53:17,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:17,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751504688] [2019-11-28 03:53:17,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:17,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:17,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:17,164 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:53:17,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:17,164 INFO L82 PathProgramCache]: Analyzing trace with hash -718428993, now seen corresponding path program 1 times [2019-11-28 03:53:17,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:17,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087093314] [2019-11-28 03:53:17,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:17,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:17,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:17,195 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:53:17,918 WARN L192 SmtUtils]: Spent 664.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 144 [2019-11-28 03:53:18,151 WARN L192 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2019-11-28 03:53:18,153 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:53:18,153 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:53:18,153 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:53:18,153 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:53:18,153 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:53:18,153 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:18,154 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:53:18,154 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:53:18,154 INFO L133 ssoRankerPreferences]: Filename of dumped script: diff-alloca-2.i_Iteration8_Lasso [2019-11-28 03:53:18,154 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:53:18,154 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:53:18,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:18,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:18,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:18,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:18,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:18,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:18,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:18,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:18,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:18,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:18,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:18,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:18,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:18,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:18,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:18,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:18,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:18,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:18,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:18,828 WARN L192 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 120 [2019-11-28 03:53:18,959 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2019-11-28 03:53:18,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:18,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:18,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:19,589 WARN L192 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 90 [2019-11-28 03:53:20,047 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-11-28 03:53:20,106 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:53:20,107 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:20,116 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:20,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:20,118 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:20,118 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:20,119 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:20,120 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:20,121 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:53:20,123 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:20,131 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:20,133 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:20,133 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:20,133 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:20,133 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:20,135 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:20,135 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:53:20,138 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:20,145 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:20,146 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:20,146 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:20,146 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:20,147 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:20,147 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:20,148 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:20,148 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:53:20,150 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:20,156 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:20,158 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:20,158 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:20,158 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:20,158 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:20,159 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:20,159 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:20,159 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:53:20,162 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:20,171 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:20,172 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:20,172 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:20,172 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:20,172 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:20,174 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:20,174 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:53:20,179 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:20,185 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:20,189 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:20,190 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:20,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:20,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:20,190 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:20,192 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:20,192 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:53:20,193 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:20,199 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:20,201 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:20,201 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:20,201 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:20,201 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:20,201 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:20,203 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:20,203 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:53:20,205 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:20,213 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:20,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:20,215 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:20,215 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:20,215 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:20,216 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:20,216 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:53:20,219 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:20,230 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:20,231 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:20,231 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:20,231 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:20,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:20,234 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:20,234 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:53:20,245 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:20,266 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:20,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:20,267 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:20,267 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:20,267 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:20,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:20,268 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:20,268 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:53:20,270 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:20,276 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:20,278 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:20,278 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:20,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:20,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:20,278 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:20,279 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:20,279 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:53:20,281 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:20,286 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:20,288 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:20,288 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:20,288 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:20,288 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:20,288 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:20,288 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:20,288 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:53:20,290 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:20,296 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:20,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:20,297 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:20,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:20,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:20,297 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:20,298 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:20,298 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:53:20,299 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:20,305 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:20,307 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:20,307 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:20,307 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:20,307 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:20,308 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:20,309 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:20,315 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:20,320 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:20,321 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:20,321 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:20,322 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:20,322 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:20,323 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:20,323 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:53:20,327 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:20,332 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:20,334 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:20,334 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:20,334 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:20,334 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:20,334 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:20,334 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:20,334 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:53:20,336 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:20,341 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:20,343 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:20,343 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:20,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:20,344 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:20,344 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:20,344 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:20,344 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:53:20,345 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:20,351 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:20,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:20,353 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:20,353 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:20,353 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:20,353 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:20,353 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:20,353 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:53:20,359 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:20,365 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:20,367 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:20,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:20,367 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:20,367 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:20,373 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:20,373 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:53:20,389 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:20,395 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:20,397 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:20,398 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:20,398 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:20,398 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:20,399 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:20,399 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:53:20,402 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:20,408 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:20,410 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:20,410 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:20,410 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 03:53:20,410 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:20,420 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-11-28 03:53:20,421 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-28 03:53:20,438 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:20,443 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:20,445 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:20,445 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:20,445 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:20,445 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:20,450 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:20,450 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:53:20,455 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:20,460 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:20,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:20,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:20,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:20,461 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:20,462 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:20,462 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:53:20,466 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:20,472 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:20,473 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:20,473 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:20,473 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:20,473 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:20,476 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:20,476 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:53:20,482 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:20,487 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:20,490 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:20,490 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:20,490 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:20,490 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:20,504 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:20,505 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:53:20,536 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:53:20,629 INFO L443 ModelExtractionUtils]: Simplification made 26 calls to the SMT solver. [2019-11-28 03:53:20,629 INFO L444 ModelExtractionUtils]: 15 out of 82 variables were initially zero. Simplification set additionally 64 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:20,634 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:53:20,636 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 03:53:20,637 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:53:20,637 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~j~0, ULTIMATE.start_diff_~l2~0) = -1*ULTIMATE.start_diff_~j~0 + 1*ULTIMATE.start_diff_~l2~0 Supporting invariants [] [2019-11-28 03:53:20,763 INFO L297 tatePredicateManager]: 26 out of 26 supporting invariants were superfluous and have been removed [2019-11-28 03:53:20,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:20,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:53:20,797 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:53:20,798 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:53:20,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:53:20,804 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 03:53:20,805 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:53:20,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:53:20,814 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 03:53:20,814 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 33 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-11-28 03:53:20,842 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 33 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 46 states and 63 transitions. Complement of second has 7 states. [2019-11-28 03:53:20,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 03:53:20,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 03:53:20,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2019-11-28 03:53:20,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 14 letters. Loop has 2 letters. [2019-11-28 03:53:20,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:53:20,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 16 letters. Loop has 2 letters. [2019-11-28 03:53:20,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:53:20,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 14 letters. Loop has 4 letters. [2019-11-28 03:53:20,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:53:20,844 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 63 transitions. [2019-11-28 03:53:20,846 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:53:20,847 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 35 states and 49 transitions. [2019-11-28 03:53:20,847 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-28 03:53:20,847 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-28 03:53:20,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 49 transitions. [2019-11-28 03:53:20,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:53:20,847 INFO L688 BuchiCegarLoop]: Abstraction has 35 states and 49 transitions. [2019-11-28 03:53:20,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 49 transitions. [2019-11-28 03:53:20,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2019-11-28 03:53:20,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-28 03:53:20,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2019-11-28 03:53:20,850 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2019-11-28 03:53:20,850 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2019-11-28 03:53:20,850 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-28 03:53:20,850 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 39 transitions. [2019-11-28 03:53:20,851 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:53:20,851 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:53:20,851 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:53:20,852 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:53:20,852 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:53:20,852 INFO L794 eck$LassoCheckResult]: Stem: 986#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 982#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~i~1, main_#t~nondet16, main_#t~post15, main_~i~2, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 983#L539 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 971#L539-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 972#L542-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~i~1 := 0; 975#L549-3 assume !!(main_~i~1 < main_~Alen~0);call write~int(main_#t~nondet14, main_~A~0.base, main_~A~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet14; 973#L549-2 main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 974#L549-3 assume !(main_~i~1 < main_~Alen~0); 976#L549-4 main_~i~2 := 0; 977#L554-3 assume !!(main_~i~2 < main_~Blen~0);call write~int(main_#t~nondet16, main_~B~0.base, main_~B~0.offset + 4 * main_~i~2, 4);havoc main_#t~nondet16; 988#L554-2 main_#t~post15 := main_~i~2;main_~i~2 := 1 + main_#t~post15;havoc main_#t~post15; 989#L554-3 assume !(main_~i~2 < main_~Blen~0); 990#L554-4 diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 991#L519-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 993#L523-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 980#L523 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem3;havoc diff_#t~mem2;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 981#L523-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 996#L522-2 assume !(0 == diff_~found~0); 987#L529-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 992#L519-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 979#L523-2 [2019-11-28 03:53:20,852 INFO L796 eck$LassoCheckResult]: Loop: 979#L523-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 978#L523 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem3;havoc diff_#t~mem2;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 979#L523-2 [2019-11-28 03:53:20,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:20,853 INFO L82 PathProgramCache]: Analyzing trace with hash -2007293386, now seen corresponding path program 1 times [2019-11-28 03:53:20,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:20,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854869943] [2019-11-28 03:53:20,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:20,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:53:20,885 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-28 03:53:20,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854869943] [2019-11-28 03:53:20,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:53:20,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:53:20,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289906563] [2019-11-28 03:53:20,886 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:53:20,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:20,887 INFO L82 PathProgramCache]: Analyzing trace with hash 2918, now seen corresponding path program 2 times [2019-11-28 03:53:20,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:20,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044934627] [2019-11-28 03:53:20,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:20,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:20,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:20,894 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:53:20,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:53:20,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 03:53:20,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 03:53:20,946 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. cyclomatic complexity: 16 Second operand 3 states. [2019-11-28 03:53:20,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:53:20,960 INFO L93 Difference]: Finished difference Result 30 states and 41 transitions. [2019-11-28 03:53:20,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 03:53:20,963 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 41 transitions. [2019-11-28 03:53:20,964 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:53:20,964 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 41 transitions. [2019-11-28 03:53:20,964 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-28 03:53:20,964 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-28 03:53:20,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 41 transitions. [2019-11-28 03:53:20,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:53:20,965 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 41 transitions. [2019-11-28 03:53:20,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 41 transitions. [2019-11-28 03:53:20,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2019-11-28 03:53:20,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-28 03:53:20,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2019-11-28 03:53:20,969 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 38 transitions. [2019-11-28 03:53:20,970 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 38 transitions. [2019-11-28 03:53:20,970 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-28 03:53:20,970 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 38 transitions. [2019-11-28 03:53:20,970 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:53:20,970 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:53:20,970 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:53:20,971 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:53:20,971 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:53:20,971 INFO L794 eck$LassoCheckResult]: Stem: 1050#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1046#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~i~1, main_#t~nondet16, main_#t~post15, main_~i~2, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 1047#L539 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 1035#L539-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 1036#L542-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~i~1 := 0; 1039#L549-3 assume !!(main_~i~1 < main_~Alen~0);call write~int(main_#t~nondet14, main_~A~0.base, main_~A~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet14; 1037#L549-2 main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 1038#L549-3 assume !(main_~i~1 < main_~Alen~0); 1040#L549-4 main_~i~2 := 0; 1041#L554-3 assume !!(main_~i~2 < main_~Blen~0);call write~int(main_#t~nondet16, main_~B~0.base, main_~B~0.offset + 4 * main_~i~2, 4);havoc main_#t~nondet16; 1053#L554-2 main_#t~post15 := main_~i~2;main_~i~2 := 1 + main_#t~post15;havoc main_#t~post15; 1054#L554-3 assume !(main_~i~2 < main_~Blen~0); 1055#L554-4 diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 1056#L519-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 1058#L523-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 1044#L523 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem3;havoc diff_#t~mem2;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 1045#L523-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 1060#L522-2 assume 0 == diff_~found~0;call diff_#t~mem5 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call write~int(diff_#t~mem5, diff_~D.base, diff_~D.offset + 4 * diff_~k~0, 4);havoc diff_#t~mem5;diff_#t~post6 := diff_~k~0;diff_~k~0 := 1 + diff_#t~post6;havoc diff_#t~post6; 1052#L529-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 1057#L519-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 1043#L523-2 [2019-11-28 03:53:20,971 INFO L796 eck$LassoCheckResult]: Loop: 1043#L523-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 1042#L523 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem3;havoc diff_#t~mem2;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 1043#L523-2 [2019-11-28 03:53:20,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:20,972 INFO L82 PathProgramCache]: Analyzing trace with hash -2007295308, now seen corresponding path program 1 times [2019-11-28 03:53:20,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:20,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806116936] [2019-11-28 03:53:20,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:20,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:53:21,067 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 03:53:21,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806116936] [2019-11-28 03:53:21,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539341786] [2019-11-28 03:53:21,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:53:21,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:53:21,139 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 03:53:21,140 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:53:21,220 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 03:53:21,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:53:21,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 13 [2019-11-28 03:53:21,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259908947] [2019-11-28 03:53:21,222 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:53:21,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:21,222 INFO L82 PathProgramCache]: Analyzing trace with hash 2918, now seen corresponding path program 3 times [2019-11-28 03:53:21,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:21,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144491104] [2019-11-28 03:53:21,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:21,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:21,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:21,238 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:53:21,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:53:21,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 03:53:21,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-11-28 03:53:21,295 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. cyclomatic complexity: 15 Second operand 14 states. [2019-11-28 03:53:21,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:53:21,464 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2019-11-28 03:53:21,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 03:53:21,464 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 67 transitions. [2019-11-28 03:53:21,466 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:53:21,467 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 31 states and 40 transitions. [2019-11-28 03:53:21,467 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-28 03:53:21,467 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-28 03:53:21,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 40 transitions. [2019-11-28 03:53:21,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:53:21,468 INFO L688 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2019-11-28 03:53:21,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 40 transitions. [2019-11-28 03:53:21,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-11-28 03:53:21,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-28 03:53:21,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2019-11-28 03:53:21,470 INFO L711 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2019-11-28 03:53:21,471 INFO L591 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2019-11-28 03:53:21,471 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-28 03:53:21,471 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 39 transitions. [2019-11-28 03:53:21,471 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:53:21,471 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:53:21,472 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:53:21,472 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:53:21,472 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:53:21,473 INFO L794 eck$LassoCheckResult]: Stem: 1212#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1208#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~i~1, main_#t~nondet16, main_#t~post15, main_~i~2, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 1209#L539 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 1196#L539-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 1197#L542-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~i~1 := 0; 1200#L549-3 assume !!(main_~i~1 < main_~Alen~0);call write~int(main_#t~nondet14, main_~A~0.base, main_~A~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet14; 1198#L549-2 main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 1199#L549-3 assume !!(main_~i~1 < main_~Alen~0);call write~int(main_#t~nondet14, main_~A~0.base, main_~A~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet14; 1201#L549-2 main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 1221#L549-3 assume !(main_~i~1 < main_~Alen~0); 1202#L549-4 main_~i~2 := 0; 1203#L554-3 assume !!(main_~i~2 < main_~Blen~0);call write~int(main_#t~nondet16, main_~B~0.base, main_~B~0.offset + 4 * main_~i~2, 4);havoc main_#t~nondet16; 1213#L554-2 main_#t~post15 := main_~i~2;main_~i~2 := 1 + main_#t~post15;havoc main_#t~post15; 1214#L554-3 assume !(main_~i~2 < main_~Blen~0); 1217#L554-4 diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 1218#L519-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 1220#L523-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 1206#L523 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem3;havoc diff_#t~mem2;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 1207#L523-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 1222#L522-2 assume 0 == diff_~found~0;call diff_#t~mem5 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call write~int(diff_#t~mem5, diff_~D.base, diff_~D.offset + 4 * diff_~k~0, 4);havoc diff_#t~mem5;diff_#t~post6 := diff_~k~0;diff_~k~0 := 1 + diff_#t~post6;havoc diff_#t~post6; 1216#L529-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 1219#L519-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 1205#L523-2 [2019-11-28 03:53:21,473 INFO L796 eck$LassoCheckResult]: Loop: 1205#L523-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 1204#L523 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem3;havoc diff_#t~mem2;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 1205#L523-2 [2019-11-28 03:53:21,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:21,473 INFO L82 PathProgramCache]: Analyzing trace with hash 633938194, now seen corresponding path program 2 times [2019-11-28 03:53:21,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:21,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99745482] [2019-11-28 03:53:21,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:21,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:21,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:21,509 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:53:21,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:21,510 INFO L82 PathProgramCache]: Analyzing trace with hash 2918, now seen corresponding path program 4 times [2019-11-28 03:53:21,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:21,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765107706] [2019-11-28 03:53:21,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:21,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:21,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:21,517 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:53:21,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:21,517 INFO L82 PathProgramCache]: Analyzing trace with hash -670749641, now seen corresponding path program 3 times [2019-11-28 03:53:21,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:21,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821339929] [2019-11-28 03:53:21,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:21,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:21,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:21,561 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:53:22,890 WARN L192 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 253 DAG size of output: 196 [2019-11-28 03:53:23,335 WARN L192 SmtUtils]: Spent 436.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-11-28 03:53:23,340 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:53:23,340 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:53:23,340 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:53:23,340 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:53:23,340 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:53:23,340 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:23,340 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:53:23,341 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:53:23,341 INFO L133 ssoRankerPreferences]: Filename of dumped script: diff-alloca-2.i_Iteration11_Lasso [2019-11-28 03:53:23,341 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:53:23,341 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:53:23,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:23,612 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:278) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:612) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:539) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:957) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:865) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:458) 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:316) 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) [2019-11-28 03:53:23,617 INFO L168 Benchmark]: Toolchain (without parser) took 17229.44 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 379.6 MB). Free memory was 960.4 MB in the beginning and 1.2 GB in the end (delta: -193.9 MB). Peak memory consumption was 524.2 MB. Max. memory is 11.5 GB. [2019-11-28 03:53:23,617 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:53:23,618 INFO L168 Benchmark]: CACSL2BoogieTranslator took 659.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -158.4 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. [2019-11-28 03:53:23,620 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 03:53:23,621 INFO L168 Benchmark]: Boogie Preprocessor took 70.40 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:53:23,626 INFO L168 Benchmark]: RCFGBuilder took 489.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. [2019-11-28 03:53:23,627 INFO L168 Benchmark]: BuchiAutomizer took 15924.79 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 242.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -66.5 MB). Peak memory consumption was 514.2 MB. Max. memory is 11.5 GB. [2019-11-28 03:53:23,630 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 659.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -158.4 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 78.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 70.40 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 489.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 15924.79 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 242.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -66.5 MB). Peak memory consumption was 514.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...