./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/b.03_assume-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-memory-alloca/b.03_assume-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 b76149a90863628db6af524c153a3f434b0c2e82 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:19:37,374 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:19:37,376 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:19:37,389 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:19:37,389 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:19:37,390 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:19:37,392 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:19:37,395 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:19:37,397 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:19:37,398 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:19:37,400 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:19:37,400 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:19:37,401 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:19:37,403 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:19:37,404 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:19:37,405 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:19:37,406 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:19:37,409 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:19:37,411 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:19:37,415 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:19:37,416 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:19:37,418 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:19:37,427 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:19:37,428 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:19:37,428 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:19:37,431 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:19:37,433 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:19:37,436 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:19:37,438 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:19:37,440 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:19:37,441 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:19:37,443 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:19:37,443 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:19:37,444 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:19:37,447 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:19:37,448 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:19:37,450 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 23:19:37,481 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:19:37,486 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:19:37,487 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:19:37,487 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:19:37,491 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:19:37,491 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:19:37,491 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:19:37,491 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:19:37,492 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:19:37,492 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:19:37,492 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:19:37,492 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:19:37,492 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:19:37,493 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:19:37,495 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:19:37,495 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:19:37,495 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:19:37,496 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:19:37,496 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:19:37,496 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:19:37,496 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:19:37,496 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:19:37,496 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:19:37,497 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:19:37,497 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:19:37,497 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:19:37,497 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:19:37,497 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:19:37,498 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:19:37,502 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 -> b76149a90863628db6af524c153a3f434b0c2e82 [2018-11-28 23:19:37,565 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:19:37,582 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:19:37,590 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:19:37,592 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:19:37,592 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:19:37,593 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/b.03_assume-alloca_true-termination_true-no-overflow.c.i [2018-11-28 23:19:37,653 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5148e532/908bb4fd5e5345328bf3ba8b0215d017/FLAGa802f6fc2 [2018-11-28 23:19:38,135 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:19:38,137 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/b.03_assume-alloca_true-termination_true-no-overflow.c.i [2018-11-28 23:19:38,154 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5148e532/908bb4fd5e5345328bf3ba8b0215d017/FLAGa802f6fc2 [2018-11-28 23:19:38,443 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5148e532/908bb4fd5e5345328bf3ba8b0215d017 [2018-11-28 23:19:38,447 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:19:38,448 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:19:38,449 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:19:38,449 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:19:38,454 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:19:38,455 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:19:38" (1/1) ... [2018-11-28 23:19:38,459 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29ca5205 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:38, skipping insertion in model container [2018-11-28 23:19:38,459 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:19:38" (1/1) ... [2018-11-28 23:19:38,468 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:19:38,519 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:19:38,885 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:19:38,905 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:19:38,980 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:19:39,045 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:19:39,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:39 WrapperNode [2018-11-28 23:19:39,046 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:19:39,047 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:19:39,047 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:19:39,047 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:19:39,133 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:39" (1/1) ... [2018-11-28 23:19:39,157 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:39" (1/1) ... [2018-11-28 23:19:39,189 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:19:39,189 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:19:39,189 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:19:39,190 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:19:39,201 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:39" (1/1) ... [2018-11-28 23:19:39,202 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:39" (1/1) ... [2018-11-28 23:19:39,205 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:39" (1/1) ... [2018-11-28 23:19:39,206 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:39" (1/1) ... [2018-11-28 23:19:39,213 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:39" (1/1) ... [2018-11-28 23:19:39,218 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:39" (1/1) ... [2018-11-28 23:19:39,220 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:39" (1/1) ... [2018-11-28 23:19:39,222 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:19:39,223 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:19:39,224 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:19:39,224 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:19:39,225 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:19:39,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:19:39,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:19:39,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:19:39,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:19:39,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:19:39,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:19:39,741 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:19:39,742 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-28 23:19:39,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:19:39 BoogieIcfgContainer [2018-11-28 23:19:39,742 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:19:39,743 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:19:39,743 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:19:39,748 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:19:39,749 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:19:39,750 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:19:38" (1/3) ... [2018-11-28 23:19:39,751 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@30087dc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:19:39, skipping insertion in model container [2018-11-28 23:19:39,751 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:19:39,751 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:39" (2/3) ... [2018-11-28 23:19:39,753 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@30087dc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:19:39, skipping insertion in model container [2018-11-28 23:19:39,753 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:19:39,753 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:19:39" (3/3) ... [2018-11-28 23:19:39,756 INFO L375 chiAutomizerObserver]: Analyzing ICFG b.03_assume-alloca_true-termination_true-no-overflow.c.i [2018-11-28 23:19:39,820 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:19:39,821 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:19:39,821 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:19:39,821 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:19:39,823 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:19:39,823 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:19:39,823 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:19:39,823 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:19:39,823 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:19:39,840 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-11-28 23:19:39,862 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:19:39,862 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:19:39,862 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:19:39,868 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 23:19:39,868 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:19:39,869 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:19:39,869 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-11-28 23:19:39,870 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:19:39,870 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:19:39,870 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:19:39,871 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 23:19:39,871 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:19:39,880 INFO L794 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~nondet16, main_#t~nondet17, main_#t~ret18;test_fun_#in~x, test_fun_#in~y := main_#t~nondet16, main_#t~nondet17;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~mem4, test_fun_#t~mem5, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem8, test_fun_#t~short10, test_fun_#t~mem15, test_fun_~x, test_fun_~y, 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_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(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.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.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 test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 4#L553true assume !(test_fun_#t~mem4 <= 0);havoc test_fun_#t~mem4; 9#L556-5true [2018-11-28 23:19:39,881 INFO L796 eck$LassoCheckResult]: Loop: 9#L556-5true 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_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 12#L556-1true assume !test_fun_#t~short10; 5#L556-3true assume !!test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;havoc test_fun_#t~mem8;havoc test_fun_#t~mem9;havoc test_fun_#t~short10;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 7#L557true assume !(test_fun_#t~mem11 <= 0);havoc test_fun_#t~mem11;call test_fun_#t~mem13 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem13 + test_fun_#t~mem14, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem14;havoc test_fun_#t~mem13; 9#L556-5true [2018-11-28 23:19:39,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:39,894 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-11-28 23:19:39,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:39,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:39,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:39,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:39,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:40,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:40,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:40,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:40,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1298091, now seen corresponding path program 1 times [2018-11-28 23:19:40,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:40,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:40,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:40,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:40,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:40,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:40,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:19:40,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:19:40,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 23:19:40,161 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 23:19:40,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:19:40,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:19:40,180 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 3 states. [2018-11-28 23:19:40,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:19:40,244 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2018-11-28 23:19:40,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:19:40,248 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2018-11-28 23:19:40,249 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:19:40,254 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 7 states and 7 transitions. [2018-11-28 23:19:40,255 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-28 23:19:40,255 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-28 23:19:40,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 7 transitions. [2018-11-28 23:19:40,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:19:40,256 INFO L705 BuchiCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-11-28 23:19:40,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 7 transitions. [2018-11-28 23:19:40,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-11-28 23:19:40,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 23:19:40,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-11-28 23:19:40,289 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-11-28 23:19:40,289 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-11-28 23:19:40,290 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:19:40,290 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 7 transitions. [2018-11-28 23:19:40,290 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:19:40,290 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:19:40,291 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:19:40,292 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 23:19:40,292 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:19:40,292 INFO L794 eck$LassoCheckResult]: Stem: 39#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 34#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~nondet17, main_#t~ret18;test_fun_#in~x, test_fun_#in~y := main_#t~nondet16, main_#t~nondet17;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~mem4, test_fun_#t~mem5, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem8, test_fun_#t~short10, test_fun_#t~mem15, test_fun_~x, test_fun_~y, 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_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(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.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.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 test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 35#L553 assume !(test_fun_#t~mem4 <= 0);havoc test_fun_#t~mem4; 36#L556-5 [2018-11-28 23:19:40,292 INFO L796 eck$LassoCheckResult]: Loop: 36#L556-5 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_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 40#L556-1 assume test_fun_#t~short10;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem9 <= 2147483647 - test_fun_#t~mem8; 37#L556-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;havoc test_fun_#t~mem8;havoc test_fun_#t~mem9;havoc test_fun_#t~short10;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 38#L557 assume !(test_fun_#t~mem11 <= 0);havoc test_fun_#t~mem11;call test_fun_#t~mem13 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem13 + test_fun_#t~mem14, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem14;havoc test_fun_#t~mem13; 36#L556-5 [2018-11-28 23:19:40,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:40,294 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 2 times [2018-11-28 23:19:40,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:40,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:40,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:40,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:40,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:40,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:40,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:40,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:40,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1296169, now seen corresponding path program 1 times [2018-11-28 23:19:40,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:40,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:40,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:40,334 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:19:40,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:40,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:40,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:40,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:40,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1806905932, now seen corresponding path program 1 times [2018-11-28 23:19:40,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:40,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:40,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:40,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:40,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:40,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:40,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:41,126 WARN L180 SmtUtils]: Spent 684.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2018-11-28 23:19:41,411 WARN L180 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-11-28 23:19:41,802 WARN L180 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2018-11-28 23:19:41,912 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:19:41,913 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:19:41,913 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:19:41,913 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:19:41,914 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:19:41,914 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:19:41,914 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:19:41,914 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:19:41,914 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.03_assume-alloca_true-termination_true-no-overflow.c.i_Iteration2_Lasso [2018-11-28 23:19:41,915 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:19:41,915 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:19:41,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:41,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:41,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:42,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:42,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:42,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:42,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:42,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:42,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:42,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:42,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:42,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:42,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:42,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:42,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:42,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:42,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:42,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:42,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:42,763 WARN L180 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2018-11-28 23:19:42,988 WARN L180 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2018-11-28 23:19:42,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:42,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:43,527 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:19:43,532 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:19:43,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 [2018-11-28 23:19:43,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:43,538 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:43,539 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:43,539 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:43,539 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:43,542 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:43,542 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:43,545 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:43,546 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:43,546 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:43,546 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:43,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:43,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:43,548 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:43,549 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:43,549 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:43,551 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:43,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 [2018-11-28 23:19:43,552 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:43,552 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:43,552 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:43,552 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:43,552 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:43,555 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:43,555 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:43,556 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:43,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 [2018-11-28 23:19:43,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:43,558 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:43,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:43,558 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:43,558 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:43,560 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:43,561 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:43,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:43,562 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:43,563 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:43,563 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:43,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:43,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:43,564 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:43,564 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:43,564 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:43,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:43,568 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:43,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:43,569 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:43,569 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:43,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:43,569 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:43,571 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:43,572 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:43,573 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:43,574 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:43,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:43,574 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:43,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:43,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:43,575 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:43,575 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:43,576 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:43,579 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:43,579 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:43,580 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:43,580 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:43,581 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:43,581 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:43,585 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:43,585 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:43,589 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:43,590 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:43,591 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:43,592 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:43,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:43,592 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:43,592 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:43,593 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:43,593 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:43,595 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:43,595 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:43,598 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:43,598 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:43,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:43,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:43,599 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:43,600 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:43,600 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:43,601 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:43,601 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:43,603 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:43,603 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:43,603 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:43,603 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:43,607 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:43,607 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:43,613 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:43,613 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:43,614 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:43,614 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:43,614 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:43,614 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:43,618 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:43,618 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:43,623 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:43,623 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:43,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:43,624 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:43,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:43,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:43,625 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:43,625 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:43,625 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:43,628 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:43,629 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:43,631 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:43,631 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:43,631 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:43,632 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:43,632 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:43,632 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:43,632 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:43,635 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:43,635 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:43,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:43,637 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:43,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:43,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:43,637 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:43,639 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:43,639 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:43,640 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:43,640 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:43,643 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:43,643 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:43,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:43,643 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:43,643 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:43,645 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:43,645 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:43,646 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:43,647 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:43,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:43,647 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:43,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:43,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:43,649 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:43,650 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:43,650 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:43,652 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:43,653 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:43,653 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:43,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:43,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:43,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:43,657 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:43,657 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:43,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:43,661 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:43,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:43,663 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:19:43,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:43,663 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:43,666 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:19:43,666 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:43,677 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:43,677 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:43,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:43,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:43,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:43,679 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:43,683 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:43,683 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:43,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:43,695 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:43,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:43,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:43,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:43,696 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:43,700 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:43,700 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:43,714 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:43,715 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:43,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:43,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:43,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:43,716 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:43,719 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:43,719 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:43,722 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:43,722 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:43,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:43,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:43,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:43,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:43,729 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:43,729 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:43,764 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:19:43,795 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-28 23:19:43,795 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-28 23:19:43,798 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:19:43,800 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:19:43,801 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:19:43,801 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)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1 + 4294967293 Supporting invariants [] [2018-11-28 23:19:43,897 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-11-28 23:19:43,906 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:19:43,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:43,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:43,978 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:44,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:44,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:44,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:19:44,360 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-28 23:19:44,361 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 7 transitions. cyclomatic complexity: 1 Second operand 5 states. [2018-11-28 23:19:44,481 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 7 transitions. cyclomatic complexity: 1. Second operand 5 states. Result 11 states and 12 transitions. Complement of second has 8 states. [2018-11-28 23:19:44,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 23:19:44,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:19:44,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7 transitions. [2018-11-28 23:19:44,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7 transitions. Stem has 3 letters. Loop has 4 letters. [2018-11-28 23:19:44,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:44,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7 transitions. Stem has 7 letters. Loop has 4 letters. [2018-11-28 23:19:44,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:44,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7 transitions. Stem has 3 letters. Loop has 8 letters. [2018-11-28 23:19:44,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:44,487 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2018-11-28 23:19:44,488 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:19:44,488 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 0 states and 0 transitions. [2018-11-28 23:19:44,488 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:19:44,489 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:19:44,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:19:44,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:19:44,489 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:19:44,489 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:19:44,489 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:19:44,489 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:19:44,489 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:19:44,490 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:19:44,490 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:19:44,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:19:44 BoogieIcfgContainer [2018-11-28 23:19:44,497 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:19:44,498 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:19:44,498 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:19:44,498 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:19:44,499 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:19:39" (3/4) ... [2018-11-28 23:19:44,503 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:19:44,503 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:19:44,504 INFO L168 Benchmark]: Toolchain (without parser) took 6056.76 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.4 MB). Free memory was 952.7 MB in the beginning and 816.5 MB in the end (delta: 136.2 MB). Peak memory consumption was 252.6 MB. Max. memory is 11.5 GB. [2018-11-28 23:19:44,505 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:19:44,506 INFO L168 Benchmark]: CACSL2BoogieTranslator took 597.65 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 931.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-28 23:19:44,507 INFO L168 Benchmark]: Boogie Procedure Inliner took 141.90 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.4 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -173.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2018-11-28 23:19:44,509 INFO L168 Benchmark]: Boogie Preprocessor took 33.70 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:19:44,510 INFO L168 Benchmark]: RCFGBuilder took 519.30 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. [2018-11-28 23:19:44,511 INFO L168 Benchmark]: BuchiAutomizer took 4754.19 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 816.5 MB in the end (delta: 268.7 MB). Peak memory consumption was 268.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:19:44,512 INFO L168 Benchmark]: Witness Printer took 5.33 ms. Allocated memory is still 1.1 GB. Free memory is still 816.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:19:44,518 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.23 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 597.65 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 931.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 141.90 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.4 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -173.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.70 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 519.30 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4754.19 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 816.5 MB in the end (delta: 268.7 MB). Peak memory consumption was 268.7 MB. Max. memory is 11.5 GB. * Witness Printer took 5.33 ms. Allocated memory is still 1.1 GB. Free memory is still 816.5 MB. 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[y_ref][y_ref] + 4294967293 and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.6s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 3.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 7 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 17 SDtfs, 3 SDslu, 9 SDs, 0 SdLazy, 15 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital202 mio100 ax108 hnf100 lsp89 ukn68 mio100 lsp33 div100 bol100 ite100 ukn100 eq188 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 16ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...