./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 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.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-2e94e6a [2019-01-01 21:47:35,486 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:47:35,488 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:47:35,503 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:47:35,504 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:47:35,505 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:47:35,508 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:47:35,511 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:47:35,513 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:47:35,515 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:47:35,517 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:47:35,518 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:47:35,519 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:47:35,520 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:47:35,523 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:47:35,524 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:47:35,525 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:47:35,534 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:47:35,537 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:47:35,541 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:47:35,542 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:47:35,543 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:47:35,549 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:47:35,550 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:47:35,551 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:47:35,552 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:47:35,553 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:47:35,553 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:47:35,556 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:47:35,559 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:47:35,559 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:47:35,560 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:47:35,560 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:47:35,561 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:47:35,561 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:47:35,563 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:47:35,563 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:47:35,592 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:47:35,594 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:47:35,596 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:47:35,596 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:47:35,597 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:47:35,597 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:47:35,597 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:47:35,597 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:47:35,597 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:47:35,598 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:47:35,598 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:47:35,598 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:47:35,598 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:47:35,598 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:47:35,599 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:47:35,600 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:47:35,600 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:47:35,600 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:47:35,601 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:47:35,601 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:47:35,601 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:47:35,601 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:47:35,601 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:47:35,601 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:47:35,603 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:47:35,603 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:47:35,604 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:47:35,604 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:47:35,605 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:47:35,605 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 [2019-01-01 21:47:35,676 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:47:35,690 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:47:35,694 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:47:35,696 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:47:35,696 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:47:35,697 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 [2019-01-01 21:47:35,757 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e407abb7/e04f7340d5424a36815d5d541ca3a8bb/FLAG1a62f6a2d [2019-01-01 21:47:36,236 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:47:36,239 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/b.03_assume-alloca_true-termination_true-no-overflow.c.i [2019-01-01 21:47:36,261 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e407abb7/e04f7340d5424a36815d5d541ca3a8bb/FLAG1a62f6a2d [2019-01-01 21:47:36,547 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e407abb7/e04f7340d5424a36815d5d541ca3a8bb [2019-01-01 21:47:36,551 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:47:36,553 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:47:36,553 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:47:36,554 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:47:36,558 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:47:36,559 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:47:36" (1/1) ... [2019-01-01 21:47:36,562 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@262a2c0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:36, skipping insertion in model container [2019-01-01 21:47:36,562 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:47:36" (1/1) ... [2019-01-01 21:47:36,570 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:47:36,613 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:47:36,964 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:47:36,983 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:47:37,148 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:47:37,205 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:47:37,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:37 WrapperNode [2019-01-01 21:47:37,206 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:47:37,207 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:47:37,207 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:47:37,207 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:47:37,218 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:47:37" (1/1) ... [2019-01-01 21:47:37,238 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:47:37" (1/1) ... [2019-01-01 21:47:37,265 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:47:37,266 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:47:37,266 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:47:37,266 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:47:37,274 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:37" (1/1) ... [2019-01-01 21:47:37,275 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:37" (1/1) ... [2019-01-01 21:47:37,279 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:37" (1/1) ... [2019-01-01 21:47:37,279 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:37" (1/1) ... [2019-01-01 21:47:37,284 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:37" (1/1) ... [2019-01-01 21:47:37,292 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:37" (1/1) ... [2019-01-01 21:47:37,293 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:37" (1/1) ... [2019-01-01 21:47:37,301 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:47:37,302 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:47:37,302 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:47:37,302 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:47:37,303 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:37" (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:47:37,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 21:47:37,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 21:47:37,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 21:47:37,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 21:47:37,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:47:37,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:47:37,800 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:47:37,800 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-01 21:47:37,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:47:37 BoogieIcfgContainer [2019-01-01 21:47:37,801 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:47:37,802 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:47:37,802 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:47:37,813 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:47:37,814 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:47:37,815 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:47:36" (1/3) ... [2019-01-01 21:47:37,816 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6b49288b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:47:37, skipping insertion in model container [2019-01-01 21:47:37,816 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:47:37,816 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:37" (2/3) ... [2019-01-01 21:47:37,817 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6b49288b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:47:37, skipping insertion in model container [2019-01-01 21:47:37,817 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:47:37,817 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:47:37" (3/3) ... [2019-01-01 21:47:37,819 INFO L375 chiAutomizerObserver]: Analyzing ICFG b.03_assume-alloca_true-termination_true-no-overflow.c.i [2019-01-01 21:47:37,887 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:47:37,888 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:47:37,888 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:47:37,888 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:47:37,888 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:47:37,888 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:47:37,889 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:47:37,889 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:47:37,889 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:47:37,903 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-01-01 21:47:37,924 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:47:37,925 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:47:37,925 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:47:37,931 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 21:47:37,932 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 21:47:37,932 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:47:37,932 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-01-01 21:47:37,933 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:47:37,933 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:47:37,934 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:47:37,934 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 21:47:37,934 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 21:47:37,942 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.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 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 [2019-01-01 21:47:37,942 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~mem7;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6;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~mem13;havoc test_fun_#t~mem14; 9#L556-5true [2019-01-01 21:47:37,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:37,950 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2019-01-01 21:47:37,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:47:37,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:47:38,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:38,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:47:38,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:38,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:38,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:38,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:38,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1298091, now seen corresponding path program 1 times [2019-01-01 21:47:38,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:47:38,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:47:38,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:38,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:47:38,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:38,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:47:38,220 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:47:38,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:47:38,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 21:47:38,227 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 21:47:38,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 21:47:38,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 21:47:38,247 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 3 states. [2019-01-01 21:47:38,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:47:38,345 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2019-01-01 21:47:38,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 21:47:38,349 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2019-01-01 21:47:38,350 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:47:38,355 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 7 states and 7 transitions. [2019-01-01 21:47:38,357 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-01-01 21:47:38,357 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-01 21:47:38,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 7 transitions. [2019-01-01 21:47:38,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:47:38,358 INFO L705 BuchiCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-01-01 21:47:38,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 7 transitions. [2019-01-01 21:47:38,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-01 21:47:38,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 21:47:38,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-01-01 21:47:38,394 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-01-01 21:47:38,394 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-01-01 21:47:38,394 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:47:38,394 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 7 transitions. [2019-01-01 21:47:38,395 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:47:38,395 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:47:38,395 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:47:38,395 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 21:47:38,396 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 21:47:38,396 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.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 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 [2019-01-01 21:47:38,396 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~mem7;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6;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~mem13;havoc test_fun_#t~mem14; 36#L556-5 [2019-01-01 21:47:38,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:38,397 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 2 times [2019-01-01 21:47:38,397 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:47:38,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:47:38,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:38,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:47:38,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:38,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:38,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:38,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:38,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1296169, now seen corresponding path program 1 times [2019-01-01 21:47:38,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:47:38,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:47:38,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:38,479 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:47:38,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:38,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:38,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:38,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:38,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1806905932, now seen corresponding path program 1 times [2019-01-01 21:47:38,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:47:38,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:47:38,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:38,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:47:38,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:38,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:38,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:39,254 WARN L181 SmtUtils]: Spent 568.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-01-01 21:47:39,846 WARN L181 SmtUtils]: Spent 519.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-01-01 21:47:40,067 WARN L181 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-01-01 21:47:40,080 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:47:40,082 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:47:40,082 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:47:40,082 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:47:40,082 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:47:40,082 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:47:40,083 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:47:40,083 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:47:40,083 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.03_assume-alloca_true-termination_true-no-overflow.c.i_Iteration2_Lasso [2019-01-01 21:47:40,083 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:47:40,084 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:47:40,111 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:47:40,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:47:40,137 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:47:40,140 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:47:40,153 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:47:40,182 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:47:40,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:40,230 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:47:40,266 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:47:40,269 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:47:40,272 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:47:40,277 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:47:40,281 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:47:40,309 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:47:40,314 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:47:40,317 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:47:40,322 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:47:40,330 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:47:40,675 WARN L181 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-01-01 21:47:40,814 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-01-01 21:47:40,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:40,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:40,822 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:47:41,361 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-01-01 21:47:41,517 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:47:41,523 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:47:41,526 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:47:41,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:41,529 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:41,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:41,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:41,530 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:41,533 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:41,533 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:41,536 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:41,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:47:41,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:41,538 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:41,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:41,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:41,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:41,540 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:41,541 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:41,542 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:41,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:47:41,543 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:41,543 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:41,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:41,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:41,544 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:41,546 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:41,547 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:41,548 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:41,548 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:47:41,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:41,550 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:41,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:41,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:41,551 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:41,551 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:41,551 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:41,553 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:41,554 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:47:41,554 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:41,555 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:41,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:41,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:41,555 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:41,556 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:41,556 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:41,559 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:41,559 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:47:41,560 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:41,560 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:41,560 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:41,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:41,561 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:41,561 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:41,561 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:41,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:41,565 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:47:41,566 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:41,566 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:41,566 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:41,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:41,567 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:41,567 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:41,567 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:41,570 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:41,571 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:47:41,572 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:41,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:41,572 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:41,572 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:41,576 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:41,577 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:41,580 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:41,581 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:47:41,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:41,582 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:41,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:41,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:41,582 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:41,583 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:41,583 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:41,586 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:41,587 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:47:41,588 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:41,588 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:41,588 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:41,588 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:41,588 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:41,591 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:41,591 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:41,593 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:41,593 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:47:41,594 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:41,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:41,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:41,594 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:41,599 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:41,599 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:41,613 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:41,615 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:47:41,616 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:41,616 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:41,616 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:41,616 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:41,621 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:41,625 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:41,631 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:41,632 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:47:41,633 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:41,633 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:41,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:41,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:41,633 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:41,637 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:41,637 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:41,638 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:41,639 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:47:41,639 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:41,639 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:41,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:41,643 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:41,643 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:41,644 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:41,644 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:41,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:41,648 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:47:41,649 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:41,650 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:41,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:41,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:41,651 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:41,651 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:41,651 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:41,653 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:41,654 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:47:41,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:41,654 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:41,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:41,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:41,656 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:41,656 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:41,656 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:41,658 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:41,659 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:47:41,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:41,659 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:41,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:41,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:41,661 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:41,662 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:41,662 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:41,664 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:41,665 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:47:41,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:41,665 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-01 21:47:41,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:41,666 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:41,676 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 21:47:41,676 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:41,708 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:41,709 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:47:41,709 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:41,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:41,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:41,711 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:41,714 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:41,714 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:41,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:41,730 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:47:41,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:41,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:41,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:41,733 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:41,737 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:41,738 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:41,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:41,748 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:47:41,748 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:41,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:41,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:41,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:41,752 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:41,752 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:41,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:41,756 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:47:41,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:41,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:41,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:41,757 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:41,762 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:41,763 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:41,791 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:47:41,823 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 21:47:41,826 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-01 21:47:41,829 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:47:41,831 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:47:41,832 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:47:41,832 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 [] [2019-01-01 21:47:41,927 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2019-01-01 21:47:41,936 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:47:41,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:41,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:47:41,985 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:47:42,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:47:42,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:47:42,234 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:47:42,238 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 [2019-01-01 21:47:42,239 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 7 transitions. cyclomatic complexity: 1 Second operand 5 states. [2019-01-01 21:47:42,413 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. [2019-01-01 21:47:42,414 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 [2019-01-01 21:47:42,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:47:42,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7 transitions. [2019-01-01 21:47:42,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7 transitions. Stem has 3 letters. Loop has 4 letters. [2019-01-01 21:47:42,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:47:42,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7 transitions. Stem has 7 letters. Loop has 4 letters. [2019-01-01 21:47:42,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:47:42,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7 transitions. Stem has 3 letters. Loop has 8 letters. [2019-01-01 21:47:42,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:47:42,419 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2019-01-01 21:47:42,421 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:47:42,421 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 0 states and 0 transitions. [2019-01-01 21:47:42,421 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:47:42,421 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:47:42,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:47:42,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:47:42,422 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:47:42,422 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:47:42,422 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:47:42,422 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:47:42,422 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:47:42,422 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:47:42,423 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:47:42,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:47:42 BoogieIcfgContainer [2019-01-01 21:47:42,429 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:47:42,429 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:47:42,429 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:47:42,430 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:47:42,430 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:47:37" (3/4) ... [2019-01-01 21:47:42,435 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:47:42,435 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:47:42,436 INFO L168 Benchmark]: Toolchain (without parser) took 5884.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 208.1 MB). Free memory was 947.3 MB in the beginning and 1.2 GB in the end (delta: -241.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:47:42,437 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:47:42,439 INFO L168 Benchmark]: CACSL2BoogieTranslator took 652.83 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -151.9 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. [2019-01-01 21:47:42,440 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.71 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. [2019-01-01 21:47:42,441 INFO L168 Benchmark]: Boogie Preprocessor took 35.37 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. [2019-01-01 21:47:42,441 INFO L168 Benchmark]: RCFGBuilder took 499.87 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.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. [2019-01-01 21:47:42,442 INFO L168 Benchmark]: BuchiAutomizer took 4626.97 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 87.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -112.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:47:42,444 INFO L168 Benchmark]: Witness Printer took 5.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 4.3 MB). Peak memory consumption was 4.3 MB. Max. memory is 11.5 GB. [2019-01-01 21:47:42,450 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 652.83 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -151.9 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 58.71 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. * Boogie Preprocessor took 35.37 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 499.87 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.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4626.97 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 87.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -112.9 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 5.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 4.3 MB). Peak memory consumption was 4.3 MB. 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.5s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 3.8s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. 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.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital208 mio100 ax108 hnf100 lsp89 ukn69 mio100 lsp31 div100 bol100 ite100 ukn100 eq188 hnf88 smp100 dnf162 smp95 tf100 neg93 sie125 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 43ms VariablesStem: 5 VariablesLoop: 4 DisjunctsStem: 4 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 12 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...