./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/b.17-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa 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/termination-memory-alloca/b.17-alloca_true-termination_true-no-overflow.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash a398041f87cd84898ae142142fdf4872d746c3b1 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 21:48:14,484 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:48:14,486 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:48:14,498 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:48:14,499 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:48:14,500 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:48:14,501 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:48:14,503 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:48:14,505 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:48:14,506 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:48:14,506 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:48:14,507 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:48:14,508 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:48:14,509 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:48:14,510 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:48:14,510 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:48:14,511 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:48:14,513 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:48:14,515 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:48:14,521 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:48:14,522 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:48:14,524 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:48:14,528 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:48:14,529 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:48:14,529 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:48:14,530 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:48:14,531 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:48:14,532 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:48:14,532 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:48:14,533 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:48:14,534 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:48:14,534 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:48:14,534 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:48:14,535 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:48:14,535 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:48:14,536 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:48:14,537 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:48:14,553 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:48:14,553 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:48:14,554 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:48:14,555 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:48:14,555 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:48:14,555 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:48:14,555 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:48:14,555 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:48:14,555 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:48:14,556 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:48:14,556 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:48:14,556 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:48:14,556 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:48:14,556 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:48:14,557 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:48:14,557 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:48:14,557 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:48:14,557 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:48:14,557 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:48:14,557 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:48:14,558 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:48:14,558 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:48:14,558 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:48:14,558 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:48:14,558 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:48:14,558 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:48:14,559 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:48:14,559 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:48:14,560 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:48:14,560 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a398041f87cd84898ae142142fdf4872d746c3b1 [2019-01-01 21:48:14,601 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:48:14,617 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:48:14,622 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:48:14,623 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:48:14,624 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:48:14,625 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/b.17-alloca_true-termination_true-no-overflow.c.i [2019-01-01 21:48:14,688 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/080ed28cf/648616f71f4a4061840789837f19835b/FLAG968431650 [2019-01-01 21:48:15,231 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:48:15,232 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/b.17-alloca_true-termination_true-no-overflow.c.i [2019-01-01 21:48:15,246 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/080ed28cf/648616f71f4a4061840789837f19835b/FLAG968431650 [2019-01-01 21:48:15,488 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/080ed28cf/648616f71f4a4061840789837f19835b [2019-01-01 21:48:15,492 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:48:15,493 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:48:15,497 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:48:15,497 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:48:15,502 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:48:15,503 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:48:15" (1/1) ... [2019-01-01 21:48:15,505 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d5ec0c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:48:15, skipping insertion in model container [2019-01-01 21:48:15,506 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:48:15" (1/1) ... [2019-01-01 21:48:15,514 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:48:15,571 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:48:15,951 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:48:15,968 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:48:16,092 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:48:16,168 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:48:16,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:48:16 WrapperNode [2019-01-01 21:48:16,168 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:48:16,169 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:48:16,169 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:48:16,169 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:48:16,178 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:48:16" (1/1) ... [2019-01-01 21:48:16,194 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:48:16" (1/1) ... [2019-01-01 21:48:16,220 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:48:16,220 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:48:16,220 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:48:16,220 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:48:16,230 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:48:16" (1/1) ... [2019-01-01 21:48:16,230 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:48:16" (1/1) ... [2019-01-01 21:48:16,234 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:48:16" (1/1) ... [2019-01-01 21:48:16,234 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:48:16" (1/1) ... [2019-01-01 21:48:16,241 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:48:16" (1/1) ... [2019-01-01 21:48:16,246 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:48:16" (1/1) ... [2019-01-01 21:48:16,248 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:48:16" (1/1) ... [2019-01-01 21:48:16,251 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:48:16,251 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:48:16,252 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:48:16,252 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:48:16,253 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:48:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:48:16,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 21:48:16,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 21:48:16,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 21:48:16,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 21:48:16,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:48:16,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:48:16,734 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:48:16,734 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-01 21:48:16,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:48:16 BoogieIcfgContainer [2019-01-01 21:48:16,735 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:48:16,736 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:48:16,736 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:48:16,740 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:48:16,741 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:48:16,742 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:48:15" (1/3) ... [2019-01-01 21:48:16,743 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@20c644b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:48:16, skipping insertion in model container [2019-01-01 21:48:16,743 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:48:16,743 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:48:16" (2/3) ... [2019-01-01 21:48:16,744 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@20c644b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:48:16, skipping insertion in model container [2019-01-01 21:48:16,744 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:48:16,744 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:48:16" (3/3) ... [2019-01-01 21:48:16,746 INFO L375 chiAutomizerObserver]: Analyzing ICFG b.17-alloca_true-termination_true-no-overflow.c.i [2019-01-01 21:48:16,806 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:48:16,807 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:48:16,807 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:48:16,807 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:48:16,807 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:48:16,807 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:48:16,808 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:48:16,808 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:48:16,808 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:48:16,821 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-01-01 21:48:16,848 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 21:48:16,848 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:48:16,849 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:48:16,855 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:48:16,855 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 21:48:16,855 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:48:16,855 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-01-01 21:48:16,857 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 21:48:16,857 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:48:16,857 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:48:16,857 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:48:16,857 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 21:48:16,866 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet13, main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem10, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 13#L557-3true [2019-01-01 21:48:16,866 INFO L796 eck$LassoCheckResult]: Loop: 13#L557-3true call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 8#L557-1true assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 11#L558-3true assume !true; 14#L558-4true call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; 13#L557-3true [2019-01-01 21:48:16,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:16,875 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-01-01 21:48:16,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:48:16,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:48:16,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:16,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:48:16,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:17,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:17,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:17,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:17,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1144360, now seen corresponding path program 1 times [2019-01-01 21:48:17,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:48:17,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:48:17,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:17,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:48:17,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:17,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:48:17,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:48:17,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:48:17,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 21:48:17,172 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 21:48:17,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-01 21:48:17,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-01 21:48:17,191 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 2 states. [2019-01-01 21:48:17,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:48:17,199 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2019-01-01 21:48:17,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-01 21:48:17,201 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2019-01-01 21:48:17,203 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 21:48:17,207 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 7 states and 8 transitions. [2019-01-01 21:48:17,208 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-01-01 21:48:17,209 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-01 21:48:17,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2019-01-01 21:48:17,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:48:17,210 INFO L705 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-01-01 21:48:17,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2019-01-01 21:48:17,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-01 21:48:17,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 21:48:17,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-01-01 21:48:17,237 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-01-01 21:48:17,238 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-01-01 21:48:17,238 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:48:17,238 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2019-01-01 21:48:17,238 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 21:48:17,239 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:48:17,239 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:48:17,240 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:48:17,240 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 21:48:17,240 INFO L794 eck$LassoCheckResult]: Stem: 34#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 32#L-1 havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet13, main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem10, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 33#L557-3 [2019-01-01 21:48:17,240 INFO L796 eck$LassoCheckResult]: Loop: 33#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 38#L557-1 assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 37#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 35#L558-1 assume !(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem9;havoc test_fun_#t~mem8; 36#L558-4 call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; 33#L557-3 [2019-01-01 21:48:17,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:17,241 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-01-01 21:48:17,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:48:17,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:48:17,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:17,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:48:17,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:17,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:17,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:17,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:17,319 INFO L82 PathProgramCache]: Analyzing trace with hash 35468273, now seen corresponding path program 1 times [2019-01-01 21:48:17,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:48:17,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:48:17,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:17,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:48:17,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:17,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:17,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:17,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:17,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1806907759, now seen corresponding path program 1 times [2019-01-01 21:48:17,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:48:17,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:48:17,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:17,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:48:17,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:17,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:17,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:17,721 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-01-01 21:48:17,972 WARN L181 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-01-01 21:48:19,152 WARN L181 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 128 DAG size of output: 110 [2019-01-01 21:48:19,432 WARN L181 SmtUtils]: Spent 276.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-01-01 21:48:19,452 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:48:19,453 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:48:19,454 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:48:19,454 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:48:19,454 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:48:19,454 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:48:19,454 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:48:19,455 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:48:19,455 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.17-alloca_true-termination_true-no-overflow.c.i_Iteration2_Lasso [2019-01-01 21:48:19,455 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:48:19,456 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:48:19,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:19,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:19,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:19,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:19,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:20,645 WARN L181 SmtUtils]: Spent 761.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 96 [2019-01-01 21:48:20,865 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-01-01 21:48:20,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:20,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:20,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:20,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:20,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:20,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:20,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:20,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:20,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:20,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:20,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:20,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:22,755 WARN L181 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-01-01 21:48:22,989 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:48:22,995 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:48:22,997 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 [2019-01-01 21:48:22,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:22,999 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:23,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:23,000 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:23,000 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:23,002 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:23,002 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:23,005 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:23,005 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 [2019-01-01 21:48:23,006 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:23,006 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:23,006 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:23,006 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:23,006 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:23,007 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:23,007 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:23,008 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:23,009 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 [2019-01-01 21:48:23,009 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:23,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:23,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:23,010 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:23,013 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:23,013 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:23,016 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:23,017 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 [2019-01-01 21:48:23,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:23,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:23,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:23,018 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:23,020 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:23,020 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:23,025 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:23,026 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 [2019-01-01 21:48:23,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:23,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:23,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:23,027 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:23,029 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:23,029 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:23,033 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:23,034 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 [2019-01-01 21:48:23,034 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:23,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:23,035 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:23,035 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:23,037 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:23,037 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:23,040 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:23,040 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 [2019-01-01 21:48:23,041 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:23,041 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:23,041 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:23,041 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:23,045 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:23,045 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:23,068 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:23,073 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 [2019-01-01 21:48:23,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:23,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:23,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:23,074 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:23,093 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:23,094 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:23,151 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:23,152 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 [2019-01-01 21:48:23,153 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:23,153 INFO L205 nArgumentSynthesizer]: 16 stem disjuncts [2019-01-01 21:48:23,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:23,154 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:23,174 INFO L402 nArgumentSynthesizer]: We have 36 Motzkin's Theorem applications. [2019-01-01 21:48:23,174 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:23,258 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:23,259 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 [2019-01-01 21:48:23,259 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:23,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:23,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:23,260 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:23,264 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:23,264 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:23,268 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:23,269 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 [2019-01-01 21:48:23,269 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:23,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:23,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:23,270 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:23,273 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:23,273 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:23,279 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:23,279 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 [2019-01-01 21:48:23,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:23,280 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:23,280 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:23,280 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:23,281 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:23,281 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:23,283 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:23,284 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 [2019-01-01 21:48:23,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:23,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:23,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:23,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:23,289 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:23,289 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:23,294 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:23,295 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 [2019-01-01 21:48:23,296 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:23,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:23,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:23,296 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:23,298 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:23,303 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:23,310 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:23,311 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 [2019-01-01 21:48:23,312 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:23,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:23,312 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:23,312 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:23,317 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:23,317 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:23,337 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:48:23,369 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 21:48:23,369 INFO L444 ModelExtractionUtils]: 33 out of 40 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-01 21:48:23,373 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:48:23,375 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:48:23,375 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:48:23,377 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 - 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_1 Supporting invariants [] [2019-01-01 21:48:23,896 INFO L297 tatePredicateManager]: 37 out of 37 supporting invariants were superfluous and have been removed [2019-01-01 21:48:23,916 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:48:23,918 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:48:23,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:24,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:48:24,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:48:24,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:48:24,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:48:24,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:48:24,143 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 21:48:24,144 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand 4 states. [2019-01-01 21:48:24,282 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2. Second operand 4 states. Result 17 states and 20 transitions. Complement of second has 7 states. [2019-01-01 21:48:24,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 21:48:24,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:48:24,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2019-01-01 21:48:24,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 2 letters. Loop has 5 letters. [2019-01-01 21:48:24,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:48:24,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 7 letters. Loop has 5 letters. [2019-01-01 21:48:24,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:48:24,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 2 letters. Loop has 10 letters. [2019-01-01 21:48:24,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:48:24,290 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 20 transitions. [2019-01-01 21:48:24,291 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 21:48:24,292 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 16 states and 19 transitions. [2019-01-01 21:48:24,292 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-01 21:48:24,292 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-01 21:48:24,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2019-01-01 21:48:24,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:48:24,293 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-01-01 21:48:24,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2019-01-01 21:48:24,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-01-01 21:48:24,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-01 21:48:24,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2019-01-01 21:48:24,295 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-01-01 21:48:24,295 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-01-01 21:48:24,295 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:48:24,295 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2019-01-01 21:48:24,296 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 21:48:24,296 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:48:24,297 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:48:24,297 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 21:48:24,297 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:48:24,297 INFO L794 eck$LassoCheckResult]: Stem: 252#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 250#L-1 havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet13, main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem10, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 251#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 257#L557-1 assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 258#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 253#L558-1 assume !!(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem9;havoc test_fun_#t~mem8;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem10; 254#L558-3 [2019-01-01 21:48:24,298 INFO L796 eck$LassoCheckResult]: Loop: 254#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 264#L558-1 assume !!(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem9;havoc test_fun_#t~mem8;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem10; 254#L558-3 [2019-01-01 21:48:24,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:24,298 INFO L82 PathProgramCache]: Analyzing trace with hash 889571341, now seen corresponding path program 1 times [2019-01-01 21:48:24,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:48:24,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:48:24,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:24,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:48:24,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:24,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:24,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:24,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:24,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1510, now seen corresponding path program 1 times [2019-01-01 21:48:24,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:48:24,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:48:24,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:24,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:48:24,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:24,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:24,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:24,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:24,366 INFO L82 PathProgramCache]: Analyzing trace with hash 179567346, now seen corresponding path program 2 times [2019-01-01 21:48:24,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:48:24,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:48:24,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:24,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:48:24,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:24,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:24,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:24,626 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-01-01 21:48:25,803 WARN L181 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 150 DAG size of output: 126 [2019-01-01 21:48:26,105 WARN L181 SmtUtils]: Spent 296.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-01 21:48:26,108 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:48:26,109 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:48:26,109 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:48:26,109 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:48:26,109 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:48:26,109 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:48:26,109 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:48:26,109 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:48:26,109 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.17-alloca_true-termination_true-no-overflow.c.i_Iteration3_Lasso [2019-01-01 21:48:26,109 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:48:26,110 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:48:26,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:26,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:26,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:26,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:26,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:26,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:26,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:26,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:26,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:26,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:26,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:26,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:26,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:28,325 WARN L181 SmtUtils]: Spent 2.01 s on a formula simplification. DAG size of input: 107 DAG size of output: 97 [2019-01-01 21:48:28,570 WARN L181 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-01-01 21:48:28,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:28,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:28,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:30,406 WARN L181 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-01-01 21:48:30,521 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:48:30,521 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:48:30,522 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 [2019-01-01 21:48:30,522 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:30,522 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:30,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:30,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:30,523 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:30,523 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:30,523 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:30,524 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:30,525 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 [2019-01-01 21:48:30,525 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:30,525 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:30,525 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:30,525 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:30,526 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:30,526 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:30,526 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:30,527 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:30,527 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 [2019-01-01 21:48:30,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:30,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:30,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:30,528 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:30,529 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:30,529 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:30,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:30,531 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 [2019-01-01 21:48:30,531 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:30,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:30,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:30,532 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:30,533 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:30,533 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:30,535 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:30,535 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 [2019-01-01 21:48:30,536 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:30,536 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:30,536 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:30,536 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:30,536 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:30,537 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:30,537 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:30,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:30,537 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 [2019-01-01 21:48:30,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:30,538 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:30,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:30,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:30,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:30,539 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:30,539 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:30,539 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:30,539 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 [2019-01-01 21:48:30,540 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:30,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:30,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:30,540 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:30,541 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:30,541 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:30,542 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:30,543 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 [2019-01-01 21:48:30,543 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:30,543 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:30,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:30,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:30,544 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:30,544 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:30,544 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:30,544 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:30,545 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 [2019-01-01 21:48:30,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:30,545 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:30,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:30,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:30,545 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:30,546 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:30,546 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:30,546 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:30,547 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 [2019-01-01 21:48:30,547 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:30,547 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:30,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:30,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:30,547 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:30,548 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:30,548 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:30,548 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:30,549 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 [2019-01-01 21:48:30,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:30,549 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:30,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:30,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:30,550 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:30,550 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:30,550 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:30,551 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:30,551 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 [2019-01-01 21:48:30,552 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:30,552 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:30,552 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:30,552 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:30,553 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:30,553 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:30,557 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:30,557 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 [2019-01-01 21:48:30,558 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:30,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:30,558 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:30,558 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:30,559 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:30,559 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:30,565 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:30,566 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 [2019-01-01 21:48:30,566 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:30,566 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:30,566 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:30,566 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:30,567 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:30,567 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:30,571 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:30,575 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 [2019-01-01 21:48:30,575 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:30,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:30,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:30,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:30,578 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:30,578 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:30,585 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:30,589 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 [2019-01-01 21:48:30,589 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:30,590 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:30,590 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:30,590 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:30,590 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:30,594 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:30,595 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:30,596 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 [2019-01-01 21:48:30,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:30,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:30,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:30,596 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:30,597 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:30,597 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:30,603 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:30,604 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 [2019-01-01 21:48:30,604 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:30,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:30,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:30,605 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:30,605 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:30,606 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:30,607 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:30,608 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 [2019-01-01 21:48:30,608 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:30,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:30,609 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:30,609 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:30,609 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:30,610 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:30,619 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:30,619 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 [2019-01-01 21:48:30,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:30,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:30,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:30,620 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:30,624 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:30,624 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:30,626 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:30,627 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 [2019-01-01 21:48:30,627 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:30,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:30,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:30,628 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:30,631 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:30,631 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:30,648 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:48:30,665 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-01 21:48:30,665 INFO L444 ModelExtractionUtils]: 32 out of 40 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-01-01 21:48:30,666 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:48:30,666 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:48:30,667 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:48:30,667 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2 - 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_2 Supporting invariants [] [2019-01-01 21:48:30,923 INFO L297 tatePredicateManager]: 32 out of 32 supporting invariants were superfluous and have been removed [2019-01-01 21:48:30,925 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:48:30,925 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:48:30,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:30,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:48:30,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:48:30,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:48:30,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:48:31,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:48:31,091 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:48:31,091 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-01 21:48:31,114 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 22 states and 27 transitions. Complement of second has 7 states. [2019-01-01 21:48:31,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 21:48:31,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:48:31,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-01-01 21:48:31,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 6 letters. Loop has 2 letters. [2019-01-01 21:48:31,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:48:31,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 8 letters. Loop has 2 letters. [2019-01-01 21:48:31,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:48:31,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 6 letters. Loop has 4 letters. [2019-01-01 21:48:31,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:48:31,120 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 27 transitions. [2019-01-01 21:48:31,122 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 21:48:31,123 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 21 states and 26 transitions. [2019-01-01 21:48:31,123 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-01-01 21:48:31,123 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-01-01 21:48:31,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 26 transitions. [2019-01-01 21:48:31,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:48:31,125 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2019-01-01 21:48:31,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 26 transitions. [2019-01-01 21:48:31,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-01-01 21:48:31,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-01 21:48:31,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2019-01-01 21:48:31,127 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2019-01-01 21:48:31,127 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2019-01-01 21:48:31,127 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:48:31,128 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2019-01-01 21:48:31,128 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 21:48:31,129 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:48:31,129 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:48:31,129 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2019-01-01 21:48:31,129 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 21:48:31,129 INFO L794 eck$LassoCheckResult]: Stem: 466#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 464#L-1 havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet13, main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem10, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 465#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 471#L557-1 assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 472#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 483#L558-1 assume !!(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem9;havoc test_fun_#t~mem8;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem10; 482#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 467#L558-1 assume !(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem9;havoc test_fun_#t~mem8; 468#L558-4 [2019-01-01 21:48:31,129 INFO L796 eck$LassoCheckResult]: Loop: 468#L558-4 call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; 478#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 479#L557-1 assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 475#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 476#L558-1 assume !(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem9;havoc test_fun_#t~mem8; 468#L558-4 [2019-01-01 21:48:31,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:31,130 INFO L82 PathProgramCache]: Analyzing trace with hash 179567344, now seen corresponding path program 1 times [2019-01-01 21:48:31,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:48:31,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:48:31,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:31,131 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:48:31,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:31,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:31,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:31,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:31,188 INFO L82 PathProgramCache]: Analyzing trace with hash 52861313, now seen corresponding path program 2 times [2019-01-01 21:48:31,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:48:31,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:48:31,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:31,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:48:31,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:31,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:31,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:31,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:31,201 INFO L82 PathProgramCache]: Analyzing trace with hash -474670094, now seen corresponding path program 1 times [2019-01-01 21:48:31,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:48:31,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:48:31,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:31,202 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:48:31,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:31,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:31,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:31,457 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-01-01 21:48:32,398 WARN L181 SmtUtils]: Spent 907.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 142 [2019-01-01 21:48:32,798 WARN L181 SmtUtils]: Spent 396.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2019-01-01 21:48:32,801 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:48:32,801 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:48:32,801 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:48:32,801 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:48:32,802 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:48:32,802 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:48:32,802 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:48:32,802 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:48:32,802 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.17-alloca_true-termination_true-no-overflow.c.i_Iteration4_Lasso [2019-01-01 21:48:32,802 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:48:32,802 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:48:32,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:32,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:32,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:32,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:32,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:32,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:32,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:32,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:32,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:33,601 WARN L181 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 106 [2019-01-01 21:48:33,798 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2019-01-01 21:48:33,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:33,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:33,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:33,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:33,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:33,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:33,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:34,145 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2019-01-01 21:48:35,829 WARN L181 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-01-01 21:48:35,871 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:48:35,871 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:48:35,872 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 [2019-01-01 21:48:35,872 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:35,872 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:35,875 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:35,875 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:35,875 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:35,876 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:35,876 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:35,878 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:35,878 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 [2019-01-01 21:48:35,878 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:35,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:35,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:35,879 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:35,879 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:35,882 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:35,884 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:35,884 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 [2019-01-01 21:48:35,884 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:35,884 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:35,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:35,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:35,885 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:35,885 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:35,885 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:35,885 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:35,889 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 [2019-01-01 21:48:35,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:35,892 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:35,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:35,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:35,892 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:35,893 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:35,893 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:35,893 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:35,894 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 [2019-01-01 21:48:35,894 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:35,894 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:35,894 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:35,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:35,898 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:35,899 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:35,899 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:35,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:35,901 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 [2019-01-01 21:48:35,901 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:35,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:35,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:35,902 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:35,902 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:35,903 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:35,907 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:35,908 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 [2019-01-01 21:48:35,909 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:35,909 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:35,909 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:35,909 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:35,909 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:35,909 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:35,909 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:35,913 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:35,913 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 [2019-01-01 21:48:35,914 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:35,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:35,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:35,914 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:35,917 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:35,917 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:35,918 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:35,919 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 [2019-01-01 21:48:35,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:35,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:35,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:35,919 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:35,921 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:35,922 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:35,928 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:35,929 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 [2019-01-01 21:48:35,929 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:35,929 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:35,929 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:35,929 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:35,930 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:35,930 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:35,935 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:35,936 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 [2019-01-01 21:48:35,938 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:35,938 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:35,938 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:35,938 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:35,940 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:35,940 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:35,953 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:48:35,967 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 21:48:35,967 INFO L444 ModelExtractionUtils]: 36 out of 40 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:48:35,968 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:48:35,968 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:48:35,968 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:48:35,968 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3 - 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_3 Supporting invariants [] [2019-01-01 21:48:36,820 INFO L297 tatePredicateManager]: 41 out of 41 supporting invariants were superfluous and have been removed [2019-01-01 21:48:36,823 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:48:36,824 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:48:36,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:36,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:48:36,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:48:36,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:48:36,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:48:36,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:36,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 49 [2019-01-01 21:48:37,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:37,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 43 [2019-01-01 21:48:37,030 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-01-01 21:48:37,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:37,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2019-01-01 21:48:37,090 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 21:48:37,111 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:48:37,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:48:37,122 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:31, output treesize:26 [2019-01-01 21:48:37,265 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-01 21:48:37,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:48:37,624 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2019-01-01 21:48:37,624 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 25 transitions. cyclomatic complexity: 8 Second operand 6 states. [2019-01-01 21:48:37,941 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 25 transitions. cyclomatic complexity: 8. Second operand 6 states. Result 59 states and 71 transitions. Complement of second has 13 states. [2019-01-01 21:48:37,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2019-01-01 21:48:37,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-01 21:48:37,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2019-01-01 21:48:37,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 8 letters. Loop has 5 letters. [2019-01-01 21:48:37,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:48:37,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 13 letters. Loop has 5 letters. [2019-01-01 21:48:37,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:48:37,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 8 letters. Loop has 10 letters. [2019-01-01 21:48:37,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:48:37,944 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 71 transitions. [2019-01-01 21:48:37,947 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2019-01-01 21:48:37,948 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 55 states and 67 transitions. [2019-01-01 21:48:37,949 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-01-01 21:48:37,949 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-01-01 21:48:37,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 67 transitions. [2019-01-01 21:48:37,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:48:37,950 INFO L705 BuchiCegarLoop]: Abstraction has 55 states and 67 transitions. [2019-01-01 21:48:37,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 67 transitions. [2019-01-01 21:48:37,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 48. [2019-01-01 21:48:37,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-01 21:48:37,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2019-01-01 21:48:37,957 INFO L728 BuchiCegarLoop]: Abstraction has 48 states and 60 transitions. [2019-01-01 21:48:37,957 INFO L608 BuchiCegarLoop]: Abstraction has 48 states and 60 transitions. [2019-01-01 21:48:37,958 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 21:48:37,958 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 60 transitions. [2019-01-01 21:48:37,961 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2019-01-01 21:48:37,961 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:48:37,961 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:48:37,962 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:48:37,962 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2019-01-01 21:48:37,962 INFO L794 eck$LassoCheckResult]: Stem: 785#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 783#L-1 havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet13, main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem10, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 784#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 811#L557-1 assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 810#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 809#L558-1 assume !!(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem9;havoc test_fun_#t~mem8;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem10; 808#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 805#L558-1 assume !(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem9;havoc test_fun_#t~mem8; 804#L558-4 call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; 798#L557-3 [2019-01-01 21:48:37,962 INFO L796 eck$LassoCheckResult]: Loop: 798#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 830#L557-1 assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 829#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 828#L558-1 assume !!(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem9;havoc test_fun_#t~mem8;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem10; 827#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 825#L558-1 assume !(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem9;havoc test_fun_#t~mem8; 797#L558-4 call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; 798#L557-3 [2019-01-01 21:48:37,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:37,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1271620394, now seen corresponding path program 2 times [2019-01-01 21:48:37,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:48:37,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:48:37,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:37,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:48:37,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:37,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:37,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:38,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:38,002 INFO L82 PathProgramCache]: Analyzing trace with hash -274676436, now seen corresponding path program 1 times [2019-01-01 21:48:38,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:48:38,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:48:38,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:38,003 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:48:38,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:38,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:38,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:38,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:38,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1864355357, now seen corresponding path program 3 times [2019-01-01 21:48:38,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:48:38,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:48:38,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:38,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:48:38,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:38,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:48:38,721 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 21:48:38,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:48:38,721 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:48:38,732 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 21:48:38,784 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-01 21:48:38,784 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:48:38,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:48:38,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-01 21:48:38,811 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 21:48:38,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:48:38,821 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-01-01 21:48:38,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:38,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 29 treesize of output 53 [2019-01-01 21:48:38,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:38,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 35 [2019-01-01 21:48:38,975 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:48:39,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:39,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 29 [2019-01-01 21:48:39,059 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 21:48:39,105 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:48:39,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:48:39,123 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:39, output treesize:50 [2019-01-01 21:48:39,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:39,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:39,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 47 [2019-01-01 21:48:39,314 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 47 [2019-01-01 21:48:39,316 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:48:39,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2019-01-01 21:48:39,375 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-01 21:48:39,400 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:48:39,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:48:39,407 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:43, output treesize:3 [2019-01-01 21:48:39,428 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 21:48:39,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:48:39,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2019-01-01 21:48:39,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-01 21:48:39,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2019-01-01 21:48:39,574 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. cyclomatic complexity: 18 Second operand 17 states. [2019-01-01 21:48:39,868 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2019-01-01 21:48:40,290 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2019-01-01 21:48:40,635 WARN L181 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 44 [2019-01-01 21:48:41,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:48:41,067 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2019-01-01 21:48:41,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 21:48:41,070 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 51 transitions. [2019-01-01 21:48:41,073 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:48:41,073 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 0 states and 0 transitions. [2019-01-01 21:48:41,073 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:48:41,073 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:48:41,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:48:41,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:48:41,073 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:48:41,073 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:48:41,073 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:48:41,074 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 21:48:41,074 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:48:41,074 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:48:41,074 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:48:41,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:48:41 BoogieIcfgContainer [2019-01-01 21:48:41,084 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:48:41,084 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:48:41,084 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:48:41,085 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:48:41,085 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:48:16" (3/4) ... [2019-01-01 21:48:41,089 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:48:41,089 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:48:41,090 INFO L168 Benchmark]: Toolchain (without parser) took 25598.05 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 380.1 MB). Free memory was 951.4 MB in the beginning and 1.3 GB in the end (delta: -371.6 MB). Peak memory consumption was 8.5 MB. Max. memory is 11.5 GB. [2019-01-01 21:48:41,092 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. [2019-01-01 21:48:41,093 INFO L168 Benchmark]: CACSL2BoogieTranslator took 672.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -159.1 MB). Peak memory consumption was 30.8 MB. Max. memory is 11.5 GB. [2019-01-01 21:48:41,095 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.65 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:48:41,095 INFO L168 Benchmark]: Boogie Preprocessor took 31.03 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:48:41,096 INFO L168 Benchmark]: RCFGBuilder took 483.92 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.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. [2019-01-01 21:48:41,098 INFO L168 Benchmark]: BuchiAutomizer took 24347.71 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 249.0 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -231.4 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. [2019-01-01 21:48:41,099 INFO L168 Benchmark]: Witness Printer took 5.12 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:48:41,106 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 672.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -159.1 MB). Peak memory consumption was 30.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.65 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. * Boogie Preprocessor took 31.03 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 483.92 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.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 24347.71 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 249.0 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -231.4 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. * Witness Printer took 5.12 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 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 #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] + -1 * unknown-#memory_int-unknown[z_ref][z_ref] and consists of 4 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] + -1 * unknown-#memory_int-unknown[z_ref][z_ref] and consists of 4 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] + -1 * unknown-#memory_int-unknown[y_ref][y_ref] and consists of 7 locations. 2 modules have a trivial ranking function, the largest among these consists of 17 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 24.2s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 20.9s. Construction of modules took 0.4s. Büchi inclusion checks took 2.7s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 48 states and ocurred in iteration 4. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 33 SDtfs, 33 SDslu, 15 SDs, 0 SdLazy, 178 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital888 mio100 ax102 hnf100 lsp96 ukn32 mio100 lsp31 div100 bol100 ite100 ukn100 eq194 hnf87 smp99 dnf729 smp90 tf100 neg91 sie127 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 105ms VariablesStem: 9 VariablesLoop: 6 DisjunctsStem: 16 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 36 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...