./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/loop-lit/mcmillan2006_true-unreach-call_true-termination.c.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/loop-lit/mcmillan2006_true-unreach-call_true-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 025e0289c8e9b33528493c96bf0a22ba3200731b .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 23:09:23,431 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 23:09:23,433 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 23:09:23,452 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 23:09:23,452 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 23:09:23,454 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 23:09:23,456 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 23:09:23,459 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 23:09:23,461 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 23:09:23,468 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 23:09:23,469 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 23:09:23,471 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 23:09:23,472 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 23:09:23,474 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 23:09:23,477 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 23:09:23,478 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 23:09:23,480 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 23:09:23,481 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 23:09:23,488 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 23:09:23,491 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 23:09:23,493 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 23:09:23,496 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 23:09:23,501 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 23:09:23,501 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 23:09:23,501 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 23:09:23,505 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 23:09:23,506 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 23:09:23,506 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 23:09:23,510 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 23:09:23,512 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 23:09:23,513 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 23:09:23,514 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 23:09:23,514 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 23:09:23,514 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 23:09:23,515 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 23:09:23,518 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 23:09:23,519 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-01 23:09:23,547 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 23:09:23,547 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 23:09:23,548 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 23:09:23,548 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 23:09:23,548 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 23:09:23,549 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 23:09:23,549 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 23:09:23,549 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 23:09:23,549 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 23:09:23,549 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 23:09:23,549 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 23:09:23,550 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 23:09:23,550 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 23:09:23,550 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 23:09:23,550 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 23:09:23,550 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 23:09:23,550 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 23:09:23,551 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 23:09:23,551 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 23:09:23,551 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 23:09:23,551 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 23:09:23,551 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 23:09:23,551 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 23:09:23,552 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 23:09:23,552 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 23:09:23,552 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 23:09:23,552 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 23:09:23,552 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 23:09:23,553 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 23:09:23,553 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 23:09:23,553 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 23:09:23,554 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 23:09:23,554 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 025e0289c8e9b33528493c96bf0a22ba3200731b [2019-01-01 23:09:23,616 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 23:09:23,630 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 23:09:23,635 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 23:09:23,637 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 23:09:23,637 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 23:09:23,638 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loop-lit/mcmillan2006_true-unreach-call_true-termination.c.i [2019-01-01 23:09:23,707 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dcc64294/fb6a8f4eabe94062bc8f464dc3f37512/FLAG9cff82a18 [2019-01-01 23:09:24,151 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 23:09:24,151 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loop-lit/mcmillan2006_true-unreach-call_true-termination.c.i [2019-01-01 23:09:24,156 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dcc64294/fb6a8f4eabe94062bc8f464dc3f37512/FLAG9cff82a18 [2019-01-01 23:09:24,521 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dcc64294/fb6a8f4eabe94062bc8f464dc3f37512 [2019-01-01 23:09:24,524 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 23:09:24,526 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 23:09:24,527 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 23:09:24,527 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 23:09:24,531 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 23:09:24,532 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:09:24" (1/1) ... [2019-01-01 23:09:24,535 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c03e545 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:09:24, skipping insertion in model container [2019-01-01 23:09:24,536 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:09:24" (1/1) ... [2019-01-01 23:09:24,544 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 23:09:24,563 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 23:09:24,787 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:09:24,800 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 23:09:24,819 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:09:24,838 INFO L195 MainTranslator]: Completed translation [2019-01-01 23:09:24,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:09:24 WrapperNode [2019-01-01 23:09:24,839 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 23:09:24,840 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 23:09:24,840 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 23:09:24,840 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 23:09:24,850 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:09:24" (1/1) ... [2019-01-01 23:09:24,860 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:09:24" (1/1) ... [2019-01-01 23:09:24,888 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 23:09:24,889 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 23:09:24,889 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 23:09:24,889 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 23:09:24,901 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:09:24" (1/1) ... [2019-01-01 23:09:24,902 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:09:24" (1/1) ... [2019-01-01 23:09:24,904 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:09:24" (1/1) ... [2019-01-01 23:09:24,905 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:09:24" (1/1) ... [2019-01-01 23:09:24,912 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:09:24" (1/1) ... [2019-01-01 23:09:24,923 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:09:24" (1/1) ... [2019-01-01 23:09:24,925 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:09:24" (1/1) ... [2019-01-01 23:09:24,928 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 23:09:24,929 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 23:09:24,929 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 23:09:24,930 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 23:09:24,931 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:09:24" (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 23:09:25,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 23:09:25,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-01 23:09:25,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 23:09:25,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 23:09:25,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 23:09:25,364 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 23:09:25,364 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-01 23:09:25,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:09:25 BoogieIcfgContainer [2019-01-01 23:09:25,365 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 23:09:25,366 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 23:09:25,366 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 23:09:25,371 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 23:09:25,372 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:09:25,372 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 11:09:24" (1/3) ... [2019-01-01 23:09:25,375 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6a08b228 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:09:25, skipping insertion in model container [2019-01-01 23:09:25,375 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:09:25,375 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:09:24" (2/3) ... [2019-01-01 23:09:25,376 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6a08b228 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:09:25, skipping insertion in model container [2019-01-01 23:09:25,376 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:09:25,377 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:09:25" (3/3) ... [2019-01-01 23:09:25,380 INFO L375 chiAutomizerObserver]: Analyzing ICFG mcmillan2006_true-unreach-call_true-termination.c.i [2019-01-01 23:09:25,477 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 23:09:25,479 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 23:09:25,480 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 23:09:25,480 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 23:09:25,483 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 23:09:25,484 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 23:09:25,484 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 23:09:25,484 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 23:09:25,484 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 23:09:25,510 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-01-01 23:09:25,537 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-01-01 23:09:25,538 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:09:25,538 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:09:25,545 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 23:09:25,545 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 23:09:25,545 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 23:09:25,546 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-01-01 23:09:25,548 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-01-01 23:09:25,549 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:09:25,549 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:09:25,549 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 23:09:25,549 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 23:09:25,557 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true havoc main_#res;havoc main_#t~nondet1, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~post3, main_~i~0, main_#t~mem5, main_#t~post4, main_~i~1, main_~n~0, main_~x~0.base, main_~x~0.offset;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 15#L14true assume !!(0 <= main_~n~0 && main_~n~0 <= 1000);call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;main_~i~0 := 0; 11#L16-3true [2019-01-01 23:09:25,557 INFO L796 eck$LassoCheckResult]: Loop: 11#L16-3true assume !!(main_~i~0 < main_~n~0);call write~int(0, main_~x~0.base, main_~x~0.offset + 4 * main_~i~0, 4); 16#L16-2true main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 11#L16-3true [2019-01-01 23:09:25,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:09:25,564 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2019-01-01 23:09:25,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:09:25,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:09:25,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:09:25,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:09:25,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:09:25,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:09:25,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:09:25,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:09:25,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1443, now seen corresponding path program 1 times [2019-01-01 23:09:25,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:09:25,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:09:25,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:09:25,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:09:25,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:09:25,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:09:25,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:09:25,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:09:25,733 INFO L82 PathProgramCache]: Analyzing trace with hash 28695942, now seen corresponding path program 1 times [2019-01-01 23:09:25,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:09:25,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:09:25,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:09:25,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:09:25,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:09:25,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:09:25,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:09:25,917 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-01 23:09:26,149 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-01 23:09:26,337 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-01-01 23:09:26,363 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:09:26,365 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:09:26,365 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:09:26,365 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:09:26,365 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:09:26,366 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:09:26,366 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:09:26,366 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:09:26,366 INFO L131 ssoRankerPreferences]: Filename of dumped script: mcmillan2006_true-unreach-call_true-termination.c.i_Iteration1_Lasso [2019-01-01 23:09:26,366 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:09:26,367 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:09:26,400 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 23:09:26,410 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 23:09:26,415 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 23:09:26,420 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 23:09:26,424 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 23:09:26,431 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 23:09:26,435 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 23:09:26,438 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 23:09:26,674 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2019-01-01 23:09:26,712 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 23:09:27,407 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:09:27,413 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:09:27,415 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 23:09:27,417 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:09:27,418 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:09:27,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:09:27,419 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:09:27,419 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:09:27,421 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:09:27,422 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:09:27,425 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:09:27,426 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 23:09:27,427 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:09:27,427 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:09:27,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:09:27,428 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:09:27,428 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:09:27,429 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:09:27,429 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:09:27,430 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:09:27,430 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 23:09:27,431 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:09:27,431 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:09:27,431 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:09:27,432 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:09:27,432 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:09:27,432 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:09:27,433 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:09:27,434 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:09:27,434 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 23:09:27,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:09:27,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:09:27,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:09:27,436 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:09:27,439 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:09:27,439 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:09:27,444 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:09:27,445 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 23:09:27,446 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:09:27,446 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:09:27,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:09:27,447 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:09:27,447 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:09:27,447 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:09:27,448 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:09:27,449 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:09:27,450 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 23:09:27,450 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:09:27,451 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:09:27,451 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:09:27,451 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:09:27,451 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:09:27,452 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:09:27,452 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:09:27,453 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:09:27,454 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 23:09:27,454 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:09:27,455 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:09:27,455 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:09:27,455 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:09:27,455 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:09:27,456 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:09:27,456 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:09:27,457 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:09:27,458 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 23:09:27,458 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:09:27,459 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:09:27,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:09:27,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:09:27,459 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:09:27,460 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:09:27,460 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:09:27,462 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:09:27,463 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 23:09:27,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:09:27,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:09:27,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:09:27,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:09:27,471 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:09:27,472 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:09:27,586 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:09:27,690 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 23:09:27,694 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-01 23:09:27,699 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:09:27,705 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 23:09:27,706 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:09:27,706 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_~i~0, v_rep(select #length ULTIMATE.start_main_~x~0.base)_1) = -1*ULTIMATE.start_main_~x~0.offset - 4*ULTIMATE.start_main_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_~x~0.base)_1 Supporting invariants [] [2019-01-01 23:09:27,772 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-01 23:09:27,791 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 23:09:27,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:09:27,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:09:27,901 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:09:27,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:09:27,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:09:27,990 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 23:09:28,008 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 23:09:28,009 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 3 states. [2019-01-01 23:09:28,069 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states.. Second operand 3 states. Result 40 states and 51 transitions. Complement of second has 7 states. [2019-01-01 23:09:28,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 23:09:28,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 23:09:28,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2019-01-01 23:09:28,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 3 letters. Loop has 2 letters. [2019-01-01 23:09:28,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:09:28,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-01 23:09:28,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:09:28,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 3 letters. Loop has 4 letters. [2019-01-01 23:09:28,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:09:28,078 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 51 transitions. [2019-01-01 23:09:28,082 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 23:09:28,087 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 11 states and 13 transitions. [2019-01-01 23:09:28,088 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-01-01 23:09:28,088 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-01-01 23:09:28,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2019-01-01 23:09:28,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:09:28,089 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-01-01 23:09:28,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2019-01-01 23:09:28,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-01 23:09:28,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-01 23:09:28,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2019-01-01 23:09:28,116 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-01-01 23:09:28,116 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-01-01 23:09:28,117 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 23:09:28,117 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. [2019-01-01 23:09:28,117 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 23:09:28,118 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:09:28,118 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:09:28,118 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 23:09:28,118 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 23:09:28,119 INFO L794 eck$LassoCheckResult]: Stem: 115#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 111#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~post3, main_~i~0, main_#t~mem5, main_#t~post4, main_~i~1, main_~n~0, main_~x~0.base, main_~x~0.offset;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 112#L14 assume !!(0 <= main_~n~0 && main_~n~0 <= 1000);call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;main_~i~0 := 0; 117#L16-3 assume !(main_~i~0 < main_~n~0); 116#L16-4 main_~i~1 := 0; 110#L17-3 [2019-01-01 23:09:28,119 INFO L796 eck$LassoCheckResult]: Loop: 110#L17-3 assume !!(main_~i~1 < main_~n~0);call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset + 4 * main_~i~1, 4);__VERIFIER_assert_#in~cond := (if 0 == main_#t~mem5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 113#L5 assume !(0 == __VERIFIER_assert_~cond); 114#L5-2 havoc main_#t~mem5; 109#L17-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 110#L17-3 [2019-01-01 23:09:28,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:09:28,119 INFO L82 PathProgramCache]: Analyzing trace with hash 28695884, now seen corresponding path program 1 times [2019-01-01 23:09:28,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:09:28,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:09:28,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:09:28,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:09:28,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:09:28,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:09:28,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:09:28,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:09:28,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1823306, now seen corresponding path program 1 times [2019-01-01 23:09:28,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:09:28,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:09:28,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:09:28,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:09:28,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:09:28,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:09:28,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:09:28,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:09:28,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1304171029, now seen corresponding path program 1 times [2019-01-01 23:09:28,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:09:28,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:09:28,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:09:28,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:09:28,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:09:28,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:09:28,246 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 23:09:28,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:09:28,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 23:09:28,434 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 30 [2019-01-01 23:09:28,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 23:09:28,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 23:09:28,440 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. cyclomatic complexity: 4 Second operand 4 states. [2019-01-01 23:09:28,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:09:28,650 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2019-01-01 23:09:28,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 23:09:28,653 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 15 transitions. [2019-01-01 23:09:28,655 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 23:09:28,656 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 12 states and 13 transitions. [2019-01-01 23:09:28,656 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-01-01 23:09:28,656 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-01-01 23:09:28,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 13 transitions. [2019-01-01 23:09:28,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:09:28,658 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-01-01 23:09:28,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 13 transitions. [2019-01-01 23:09:28,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-01-01 23:09:28,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-01 23:09:28,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-01-01 23:09:28,660 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-01-01 23:09:28,661 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-01-01 23:09:28,661 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 23:09:28,661 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2019-01-01 23:09:28,661 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 23:09:28,661 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:09:28,662 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:09:28,662 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:09:28,662 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 23:09:28,662 INFO L794 eck$LassoCheckResult]: Stem: 151#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 147#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~post3, main_~i~0, main_#t~mem5, main_#t~post4, main_~i~1, main_~n~0, main_~x~0.base, main_~x~0.offset;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 148#L14 assume !!(0 <= main_~n~0 && main_~n~0 <= 1000);call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;main_~i~0 := 0; 153#L16-3 assume !!(main_~i~0 < main_~n~0);call write~int(0, main_~x~0.base, main_~x~0.offset + 4 * main_~i~0, 4); 154#L16-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 155#L16-3 assume !(main_~i~0 < main_~n~0); 152#L16-4 main_~i~1 := 0; 146#L17-3 [2019-01-01 23:09:28,663 INFO L796 eck$LassoCheckResult]: Loop: 146#L17-3 assume !!(main_~i~1 < main_~n~0);call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset + 4 * main_~i~1, 4);__VERIFIER_assert_#in~cond := (if 0 == main_#t~mem5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 149#L5 assume !(0 == __VERIFIER_assert_~cond); 150#L5-2 havoc main_#t~mem5; 145#L17-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 146#L17-3 [2019-01-01 23:09:28,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:09:28,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1806996910, now seen corresponding path program 1 times [2019-01-01 23:09:28,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:09:28,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:09:28,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:09:28,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:09:28,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:09:28,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:09:28,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:09:28,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:09:28,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1823306, now seen corresponding path program 2 times [2019-01-01 23:09:28,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:09:28,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:09:28,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:09:28,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:09:28,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:09:28,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:09:28,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:09:28,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:09:28,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1358706313, now seen corresponding path program 1 times [2019-01-01 23:09:28,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:09:28,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:09:28,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:09:28,722 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:09:28,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:09:28,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:09:28,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:09:28,928 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 30 [2019-01-01 23:09:29,104 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-01-01 23:09:29,196 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:09:29,196 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:09:29,197 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:09:29,197 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:09:29,197 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:09:29,197 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:09:29,197 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:09:29,197 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:09:29,197 INFO L131 ssoRankerPreferences]: Filename of dumped script: mcmillan2006_true-unreach-call_true-termination.c.i_Iteration3_Lasso [2019-01-01 23:09:29,198 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:09:29,198 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:09:29,202 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 23:09:29,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:09:29,215 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 23:09:29,217 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 23:09:29,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:09:29,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:09:29,235 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 23:09:29,239 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 23:09:29,420 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-01-01 23:09:29,456 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 23:09:29,795 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:09:29,796 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:09:29,797 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 23:09:29,798 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:09:29,798 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:09:29,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:09:29,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:09:29,799 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:09:29,799 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:09:29,799 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:09:29,800 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:09:29,803 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 23:09:29,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:09:29,805 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:09:29,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:09:29,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:09:29,805 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:09:29,807 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:09:29,807 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:09:29,807 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:09:29,808 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 23:09:29,808 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:09:29,810 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:09:29,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:09:29,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:09:29,811 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:09:29,811 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:09:29,811 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:09:29,813 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:09:29,814 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 23:09:29,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:09:29,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:09:29,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:09:29,816 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:09:29,818 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:09:29,819 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:09:29,822 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:09:29,822 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 23:09:29,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:09:29,825 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:09:29,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:09:29,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:09:29,825 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:09:29,826 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:09:29,826 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:09:29,826 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:09:29,827 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 23:09:29,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:09:29,830 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:09:29,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:09:29,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:09:29,830 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:09:29,832 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:09:29,832 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:09:29,834 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:09:29,836 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 23:09:29,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:09:29,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:09:29,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:09:29,837 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:09:29,840 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:09:29,841 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:09:29,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:09:29,844 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 23:09:29,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:09:29,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:09:29,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:09:29,845 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:09:29,848 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:09:29,849 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:09:29,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:09:29,857 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 23:09:29,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:09:29,858 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-01 23:09:29,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:09:29,858 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:09:29,862 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 23:09:29,863 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:09:29,871 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:09:29,872 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:09:29,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:09:29,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:09:29,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:09:29,873 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:09:29,878 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:09:29,879 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:09:29,900 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:09:29,920 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-01 23:09:29,920 INFO L444 ModelExtractionUtils]: 17 out of 25 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-01 23:09:29,921 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:09:29,923 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 23:09:29,923 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:09:29,924 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_~i~1, v_rep(select #length ULTIMATE.start_main_~x~0.base)_2) = -1*ULTIMATE.start_main_~x~0.offset - 4*ULTIMATE.start_main_~i~1 + 1*v_rep(select #length ULTIMATE.start_main_~x~0.base)_2 Supporting invariants [] [2019-01-01 23:09:29,968 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-01 23:09:29,971 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 23:09:30,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:09:30,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:09:30,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:09:30,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:09:30,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:09:30,103 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 23:09:30,103 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 23:09:30,104 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 12 transitions. cyclomatic complexity: 3 Second operand 3 states. [2019-01-01 23:09:30,149 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 12 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 15 states and 17 transitions. Complement of second has 4 states. [2019-01-01 23:09:30,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 23:09:30,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 23:09:30,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2019-01-01 23:09:30,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 7 letters. Loop has 4 letters. [2019-01-01 23:09:30,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:09:30,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 11 letters. Loop has 4 letters. [2019-01-01 23:09:30,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:09:30,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 7 letters. Loop has 8 letters. [2019-01-01 23:09:30,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:09:30,154 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2019-01-01 23:09:30,157 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:09:30,158 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 0 states and 0 transitions. [2019-01-01 23:09:30,158 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 23:09:30,158 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 23:09:30,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 23:09:30,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:09:30,158 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:09:30,158 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:09:30,159 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:09:30,159 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 23:09:30,159 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 23:09:30,159 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:09:30,159 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 23:09:30,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 11:09:30 BoogieIcfgContainer [2019-01-01 23:09:30,171 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 23:09:30,172 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 23:09:30,172 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 23:09:30,172 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 23:09:30,174 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:09:25" (3/4) ... [2019-01-01 23:09:30,180 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 23:09:30,181 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 23:09:30,183 INFO L168 Benchmark]: Toolchain (without parser) took 5657.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 951.4 MB in the beginning and 839.6 MB in the end (delta: 111.7 MB). Peak memory consumption was 252.2 MB. Max. memory is 11.5 GB. [2019-01-01 23:09:30,186 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:09:30,187 INFO L168 Benchmark]: CACSL2BoogieTranslator took 312.17 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 23:09:30,189 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.91 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:09:30,190 INFO L168 Benchmark]: Boogie Preprocessor took 39.65 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-01 23:09:30,192 INFO L168 Benchmark]: RCFGBuilder took 436.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -180.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2019-01-01 23:09:30,195 INFO L168 Benchmark]: BuchiAutomizer took 4805.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 839.6 MB in the end (delta: 275.9 MB). Peak memory consumption was 275.9 MB. Max. memory is 11.5 GB. [2019-01-01 23:09:30,197 INFO L168 Benchmark]: Witness Printer took 10.05 ms. Allocated memory is still 1.2 GB. Free memory is still 839.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:09:30,203 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 312.17 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.91 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.65 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 436.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -180.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4805.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 839.6 MB in the end (delta: 275.9 MB). Peak memory consumption was 275.9 MB. Max. memory is 11.5 GB. * Witness Printer took 10.05 ms. Allocated memory is still 1.2 GB. Free memory is still 839.6 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 #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x + -4 * i + unknown-#length-unknown[x] and consists of 5 locations. One deterministic module has affine ranking function -1 * x + -4 * i + unknown-#length-unknown[x] and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.7s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 3.8s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 11 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 32 SDtfs, 30 SDslu, 30 SDs, 0 SdLazy, 26 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital113 mio100 ax100 hnf99 lsp92 ukn85 mio100 lsp63 div100 bol100 ite100 ukn100 eq165 hnf90 smp92 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 14ms VariablesStem: 3 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...