./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/array-memsafety/diff-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: 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 /storage/repos/svcomp/c/array-memsafety/diff-alloca_true-valid-memsafety_true-termination.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 986c31897144a5b76f321e97eaa1d3383cce25ed ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-29 00:11:04,488 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-29 00:11:04,489 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-29 00:11:04,501 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-29 00:11:04,502 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-29 00:11:04,503 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-29 00:11:04,504 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-29 00:11:04,506 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-29 00:11:04,508 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-29 00:11:04,509 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-29 00:11:04,511 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-29 00:11:04,512 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-29 00:11:04,513 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-29 00:11:04,514 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-29 00:11:04,515 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-29 00:11:04,519 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-29 00:11:04,519 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-29 00:11:04,521 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-29 00:11:04,526 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-29 00:11:04,527 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-29 00:11:04,528 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-29 00:11:04,532 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-29 00:11:04,538 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-29 00:11:04,539 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-29 00:11:04,539 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-29 00:11:04,540 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-29 00:11:04,541 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-29 00:11:04,542 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-29 00:11:04,542 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-29 00:11:04,543 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-29 00:11:04,544 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-29 00:11:04,545 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-29 00:11:04,545 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-29 00:11:04,545 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-29 00:11:04,546 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-29 00:11:04,547 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-29 00:11:04,547 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-29 00:11:04,564 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-29 00:11:04,564 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-29 00:11:04,565 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-29 00:11:04,565 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-29 00:11:04,565 INFO L133 SettingsManager]: * Use SBE=true [2018-11-29 00:11:04,566 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-29 00:11:04,566 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-29 00:11:04,566 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-29 00:11:04,566 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-29 00:11:04,566 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-29 00:11:04,567 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-29 00:11:04,568 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-29 00:11:04,568 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-29 00:11:04,568 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-29 00:11:04,568 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-29 00:11:04,568 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-29 00:11:04,569 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-29 00:11:04,569 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-29 00:11:04,569 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-29 00:11:04,569 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-29 00:11:04,570 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-29 00:11:04,570 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-29 00:11:04,570 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-29 00:11:04,570 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-29 00:11:04,570 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-29 00:11:04,570 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-29 00:11:04,571 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-29 00:11:04,571 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-29 00:11:04,571 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-29 00:11:04,571 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-29 00:11:04,571 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-29 00:11:04,573 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-29 00:11:04,574 INFO L133 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 -> 986c31897144a5b76f321e97eaa1d3383cce25ed [2018-11-29 00:11:04,611 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-29 00:11:04,623 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-29 00:11:04,627 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-29 00:11:04,628 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-29 00:11:04,629 INFO L276 PluginConnector]: CDTParser initialized [2018-11-29 00:11:04,629 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/diff-alloca_true-valid-memsafety_true-termination.i [2018-11-29 00:11:04,705 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/627ed5e2d/58764f2b626d40b9858e7bc5cecd9f10/FLAG45942dfa3 [2018-11-29 00:11:05,216 INFO L307 CDTParser]: Found 1 translation units. [2018-11-29 00:11:05,217 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/diff-alloca_true-valid-memsafety_true-termination.i [2018-11-29 00:11:05,230 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/627ed5e2d/58764f2b626d40b9858e7bc5cecd9f10/FLAG45942dfa3 [2018-11-29 00:11:05,520 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/627ed5e2d/58764f2b626d40b9858e7bc5cecd9f10 [2018-11-29 00:11:05,524 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-29 00:11:05,529 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-29 00:11:05,530 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-29 00:11:05,530 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-29 00:11:05,535 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-29 00:11:05,536 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:11:05" (1/1) ... [2018-11-29 00:11:05,541 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6272bb4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:05, skipping insertion in model container [2018-11-29 00:11:05,542 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:11:05" (1/1) ... [2018-11-29 00:11:05,550 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-29 00:11:05,613 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-29 00:11:06,012 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:11:06,029 INFO L191 MainTranslator]: Completed pre-run [2018-11-29 00:11:06,109 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:11:06,171 INFO L195 MainTranslator]: Completed translation [2018-11-29 00:11:06,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:06 WrapperNode [2018-11-29 00:11:06,172 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-29 00:11:06,173 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-29 00:11:06,173 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-29 00:11:06,174 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-29 00:11:06,261 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:06" (1/1) ... [2018-11-29 00:11:06,285 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:06" (1/1) ... [2018-11-29 00:11:06,320 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-29 00:11:06,320 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-29 00:11:06,320 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-29 00:11:06,320 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-29 00:11:06,332 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:06" (1/1) ... [2018-11-29 00:11:06,332 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:06" (1/1) ... [2018-11-29 00:11:06,338 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:06" (1/1) ... [2018-11-29 00:11:06,338 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:06" (1/1) ... [2018-11-29 00:11:06,357 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:06" (1/1) ... [2018-11-29 00:11:06,365 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:06" (1/1) ... [2018-11-29 00:11:06,369 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:06" (1/1) ... [2018-11-29 00:11:06,376 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-29 00:11:06,376 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-29 00:11:06,376 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-29 00:11:06,379 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-29 00:11:06,380 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:06" (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 [2018-11-29 00:11:06,452 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-29 00:11:06,453 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-29 00:11:06,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-29 00:11:06,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-29 00:11:06,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-29 00:11:06,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-29 00:11:07,009 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-29 00:11:07,009 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-29 00:11:07,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:11:07 BoogieIcfgContainer [2018-11-29 00:11:07,011 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-29 00:11:07,012 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-29 00:11:07,012 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-29 00:11:07,017 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-29 00:11:07,018 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:11:07,018 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 12:11:05" (1/3) ... [2018-11-29 00:11:07,019 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@29eb9958 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:11:07, skipping insertion in model container [2018-11-29 00:11:07,019 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:11:07,021 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:06" (2/3) ... [2018-11-29 00:11:07,021 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@29eb9958 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:11:07, skipping insertion in model container [2018-11-29 00:11:07,021 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:11:07,022 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:11:07" (3/3) ... [2018-11-29 00:11:07,025 INFO L375 chiAutomizerObserver]: Analyzing ICFG diff-alloca_true-valid-memsafety_true-termination.i [2018-11-29 00:11:07,095 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-29 00:11:07,096 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-29 00:11:07,096 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-29 00:11:07,096 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-29 00:11:07,097 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-29 00:11:07,097 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-29 00:11:07,097 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-29 00:11:07,097 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-29 00:11:07,097 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-29 00:11:07,111 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-29 00:11:07,133 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-29 00:11:07,133 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:11:07,134 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:11:07,142 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-29 00:11:07,142 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-29 00:11:07,142 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-29 00:11:07,142 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-29 00:11:07,144 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-29 00:11:07,144 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:11:07,144 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:11:07,145 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-29 00:11:07,145 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-29 00:11:07,154 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#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_~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; 5#L567true assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 9#L567-2true assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 4#L570-1true call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(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.alloc(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.alloc(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;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; 7#L547-2true [2018-11-29 00:11:07,155 INFO L796 eck$LassoCheckResult]: Loop: 7#L547-2true assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 16#L551-2true assume !true; 3#L550-2true 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; 6#L557-1true diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 7#L547-2true [2018-11-29 00:11:07,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:07,162 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-11-29 00:11:07,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:07,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:07,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:07,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:07,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:07,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:07,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:07,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:07,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1679350, now seen corresponding path program 1 times [2018-11-29 00:11:07,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:07,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:07,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:07,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:07,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:07,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:07,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:11:07,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:11:07,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-29 00:11:07,371 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:11:07,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-29 00:11:07,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-29 00:11:07,393 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 2 states. [2018-11-29 00:11:07,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:11:07,401 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2018-11-29 00:11:07,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-29 00:11:07,405 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2018-11-29 00:11:07,412 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-29 00:11:07,417 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 15 transitions. [2018-11-29 00:11:07,418 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-29 00:11:07,419 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-29 00:11:07,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 15 transitions. [2018-11-29 00:11:07,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:11:07,420 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2018-11-29 00:11:07,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 15 transitions. [2018-11-29 00:11:07,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-11-29 00:11:07,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-29 00:11:07,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2018-11-29 00:11:07,453 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2018-11-29 00:11:07,453 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2018-11-29 00:11:07,453 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-29 00:11:07,453 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 15 transitions. [2018-11-29 00:11:07,454 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-29 00:11:07,454 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:11:07,454 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:11:07,454 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-29 00:11:07,454 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-29 00:11:07,455 INFO L794 eck$LassoCheckResult]: Stem: 42#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 38#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_~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; 39#L567 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 43#L567-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 40#L570-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(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.alloc(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.alloc(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;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; 41#L547-2 [2018-11-29 00:11:07,455 INFO L796 eck$LassoCheckResult]: Loop: 41#L547-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 45#L551-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 36#L550-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; 37#L557-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 41#L547-2 [2018-11-29 00:11:07,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:07,455 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2018-11-29 00:11:07,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:07,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:07,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:07,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:07,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:07,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:07,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:07,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:07,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1669740, now seen corresponding path program 1 times [2018-11-29 00:11:07,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:07,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:07,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:07,514 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:11:07,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:07,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:07,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:07,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:07,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1298476337, now seen corresponding path program 1 times [2018-11-29 00:11:07,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:07,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:07,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:07,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:07,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:07,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:07,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:11:07,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:11:07,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-29 00:11:08,028 WARN L180 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2018-11-29 00:11:08,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-29 00:11:08,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-29 00:11:08,099 INFO L87 Difference]: Start difference. First operand 10 states and 15 transitions. cyclomatic complexity: 6 Second operand 5 states. [2018-11-29 00:11:08,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:11:08,228 INFO L93 Difference]: Finished difference Result 12 states and 18 transitions. [2018-11-29 00:11:08,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-29 00:11:08,229 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 18 transitions. [2018-11-29 00:11:08,230 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-29 00:11:08,232 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 18 transitions. [2018-11-29 00:11:08,233 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-29 00:11:08,233 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-29 00:11:08,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 18 transitions. [2018-11-29 00:11:08,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:11:08,234 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 18 transitions. [2018-11-29 00:11:08,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 18 transitions. [2018-11-29 00:11:08,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-11-29 00:11:08,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-29 00:11:08,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2018-11-29 00:11:08,237 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2018-11-29 00:11:08,237 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2018-11-29 00:11:08,237 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-29 00:11:08,237 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 16 transitions. [2018-11-29 00:11:08,238 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-29 00:11:08,238 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:11:08,238 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:11:08,239 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-29 00:11:08,239 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-29 00:11:08,239 INFO L794 eck$LassoCheckResult]: Stem: 78#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 74#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_~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; 75#L567 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 81#L567-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 76#L570-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(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.alloc(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.alloc(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;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; 77#L547-2 [2018-11-29 00:11:08,239 INFO L796 eck$LassoCheckResult]: Loop: 77#L547-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 82#L551-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); 79#L551 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem3;havoc diff_#t~mem2;diff_~found~0 := 1; 80#L551-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 72#L550-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; 73#L557-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 77#L547-2 [2018-11-29 00:11:08,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:08,240 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 3 times [2018-11-29 00:11:08,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:08,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:08,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:08,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:08,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:08,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:08,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:08,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:08,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1606183209, now seen corresponding path program 1 times [2018-11-29 00:11:08,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:08,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:08,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:08,277 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:11:08,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:08,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:08,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:11:08,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:11:08,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-29 00:11:08,366 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:11:08,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-29 00:11:08,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-29 00:11:08,366 INFO L87 Difference]: Start difference. First operand 11 states and 16 transitions. cyclomatic complexity: 6 Second operand 4 states. [2018-11-29 00:11:08,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:11:08,452 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2018-11-29 00:11:08,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-29 00:11:08,453 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 22 transitions. [2018-11-29 00:11:08,455 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-29 00:11:08,456 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 22 transitions. [2018-11-29 00:11:08,456 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-29 00:11:08,456 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-29 00:11:08,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2018-11-29 00:11:08,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:11:08,457 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2018-11-29 00:11:08,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2018-11-29 00:11:08,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 13. [2018-11-29 00:11:08,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-29 00:11:08,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2018-11-29 00:11:08,459 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2018-11-29 00:11:08,460 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2018-11-29 00:11:08,460 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-29 00:11:08,460 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2018-11-29 00:11:08,461 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-29 00:11:08,461 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:11:08,461 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:11:08,461 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-29 00:11:08,461 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-29 00:11:08,462 INFO L794 eck$LassoCheckResult]: Stem: 113#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 109#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_~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; 110#L567 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 117#L567-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 111#L570-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(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.alloc(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.alloc(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;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; 112#L547-2 [2018-11-29 00:11:08,462 INFO L796 eck$LassoCheckResult]: Loop: 112#L547-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 118#L551-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); 114#L551 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem3;havoc diff_#t~mem2;diff_~found~0 := 1; 115#L551-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 107#L550-2 assume !(0 == diff_~found~0); 108#L557-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 112#L547-2 [2018-11-29 00:11:08,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:08,462 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 4 times [2018-11-29 00:11:08,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:08,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:08,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:08,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:08,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:08,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:08,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:08,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:08,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1606183271, now seen corresponding path program 1 times [2018-11-29 00:11:08,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:08,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:08,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:08,489 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:11:08,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:08,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:08,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:08,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:08,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1998160148, now seen corresponding path program 1 times [2018-11-29 00:11:08,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:08,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:08,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:08,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:08,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:08,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:08,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:08,976 WARN L180 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2018-11-29 00:11:09,670 WARN L180 SmtUtils]: Spent 629.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2018-11-29 00:11:09,983 WARN L180 SmtUtils]: Spent 307.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2018-11-29 00:11:09,996 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:11:09,997 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:11:09,997 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:11:09,997 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:11:09,997 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:11:09,997 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:11:09,998 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:11:09,998 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:11:09,998 INFO L131 ssoRankerPreferences]: Filename of dumped script: diff-alloca_true-valid-memsafety_true-termination.i_Iteration4_Lasso [2018-11-29 00:11:09,999 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:11:09,999 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:11:10,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:10,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:10,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:10,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:10,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:10,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:10,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:10,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:10,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:10,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:10,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:10,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:10,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:10,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:10,786 WARN L180 SmtUtils]: Spent 525.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 92 [2018-11-29 00:11:10,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:11,193 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-29 00:11:12,051 WARN L180 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-11-29 00:11:12,092 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:11:12,098 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:11:12,101 INFO L122 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 [2018-11-29 00:11:12,103 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:12,103 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:12,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:12,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:12,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:12,106 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:12,107 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:12,109 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:12,109 INFO L122 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 [2018-11-29 00:11:12,110 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:12,110 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:12,110 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:12,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:12,111 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:12,111 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:12,111 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:12,112 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:12,112 INFO L122 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 [2018-11-29 00:11:12,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:12,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:12,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:12,113 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:12,116 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:12,116 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:12,120 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:12,120 INFO L122 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 [2018-11-29 00:11:12,121 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:12,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:12,121 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:12,122 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:12,124 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:12,124 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:12,127 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:12,127 INFO L122 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 [2018-11-29 00:11:12,128 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:12,128 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:12,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:12,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:12,129 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:12,129 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:12,129 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:12,130 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:12,131 INFO L122 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 [2018-11-29 00:11:12,131 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:12,131 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:12,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:12,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:12,134 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:12,134 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:12,136 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:12,137 INFO L122 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 [2018-11-29 00:11:12,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:12,138 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:12,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:12,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:12,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:12,139 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:12,139 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:12,140 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:12,140 INFO L122 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 [2018-11-29 00:11:12,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:12,141 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:12,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:12,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:12,141 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:12,142 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:12,142 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:12,144 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:12,145 INFO L122 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 [2018-11-29 00:11:12,145 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:12,145 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:12,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:12,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:12,146 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:12,146 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:12,146 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:12,147 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:12,148 INFO L122 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 [2018-11-29 00:11:12,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:12,148 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:12,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:12,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:12,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:12,149 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:12,149 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:12,150 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:12,151 INFO L122 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 [2018-11-29 00:11:12,151 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:12,151 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:12,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:12,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:12,152 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:12,152 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:12,152 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:12,153 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:12,153 INFO L122 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 [2018-11-29 00:11:12,154 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:12,154 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:12,154 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:12,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:12,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:12,155 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:12,155 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:12,156 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:12,156 INFO L122 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 [2018-11-29 00:11:12,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:12,157 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:12,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:12,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:12,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:12,158 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:12,158 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:12,159 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:12,159 INFO L122 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 [2018-11-29 00:11:12,160 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:12,160 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-29 00:11:12,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:12,160 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:12,164 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:11:12,164 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:12,181 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:12,182 INFO L122 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 [2018-11-29 00:11:12,182 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:12,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:12,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:12,183 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:12,184 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:12,185 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:12,187 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:12,188 INFO L122 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 [2018-11-29 00:11:12,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:12,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:12,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:12,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:12,190 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:12,190 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:12,194 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:12,195 INFO L122 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 [2018-11-29 00:11:12,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:12,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:12,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:12,196 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:12,198 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:12,198 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:12,215 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:12,215 INFO L122 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 [2018-11-29 00:11:12,216 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:12,216 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-29 00:11:12,216 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:12,216 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:12,225 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:11:12,226 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:12,243 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:12,248 INFO L122 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 [2018-11-29 00:11:12,249 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:12,249 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:12,249 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:12,249 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:12,259 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:12,265 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:12,286 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:12,287 INFO L122 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 [2018-11-29 00:11:12,287 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:12,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:12,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:12,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:12,292 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:12,292 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:12,301 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:12,301 INFO L122 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 [2018-11-29 00:11:12,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:12,302 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-29 00:11:12,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:12,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:12,306 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:11:12,307 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:12,317 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:12,318 INFO L122 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 [2018-11-29 00:11:12,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:12,318 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:12,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:12,320 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:12,321 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:12,321 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:12,321 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:12,324 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:12,324 INFO L122 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 [2018-11-29 00:11:12,325 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:12,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:12,325 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:12,325 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:12,331 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:12,332 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:12,368 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:11:12,442 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-29 00:11:12,444 INFO L444 ModelExtractionUtils]: 28 out of 40 variables were initially zero. Simplification set additionally 8 variables to zero. [2018-11-29 00:11:12,446 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:11:12,452 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-29 00:11:12,454 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:11:12,455 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~i~0, v_rep(select #length ULTIMATE.start_diff_~A.base)_1, ULTIMATE.start_diff_~A.offset) = -4*ULTIMATE.start_diff_~i~0 + 1*v_rep(select #length ULTIMATE.start_diff_~A.base)_1 - 1*ULTIMATE.start_diff_~A.offset Supporting invariants [] [2018-11-29 00:11:12,841 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2018-11-29 00:11:12,862 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-29 00:11:12,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:12,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:12,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:12,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:12,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:13,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:11:13,015 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 [2018-11-29 00:11:13,016 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 18 transitions. cyclomatic complexity: 6 Second operand 4 states. [2018-11-29 00:11:13,070 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 18 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 21 states and 30 transitions. Complement of second has 6 states. [2018-11-29 00:11:13,070 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 [2018-11-29 00:11:13,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-29 00:11:13,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-11-29 00:11:13,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 6 letters. [2018-11-29 00:11:13,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:13,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 11 letters. Loop has 6 letters. [2018-11-29 00:11:13,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:13,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 12 letters. [2018-11-29 00:11:13,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:13,075 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 30 transitions. [2018-11-29 00:11:13,076 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-29 00:11:13,077 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 24 transitions. [2018-11-29 00:11:13,077 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-29 00:11:13,078 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-29 00:11:13,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 24 transitions. [2018-11-29 00:11:13,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:11:13,078 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2018-11-29 00:11:13,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 24 transitions. [2018-11-29 00:11:13,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2018-11-29 00:11:13,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-29 00:11:13,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 23 transitions. [2018-11-29 00:11:13,080 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 23 transitions. [2018-11-29 00:11:13,080 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 23 transitions. [2018-11-29 00:11:13,080 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-29 00:11:13,081 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 23 transitions. [2018-11-29 00:11:13,081 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-29 00:11:13,081 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:11:13,082 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:11:13,082 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-29 00:11:13,082 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-29 00:11:13,082 INFO L794 eck$LassoCheckResult]: Stem: 263#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 257#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_~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; 258#L567 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 264#L567-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 261#L570-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(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.alloc(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.alloc(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;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; 262#L547-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 266#L551-2 [2018-11-29 00:11:13,082 INFO L796 eck$LassoCheckResult]: Loop: 266#L551-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); 265#L551 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; 266#L551-2 [2018-11-29 00:11:13,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:13,083 INFO L82 PathProgramCache]: Analyzing trace with hash 889572242, now seen corresponding path program 1 times [2018-11-29 00:11:13,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:13,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:13,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:13,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:13,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:13,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:13,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:13,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:13,101 INFO L82 PathProgramCache]: Analyzing trace with hash 2022, now seen corresponding path program 1 times [2018-11-29 00:11:13,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:13,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:13,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:13,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:13,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:13,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:13,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:13,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:13,110 INFO L82 PathProgramCache]: Analyzing trace with hash 180433719, now seen corresponding path program 1 times [2018-11-29 00:11:13,110 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:13,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:13,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:13,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:13,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:13,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:13,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:13,451 WARN L180 SmtUtils]: Spent 313.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-11-29 00:11:13,720 WARN L180 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-11-29 00:11:14,134 WARN L180 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2018-11-29 00:11:14,400 WARN L180 SmtUtils]: Spent 262.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2018-11-29 00:11:14,404 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:11:14,404 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:11:14,404 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:11:14,404 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:11:14,404 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:11:14,404 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:11:14,404 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:11:14,404 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:11:14,404 INFO L131 ssoRankerPreferences]: Filename of dumped script: diff-alloca_true-valid-memsafety_true-termination.i_Iteration5_Lasso [2018-11-29 00:11:14,405 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:11:14,405 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:11:14,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:14,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:14,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:14,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:14,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:14,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:14,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:14,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:14,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:14,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:14,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:14,905 WARN L180 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 98 [2018-11-29 00:11:14,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:14,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:14,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:14,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:15,269 WARN L180 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2018-11-29 00:11:15,583 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-29 00:11:15,783 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2018-11-29 00:11:15,957 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:11:15,957 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:11:15,958 INFO L122 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 [2018-11-29 00:11:15,958 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:15,959 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:15,959 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:15,959 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:15,963 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:15,963 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:15,967 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:15,967 INFO L122 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 [2018-11-29 00:11:15,968 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:15,968 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:15,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:15,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:15,968 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:15,969 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:15,969 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:15,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:15,973 INFO L122 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 [2018-11-29 00:11:15,974 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:15,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:15,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:15,974 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:15,975 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:15,975 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:15,979 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:15,980 INFO L122 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 [2018-11-29 00:11:15,980 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:15,982 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:15,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:15,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:15,983 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:15,983 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:15,983 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:15,985 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:15,986 INFO L122 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 [2018-11-29 00:11:15,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:15,986 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:15,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:15,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:15,989 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:15,989 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:15,989 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:15,991 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:15,992 INFO L122 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 [2018-11-29 00:11:15,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:15,993 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:15,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:15,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:15,994 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:15,994 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:15,994 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:15,995 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:15,998 INFO L122 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 [2018-11-29 00:11:15,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:15,999 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:15,999 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:15,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:16,002 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:16,003 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:16,003 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:16,003 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:16,004 INFO L122 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 [2018-11-29 00:11:16,007 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:16,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:16,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:16,007 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:16,008 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:16,008 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:16,012 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:16,012 INFO L122 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 [2018-11-29 00:11:16,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:16,013 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:16,013 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:16,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:16,013 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:16,013 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:16,013 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:16,014 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:16,014 INFO L122 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 [2018-11-29 00:11:16,020 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:16,020 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:16,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:16,021 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:16,021 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:16,021 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:16,021 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:16,022 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:16,022 INFO L122 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 [2018-11-29 00:11:16,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:16,026 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-29 00:11:16,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:16,027 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:16,029 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:11:16,029 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:16,037 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:16,038 INFO L122 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 [2018-11-29 00:11:16,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:16,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:16,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:16,039 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:16,046 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:16,047 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:16,092 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:11:16,154 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-29 00:11:16,154 INFO L444 ModelExtractionUtils]: 65 out of 73 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-29 00:11:16,155 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:11:16,156 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-29 00:11:16,157 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:11:16,157 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~B.offset, v_rep(select #length ULTIMATE.start_diff_~B.base)_2, ULTIMATE.start_diff_~j~0) = -1*ULTIMATE.start_diff_~B.offset + 1*v_rep(select #length ULTIMATE.start_diff_~B.base)_2 - 4*ULTIMATE.start_diff_~j~0 Supporting invariants [] [2018-11-29 00:11:16,508 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2018-11-29 00:11:16,522 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-29 00:11:16,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:16,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:16,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:16,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:16,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:16,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:11:16,799 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 [2018-11-29 00:11:16,799 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 23 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-11-29 00:11:16,826 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 23 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 38 states and 53 transitions. Complement of second has 7 states. [2018-11-29 00:11:16,827 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 [2018-11-29 00:11:16,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-29 00:11:16,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-29 00:11:16,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 6 letters. Loop has 2 letters. [2018-11-29 00:11:16,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:16,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 8 letters. Loop has 2 letters. [2018-11-29 00:11:16,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:16,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-29 00:11:16,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:16,829 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 53 transitions. [2018-11-29 00:11:16,831 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-29 00:11:16,833 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 27 states and 39 transitions. [2018-11-29 00:11:16,833 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-29 00:11:16,833 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-29 00:11:16,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 39 transitions. [2018-11-29 00:11:16,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:11:16,834 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 39 transitions. [2018-11-29 00:11:16,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 39 transitions. [2018-11-29 00:11:16,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2018-11-29 00:11:16,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-29 00:11:16,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2018-11-29 00:11:16,837 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2018-11-29 00:11:16,837 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2018-11-29 00:11:16,837 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-29 00:11:16,837 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2018-11-29 00:11:16,839 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-29 00:11:16,839 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:11:16,839 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:11:16,840 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:11:16,840 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-29 00:11:16,840 INFO L794 eck$LassoCheckResult]: Stem: 425#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 421#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_~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; 422#L567 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 430#L567-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 423#L570-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(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.alloc(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.alloc(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;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; 424#L547-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 432#L551-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); 437#L551 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem3;havoc diff_#t~mem2;diff_~found~0 := 1; 434#L551-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 419#L550-2 assume !(0 == diff_~found~0); 420#L557-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 431#L547-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 427#L551-2 [2018-11-29 00:11:16,840 INFO L796 eck$LassoCheckResult]: Loop: 427#L551-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); 426#L551 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; 427#L551-2 [2018-11-29 00:11:16,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:16,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1813422420, now seen corresponding path program 2 times [2018-11-29 00:11:16,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:16,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:16,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:16,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:16,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:16,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:16,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:16,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:16,872 INFO L82 PathProgramCache]: Analyzing trace with hash 2022, now seen corresponding path program 2 times [2018-11-29 00:11:16,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:16,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:16,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:16,873 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:11:16,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:16,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:16,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:16,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:16,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1057777617, now seen corresponding path program 1 times [2018-11-29 00:11:16,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:16,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:16,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:16,890 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:11:16,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:16,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:16,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:17,590 WARN L180 SmtUtils]: Spent 548.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 140 [2018-11-29 00:11:17,810 WARN L180 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2018-11-29 00:11:17,812 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:11:17,812 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:11:17,813 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:11:17,813 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:11:17,813 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:11:17,813 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:11:17,813 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:11:17,813 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:11:17,813 INFO L131 ssoRankerPreferences]: Filename of dumped script: diff-alloca_true-valid-memsafety_true-termination.i_Iteration6_Lasso [2018-11-29 00:11:17,813 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:11:17,813 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:11:17,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:17,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:17,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:17,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:18,315 WARN L180 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 100 [2018-11-29 00:11:18,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:18,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:18,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:18,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:18,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:18,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:18,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:18,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:18,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:18,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:18,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:18,665 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2018-11-29 00:11:19,095 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2018-11-29 00:11:19,253 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:11:19,254 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:11:19,255 INFO L122 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 [2018-11-29 00:11:19,260 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:19,261 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:19,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:19,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:19,261 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:19,262 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:19,262 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:19,265 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:19,266 INFO L122 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 [2018-11-29 00:11:19,267 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:19,267 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:19,267 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:19,267 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:19,268 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:19,268 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:19,270 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:19,270 INFO L122 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 [2018-11-29 00:11:19,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:19,273 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:19,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:19,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:19,273 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:19,274 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:19,274 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:19,274 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:19,275 INFO L122 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 [2018-11-29 00:11:19,275 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:19,275 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-29 00:11:19,276 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:19,276 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:19,281 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:11:19,281 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:19,288 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:19,289 INFO L122 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 [2018-11-29 00:11:19,289 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:19,290 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-29 00:11:19,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:19,292 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:19,294 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:11:19,294 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:19,300 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:19,300 INFO L122 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 [2018-11-29 00:11:19,301 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:19,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:19,301 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:11:19,301 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:19,307 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-29 00:11:19,307 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-29 00:11:19,317 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:19,318 INFO L122 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 [2018-11-29 00:11:19,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:19,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:19,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:19,320 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:19,327 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:19,327 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:19,363 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:11:19,416 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-11-29 00:11:19,416 INFO L444 ModelExtractionUtils]: 65 out of 73 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-29 00:11:19,417 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:11:19,419 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-29 00:11:19,419 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:11:19,419 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~B.offset, v_rep(select #length ULTIMATE.start_diff_~B.base)_3, ULTIMATE.start_diff_~j~0) = -1*ULTIMATE.start_diff_~B.offset + 1*v_rep(select #length ULTIMATE.start_diff_~B.base)_3 - 4*ULTIMATE.start_diff_~j~0 Supporting invariants [] [2018-11-29 00:11:19,894 INFO L297 tatePredicateManager]: 18 out of 18 supporting invariants were superfluous and have been removed [2018-11-29 00:11:19,907 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-29 00:11:20,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:20,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:20,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:20,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:20,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:20,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:11:20,427 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 [2018-11-29 00:11:20,427 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 29 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-11-29 00:11:20,510 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 29 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 36 states and 51 transitions. Complement of second has 7 states. [2018-11-29 00:11:20,511 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 [2018-11-29 00:11:20,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-29 00:11:20,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-29 00:11:20,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 12 letters. Loop has 2 letters. [2018-11-29 00:11:20,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:20,512 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:11:20,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:20,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:20,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:20,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:20,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:20,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:11:20,576 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-29 00:11:20,576 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 29 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-11-29 00:11:20,601 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 29 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 36 states and 51 transitions. Complement of second has 7 states. [2018-11-29 00:11:20,602 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 [2018-11-29 00:11:20,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-29 00:11:20,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-29 00:11:20,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 12 letters. Loop has 2 letters. [2018-11-29 00:11:20,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:20,603 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:11:20,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:20,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:20,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:20,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:20,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:20,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:11:20,680 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-29 00:11:20,680 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 29 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-11-29 00:11:20,725 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 29 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 34 states and 51 transitions. Complement of second has 6 states. [2018-11-29 00:11:20,727 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 [2018-11-29 00:11:20,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-29 00:11:20,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2018-11-29 00:11:20,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 12 letters. Loop has 2 letters. [2018-11-29 00:11:20,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:20,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 14 letters. Loop has 2 letters. [2018-11-29 00:11:20,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:20,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 12 letters. Loop has 4 letters. [2018-11-29 00:11:20,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:20,732 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 51 transitions. [2018-11-29 00:11:20,734 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:11:20,734 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 0 states and 0 transitions. [2018-11-29 00:11:20,734 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-29 00:11:20,734 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-29 00:11:20,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-29 00:11:20,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:11:20,734 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:11:20,737 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:11:20,737 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:11:20,737 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-29 00:11:20,737 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-29 00:11:20,737 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:11:20,737 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-29 00:11:20,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.11 12:11:20 BoogieIcfgContainer [2018-11-29 00:11:20,747 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-29 00:11:20,747 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-29 00:11:20,747 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-29 00:11:20,747 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-29 00:11:20,748 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:11:07" (3/4) ... [2018-11-29 00:11:20,754 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-29 00:11:20,754 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-29 00:11:20,755 INFO L168 Benchmark]: Toolchain (without parser) took 15229.50 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 317.7 MB). Free memory was 950.0 MB in the beginning and 1.2 GB in the end (delta: -228.8 MB). Peak memory consumption was 88.9 MB. Max. memory is 11.5 GB. [2018-11-29 00:11:20,757 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:11:20,757 INFO L168 Benchmark]: CACSL2BoogieTranslator took 642.81 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 928.5 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-29 00:11:20,758 INFO L168 Benchmark]: Boogie Procedure Inliner took 146.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 928.5 MB in the beginning and 1.1 GB in the end (delta: -204.6 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. [2018-11-29 00:11:20,761 INFO L168 Benchmark]: Boogie Preprocessor took 55.94 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. [2018-11-29 00:11:20,761 INFO L168 Benchmark]: RCFGBuilder took 634.58 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: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2018-11-29 00:11:20,763 INFO L168 Benchmark]: BuchiAutomizer took 13735.18 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 173.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -64.2 MB). Peak memory consumption was 108.8 MB. Max. memory is 11.5 GB. [2018-11-29 00:11:20,764 INFO L168 Benchmark]: Witness Printer took 7.08 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:11:20,770 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 642.81 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 928.5 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 146.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 928.5 MB in the beginning and 1.1 GB in the end (delta: -204.6 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 55.94 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 634.58 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: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 13735.18 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 173.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -64.2 MB). Peak memory consumption was 108.8 MB. Max. memory is 11.5 GB. * Witness Printer took 7.08 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -4 * i + unknown-#length-unknown[A] + -1 * A and consists of 4 locations. One deterministic module has affine ranking function -1 * B + unknown-#length-unknown[B] + -4 * j and consists of 4 locations. One nondeterministic module has affine ranking function -1 * B + unknown-#length-unknown[B] + -4 * j and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 13.6s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 11.8s. Construction of modules took 0.2s. Büchi inclusion checks took 1.3s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 13 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 20 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 110 SDtfs, 127 SDslu, 48 SDs, 0 SdLazy, 78 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital273 mio100 ax100 hnf98 lsp90 ukn87 mio100 lsp53 div100 bol100 ite100 ukn100 eq182 hnf90 smp100 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 17ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...