./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/elevator_spec1_product26_false-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f 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/product-lines/elevator_spec1_product26_false-unreach-call_true-termination.cil.c -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 8958acb8be518dc5a56d099948b13d270d783832 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 03:58:19,379 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 03:58:19,381 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 03:58:19,394 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 03:58:19,395 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 03:58:19,396 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 03:58:19,397 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 03:58:19,400 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 03:58:19,401 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 03:58:19,402 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 03:58:19,403 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 03:58:19,404 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 03:58:19,405 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 03:58:19,406 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 03:58:19,407 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 03:58:19,408 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 03:58:19,409 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 03:58:19,411 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 03:58:19,413 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 03:58:19,415 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 03:58:19,416 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 03:58:19,418 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 03:58:19,421 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 03:58:19,421 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 03:58:19,421 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 03:58:19,422 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 03:58:19,424 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 03:58:19,425 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 03:58:19,425 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 03:58:19,427 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 03:58:19,427 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 03:58:19,428 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 03:58:19,428 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 03:58:19,429 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 03:58:19,430 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 03:58:19,431 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 03:58:19,431 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 03:58:19,466 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 03:58:19,469 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 03:58:19,471 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 03:58:19,471 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 03:58:19,471 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 03:58:19,471 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 03:58:19,472 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 03:58:19,473 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 03:58:19,473 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 03:58:19,474 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 03:58:19,474 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 03:58:19,474 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 03:58:19,475 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 03:58:19,475 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 03:58:19,475 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 03:58:19,476 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 03:58:19,476 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 03:58:19,476 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 03:58:19,476 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 03:58:19,476 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 03:58:19,477 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 03:58:19,479 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 03:58:19,479 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 03:58:19,479 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 03:58:19,480 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 03:58:19,480 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 03:58:19,481 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 03:58:19,481 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 03:58:19,481 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 03:58:19,481 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 03:58:19,481 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 03:58:19,484 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 03:58:19,485 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 -> 8958acb8be518dc5a56d099948b13d270d783832 [2019-01-14 03:58:19,537 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 03:58:19,553 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 03:58:19,557 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 03:58:19,558 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 03:58:19,558 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 03:58:19,560 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/elevator_spec1_product26_false-unreach-call_true-termination.cil.c [2019-01-14 03:58:19,615 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08b716d10/99d2b582398e440394bcace5d856c520/FLAGce5fec193 [2019-01-14 03:58:20,231 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 03:58:20,232 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/elevator_spec1_product26_false-unreach-call_true-termination.cil.c [2019-01-14 03:58:20,254 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08b716d10/99d2b582398e440394bcace5d856c520/FLAGce5fec193 [2019-01-14 03:58:20,409 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08b716d10/99d2b582398e440394bcace5d856c520 [2019-01-14 03:58:20,413 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 03:58:20,415 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 03:58:20,416 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 03:58:20,416 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 03:58:20,420 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 03:58:20,422 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:58:20" (1/1) ... [2019-01-14 03:58:20,425 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bac3717 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:58:20, skipping insertion in model container [2019-01-14 03:58:20,425 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:58:20" (1/1) ... [2019-01-14 03:58:20,434 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 03:58:20,519 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 03:58:21,262 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 03:58:21,378 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 03:58:21,568 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 03:58:21,647 INFO L195 MainTranslator]: Completed translation [2019-01-14 03:58:21,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:58:21 WrapperNode [2019-01-14 03:58:21,648 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 03:58:21,650 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 03:58:21,650 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 03:58:21,650 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 03:58:21,660 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:58:21" (1/1) ... [2019-01-14 03:58:21,716 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:58:21" (1/1) ... [2019-01-14 03:58:22,046 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 03:58:22,048 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 03:58:22,048 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 03:58:22,048 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 03:58:22,065 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:58:21" (1/1) ... [2019-01-14 03:58:22,065 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:58:21" (1/1) ... [2019-01-14 03:58:22,127 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:58:21" (1/1) ... [2019-01-14 03:58:22,130 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:58:21" (1/1) ... [2019-01-14 03:58:22,256 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:58:21" (1/1) ... [2019-01-14 03:58:22,404 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:58:21" (1/1) ... [2019-01-14 03:58:22,437 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:58:21" (1/1) ... [2019-01-14 03:58:22,494 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 03:58:22,495 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 03:58:22,495 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 03:58:22,495 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 03:58:22,496 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:58:21" (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-14 03:58:22,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 03:58:22,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-14 03:58:22,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 03:58:22,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 03:58:37,353 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 03:58:37,354 INFO L286 CfgBuilder]: Removed 1089 assue(true) statements. [2019-01-14 03:58:37,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:58:37 BoogieIcfgContainer [2019-01-14 03:58:37,357 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 03:58:37,358 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 03:58:37,358 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 03:58:37,361 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 03:58:37,362 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 03:58:37,362 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 03:58:20" (1/3) ... [2019-01-14 03:58:37,363 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2728ec04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 03:58:37, skipping insertion in model container [2019-01-14 03:58:37,363 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 03:58:37,363 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:58:21" (2/3) ... [2019-01-14 03:58:37,364 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2728ec04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 03:58:37, skipping insertion in model container [2019-01-14 03:58:37,364 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 03:58:37,364 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:58:37" (3/3) ... [2019-01-14 03:58:37,366 INFO L375 chiAutomizerObserver]: Analyzing ICFG elevator_spec1_product26_false-unreach-call_true-termination.cil.c [2019-01-14 03:58:37,427 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 03:58:37,429 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 03:58:37,429 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 03:58:37,429 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 03:58:37,429 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 03:58:37,429 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 03:58:37,429 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 03:58:37,429 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 03:58:37,429 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 03:58:37,524 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4794 states. [2019-01-14 03:58:37,682 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2357 [2019-01-14 03:58:37,682 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:58:37,682 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:58:37,702 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:58:37,702 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:58:37,702 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 03:58:37,703 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4794 states. [2019-01-14 03:58:37,759 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2357 [2019-01-14 03:58:37,759 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:58:37,760 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:58:37,763 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:58:37,763 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:58:37,771 INFO L794 eck$LassoCheckResult]: Stem: 2805#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~weight~0 := 0;~maximumWeight~0 := 100;~blocked~0 := 0;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0;call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(10);call #t~string49.base, #t~string49.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string49.base, #t~string49.offset, 1);call write~init~int(95, #t~string49.base, 1 + #t~string49.offset, 1);call write~init~int(93, #t~string49.base, 2 + #t~string49.offset, 1);call write~init~int(0, #t~string49.base, 3 + #t~string49.offset, 1);call #t~string51.base, #t~string51.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string51.base, #t~string51.offset, 1);call write~init~int(93, #t~string51.base, 1 + #t~string51.offset, 1);call write~init~int(32, #t~string51.base, 2 + #t~string51.offset, 1);call write~init~int(0, #t~string51.base, 3 + #t~string51.offset, 1);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(5);call write~init~int(32, #t~string53.base, #t~string53.offset, 1);call write~init~int(97, #t~string53.base, 1 + #t~string53.offset, 1);call write~init~int(116, #t~string53.base, 2 + #t~string53.offset, 1);call write~init~int(32, #t~string53.base, 3 + #t~string53.offset, 1);call write~init~int(0, #t~string53.base, 4 + #t~string53.offset, 1);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string55.base, #t~string55.offset, 1);call write~init~int(105, #t~string55.base, 1 + #t~string55.offset, 1);call write~init~int(0, #t~string55.base, 2 + #t~string55.offset, 1);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(10);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string59.base, #t~string59.offset, 1);call write~init~int(112, #t~string59.base, 1 + #t~string59.offset, 1);call write~init~int(0, #t~string59.base, 2 + #t~string59.offset, 1);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string61.base, #t~string61.offset, 1);call write~init~int(111, #t~string61.base, 1 + #t~string61.offset, 1);call write~init~int(119, #t~string61.base, 2 + #t~string61.offset, 1);call write~init~int(110, #t~string61.base, 3 + #t~string61.offset, 1);call write~init~int(0, #t~string61.base, 4 + #t~string61.offset, 1);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string63.base, #t~string63.offset, 1);call write~init~int(73, #t~string63.base, 1 + #t~string63.offset, 1);call write~init~int(76, #t~string63.base, 2 + #t~string63.offset, 1);call write~init~int(95, #t~string63.base, 3 + #t~string63.offset, 1);call write~init~int(112, #t~string63.base, 4 + #t~string63.offset, 1);call write~init~int(58, #t~string63.base, 5 + #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 6 + #t~string63.offset, 1);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string65.base, #t~string65.offset, 1);call write~init~int(37, #t~string65.base, 1 + #t~string65.offset, 1);call write~init~int(105, #t~string65.base, 2 + #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 3 + #t~string65.offset, 1);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string67.base, #t~string67.offset, 1);call write~init~int(37, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(105, #t~string67.base, 2 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 3 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string69.base, #t~string69.offset, 1);call write~init~int(37, #t~string69.base, 1 + #t~string69.offset, 1);call write~init~int(105, #t~string69.base, 2 + #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 3 + #t~string69.offset, 1);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string71.base, #t~string71.offset, 1);call write~init~int(37, #t~string71.base, 1 + #t~string71.offset, 1);call write~init~int(105, #t~string71.base, 2 + #t~string71.offset, 1);call write~init~int(0, #t~string71.base, 3 + #t~string71.offset, 1);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string73.base, #t~string73.offset, 1);call write~init~int(37, #t~string73.base, 1 + #t~string73.offset, 1);call write~init~int(105, #t~string73.base, 2 + #t~string73.offset, 1);call write~init~int(0, #t~string73.base, 3 + #t~string73.offset, 1);call #t~string75.base, #t~string75.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string75.base, #t~string75.offset, 1);call write~init~int(70, #t~string75.base, 1 + #t~string75.offset, 1);call write~init~int(95, #t~string75.base, 2 + #t~string75.offset, 1);call write~init~int(112, #t~string75.base, 3 + #t~string75.offset, 1);call write~init~int(58, #t~string75.base, 4 + #t~string75.offset, 1);call write~init~int(0, #t~string75.base, 5 + #t~string75.offset, 1);call #t~string78.base, #t~string78.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string78.base, #t~string78.offset, 1);call write~init~int(37, #t~string78.base, 1 + #t~string78.offset, 1);call write~init~int(105, #t~string78.base, 2 + #t~string78.offset, 1);call write~init~int(0, #t~string78.base, 3 + #t~string78.offset, 1);call #t~string81.base, #t~string81.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string81.base, #t~string81.offset, 1);call write~init~int(37, #t~string81.base, 1 + #t~string81.offset, 1);call write~init~int(105, #t~string81.base, 2 + #t~string81.offset, 1);call write~init~int(0, #t~string81.base, 3 + #t~string81.offset, 1);call #t~string84.base, #t~string84.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string84.base, #t~string84.offset, 1);call write~init~int(37, #t~string84.base, 1 + #t~string84.offset, 1);call write~init~int(105, #t~string84.base, 2 + #t~string84.offset, 1);call write~init~int(0, #t~string84.base, 3 + #t~string84.offset, 1);call #t~string87.base, #t~string87.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string87.base, #t~string87.offset, 1);call write~init~int(37, #t~string87.base, 1 + #t~string87.offset, 1);call write~init~int(105, #t~string87.base, 2 + #t~string87.offset, 1);call write~init~int(0, #t~string87.base, 3 + #t~string87.offset, 1);call #t~string90.base, #t~string90.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string90.base, #t~string90.offset, 1);call write~init~int(37, #t~string90.base, 1 + #t~string90.offset, 1);call write~init~int(105, #t~string90.base, 2 + #t~string90.offset, 1);call write~init~int(0, #t~string90.base, 3 + #t~string90.offset, 1);call #t~string92.base, #t~string92.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string92.base, #t~string92.offset, 1);call write~init~int(0, #t~string92.base, 1 + #t~string92.offset, 1);call #t~string95.base, #t~string95.offset := #Ultimate.allocOnStack(9);~head~0.base, ~head~0.offset := 0, 0;call #t~string115.base, #t~string115.offset := #Ultimate.allocOnStack(30);call #t~string116.base, #t~string116.offset := #Ultimate.allocOnStack(9);call #t~string117.base, #t~string117.offset := #Ultimate.allocOnStack(21);call #t~string118.base, #t~string118.offset := #Ultimate.allocOnStack(30);call #t~string119.base, #t~string119.offset := #Ultimate.allocOnStack(9);call #t~string120.base, #t~string120.offset := #Ultimate.allocOnStack(21);call #t~string124.base, #t~string124.offset := #Ultimate.allocOnStack(30);call #t~string125.base, #t~string125.offset := #Ultimate.allocOnStack(9);call #t~string126.base, #t~string126.offset := #Ultimate.allocOnStack(25);call #t~string127.base, #t~string127.offset := #Ultimate.allocOnStack(30);call #t~string128.base, #t~string128.offset := #Ultimate.allocOnStack(9);call #t~string129.base, #t~string129.offset := #Ultimate.allocOnStack(25);~cleanupTimeShifts~0 := 12;~landingButtons_spc1_0~0 := 0;~landingButtons_spc1_1~0 := 0;~landingButtons_spc1_2~0 := 0;~landingButtons_spc1_3~0 := 0;~landingButtons_spc1_4~0 := 0;~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0; 3872#L-1true havoc main_#res;havoc main_#t~ret158, main_~retValue_acc~22, main_~tmp~27;havoc main_~retValue_acc~22;havoc main_~tmp~27; 3217#L1974true havoc valid_product_#res;havoc valid_product_~retValue_acc~17;havoc valid_product_~retValue_acc~17;valid_product_~retValue_acc~17 := 1;valid_product_#res := valid_product_~retValue_acc~17; 1580#L1982true main_#t~ret158 := valid_product_#res;main_~tmp~27 := main_#t~ret158;havoc main_#t~ret158; 1190#L2717true assume 0 != main_~tmp~27; 1348#L2692true ~landingButtons_spc1_0~0 := 0;~landingButtons_spc1_1~0 := 0;~landingButtons_spc1_2~0 := 0;~landingButtons_spc1_3~0 := 0;~landingButtons_spc1_4~0 := 0; 4303#L2214true havoc bigMacCall_#t~ret151, bigMacCall_~tmp~24;havoc bigMacCall_~tmp~24;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~19;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~19; 4419#L2124true assume 0 == getOrigin_~person;getOrigin_~retValue_acc~19 := 4;getOrigin_#res := getOrigin_~retValue_acc~19; 3267#L2149true bigMacCall_#t~ret151 := getOrigin_#res;bigMacCall_~tmp~24 := bigMacCall_#t~ret151;havoc bigMacCall_#t~ret151;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~24;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 4336#L3097true assume 0 == initPersonOnFloor_~floor; 4144#L3098true assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 3201#L3205-1true callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID, callOnFloor_~__utac__ad__arg1~0;callOnFloor_~floorID := callOnFloor_#in~floorID;havoc callOnFloor_~__utac__ad__arg1~0;callOnFloor_~__utac__ad__arg1~0 := callOnFloor_~floorID;__utac_acc__Specification1_spec__2_#in~floor := callOnFloor_~__utac__ad__arg1~0;havoc __utac_acc__Specification1_spec__2_~floor;__utac_acc__Specification1_spec__2_~floor := __utac_acc__Specification1_spec__2_#in~floor; 3017#L2221true assume 0 == __utac_acc__Specification1_spec__2_~floor;~landingButtons_spc1_0~0 := 1; 3346#L2233-2true assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 705#L2901-2true havoc angelinaCall_#t~ret148, angelinaCall_~tmp~21;havoc angelinaCall_~tmp~21;getOrigin_#in~person := 2;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~19;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~19; 4414#L2124-1true assume 0 == getOrigin_~person;getOrigin_~retValue_acc~19 := 4;getOrigin_#res := getOrigin_~retValue_acc~19; 3256#L2149-1true angelinaCall_#t~ret148 := getOrigin_#res;angelinaCall_~tmp~21 := angelinaCall_#t~ret148;havoc angelinaCall_#t~ret148;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 2, angelinaCall_~tmp~21;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 4339#L3097-1true assume 0 == initPersonOnFloor_~floor; 4142#L3098-2true assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 3200#L3205-3true callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID, callOnFloor_~__utac__ad__arg1~0;callOnFloor_~floorID := callOnFloor_#in~floorID;havoc callOnFloor_~__utac__ad__arg1~0;callOnFloor_~__utac__ad__arg1~0 := callOnFloor_~floorID;__utac_acc__Specification1_spec__2_#in~floor := callOnFloor_~__utac__ad__arg1~0;havoc __utac_acc__Specification1_spec__2_~floor;__utac_acc__Specification1_spec__2_~floor := __utac_acc__Specification1_spec__2_#in~floor; 3019#L2221-2true assume 0 == __utac_acc__Specification1_spec__2_~floor;~landingButtons_spc1_0~0 := 1; 3337#L2233-5true assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 709#L2901-5true havoc cleanup_#t~ret152, cleanup_#t~ret153, cleanup_~i~3, cleanup_~tmp~25, cleanup_~tmp___0~9, cleanup_~__cil_tmp4~2;havoc cleanup_~i~3;havoc cleanup_~tmp~25;havoc cleanup_~tmp___0~9;havoc cleanup_~__cil_tmp4~2;havoc timeShift_#t~ret46, timeShift_~tmp~10;havoc timeShift_~tmp~10;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~2;havoc areDoorsOpen_~retValue_acc~2;areDoorsOpen_~retValue_acc~2 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~2; 518#L326true timeShift_#t~ret46 := areDoorsOpen_#res;timeShift_~tmp~10 := timeShift_#t~ret46;havoc timeShift_#t~ret46; 400#L1209true assume 0 != timeShift_~tmp~10; 346#L1210true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 3445#L913-11true havoc __utac_acc__Specification1_spec__3_#t~ret139, __utac_acc__Specification1_spec__3_#t~ret140, __utac_acc__Specification1_spec__3_#t~ret141, __utac_acc__Specification1_spec__3_#t~ret142, __utac_acc__Specification1_spec__3_#t~ret143, __utac_acc__Specification1_spec__3_#t~ret144, __utac_acc__Specification1_spec__3_~floor~0, __utac_acc__Specification1_spec__3_~tmp~18, __utac_acc__Specification1_spec__3_~tmp___0~8, __utac_acc__Specification1_spec__3_~tmp___1~7, __utac_acc__Specification1_spec__3_~tmp___2~5, __utac_acc__Specification1_spec__3_~tmp___3~5, __utac_acc__Specification1_spec__3_~tmp___4~3;havoc __utac_acc__Specification1_spec__3_~floor~0;havoc __utac_acc__Specification1_spec__3_~tmp~18;havoc __utac_acc__Specification1_spec__3_~tmp___0~8;havoc __utac_acc__Specification1_spec__3_~tmp___1~7;havoc __utac_acc__Specification1_spec__3_~tmp___2~5;havoc __utac_acc__Specification1_spec__3_~tmp___3~5;havoc __utac_acc__Specification1_spec__3_~tmp___4~3;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~1;havoc getCurrentFloorID_~retValue_acc~1;getCurrentFloorID_~retValue_acc~1 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~1; 2083#L317true __utac_acc__Specification1_spec__3_#t~ret139 := getCurrentFloorID_#res;__utac_acc__Specification1_spec__3_~tmp~18 := __utac_acc__Specification1_spec__3_#t~ret139;havoc __utac_acc__Specification1_spec__3_#t~ret139;__utac_acc__Specification1_spec__3_~floor~0 := __utac_acc__Specification1_spec__3_~tmp~18; 1983#L2259true assume 0 == __utac_acc__Specification1_spec__3_~floor~0; 1910#L2260true assume 0 != ~landingButtons_spc1_0~0;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~2;havoc areDoorsOpen_~retValue_acc~2;areDoorsOpen_~retValue_acc~2 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~2; 519#L326-1true __utac_acc__Specification1_spec__3_#t~ret140 := areDoorsOpen_#res;__utac_acc__Specification1_spec__3_~tmp___4~3 := __utac_acc__Specification1_spec__3_#t~ret140;havoc __utac_acc__Specification1_spec__3_#t~ret140; 502#L2264true assume 0 != __utac_acc__Specification1_spec__3_~tmp___4~3;~landingButtons_spc1_0~0 := 0; 3507#L2319true cleanup_~i~3 := 0; 1928#L2524-2true [2019-01-14 03:58:37,772 INFO L796 eck$LassoCheckResult]: Loop: 1928#L2524-2true assume !false; 1731#L2525true cleanup_~__cil_tmp4~2 := ~cleanupTimeShifts~0 - 1; 532#L2528true assume cleanup_~i~3 < cleanup_~__cil_tmp4~2;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~0;havoc isBlocked_~retValue_acc~0;isBlocked_~retValue_acc~0 := ~blocked~0;isBlocked_#res := isBlocked_~retValue_acc~0; 1873#L144true cleanup_#t~ret152 := isBlocked_#res;cleanup_~tmp___0~9 := cleanup_#t~ret152;havoc cleanup_#t~ret152; 449#L2532true assume 1 != cleanup_~tmp___0~9; 446#L2532-1true havoc isIdle_#res;havoc isIdle_#t~ret8, isIdle_~retValue_acc~7, isIdle_~tmp~4;havoc isIdle_~retValue_acc~7;havoc isIdle_~tmp~4;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret3, anyStopRequested_#t~ret4, anyStopRequested_#t~ret5, anyStopRequested_#t~ret6, anyStopRequested_#t~ret7, anyStopRequested_~retValue_acc~6, anyStopRequested_~tmp~3, anyStopRequested_~tmp___0~0, anyStopRequested_~tmp___1~0, anyStopRequested_~tmp___2~0, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~6;havoc anyStopRequested_~tmp~3;havoc anyStopRequested_~tmp___0~0;havoc anyStopRequested_~tmp___1~0;havoc anyStopRequested_~tmp___2~0;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~23;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~23; 3769#L2822-42true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~23 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~23; 3301#L2849-42true anyStopRequested_#t~ret3 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret3;havoc anyStopRequested_#t~ret3; 1152#L425true assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~6 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~6; 1388#L489true isIdle_#t~ret8 := anyStopRequested_#res;isIdle_~tmp~4 := isIdle_#t~ret8;havoc isIdle_#t~ret8;isIdle_~retValue_acc~7 := (if 0 == isIdle_~tmp~4 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~7; 527#L502true cleanup_#t~ret153 := isIdle_#res;cleanup_~tmp~25 := cleanup_#t~ret153;havoc cleanup_#t~ret153; 812#L2544true assume !(0 != cleanup_~tmp~25);havoc timeShift_#t~ret46, timeShift_~tmp~10;havoc timeShift_~tmp~10;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~2;havoc areDoorsOpen_~retValue_acc~2;areDoorsOpen_~retValue_acc~2 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~2; 507#L326-6true timeShift_#t~ret46 := areDoorsOpen_#res;timeShift_~tmp~10 := timeShift_#t~ret46;havoc timeShift_#t~ret46; 402#L1209-1true assume 0 != timeShift_~tmp~10; 329#L1210-2true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 3418#L913-23true havoc __utac_acc__Specification1_spec__3_#t~ret139, __utac_acc__Specification1_spec__3_#t~ret140, __utac_acc__Specification1_spec__3_#t~ret141, __utac_acc__Specification1_spec__3_#t~ret142, __utac_acc__Specification1_spec__3_#t~ret143, __utac_acc__Specification1_spec__3_#t~ret144, __utac_acc__Specification1_spec__3_~floor~0, __utac_acc__Specification1_spec__3_~tmp~18, __utac_acc__Specification1_spec__3_~tmp___0~8, __utac_acc__Specification1_spec__3_~tmp___1~7, __utac_acc__Specification1_spec__3_~tmp___2~5, __utac_acc__Specification1_spec__3_~tmp___3~5, __utac_acc__Specification1_spec__3_~tmp___4~3;havoc __utac_acc__Specification1_spec__3_~floor~0;havoc __utac_acc__Specification1_spec__3_~tmp~18;havoc __utac_acc__Specification1_spec__3_~tmp___0~8;havoc __utac_acc__Specification1_spec__3_~tmp___1~7;havoc __utac_acc__Specification1_spec__3_~tmp___2~5;havoc __utac_acc__Specification1_spec__3_~tmp___3~5;havoc __utac_acc__Specification1_spec__3_~tmp___4~3;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~1;havoc getCurrentFloorID_~retValue_acc~1;getCurrentFloorID_~retValue_acc~1 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~1; 2087#L317-1true __utac_acc__Specification1_spec__3_#t~ret139 := getCurrentFloorID_#res;__utac_acc__Specification1_spec__3_~tmp~18 := __utac_acc__Specification1_spec__3_#t~ret139;havoc __utac_acc__Specification1_spec__3_#t~ret139;__utac_acc__Specification1_spec__3_~floor~0 := __utac_acc__Specification1_spec__3_~tmp~18; 1987#L2259-1true assume 0 == __utac_acc__Specification1_spec__3_~floor~0; 1909#L2260-1true assume 0 != ~landingButtons_spc1_0~0;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~2;havoc areDoorsOpen_~retValue_acc~2;areDoorsOpen_~retValue_acc~2 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~2; 510#L326-7true __utac_acc__Specification1_spec__3_#t~ret140 := areDoorsOpen_#res;__utac_acc__Specification1_spec__3_~tmp___4~3 := __utac_acc__Specification1_spec__3_#t~ret140;havoc __utac_acc__Specification1_spec__3_#t~ret140; 504#L2264-2true assume 0 != __utac_acc__Specification1_spec__3_~tmp___4~3;~landingButtons_spc1_0~0 := 0; 3495#L2319-1true cleanup_~i~3 := 1 + cleanup_~i~3; 1928#L2524-2true [2019-01-14 03:58:37,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:58:37,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1118301076, now seen corresponding path program 1 times [2019-01-14 03:58:37,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:58:37,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:58:37,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:58:37,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:58:37,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:58:37,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:58:38,181 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-14 03:58:38,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:58:38,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 03:58:38,190 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 03:58:38,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:58:38,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1174166185, now seen corresponding path program 1 times [2019-01-14 03:58:38,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:58:38,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:58:38,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:58:38,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:58:38,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:58:38,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:58:38,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:58:39,049 WARN L181 SmtUtils]: Spent 787.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 84 [2019-01-14 03:58:39,536 WARN L181 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2019-01-14 03:58:39,547 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:58:39,549 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:58:39,549 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:58:39,549 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:58:39,549 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 03:58:39,549 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:58:39,549 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:58:39,550 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:58:39,550 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec1_product26_false-unreach-call_true-termination.cil.c_Iteration1_Loop [2019-01-14 03:58:39,550 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:58:39,550 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:58:39,581 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-14 03:58:39,616 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-14 03:58:39,650 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-14 03:58:39,676 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-14 03:58:39,767 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-14 03:58:39,795 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-14 03:58:39,824 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-14 03:58:39,847 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-14 03:58:39,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:39,899 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-14 03:58:39,925 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-14 03:58:40,043 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-14 03:58:40,044 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-14 03:58:40,049 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-14 03:58:40,052 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-14 03:58:40,055 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-14 03:58:40,062 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-14 03:58:40,082 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-14 03:58:40,085 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-14 03:58:40,100 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-14 03:58:40,103 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-14 03:58:40,113 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-14 03:58:40,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:40,117 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-14 03:58:40,120 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-14 03:58:40,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:40,150 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-14 03:58:40,158 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-14 03:58:40,173 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-14 03:58:40,175 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-14 03:58:40,176 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-14 03:58:40,177 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-14 03:58:40,184 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-14 03:58:40,187 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-14 03:58:40,189 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-14 03:58:40,728 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-14 03:58:40,897 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:58:40,898 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:58:40,905 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:58:40,905 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:58:40,926 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:58:40,926 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification1_spec__3_#t~ret140=0} Honda state: {ULTIMATE.start___utac_acc__Specification1_spec__3_#t~ret140=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:58:40,953 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:58:40,954 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:58:40,960 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:58:40,960 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification1_spec__3_~tmp___0~8=0} Honda state: {ULTIMATE.start___utac_acc__Specification1_spec__3_~tmp___0~8=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:58:40,994 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:58:40,994 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:58:40,997 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:58:40,998 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification1_spec__3_#t~ret139=0} Honda state: {ULTIMATE.start___utac_acc__Specification1_spec__3_#t~ret139=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:58:41,020 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:58:41,020 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:58:41,035 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:58:41,035 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_isIdle_#res=0, ULTIMATE.start_isIdle_~retValue_acc~7=0} Honda state: {ULTIMATE.start_isIdle_#res=0, ULTIMATE.start_isIdle_~retValue_acc~7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 03:58:41,081 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:58:41,082 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:58:41,095 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:58:41,096 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification1_spec__3_~tmp___2~5=0} Honda state: {ULTIMATE.start___utac_acc__Specification1_spec__3_~tmp___2~5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 03:58:41,141 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:58:41,141 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:58:41,155 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:58:41,156 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_cleanup_#t~ret153=0} Honda state: {ULTIMATE.start_cleanup_#t~ret153=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:58:41,183 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:58:41,184 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:58:41,193 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:58:41,194 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_~tmp___1~0=0} Honda state: {ULTIMATE.start_anyStopRequested_~tmp___1~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:58:41,215 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:58:41,216 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:58:41,229 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:58:41,230 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_cleanup_#t~ret152=0} Honda state: {ULTIMATE.start_cleanup_#t~ret152=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:58:41,266 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:58:41,266 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:58:41,280 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:58:41,281 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification1_spec__3_#t~ret142=0} Honda state: {ULTIMATE.start___utac_acc__Specification1_spec__3_#t~ret142=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 03:58:41,319 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:58:41,319 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:58:41,331 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:58:41,332 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification1_spec__3_~tmp___1~7=0} Honda state: {ULTIMATE.start___utac_acc__Specification1_spec__3_~tmp___1~7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:58:41,355 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:58:41,356 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:58:41,365 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:58:41,366 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_getCurrentFloorID_#res=0, ~currentFloorID~0=0, ULTIMATE.start_getCurrentFloorID_~retValue_acc~1=0, ULTIMATE.start___utac_acc__Specification1_spec__3_~floor~0=0, ULTIMATE.start___utac_acc__Specification1_spec__3_~tmp~18=0} Honda state: {ULTIMATE.start_getCurrentFloorID_#res=0, ~currentFloorID~0=0, ULTIMATE.start_getCurrentFloorID_~retValue_acc~1=0, ULTIMATE.start___utac_acc__Specification1_spec__3_~floor~0=0, ULTIMATE.start___utac_acc__Specification1_spec__3_~tmp~18=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:58:41,388 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:58:41,389 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:58:41,396 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:58:41,396 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_isFloorCalling_#in~floorID=0, ULTIMATE.start_isFloorCalling_~floorID=0} Honda state: {ULTIMATE.start_isFloorCalling_#in~floorID=0, ULTIMATE.start_isFloorCalling_~floorID=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:58:41,418 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:58:41,419 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:58:41,440 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:58:41,441 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~weight~0=1, ~maximumWeight~0=0} Honda state: {~weight~0=1, ~maximumWeight~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:58:41,556 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:58:41,557 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:58:41,570 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:58:41,571 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_~tmp___2~0=0} Honda state: {ULTIMATE.start_anyStopRequested_~tmp___2~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 03:58:41,601 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:58:41,601 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:58:41,613 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:58:41,614 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification1_spec__3_#t~ret143=0} Honda state: {ULTIMATE.start___utac_acc__Specification1_spec__3_#t~ret143=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:58:41,635 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:58:41,635 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:58:41,645 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:58:41,645 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_isFloorCalling_#res=-8, ~calls_0~0=-8, ULTIMATE.start_anyStopRequested_~tmp___3~0=-8, ULTIMATE.start_isFloorCalling_~retValue_acc~23=-8} Honda state: {ULTIMATE.start_isFloorCalling_#res=-8, ~calls_0~0=-8, ULTIMATE.start_anyStopRequested_~tmp___3~0=-8, ULTIMATE.start_isFloorCalling_~retValue_acc~23=-8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:58:41,668 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:58:41,668 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:58:41,671 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:58:41,671 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification1_spec__3_#t~ret144=0} Honda state: {ULTIMATE.start___utac_acc__Specification1_spec__3_#t~ret144=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:58:41,692 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:58:41,692 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:58:41,717 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 03:58:41,717 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:58:42,351 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 03:58:42,354 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:58:42,354 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:58:42,354 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:58:42,354 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:58:42,354 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 03:58:42,354 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:58:42,354 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:58:42,355 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:58:42,355 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec1_product26_false-unreach-call_true-termination.cil.c_Iteration1_Loop [2019-01-14 03:58:42,355 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:58:42,355 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:58:42,359 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-14 03:58:42,370 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-14 03:58:42,382 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-14 03:58:42,385 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-14 03:58:42,389 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-14 03:58:42,390 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-14 03:58:42,393 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-14 03:58:42,395 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-14 03:58:42,397 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-14 03:58:42,398 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-14 03:58:42,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-14 03:58:42,404 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-14 03:58:42,529 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-14 03:58:42,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:42,568 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-14 03:58:42,594 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-14 03:58:42,620 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-14 03:58:42,646 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-14 03:58:42,726 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-14 03:58:42,740 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-14 03:58:42,741 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-14 03:58:42,743 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-14 03:58:42,751 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-14 03:58:42,754 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-14 03:58:42,757 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-14 03:58:42,759 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-14 03:58:42,774 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-14 03:58:42,776 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-14 03:58:42,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:42,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:42,817 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-14 03:58:42,837 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-14 03:58:42,838 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-14 03:58:42,840 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-14 03:58:42,841 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-14 03:58:43,026 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-14 03:58:43,328 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-14 03:58:43,595 WARN L181 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-14 03:58:43,810 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-14 03:58:44,020 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-14 03:58:44,333 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:58:44,339 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 03:58:44,341 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-14 03:58:44,343 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:58:44,343 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:58:44,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:58:44,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:58:44,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:58:44,349 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:58:44,349 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:58:44,352 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:58:44,353 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-14 03:58:44,353 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:58:44,353 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:58:44,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:58:44,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:58:44,357 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:58:44,357 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:58:44,358 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:58:44,361 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:58:44,361 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-14 03:58:44,362 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:58:44,362 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:58:44,362 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:58:44,362 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:58:44,362 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:58:44,365 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:58:44,366 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:58:44,367 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:58:44,368 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-14 03:58:44,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:58:44,369 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:58:44,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:58:44,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:58:44,371 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:58:44,371 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:58:44,371 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:58:44,374 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:58:44,374 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-14 03:58:44,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:58:44,375 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:58:44,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:58:44,375 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:58:44,375 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:58:44,375 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:58:44,376 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:58:44,376 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:58:44,380 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-14 03:58:44,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:58:44,381 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:58:44,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:58:44,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:58:44,381 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:58:44,384 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:58:44,385 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:58:44,386 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:58:44,386 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-14 03:58:44,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:58:44,388 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:58:44,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:58:44,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:58:44,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:58:44,390 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:58:44,390 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:58:44,395 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:58:44,396 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-14 03:58:44,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:58:44,396 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:58:44,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:58:44,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:58:44,398 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:58:44,398 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:58:44,399 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:58:44,401 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:58:44,401 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-14 03:58:44,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:58:44,402 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:58:44,404 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:58:44,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:58:44,405 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:58:44,406 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:58:44,406 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:58:44,411 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:58:44,411 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-14 03:58:44,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:58:44,412 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:58:44,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:58:44,412 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:58:44,412 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:58:44,415 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:58:44,416 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:58:44,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:58:44,418 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-14 03:58:44,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:58:44,418 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:58:44,419 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:58:44,419 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:58:44,419 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:58:44,419 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:58:44,420 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:58:44,422 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:58:44,424 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-14 03:58:44,424 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:58:44,425 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:58:44,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:58:44,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:58:44,427 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:58:44,429 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:58:44,429 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:58:44,432 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:58:44,432 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-14 03:58:44,433 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:58:44,433 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:58:44,433 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:58:44,433 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:58:44,433 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:58:44,434 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:58:44,434 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:58:44,438 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:58:44,439 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-14 03:58:44,439 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:58:44,439 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:58:44,439 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:58:44,440 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:58:44,442 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:58:44,442 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:58:44,443 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:58:44,444 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:58:44,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-14 03:58:44,446 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:58:44,446 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:58:44,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:58:44,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:58:44,446 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:58:44,447 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:58:44,449 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:58:44,450 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:58:44,451 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-14 03:58:44,451 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:58:44,452 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:58:44,452 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:58:44,452 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:58:44,452 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:58:44,452 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:58:44,452 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:58:44,456 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:58:44,457 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-14 03:58:44,457 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:58:44,458 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:58:44,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:58:44,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:58:44,460 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:58:44,460 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:58:44,461 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:58:44,467 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 03:58:44,475 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 03:58:44,475 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 03:58:44,478 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 03:58:44,478 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 03:58:44,478 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 03:58:44,479 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~cleanupTimeShifts~0, ULTIMATE.start_cleanup_~i~3) = 1*~cleanupTimeShifts~0 - 1*ULTIMATE.start_cleanup_~i~3 Supporting invariants [] [2019-01-14 03:58:44,482 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 03:58:44,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:58:44,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:58:44,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:58:44,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:58:44,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:58:44,975 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-14 03:58:44,996 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-14 03:58:44,998 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 4794 states. Second operand 5 states. [2019-01-14 03:58:45,939 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 4794 states.. Second operand 5 states. Result 7211 states and 13587 transitions. Complement of second has 9 states. [2019-01-14 03:58:45,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 03:58:45,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 03:58:45,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9102 transitions. [2019-01-14 03:58:45,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 9102 transitions. Stem has 33 letters. Loop has 22 letters. [2019-01-14 03:58:45,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:58:45,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 9102 transitions. Stem has 55 letters. Loop has 22 letters. [2019-01-14 03:58:45,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:58:45,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 9102 transitions. Stem has 33 letters. Loop has 44 letters. [2019-01-14 03:58:45,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:58:45,965 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7211 states and 13587 transitions. [2019-01-14 03:58:46,053 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 03:58:46,057 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7211 states to 0 states and 0 transitions. [2019-01-14 03:58:46,059 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 03:58:46,059 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 03:58:46,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 03:58:46,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:58:46,060 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 03:58:46,061 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 03:58:46,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 03:58:46,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 03:58:46,069 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2019-01-14 03:58:46,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:58:46,073 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-14 03:58:46,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 03:58:46,074 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-14 03:58:46,074 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 03:58:46,074 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 03:58:46,074 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 03:58:46,074 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 03:58:46,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 03:58:46,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:58:46,075 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 03:58:46,075 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 03:58:46,075 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 03:58:46,075 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 03:58:46,075 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 03:58:46,075 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 03:58:46,076 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 03:58:46,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 03:58:46 BoogieIcfgContainer [2019-01-14 03:58:46,088 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 03:58:46,089 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 03:58:46,089 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 03:58:46,089 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 03:58:46,089 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:58:37" (3/4) ... [2019-01-14 03:58:46,097 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 03:58:46,097 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 03:58:46,098 INFO L168 Benchmark]: Toolchain (without parser) took 25684.10 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 524.8 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -108.2 MB). Peak memory consumption was 416.6 MB. Max. memory is 11.5 GB. [2019-01-14 03:58:46,100 INFO L168 Benchmark]: CDTParser took 0.18 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-14 03:58:46,101 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1232.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -144.0 MB). Peak memory consumption was 52.2 MB. Max. memory is 11.5 GB. [2019-01-14 03:58:46,102 INFO L168 Benchmark]: Boogie Procedure Inliner took 397.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.5 MB). Peak memory consumption was 47.5 MB. Max. memory is 11.5 GB. [2019-01-14 03:58:46,103 INFO L168 Benchmark]: Boogie Preprocessor took 446.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 40.7 MB). Peak memory consumption was 40.7 MB. Max. memory is 11.5 GB. [2019-01-14 03:58:46,104 INFO L168 Benchmark]: RCFGBuilder took 14862.45 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 197.7 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -145.1 MB). Peak memory consumption was 445.6 MB. Max. memory is 11.5 GB. [2019-01-14 03:58:46,106 INFO L168 Benchmark]: BuchiAutomizer took 8730.53 ms. Allocated memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: 197.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 92.7 MB). Peak memory consumption was 289.9 MB. Max. memory is 11.5 GB. [2019-01-14 03:58:46,107 INFO L168 Benchmark]: Witness Printer took 8.27 ms. Allocated memory is still 1.6 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 03:58:46,114 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.18 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 1232.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -144.0 MB). Peak memory consumption was 52.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 397.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.5 MB). Peak memory consumption was 47.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 446.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 40.7 MB). Peak memory consumption was 40.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 14862.45 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 197.7 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -145.1 MB). Peak memory consumption was 445.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8730.53 ms. Allocated memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: 197.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 92.7 MB). Peak memory consumption was 289.9 MB. Max. memory is 11.5 GB. * Witness Printer took 8.27 ms. Allocated memory is still 1.6 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * 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 cleanupTimeShifts + -1 * i and consists of 6 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.6s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 6.7s. Construction of modules took 0.1s. Büchi inclusion checks took 1.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 9068 SDtfs, 13520 SDslu, 4493 SDs, 0 SdLazy, 9 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital109 mio100 ax100 hnf100 lsp16 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq211 hnf89 smp100 dnf176 smp100 tf103 neg96 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 17 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...