./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/elevator_spec9_product31_true-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/product-lines/elevator_spec9_product31_true-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 8dd8d23e89400e7d41ca0a1d3482e52034eec047 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 23:25:12,525 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 23:25:12,528 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 23:25:12,540 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 23:25:12,541 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 23:25:12,542 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 23:25:12,544 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 23:25:12,546 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 23:25:12,548 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 23:25:12,549 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 23:25:12,549 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 23:25:12,550 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 23:25:12,551 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 23:25:12,552 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 23:25:12,554 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 23:25:12,554 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 23:25:12,555 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 23:25:12,557 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 23:25:12,559 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 23:25:12,562 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 23:25:12,563 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 23:25:12,564 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 23:25:12,567 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 23:25:12,567 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 23:25:12,568 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 23:25:12,569 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 23:25:12,570 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 23:25:12,571 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 23:25:12,572 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 23:25:12,573 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 23:25:12,573 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 23:25:12,574 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 23:25:12,574 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 23:25:12,575 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 23:25:12,576 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 23:25:12,577 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 23:25:12,578 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-01 23:25:12,610 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 23:25:12,610 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 23:25:12,611 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 23:25:12,612 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 23:25:12,612 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 23:25:12,612 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 23:25:12,612 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 23:25:12,612 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 23:25:12,612 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 23:25:12,614 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 23:25:12,614 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 23:25:12,614 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 23:25:12,614 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 23:25:12,614 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 23:25:12,615 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 23:25:12,615 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 23:25:12,615 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 23:25:12,615 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 23:25:12,616 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 23:25:12,616 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 23:25:12,616 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 23:25:12,616 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 23:25:12,616 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 23:25:12,616 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 23:25:12,617 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 23:25:12,617 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 23:25:12,617 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 23:25:12,617 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 23:25:12,617 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 23:25:12,620 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 23:25:12,620 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 23:25:12,621 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 23:25:12,621 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 -> 8dd8d23e89400e7d41ca0a1d3482e52034eec047 [2019-01-01 23:25:12,684 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 23:25:12,702 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 23:25:12,709 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 23:25:12,711 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 23:25:12,712 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 23:25:12,712 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/elevator_spec9_product31_true-unreach-call_true-termination.cil.c [2019-01-01 23:25:12,772 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80588e7c6/5d5d73a609aa435e9178622295a63e1f/FLAGb9a4da83c [2019-01-01 23:25:13,408 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 23:25:13,409 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/elevator_spec9_product31_true-unreach-call_true-termination.cil.c [2019-01-01 23:25:13,451 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80588e7c6/5d5d73a609aa435e9178622295a63e1f/FLAGb9a4da83c [2019-01-01 23:25:13,584 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80588e7c6/5d5d73a609aa435e9178622295a63e1f [2019-01-01 23:25:13,589 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 23:25:13,590 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 23:25:13,592 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 23:25:13,592 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 23:25:13,597 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 23:25:13,598 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:25:13" (1/1) ... [2019-01-01 23:25:13,602 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@133182c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:25:13, skipping insertion in model container [2019-01-01 23:25:13,602 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:25:13" (1/1) ... [2019-01-01 23:25:13,612 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 23:25:13,717 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 23:25:14,462 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:25:14,481 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 23:25:14,769 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:25:14,857 INFO L195 MainTranslator]: Completed translation [2019-01-01 23:25:14,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:25:14 WrapperNode [2019-01-01 23:25:14,859 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 23:25:14,860 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 23:25:14,860 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 23:25:14,860 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 23:25:14,871 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:25:14" (1/1) ... [2019-01-01 23:25:14,934 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:25:14" (1/1) ... [2019-01-01 23:25:15,215 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 23:25:15,215 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 23:25:15,216 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 23:25:15,216 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 23:25:15,228 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:25:14" (1/1) ... [2019-01-01 23:25:15,228 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:25:14" (1/1) ... [2019-01-01 23:25:15,256 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:25:14" (1/1) ... [2019-01-01 23:25:15,256 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:25:14" (1/1) ... [2019-01-01 23:25:15,353 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:25:14" (1/1) ... [2019-01-01 23:25:15,420 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:25:14" (1/1) ... [2019-01-01 23:25:15,440 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:25:14" (1/1) ... [2019-01-01 23:25:15,477 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 23:25:15,478 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 23:25:15,478 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 23:25:15,479 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 23:25:15,479 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:25:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:25:15,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 23:25:15,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-01 23:25:15,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 23:25:15,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 23:25:27,172 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 23:25:27,172 INFO L280 CfgBuilder]: Removed 881 assue(true) statements. [2019-01-01 23:25:27,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:25:27 BoogieIcfgContainer [2019-01-01 23:25:27,173 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 23:25:27,174 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 23:25:27,175 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 23:25:27,179 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 23:25:27,180 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:25:27,180 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 11:25:13" (1/3) ... [2019-01-01 23:25:27,181 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6c6871f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:25:27, skipping insertion in model container [2019-01-01 23:25:27,181 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:25:27,182 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:25:14" (2/3) ... [2019-01-01 23:25:27,182 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6c6871f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:25:27, skipping insertion in model container [2019-01-01 23:25:27,182 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:25:27,182 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:25:27" (3/3) ... [2019-01-01 23:25:27,184 INFO L375 chiAutomizerObserver]: Analyzing ICFG elevator_spec9_product31_true-unreach-call_true-termination.cil.c [2019-01-01 23:25:27,242 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 23:25:27,243 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 23:25:27,243 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 23:25:27,243 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 23:25:27,243 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 23:25:27,243 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 23:25:27,243 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 23:25:27,243 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 23:25:27,244 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 23:25:27,316 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3671 states. [2019-01-01 23:25:27,494 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1825 [2019-01-01 23:25:27,495 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:25:27,495 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:25:27,522 INFO L866 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, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:25:27,522 INFO L867 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:25:27,523 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 23:25:27,523 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3671 states. [2019-01-01 23:25:27,572 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1825 [2019-01-01 23:25:27,572 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:25:27,572 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:25:27,579 INFO L866 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, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:25:27,579 INFO L867 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:25:27,594 INFO L794 eck$LassoCheckResult]: Stem: 2093#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~cleanupTimeShifts~0 := 12;~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;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~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~string69.base, #t~string69.offset := #Ultimate.allocOnStack(10);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string71.base, #t~string71.offset, 1);call write~init~int(95, #t~string71.base, 1 + #t~string71.offset, 1);call write~init~int(93, #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(91, #t~string73.base, #t~string73.offset, 1);call write~init~int(93, #t~string73.base, 1 + #t~string73.offset, 1);call write~init~int(32, #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(5);call write~init~int(32, #t~string75.base, #t~string75.offset, 1);call write~init~int(97, #t~string75.base, 1 + #t~string75.offset, 1);call write~init~int(116, #t~string75.base, 2 + #t~string75.offset, 1);call write~init~int(32, #t~string75.base, 3 + #t~string75.offset, 1);call write~init~int(0, #t~string75.base, 4 + #t~string75.offset, 1);call #t~string77.base, #t~string77.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string77.base, #t~string77.offset, 1);call write~init~int(105, #t~string77.base, 1 + #t~string77.offset, 1);call write~init~int(0, #t~string77.base, 2 + #t~string77.offset, 1);call #t~string79.base, #t~string79.offset := #Ultimate.allocOnStack(10);call #t~string81.base, #t~string81.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string81.base, #t~string81.offset, 1);call write~init~int(112, #t~string81.base, 1 + #t~string81.offset, 1);call write~init~int(0, #t~string81.base, 2 + #t~string81.offset, 1);call #t~string83.base, #t~string83.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string83.base, #t~string83.offset, 1);call write~init~int(111, #t~string83.base, 1 + #t~string83.offset, 1);call write~init~int(119, #t~string83.base, 2 + #t~string83.offset, 1);call write~init~int(110, #t~string83.base, 3 + #t~string83.offset, 1);call write~init~int(0, #t~string83.base, 4 + #t~string83.offset, 1);call #t~string85.base, #t~string85.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string85.base, #t~string85.offset, 1);call write~init~int(73, #t~string85.base, 1 + #t~string85.offset, 1);call write~init~int(76, #t~string85.base, 2 + #t~string85.offset, 1);call write~init~int(95, #t~string85.base, 3 + #t~string85.offset, 1);call write~init~int(112, #t~string85.base, 4 + #t~string85.offset, 1);call write~init~int(58, #t~string85.base, 5 + #t~string85.offset, 1);call write~init~int(0, #t~string85.base, 6 + #t~string85.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~string89.base, #t~string89.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string89.base, #t~string89.offset, 1);call write~init~int(37, #t~string89.base, 1 + #t~string89.offset, 1);call write~init~int(105, #t~string89.base, 2 + #t~string89.offset, 1);call write~init~int(0, #t~string89.base, 3 + #t~string89.offset, 1);call #t~string91.base, #t~string91.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string91.base, #t~string91.offset, 1);call write~init~int(37, #t~string91.base, 1 + #t~string91.offset, 1);call write~init~int(105, #t~string91.base, 2 + #t~string91.offset, 1);call write~init~int(0, #t~string91.base, 3 + #t~string91.offset, 1);call #t~string93.base, #t~string93.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string93.base, #t~string93.offset, 1);call write~init~int(37, #t~string93.base, 1 + #t~string93.offset, 1);call write~init~int(105, #t~string93.base, 2 + #t~string93.offset, 1);call write~init~int(0, #t~string93.base, 3 + #t~string93.offset, 1);call #t~string95.base, #t~string95.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string95.base, #t~string95.offset, 1);call write~init~int(37, #t~string95.base, 1 + #t~string95.offset, 1);call write~init~int(105, #t~string95.base, 2 + #t~string95.offset, 1);call write~init~int(0, #t~string95.base, 3 + #t~string95.offset, 1);call #t~string97.base, #t~string97.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string97.base, #t~string97.offset, 1);call write~init~int(70, #t~string97.base, 1 + #t~string97.offset, 1);call write~init~int(95, #t~string97.base, 2 + #t~string97.offset, 1);call write~init~int(112, #t~string97.base, 3 + #t~string97.offset, 1);call write~init~int(58, #t~string97.base, 4 + #t~string97.offset, 1);call write~init~int(0, #t~string97.base, 5 + #t~string97.offset, 1);call #t~string100.base, #t~string100.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string100.base, #t~string100.offset, 1);call write~init~int(37, #t~string100.base, 1 + #t~string100.offset, 1);call write~init~int(105, #t~string100.base, 2 + #t~string100.offset, 1);call write~init~int(0, #t~string100.base, 3 + #t~string100.offset, 1);call #t~string103.base, #t~string103.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string103.base, #t~string103.offset, 1);call write~init~int(37, #t~string103.base, 1 + #t~string103.offset, 1);call write~init~int(105, #t~string103.base, 2 + #t~string103.offset, 1);call write~init~int(0, #t~string103.base, 3 + #t~string103.offset, 1);call #t~string106.base, #t~string106.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string106.base, #t~string106.offset, 1);call write~init~int(37, #t~string106.base, 1 + #t~string106.offset, 1);call write~init~int(105, #t~string106.base, 2 + #t~string106.offset, 1);call write~init~int(0, #t~string106.base, 3 + #t~string106.offset, 1);call #t~string109.base, #t~string109.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string109.base, #t~string109.offset, 1);call write~init~int(37, #t~string109.base, 1 + #t~string109.offset, 1);call write~init~int(105, #t~string109.base, 2 + #t~string109.offset, 1);call write~init~int(0, #t~string109.base, 3 + #t~string109.offset, 1);call #t~string112.base, #t~string112.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string112.base, #t~string112.offset, 1);call write~init~int(37, #t~string112.base, 1 + #t~string112.offset, 1);call write~init~int(105, #t~string112.base, 2 + #t~string112.offset, 1);call write~init~int(0, #t~string112.base, 3 + #t~string112.offset, 1);call #t~string114.base, #t~string114.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string114.base, #t~string114.offset, 1);call write~init~int(0, #t~string114.base, 1 + #t~string114.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string136.base, #t~string136.offset := #Ultimate.allocOnStack(30);call #t~string137.base, #t~string137.offset := #Ultimate.allocOnStack(9);call #t~string138.base, #t~string138.offset := #Ultimate.allocOnStack(21);call #t~string139.base, #t~string139.offset := #Ultimate.allocOnStack(30);call #t~string140.base, #t~string140.offset := #Ultimate.allocOnStack(9);call #t~string141.base, #t~string141.offset := #Ultimate.allocOnStack(21);call #t~string145.base, #t~string145.offset := #Ultimate.allocOnStack(30);call #t~string146.base, #t~string146.offset := #Ultimate.allocOnStack(9);call #t~string147.base, #t~string147.offset := #Ultimate.allocOnStack(25);call #t~string148.base, #t~string148.offset := #Ultimate.allocOnStack(30);call #t~string149.base, #t~string149.offset := #Ultimate.allocOnStack(9);call #t~string150.base, #t~string150.offset := #Ultimate.allocOnStack(25); 3155#L-1true havoc main_#res;havoc main_#t~ret166, main_~retValue_acc~31, main_~tmp~29;havoc main_~retValue_acc~31;havoc main_~tmp~29; 2070#L2753true havoc valid_product_#res;havoc valid_product_~retValue_acc~26;havoc valid_product_~retValue_acc~26;valid_product_~retValue_acc~26 := 1;valid_product_#res := valid_product_~retValue_acc~26; 2952#L2761true main_#t~ret166 := valid_product_#res;main_~tmp~29 := main_#t~ret166;havoc main_#t~ret166; 2826#L3468true assume 0 != main_~tmp~29; 3633#L3443true ~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 3188#L968true havoc bigMacCall_#t~ret159, bigMacCall_~tmp~26;havoc bigMacCall_~tmp~26;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~1;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~1; 3279#L85true assume 0 == getOrigin_~person;getOrigin_~retValue_acc~1 := 4;getOrigin_#res := getOrigin_~retValue_acc~1; 2105#L110true bigMacCall_#t~ret159 := getOrigin_#res;bigMacCall_~tmp~26 := bigMacCall_#t~ret159;havoc bigMacCall_#t~ret159;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~26;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 1619#L643true assume 0 == initPersonOnFloor_~floor; 1736#L644true assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 969#L751-1true callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 518#L435true assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 3560#L447-2true havoc cleanup_#t~ret160, cleanup_#t~ret161, cleanup_~i~3, cleanup_~tmp~27, cleanup_~tmp___0~12, cleanup_~__cil_tmp4~3;havoc cleanup_~i~3;havoc cleanup_~tmp~27;havoc cleanup_~tmp___0~12;havoc cleanup_~__cil_tmp4~3;havoc timeShift_#t~ret58, timeShift_#t~ret59, timeShift_#t~ret60, timeShift_#t~ret61, timeShift_#t~ret62, timeShift_#t~ret63, timeShift_#t~ret64, timeShift_#t~ret65, timeShift_#t~ret66, timeShift_#t~ret67, timeShift_#t~ret68, timeShift_~tmp~16, timeShift_~tmp___0~10, timeShift_~tmp___1~6, timeShift_~tmp___2~3, timeShift_~tmp___3~3, timeShift_~tmp___4~2, timeShift_~tmp___5~2, timeShift_~tmp___6~2, timeShift_~tmp___7~2, timeShift_~tmp___8~2, timeShift_~tmp___9~2;havoc timeShift_~tmp~16;havoc timeShift_~tmp___0~10;havoc timeShift_~tmp___1~6;havoc timeShift_~tmp___2~3;havoc timeShift_~tmp___3~3;havoc timeShift_~tmp___4~2;havoc timeShift_~tmp___5~2;havoc timeShift_~tmp___6~2;havoc timeShift_~tmp___7~2;havoc timeShift_~tmp___8~2;havoc timeShift_~tmp___9~2;havoc stopRequestedAtCurrentFloor_#res;havoc stopRequestedAtCurrentFloor_#t~ret42, stopRequestedAtCurrentFloor_#t~ret43, stopRequestedAtCurrentFloor_#t~ret44, stopRequestedAtCurrentFloor_#t~ret45, stopRequestedAtCurrentFloor_~retValue_acc~20, stopRequestedAtCurrentFloor_~tmp~14, stopRequestedAtCurrentFloor_~tmp___0~8;havoc stopRequestedAtCurrentFloor_~retValue_acc~20;havoc stopRequestedAtCurrentFloor_~tmp~14;havoc stopRequestedAtCurrentFloor_~tmp___0~8;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret116, isExecutiveFloorCalling_~retValue_acc~23;havoc isExecutiveFloorCalling_~retValue_acc~23;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~3;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~3; 2048#L372true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~3 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~3; 968#L399true isExecutiveFloorCalling_#t~ret116 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~23 := isExecutiveFloorCalling_#t~ret116;havoc isExecutiveFloorCalling_#t~ret116;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~23; 68#L2714true stopRequestedAtCurrentFloor_#t~ret42 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~14 := stopRequestedAtCurrentFloor_#t~ret42;havoc stopRequestedAtCurrentFloor_#t~ret42; 693#L2099true assume 0 != stopRequestedAtCurrentFloor_~tmp~14;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~7;havoc getCurrentFloorID_~retValue_acc~7;getCurrentFloorID_~retValue_acc~7 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~7; 1152#L1362true stopRequestedAtCurrentFloor_#t~ret43 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~8 := stopRequestedAtCurrentFloor_#t~ret43;havoc stopRequestedAtCurrentFloor_#t~ret43; 661#L2103true assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~8);stopRequestedAtCurrentFloor_~retValue_acc~20 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~20; 3148#L2116true timeShift_#t~ret58 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret58;havoc timeShift_#t~ret58; 883#L2251true assume !(0 != timeShift_~tmp___9~2); 1611#L2342true assume !(1 == ~doorState~0); 1602#L2342-2true stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret33, stopRequestedInDirection_#t~ret34, stopRequestedInDirection_#t~ret35, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~16, stopRequestedInDirection_~tmp~10, stopRequestedInDirection_~tmp___0~5, stopRequestedInDirection_~__cil_tmp7~0, stopRequestedInDirection_~__cil_tmp8~1;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~16;havoc stopRequestedInDirection_~tmp~10;havoc stopRequestedInDirection_~tmp___0~5;havoc stopRequestedInDirection_~__cil_tmp7~0;havoc stopRequestedInDirection_~__cil_tmp8~1;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret116, isExecutiveFloorCalling_~retValue_acc~23;havoc isExecutiveFloorCalling_~retValue_acc~23;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~3;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~3; 2056#L372-3true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~3 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~3; 953#L399-3true isExecutiveFloorCalling_#t~ret116 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~23 := isExecutiveFloorCalling_#t~ret116;havoc isExecutiveFloorCalling_#t~ret116;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~23; 39#L2714-1true stopRequestedInDirection_#t~ret33 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~5 := stopRequestedInDirection_#t~ret33;havoc stopRequestedInDirection_#t~ret33; 3357#L1954true assume 0 != stopRequestedInDirection_~tmp___0~5;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~7;havoc getCurrentFloorID_~retValue_acc~7;getCurrentFloorID_~retValue_acc~7 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~7; 1155#L1362-3true stopRequestedInDirection_#t~ret34 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~10 := stopRequestedInDirection_#t~ret34;havoc stopRequestedInDirection_#t~ret34;stopRequestedInDirection_~__cil_tmp7~0 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~1 := (if stopRequestedInDirection_~tmp~10 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~16 := (if stopRequestedInDirection_~__cil_tmp8~1 == stopRequestedInDirection_~__cil_tmp7~0 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~16; 2873#L1967true timeShift_#t~ret65 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret65;havoc timeShift_#t~ret65; 1236#L2350true assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret36, continueInDirection_~dir, continueInDirection_~tmp~11;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~11;~currentHeading~0 := continueInDirection_~dir; 695#L2011true assume !(1 == ~currentHeading~0); 3263#L2021true assume !(0 == ~currentFloorID~0); 3256#L2021-2true assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 3114#L2027-5true havoc __utac_acc__Specification9_spec__3_#t~ret6, __utac_acc__Specification9_spec__3_#t~ret7, __utac_acc__Specification9_spec__3_#t~ret8, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~2, __utac_acc__Specification9_spec__3_~tmp___0~2, __utac_acc__Specification9_spec__3_~tmp___1~2;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~2;havoc __utac_acc__Specification9_spec__3_~tmp___0~2;havoc __utac_acc__Specification9_spec__3_~tmp___1~2;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~7;havoc getCurrentFloorID_~retValue_acc~7;getCurrentFloorID_~retValue_acc~7 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~7; 1142#L1362-5true __utac_acc__Specification9_spec__3_#t~ret6 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~2 := __utac_acc__Specification9_spec__3_#t~ret6;havoc __utac_acc__Specification9_spec__3_#t~ret6;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~2;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~11;havoc isEmpty_~retValue_acc~11; 3460#L1422-6true assume 1 == ~persons_0~0;isEmpty_~retValue_acc~11 := 0;isEmpty_#res := isEmpty_~retValue_acc~11; 908#L1454-6true __utac_acc__Specification9_spec__3_#t~ret7 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~2 := __utac_acc__Specification9_spec__3_#t~ret7;havoc __utac_acc__Specification9_spec__3_#t~ret7; 1018#L1011true assume 0 != __utac_acc__Specification9_spec__3_~tmp___1~2;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 1595#L1021-1true cleanup_~i~3 := 0; 3366#L3275-2true [2019-01-01 23:25:27,595 INFO L796 eck$LassoCheckResult]: Loop: 3366#L3275-2true assume !false; 3344#L3276true cleanup_~__cil_tmp4~3 := ~cleanupTimeShifts~0 - 1; 2057#L3279true assume cleanup_~i~3 < cleanup_~__cil_tmp4~3;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~6;havoc isBlocked_~retValue_acc~6;isBlocked_~retValue_acc~6 := 0;isBlocked_#res := isBlocked_~retValue_acc~6; 1076#L1185true cleanup_#t~ret160 := isBlocked_#res;cleanup_~tmp___0~12 := cleanup_#t~ret160;havoc cleanup_#t~ret160; 1969#L3283true assume 1 != cleanup_~tmp___0~12; 1962#L3283-1true havoc isIdle_#res;havoc isIdle_#t~ret17, isIdle_~retValue_acc~13, isIdle_~tmp~7;havoc isIdle_~retValue_acc~13;havoc isIdle_~tmp~7;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret12, anyStopRequested_#t~ret13, anyStopRequested_#t~ret14, anyStopRequested_#t~ret15, anyStopRequested_#t~ret16, anyStopRequested_~retValue_acc~12, anyStopRequested_~tmp~6, anyStopRequested_~tmp___0~3, anyStopRequested_~tmp___1~3, anyStopRequested_~tmp___2~0, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~12;havoc anyStopRequested_~tmp~6;havoc anyStopRequested_~tmp___0~3;havoc anyStopRequested_~tmp___1~3;havoc anyStopRequested_~tmp___2~0;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~3;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~3; 2094#L372-65true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~3 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~3; 879#L399-65true anyStopRequested_#t~ret12 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret12;havoc anyStopRequested_#t~ret12; 1213#L1470true assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~12 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~12; 2335#L1534true isIdle_#t~ret17 := anyStopRequested_#res;isIdle_~tmp~7 := isIdle_#t~ret17;havoc isIdle_#t~ret17;isIdle_~retValue_acc~13 := (if 0 == isIdle_~tmp~7 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~13; 858#L1547true cleanup_#t~ret161 := isIdle_#res;cleanup_~tmp~27 := cleanup_#t~ret161;havoc cleanup_#t~ret161; 2643#L3295true assume !(0 != cleanup_~tmp~27);havoc timeShift_#t~ret58, timeShift_#t~ret59, timeShift_#t~ret60, timeShift_#t~ret61, timeShift_#t~ret62, timeShift_#t~ret63, timeShift_#t~ret64, timeShift_#t~ret65, timeShift_#t~ret66, timeShift_#t~ret67, timeShift_#t~ret68, timeShift_~tmp~16, timeShift_~tmp___0~10, timeShift_~tmp___1~6, timeShift_~tmp___2~3, timeShift_~tmp___3~3, timeShift_~tmp___4~2, timeShift_~tmp___5~2, timeShift_~tmp___6~2, timeShift_~tmp___7~2, timeShift_~tmp___8~2, timeShift_~tmp___9~2;havoc timeShift_~tmp~16;havoc timeShift_~tmp___0~10;havoc timeShift_~tmp___1~6;havoc timeShift_~tmp___2~3;havoc timeShift_~tmp___3~3;havoc timeShift_~tmp___4~2;havoc timeShift_~tmp___5~2;havoc timeShift_~tmp___6~2;havoc timeShift_~tmp___7~2;havoc timeShift_~tmp___8~2;havoc timeShift_~tmp___9~2;havoc stopRequestedAtCurrentFloor_#res;havoc stopRequestedAtCurrentFloor_#t~ret42, stopRequestedAtCurrentFloor_#t~ret43, stopRequestedAtCurrentFloor_#t~ret44, stopRequestedAtCurrentFloor_#t~ret45, stopRequestedAtCurrentFloor_~retValue_acc~20, stopRequestedAtCurrentFloor_~tmp~14, stopRequestedAtCurrentFloor_~tmp___0~8;havoc stopRequestedAtCurrentFloor_~retValue_acc~20;havoc stopRequestedAtCurrentFloor_~tmp~14;havoc stopRequestedAtCurrentFloor_~tmp___0~8;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret116, isExecutiveFloorCalling_~retValue_acc~23;havoc isExecutiveFloorCalling_~retValue_acc~23;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~3;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~3; 2085#L372-70true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~3 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~3; 874#L399-70true isExecutiveFloorCalling_#t~ret116 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~23 := isExecutiveFloorCalling_#t~ret116;havoc isExecutiveFloorCalling_#t~ret116;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~23; 42#L2714-3true stopRequestedAtCurrentFloor_#t~ret42 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~14 := stopRequestedAtCurrentFloor_#t~ret42;havoc stopRequestedAtCurrentFloor_#t~ret42; 694#L2099-1true assume 0 != stopRequestedAtCurrentFloor_~tmp~14;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~7;havoc getCurrentFloorID_~retValue_acc~7;getCurrentFloorID_~retValue_acc~7 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~7; 1145#L1362-6true stopRequestedAtCurrentFloor_#t~ret43 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~8 := stopRequestedAtCurrentFloor_#t~ret43;havoc stopRequestedAtCurrentFloor_#t~ret43; 662#L2103-1true assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~8);stopRequestedAtCurrentFloor_~retValue_acc~20 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~20; 3147#L2116-1true timeShift_#t~ret58 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret58;havoc timeShift_#t~ret58; 886#L2251-1true assume !(0 != timeShift_~tmp___9~2); 1601#L2342-3true assume 1 == ~doorState~0;~doorState~0 := 0; 1605#L2342-5true stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret33, stopRequestedInDirection_#t~ret34, stopRequestedInDirection_#t~ret35, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~16, stopRequestedInDirection_~tmp~10, stopRequestedInDirection_~tmp___0~5, stopRequestedInDirection_~__cil_tmp7~0, stopRequestedInDirection_~__cil_tmp8~1;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~16;havoc stopRequestedInDirection_~tmp~10;havoc stopRequestedInDirection_~tmp___0~5;havoc stopRequestedInDirection_~__cil_tmp7~0;havoc stopRequestedInDirection_~__cil_tmp8~1;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret116, isExecutiveFloorCalling_~retValue_acc~23;havoc isExecutiveFloorCalling_~retValue_acc~23;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~3;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~3; 2088#L372-73true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~3 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~3; 877#L399-73true isExecutiveFloorCalling_#t~ret116 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~23 := isExecutiveFloorCalling_#t~ret116;havoc isExecutiveFloorCalling_#t~ret116;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~23; 49#L2714-4true stopRequestedInDirection_#t~ret33 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~5 := stopRequestedInDirection_#t~ret33;havoc stopRequestedInDirection_#t~ret33; 3362#L1954-2true assume 0 != stopRequestedInDirection_~tmp___0~5;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~7;havoc getCurrentFloorID_~retValue_acc~7;getCurrentFloorID_~retValue_acc~7 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~7; 1131#L1362-9true stopRequestedInDirection_#t~ret34 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~10 := stopRequestedInDirection_#t~ret34;havoc stopRequestedInDirection_#t~ret34;stopRequestedInDirection_~__cil_tmp7~0 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~1 := (if stopRequestedInDirection_~tmp~10 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~16 := (if stopRequestedInDirection_~__cil_tmp8~1 == stopRequestedInDirection_~__cil_tmp7~0 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~16; 2858#L1967-2true timeShift_#t~ret65 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret65;havoc timeShift_#t~ret65; 1239#L2350-1true assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret36, continueInDirection_~dir, continueInDirection_~tmp~11;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~11;~currentHeading~0 := continueInDirection_~dir; 691#L2011-3true assume !(1 == ~currentHeading~0); 3251#L2021-9true assume 0 == ~currentFloorID~0;~currentHeading~0 := 1; 3253#L2021-11true assume 1 == ~currentHeading~0;~currentFloorID~0 := 1 + ~currentFloorID~0; 3111#L2027-11true havoc __utac_acc__Specification9_spec__3_#t~ret6, __utac_acc__Specification9_spec__3_#t~ret7, __utac_acc__Specification9_spec__3_#t~ret8, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~2, __utac_acc__Specification9_spec__3_~tmp___0~2, __utac_acc__Specification9_spec__3_~tmp___1~2;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~2;havoc __utac_acc__Specification9_spec__3_~tmp___0~2;havoc __utac_acc__Specification9_spec__3_~tmp___1~2;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~7;havoc getCurrentFloorID_~retValue_acc~7;getCurrentFloorID_~retValue_acc~7 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~7; 1135#L1362-11true __utac_acc__Specification9_spec__3_#t~ret6 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~2 := __utac_acc__Specification9_spec__3_#t~ret6;havoc __utac_acc__Specification9_spec__3_#t~ret6;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~2;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~11;havoc isEmpty_~retValue_acc~11; 3456#L1422-13true assume 1 == ~persons_0~0;isEmpty_~retValue_acc~11 := 0;isEmpty_#res := isEmpty_~retValue_acc~11; 903#L1454-13true __utac_acc__Specification9_spec__3_#t~ret7 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~2 := __utac_acc__Specification9_spec__3_#t~ret7;havoc __utac_acc__Specification9_spec__3_#t~ret7; 1019#L1011-2true assume 0 != __utac_acc__Specification9_spec__3_~tmp___1~2;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 1600#L1021-3true cleanup_~i~3 := 1 + cleanup_~i~3; 3366#L3275-2true [2019-01-01 23:25:27,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:25:27,610 INFO L82 PathProgramCache]: Analyzing trace with hash -2000350140, now seen corresponding path program 1 times [2019-01-01 23:25:27,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:25:27,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:25:27,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:25:27,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:25:27,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:25:27,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:25:27,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:25:28,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:25:28,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:25:28,009 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:25:28,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:25:28,010 INFO L82 PathProgramCache]: Analyzing trace with hash -415102220, now seen corresponding path program 1 times [2019-01-01 23:25:28,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:25:28,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:25:28,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:25:28,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:25:28,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:25:28,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:25:28,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:25:28,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:25:28,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 23:25:28,271 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:25:28,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 23:25:28,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-01 23:25:28,289 INFO L87 Difference]: Start difference. First operand 3671 states. Second operand 7 states. [2019-01-01 23:25:42,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:25:42,948 INFO L93 Difference]: Finished difference Result 31176 states and 58291 transitions. [2019-01-01 23:25:42,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-01 23:25:42,952 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31176 states and 58291 transitions. [2019-01-01 23:25:43,329 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13613 [2019-01-01 23:25:43,582 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31176 states to 31036 states and 58133 transitions. [2019-01-01 23:25:43,583 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31036 [2019-01-01 23:25:43,624 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31036 [2019-01-01 23:25:43,625 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31036 states and 58133 transitions. [2019-01-01 23:25:43,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:25:43,702 INFO L705 BuchiCegarLoop]: Abstraction has 31036 states and 58133 transitions. [2019-01-01 23:25:43,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31036 states and 58133 transitions. [2019-01-01 23:25:44,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31036 to 10466. [2019-01-01 23:25:44,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10466 states. [2019-01-01 23:25:44,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10466 states to 10466 states and 19644 transitions. [2019-01-01 23:25:44,148 INFO L728 BuchiCegarLoop]: Abstraction has 10466 states and 19644 transitions. [2019-01-01 23:25:44,148 INFO L608 BuchiCegarLoop]: Abstraction has 10466 states and 19644 transitions. [2019-01-01 23:25:44,148 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 23:25:44,148 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10466 states and 19644 transitions. [2019-01-01 23:25:44,190 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5290 [2019-01-01 23:25:44,191 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:25:44,191 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:25:44,196 INFO L866 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, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:25:44,196 INFO L867 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:25:44,197 INFO L794 eck$LassoCheckResult]: Stem: 37727#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~cleanupTimeShifts~0 := 12;~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;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~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~string69.base, #t~string69.offset := #Ultimate.allocOnStack(10);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string71.base, #t~string71.offset, 1);call write~init~int(95, #t~string71.base, 1 + #t~string71.offset, 1);call write~init~int(93, #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(91, #t~string73.base, #t~string73.offset, 1);call write~init~int(93, #t~string73.base, 1 + #t~string73.offset, 1);call write~init~int(32, #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(5);call write~init~int(32, #t~string75.base, #t~string75.offset, 1);call write~init~int(97, #t~string75.base, 1 + #t~string75.offset, 1);call write~init~int(116, #t~string75.base, 2 + #t~string75.offset, 1);call write~init~int(32, #t~string75.base, 3 + #t~string75.offset, 1);call write~init~int(0, #t~string75.base, 4 + #t~string75.offset, 1);call #t~string77.base, #t~string77.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string77.base, #t~string77.offset, 1);call write~init~int(105, #t~string77.base, 1 + #t~string77.offset, 1);call write~init~int(0, #t~string77.base, 2 + #t~string77.offset, 1);call #t~string79.base, #t~string79.offset := #Ultimate.allocOnStack(10);call #t~string81.base, #t~string81.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string81.base, #t~string81.offset, 1);call write~init~int(112, #t~string81.base, 1 + #t~string81.offset, 1);call write~init~int(0, #t~string81.base, 2 + #t~string81.offset, 1);call #t~string83.base, #t~string83.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string83.base, #t~string83.offset, 1);call write~init~int(111, #t~string83.base, 1 + #t~string83.offset, 1);call write~init~int(119, #t~string83.base, 2 + #t~string83.offset, 1);call write~init~int(110, #t~string83.base, 3 + #t~string83.offset, 1);call write~init~int(0, #t~string83.base, 4 + #t~string83.offset, 1);call #t~string85.base, #t~string85.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string85.base, #t~string85.offset, 1);call write~init~int(73, #t~string85.base, 1 + #t~string85.offset, 1);call write~init~int(76, #t~string85.base, 2 + #t~string85.offset, 1);call write~init~int(95, #t~string85.base, 3 + #t~string85.offset, 1);call write~init~int(112, #t~string85.base, 4 + #t~string85.offset, 1);call write~init~int(58, #t~string85.base, 5 + #t~string85.offset, 1);call write~init~int(0, #t~string85.base, 6 + #t~string85.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~string89.base, #t~string89.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string89.base, #t~string89.offset, 1);call write~init~int(37, #t~string89.base, 1 + #t~string89.offset, 1);call write~init~int(105, #t~string89.base, 2 + #t~string89.offset, 1);call write~init~int(0, #t~string89.base, 3 + #t~string89.offset, 1);call #t~string91.base, #t~string91.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string91.base, #t~string91.offset, 1);call write~init~int(37, #t~string91.base, 1 + #t~string91.offset, 1);call write~init~int(105, #t~string91.base, 2 + #t~string91.offset, 1);call write~init~int(0, #t~string91.base, 3 + #t~string91.offset, 1);call #t~string93.base, #t~string93.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string93.base, #t~string93.offset, 1);call write~init~int(37, #t~string93.base, 1 + #t~string93.offset, 1);call write~init~int(105, #t~string93.base, 2 + #t~string93.offset, 1);call write~init~int(0, #t~string93.base, 3 + #t~string93.offset, 1);call #t~string95.base, #t~string95.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string95.base, #t~string95.offset, 1);call write~init~int(37, #t~string95.base, 1 + #t~string95.offset, 1);call write~init~int(105, #t~string95.base, 2 + #t~string95.offset, 1);call write~init~int(0, #t~string95.base, 3 + #t~string95.offset, 1);call #t~string97.base, #t~string97.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string97.base, #t~string97.offset, 1);call write~init~int(70, #t~string97.base, 1 + #t~string97.offset, 1);call write~init~int(95, #t~string97.base, 2 + #t~string97.offset, 1);call write~init~int(112, #t~string97.base, 3 + #t~string97.offset, 1);call write~init~int(58, #t~string97.base, 4 + #t~string97.offset, 1);call write~init~int(0, #t~string97.base, 5 + #t~string97.offset, 1);call #t~string100.base, #t~string100.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string100.base, #t~string100.offset, 1);call write~init~int(37, #t~string100.base, 1 + #t~string100.offset, 1);call write~init~int(105, #t~string100.base, 2 + #t~string100.offset, 1);call write~init~int(0, #t~string100.base, 3 + #t~string100.offset, 1);call #t~string103.base, #t~string103.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string103.base, #t~string103.offset, 1);call write~init~int(37, #t~string103.base, 1 + #t~string103.offset, 1);call write~init~int(105, #t~string103.base, 2 + #t~string103.offset, 1);call write~init~int(0, #t~string103.base, 3 + #t~string103.offset, 1);call #t~string106.base, #t~string106.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string106.base, #t~string106.offset, 1);call write~init~int(37, #t~string106.base, 1 + #t~string106.offset, 1);call write~init~int(105, #t~string106.base, 2 + #t~string106.offset, 1);call write~init~int(0, #t~string106.base, 3 + #t~string106.offset, 1);call #t~string109.base, #t~string109.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string109.base, #t~string109.offset, 1);call write~init~int(37, #t~string109.base, 1 + #t~string109.offset, 1);call write~init~int(105, #t~string109.base, 2 + #t~string109.offset, 1);call write~init~int(0, #t~string109.base, 3 + #t~string109.offset, 1);call #t~string112.base, #t~string112.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string112.base, #t~string112.offset, 1);call write~init~int(37, #t~string112.base, 1 + #t~string112.offset, 1);call write~init~int(105, #t~string112.base, 2 + #t~string112.offset, 1);call write~init~int(0, #t~string112.base, 3 + #t~string112.offset, 1);call #t~string114.base, #t~string114.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string114.base, #t~string114.offset, 1);call write~init~int(0, #t~string114.base, 1 + #t~string114.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string136.base, #t~string136.offset := #Ultimate.allocOnStack(30);call #t~string137.base, #t~string137.offset := #Ultimate.allocOnStack(9);call #t~string138.base, #t~string138.offset := #Ultimate.allocOnStack(21);call #t~string139.base, #t~string139.offset := #Ultimate.allocOnStack(30);call #t~string140.base, #t~string140.offset := #Ultimate.allocOnStack(9);call #t~string141.base, #t~string141.offset := #Ultimate.allocOnStack(21);call #t~string145.base, #t~string145.offset := #Ultimate.allocOnStack(30);call #t~string146.base, #t~string146.offset := #Ultimate.allocOnStack(9);call #t~string147.base, #t~string147.offset := #Ultimate.allocOnStack(25);call #t~string148.base, #t~string148.offset := #Ultimate.allocOnStack(30);call #t~string149.base, #t~string149.offset := #Ultimate.allocOnStack(9);call #t~string150.base, #t~string150.offset := #Ultimate.allocOnStack(25); 37728#L-1 havoc main_#res;havoc main_#t~ret166, main_~retValue_acc~31, main_~tmp~29;havoc main_~retValue_acc~31;havoc main_~tmp~29; 37708#L2753 havoc valid_product_#res;havoc valid_product_~retValue_acc~26;havoc valid_product_~retValue_acc~26;valid_product_~retValue_acc~26 := 1;valid_product_#res := valid_product_~retValue_acc~26; 37709#L2761 main_#t~ret166 := valid_product_#res;main_~tmp~29 := main_#t~ret166;havoc main_#t~ret166; 38332#L3468 assume 0 != main_~tmp~29; 38333#L3443 ~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 38602#L968 havoc bigMacCall_#t~ret159, bigMacCall_~tmp~26;havoc bigMacCall_~tmp~26;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~1;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~1; 38603#L85 assume 0 == getOrigin_~person;getOrigin_~retValue_acc~1 := 4;getOrigin_#res := getOrigin_~retValue_acc~1; 37735#L110 bigMacCall_#t~ret159 := getOrigin_#res;bigMacCall_~tmp~26 := bigMacCall_#t~ret159;havoc bigMacCall_#t~ret159;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~26;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 37064#L643 assume 0 == initPersonOnFloor_~floor; 37065#L644 assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 34933#L751-1 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 35734#L435 assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 35735#L447-2 havoc cleanup_#t~ret160, cleanup_#t~ret161, cleanup_~i~3, cleanup_~tmp~27, cleanup_~tmp___0~12, cleanup_~__cil_tmp4~3;havoc cleanup_~i~3;havoc cleanup_~tmp~27;havoc cleanup_~tmp___0~12;havoc cleanup_~__cil_tmp4~3;havoc timeShift_#t~ret58, timeShift_#t~ret59, timeShift_#t~ret60, timeShift_#t~ret61, timeShift_#t~ret62, timeShift_#t~ret63, timeShift_#t~ret64, timeShift_#t~ret65, timeShift_#t~ret66, timeShift_#t~ret67, timeShift_#t~ret68, timeShift_~tmp~16, timeShift_~tmp___0~10, timeShift_~tmp___1~6, timeShift_~tmp___2~3, timeShift_~tmp___3~3, timeShift_~tmp___4~2, timeShift_~tmp___5~2, timeShift_~tmp___6~2, timeShift_~tmp___7~2, timeShift_~tmp___8~2, timeShift_~tmp___9~2;havoc timeShift_~tmp~16;havoc timeShift_~tmp___0~10;havoc timeShift_~tmp___1~6;havoc timeShift_~tmp___2~3;havoc timeShift_~tmp___3~3;havoc timeShift_~tmp___4~2;havoc timeShift_~tmp___5~2;havoc timeShift_~tmp___6~2;havoc timeShift_~tmp___7~2;havoc timeShift_~tmp___8~2;havoc timeShift_~tmp___9~2;havoc stopRequestedAtCurrentFloor_#res;havoc stopRequestedAtCurrentFloor_#t~ret42, stopRequestedAtCurrentFloor_#t~ret43, stopRequestedAtCurrentFloor_#t~ret44, stopRequestedAtCurrentFloor_#t~ret45, stopRequestedAtCurrentFloor_~retValue_acc~20, stopRequestedAtCurrentFloor_~tmp~14, stopRequestedAtCurrentFloor_~tmp___0~8;havoc stopRequestedAtCurrentFloor_~retValue_acc~20;havoc stopRequestedAtCurrentFloor_~tmp~14;havoc stopRequestedAtCurrentFloor_~tmp___0~8;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret116, isExecutiveFloorCalling_~retValue_acc~23;havoc isExecutiveFloorCalling_~retValue_acc~23;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~3;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~3; 37687#L372 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~3 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~3; 36445#L399 isExecutiveFloorCalling_#t~ret116 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~23 := isExecutiveFloorCalling_#t~ret116;havoc isExecutiveFloorCalling_#t~ret116;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~23; 36446#L2714 stopRequestedAtCurrentFloor_#t~ret42 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~14 := stopRequestedAtCurrentFloor_#t~ret42;havoc stopRequestedAtCurrentFloor_#t~ret42; 36015#L2099 assume 0 != stopRequestedAtCurrentFloor_~tmp~14;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~7;havoc getCurrentFloorID_~retValue_acc~7;getCurrentFloorID_~retValue_acc~7 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~7; 36017#L1362 stopRequestedAtCurrentFloor_#t~ret43 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~8 := stopRequestedAtCurrentFloor_#t~ret43;havoc stopRequestedAtCurrentFloor_#t~ret43; 35982#L2103 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~8);stopRequestedAtCurrentFloor_~retValue_acc~20 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~20; 35984#L2116 timeShift_#t~ret58 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret58;havoc timeShift_#t~ret58; 43823#L2251 assume !(0 != timeShift_~tmp___9~2); 43824#L2342 assume !(1 == ~doorState~0); 45005#L2342-2 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret33, stopRequestedInDirection_#t~ret34, stopRequestedInDirection_#t~ret35, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~16, stopRequestedInDirection_~tmp~10, stopRequestedInDirection_~tmp___0~5, stopRequestedInDirection_~__cil_tmp7~0, stopRequestedInDirection_~__cil_tmp8~1;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~16;havoc stopRequestedInDirection_~tmp~10;havoc stopRequestedInDirection_~tmp___0~5;havoc stopRequestedInDirection_~__cil_tmp7~0;havoc stopRequestedInDirection_~__cil_tmp8~1;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret116, isExecutiveFloorCalling_~retValue_acc~23;havoc isExecutiveFloorCalling_~retValue_acc~23;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~3;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~3; 45004#L372-3 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~3 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~3; 45003#L399-3 isExecutiveFloorCalling_#t~ret116 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~23 := isExecutiveFloorCalling_#t~ret116;havoc isExecutiveFloorCalling_#t~ret116;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~23; 45002#L2714-1 stopRequestedInDirection_#t~ret33 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~5 := stopRequestedInDirection_#t~ret33;havoc stopRequestedInDirection_#t~ret33; 45000#L1954 assume 0 != stopRequestedInDirection_~tmp___0~5;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~7;havoc getCurrentFloorID_~retValue_acc~7;getCurrentFloorID_~retValue_acc~7 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~7; 36694#L1362-3 stopRequestedInDirection_#t~ret34 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~10 := stopRequestedInDirection_#t~ret34;havoc stopRequestedInDirection_#t~ret34;stopRequestedInDirection_~__cil_tmp7~0 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~1 := (if stopRequestedInDirection_~tmp~10 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~16 := (if stopRequestedInDirection_~__cil_tmp8~1 == stopRequestedInDirection_~__cil_tmp7~0 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~16; 36695#L1967 timeShift_#t~ret65 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret65;havoc timeShift_#t~ret65; 36776#L2350 assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret36, continueInDirection_~dir, continueInDirection_~tmp~11;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~11;~currentHeading~0 := continueInDirection_~dir; 36777#L2011 assume !(1 == ~currentHeading~0); 38621#L2021 assume !(0 == ~currentFloorID~0); 35987#L2021-2 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 38615#L2027-5 havoc __utac_acc__Specification9_spec__3_#t~ret6, __utac_acc__Specification9_spec__3_#t~ret7, __utac_acc__Specification9_spec__3_#t~ret8, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~2, __utac_acc__Specification9_spec__3_~tmp___0~2, __utac_acc__Specification9_spec__3_~tmp___1~2;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~2;havoc __utac_acc__Specification9_spec__3_~tmp___0~2;havoc __utac_acc__Specification9_spec__3_~tmp___1~2;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~7;havoc getCurrentFloorID_~retValue_acc~7;getCurrentFloorID_~retValue_acc~7 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~7; 43044#L1362-5 __utac_acc__Specification9_spec__3_#t~ret6 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~2 := __utac_acc__Specification9_spec__3_#t~ret6;havoc __utac_acc__Specification9_spec__3_#t~ret6;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~2;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~11;havoc isEmpty_~retValue_acc~11; 43042#L1422-6 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~11 := 0;isEmpty_#res := isEmpty_~retValue_acc~11; 43037#L1454-6 __utac_acc__Specification9_spec__3_#t~ret7 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~2 := __utac_acc__Specification9_spec__3_#t~ret7;havoc __utac_acc__Specification9_spec__3_#t~ret7; 43020#L1011 assume 0 != __utac_acc__Specification9_spec__3_~tmp___1~2;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 43014#L1021-1 cleanup_~i~3 := 0; 43013#L3275-2 [2019-01-01 23:25:44,197 INFO L796 eck$LassoCheckResult]: Loop: 43013#L3275-2 assume !false; 43012#L3276 cleanup_~__cil_tmp4~3 := ~cleanupTimeShifts~0 - 1; 43007#L3279 assume cleanup_~i~3 < cleanup_~__cil_tmp4~3;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~6;havoc isBlocked_~retValue_acc~6;isBlocked_~retValue_acc~6 := 0;isBlocked_#res := isBlocked_~retValue_acc~6; 43002#L1185 cleanup_#t~ret160 := isBlocked_#res;cleanup_~tmp___0~12 := cleanup_#t~ret160;havoc cleanup_#t~ret160; 42991#L3283 assume 1 != cleanup_~tmp___0~12; 42988#L3283-1 havoc isIdle_#res;havoc isIdle_#t~ret17, isIdle_~retValue_acc~13, isIdle_~tmp~7;havoc isIdle_~retValue_acc~13;havoc isIdle_~tmp~7;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret12, anyStopRequested_#t~ret13, anyStopRequested_#t~ret14, anyStopRequested_#t~ret15, anyStopRequested_#t~ret16, anyStopRequested_~retValue_acc~12, anyStopRequested_~tmp~6, anyStopRequested_~tmp___0~3, anyStopRequested_~tmp___1~3, anyStopRequested_~tmp___2~0, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~12;havoc anyStopRequested_~tmp~6;havoc anyStopRequested_~tmp___0~3;havoc anyStopRequested_~tmp___1~3;havoc anyStopRequested_~tmp___2~0;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~3;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~3; 37729#L372-65 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~3 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~3; 37730#L399-65 anyStopRequested_#t~ret12 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret12;havoc anyStopRequested_#t~ret12; 36753#L1470 assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~12 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~12; 34955#L1534 isIdle_#t~ret17 := anyStopRequested_#res;isIdle_~tmp~7 := isIdle_#t~ret17;havoc isIdle_#t~ret17;isIdle_~retValue_acc~13 := (if 0 == isIdle_~tmp~7 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~13; 36261#L1547 cleanup_#t~ret161 := isIdle_#res;cleanup_~tmp~27 := cleanup_#t~ret161;havoc cleanup_#t~ret161; 36262#L3295 assume !(0 != cleanup_~tmp~27);havoc timeShift_#t~ret58, timeShift_#t~ret59, timeShift_#t~ret60, timeShift_#t~ret61, timeShift_#t~ret62, timeShift_#t~ret63, timeShift_#t~ret64, timeShift_#t~ret65, timeShift_#t~ret66, timeShift_#t~ret67, timeShift_#t~ret68, timeShift_~tmp~16, timeShift_~tmp___0~10, timeShift_~tmp___1~6, timeShift_~tmp___2~3, timeShift_~tmp___3~3, timeShift_~tmp___4~2, timeShift_~tmp___5~2, timeShift_~tmp___6~2, timeShift_~tmp___7~2, timeShift_~tmp___8~2, timeShift_~tmp___9~2;havoc timeShift_~tmp~16;havoc timeShift_~tmp___0~10;havoc timeShift_~tmp___1~6;havoc timeShift_~tmp___2~3;havoc timeShift_~tmp___3~3;havoc timeShift_~tmp___4~2;havoc timeShift_~tmp___5~2;havoc timeShift_~tmp___6~2;havoc timeShift_~tmp___7~2;havoc timeShift_~tmp___8~2;havoc timeShift_~tmp___9~2;havoc stopRequestedAtCurrentFloor_#res;havoc stopRequestedAtCurrentFloor_#t~ret42, stopRequestedAtCurrentFloor_#t~ret43, stopRequestedAtCurrentFloor_#t~ret44, stopRequestedAtCurrentFloor_#t~ret45, stopRequestedAtCurrentFloor_~retValue_acc~20, stopRequestedAtCurrentFloor_~tmp~14, stopRequestedAtCurrentFloor_~tmp___0~8;havoc stopRequestedAtCurrentFloor_~retValue_acc~20;havoc stopRequestedAtCurrentFloor_~tmp~14;havoc stopRequestedAtCurrentFloor_~tmp___0~8;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret116, isExecutiveFloorCalling_~retValue_acc~23;havoc isExecutiveFloorCalling_~retValue_acc~23;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~3;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~3; 38219#L372-70 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~3 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~3; 38846#L399-70 isExecutiveFloorCalling_#t~ret116 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~23 := isExecutiveFloorCalling_#t~ret116;havoc isExecutiveFloorCalling_#t~ret116;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~23; 39145#L2714-3 stopRequestedAtCurrentFloor_#t~ret42 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~14 := stopRequestedAtCurrentFloor_#t~ret42;havoc stopRequestedAtCurrentFloor_#t~ret42; 39130#L2099-1 assume 0 != stopRequestedAtCurrentFloor_~tmp~14;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~7;havoc getCurrentFloorID_~retValue_acc~7;getCurrentFloorID_~retValue_acc~7 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~7; 39129#L1362-6 stopRequestedAtCurrentFloor_#t~ret43 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~8 := stopRequestedAtCurrentFloor_#t~ret43;havoc stopRequestedAtCurrentFloor_#t~ret43; 39128#L2103-1 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~8);stopRequestedAtCurrentFloor_~retValue_acc~20 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~20; 35986#L2116-1 timeShift_#t~ret58 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret58;havoc timeShift_#t~ret58; 44521#L2251-1 assume !(0 != timeShift_~tmp___9~2); 44522#L2342-3 assume 1 == ~doorState~0;~doorState~0 := 0; 44848#L2342-5 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret33, stopRequestedInDirection_#t~ret34, stopRequestedInDirection_#t~ret35, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~16, stopRequestedInDirection_~tmp~10, stopRequestedInDirection_~tmp___0~5, stopRequestedInDirection_~__cil_tmp7~0, stopRequestedInDirection_~__cil_tmp8~1;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~16;havoc stopRequestedInDirection_~tmp~10;havoc stopRequestedInDirection_~tmp___0~5;havoc stopRequestedInDirection_~__cil_tmp7~0;havoc stopRequestedInDirection_~__cil_tmp8~1;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret116, isExecutiveFloorCalling_~retValue_acc~23;havoc isExecutiveFloorCalling_~retValue_acc~23;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~3;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~3; 44847#L372-73 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~3 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~3; 44846#L399-73 isExecutiveFloorCalling_#t~ret116 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~23 := isExecutiveFloorCalling_#t~ret116;havoc isExecutiveFloorCalling_#t~ret116;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~23; 44845#L2714-4 stopRequestedInDirection_#t~ret33 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~5 := stopRequestedInDirection_#t~ret33;havoc stopRequestedInDirection_#t~ret33; 44843#L1954-2 assume 0 != stopRequestedInDirection_~tmp___0~5;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~7;havoc getCurrentFloorID_~retValue_acc~7;getCurrentFloorID_~retValue_acc~7 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~7; 36663#L1362-9 stopRequestedInDirection_#t~ret34 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~10 := stopRequestedInDirection_#t~ret34;havoc stopRequestedInDirection_#t~ret34;stopRequestedInDirection_~__cil_tmp7~0 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~1 := (if stopRequestedInDirection_~tmp~10 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~16 := (if stopRequestedInDirection_~__cil_tmp8~1 == stopRequestedInDirection_~__cil_tmp7~0 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~16; 36664#L1967-2 timeShift_#t~ret65 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret65;havoc timeShift_#t~ret65; 36781#L2350-1 assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret36, continueInDirection_~dir, continueInDirection_~tmp~11;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~11;~currentHeading~0 := continueInDirection_~dir; 36012#L2011-3 assume !(1 == ~currentHeading~0); 36013#L2021-9 assume !(0 == ~currentFloorID~0); 35980#L2021-11 assume 1 == ~currentHeading~0;~currentFloorID~0 := 1 + ~currentFloorID~0; 38606#L2027-11 havoc __utac_acc__Specification9_spec__3_#t~ret6, __utac_acc__Specification9_spec__3_#t~ret7, __utac_acc__Specification9_spec__3_#t~ret8, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~2, __utac_acc__Specification9_spec__3_~tmp___0~2, __utac_acc__Specification9_spec__3_~tmp___1~2;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~2;havoc __utac_acc__Specification9_spec__3_~tmp___0~2;havoc __utac_acc__Specification9_spec__3_~tmp___1~2;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~7;havoc getCurrentFloorID_~retValue_acc~7;getCurrentFloorID_~retValue_acc~7 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~7; 43052#L1362-11 __utac_acc__Specification9_spec__3_#t~ret6 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~2 := __utac_acc__Specification9_spec__3_#t~ret6;havoc __utac_acc__Specification9_spec__3_#t~ret6;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~2;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~11;havoc isEmpty_~retValue_acc~11; 43048#L1422-13 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~11 := 0;isEmpty_#res := isEmpty_~retValue_acc~11; 43045#L1454-13 __utac_acc__Specification9_spec__3_#t~ret7 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~2 := __utac_acc__Specification9_spec__3_#t~ret7;havoc __utac_acc__Specification9_spec__3_#t~ret7; 43025#L1011-2 assume 0 != __utac_acc__Specification9_spec__3_~tmp___1~2;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 43015#L1021-3 cleanup_~i~3 := 1 + cleanup_~i~3; 43013#L3275-2 [2019-01-01 23:25:44,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:25:44,198 INFO L82 PathProgramCache]: Analyzing trace with hash -2000350140, now seen corresponding path program 2 times [2019-01-01 23:25:44,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:25:44,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:25:44,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:25:44,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:25:44,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:25:44,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:25:44,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:25:44,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:25:44,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:25:44,343 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:25:44,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:25:44,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1224448846, now seen corresponding path program 1 times [2019-01-01 23:25:44,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:25:44,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:25:44,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:25:44,346 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:25:44,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:25:44,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:25:44,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:25:44,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:25:44,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:25:44,421 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:25:44,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:25:44,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:25:44,422 INFO L87 Difference]: Start difference. First operand 10466 states and 19644 transitions. cyclomatic complexity: 9180 Second operand 3 states. [2019-01-01 23:25:45,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:25:45,111 INFO L93 Difference]: Finished difference Result 15780 states and 29587 transitions. [2019-01-01 23:25:45,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:25:45,118 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15780 states and 29587 transitions. [2019-01-01 23:25:45,206 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10552 [2019-01-01 23:25:45,280 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15780 states to 15780 states and 29587 transitions. [2019-01-01 23:25:45,280 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15780 [2019-01-01 23:25:45,296 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15780 [2019-01-01 23:25:45,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15780 states and 29587 transitions. [2019-01-01 23:25:45,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:25:45,316 INFO L705 BuchiCegarLoop]: Abstraction has 15780 states and 29587 transitions. [2019-01-01 23:25:45,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15780 states and 29587 transitions. [2019-01-01 23:25:45,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15780 to 15772. [2019-01-01 23:25:45,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15772 states. [2019-01-01 23:25:45,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15772 states to 15772 states and 29575 transitions. [2019-01-01 23:25:45,920 INFO L728 BuchiCegarLoop]: Abstraction has 15772 states and 29575 transitions. [2019-01-01 23:25:45,920 INFO L608 BuchiCegarLoop]: Abstraction has 15772 states and 29575 transitions. [2019-01-01 23:25:45,920 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 23:25:45,920 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15772 states and 29575 transitions. [2019-01-01 23:25:45,974 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10544 [2019-01-01 23:25:45,974 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:25:45,975 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:25:45,981 INFO L866 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, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:25:45,981 INFO L867 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:25:45,986 INFO L794 eck$LassoCheckResult]: Stem: 63978#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~cleanupTimeShifts~0 := 12;~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;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~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~string69.base, #t~string69.offset := #Ultimate.allocOnStack(10);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string71.base, #t~string71.offset, 1);call write~init~int(95, #t~string71.base, 1 + #t~string71.offset, 1);call write~init~int(93, #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(91, #t~string73.base, #t~string73.offset, 1);call write~init~int(93, #t~string73.base, 1 + #t~string73.offset, 1);call write~init~int(32, #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(5);call write~init~int(32, #t~string75.base, #t~string75.offset, 1);call write~init~int(97, #t~string75.base, 1 + #t~string75.offset, 1);call write~init~int(116, #t~string75.base, 2 + #t~string75.offset, 1);call write~init~int(32, #t~string75.base, 3 + #t~string75.offset, 1);call write~init~int(0, #t~string75.base, 4 + #t~string75.offset, 1);call #t~string77.base, #t~string77.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string77.base, #t~string77.offset, 1);call write~init~int(105, #t~string77.base, 1 + #t~string77.offset, 1);call write~init~int(0, #t~string77.base, 2 + #t~string77.offset, 1);call #t~string79.base, #t~string79.offset := #Ultimate.allocOnStack(10);call #t~string81.base, #t~string81.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string81.base, #t~string81.offset, 1);call write~init~int(112, #t~string81.base, 1 + #t~string81.offset, 1);call write~init~int(0, #t~string81.base, 2 + #t~string81.offset, 1);call #t~string83.base, #t~string83.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string83.base, #t~string83.offset, 1);call write~init~int(111, #t~string83.base, 1 + #t~string83.offset, 1);call write~init~int(119, #t~string83.base, 2 + #t~string83.offset, 1);call write~init~int(110, #t~string83.base, 3 + #t~string83.offset, 1);call write~init~int(0, #t~string83.base, 4 + #t~string83.offset, 1);call #t~string85.base, #t~string85.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string85.base, #t~string85.offset, 1);call write~init~int(73, #t~string85.base, 1 + #t~string85.offset, 1);call write~init~int(76, #t~string85.base, 2 + #t~string85.offset, 1);call write~init~int(95, #t~string85.base, 3 + #t~string85.offset, 1);call write~init~int(112, #t~string85.base, 4 + #t~string85.offset, 1);call write~init~int(58, #t~string85.base, 5 + #t~string85.offset, 1);call write~init~int(0, #t~string85.base, 6 + #t~string85.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~string89.base, #t~string89.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string89.base, #t~string89.offset, 1);call write~init~int(37, #t~string89.base, 1 + #t~string89.offset, 1);call write~init~int(105, #t~string89.base, 2 + #t~string89.offset, 1);call write~init~int(0, #t~string89.base, 3 + #t~string89.offset, 1);call #t~string91.base, #t~string91.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string91.base, #t~string91.offset, 1);call write~init~int(37, #t~string91.base, 1 + #t~string91.offset, 1);call write~init~int(105, #t~string91.base, 2 + #t~string91.offset, 1);call write~init~int(0, #t~string91.base, 3 + #t~string91.offset, 1);call #t~string93.base, #t~string93.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string93.base, #t~string93.offset, 1);call write~init~int(37, #t~string93.base, 1 + #t~string93.offset, 1);call write~init~int(105, #t~string93.base, 2 + #t~string93.offset, 1);call write~init~int(0, #t~string93.base, 3 + #t~string93.offset, 1);call #t~string95.base, #t~string95.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string95.base, #t~string95.offset, 1);call write~init~int(37, #t~string95.base, 1 + #t~string95.offset, 1);call write~init~int(105, #t~string95.base, 2 + #t~string95.offset, 1);call write~init~int(0, #t~string95.base, 3 + #t~string95.offset, 1);call #t~string97.base, #t~string97.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string97.base, #t~string97.offset, 1);call write~init~int(70, #t~string97.base, 1 + #t~string97.offset, 1);call write~init~int(95, #t~string97.base, 2 + #t~string97.offset, 1);call write~init~int(112, #t~string97.base, 3 + #t~string97.offset, 1);call write~init~int(58, #t~string97.base, 4 + #t~string97.offset, 1);call write~init~int(0, #t~string97.base, 5 + #t~string97.offset, 1);call #t~string100.base, #t~string100.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string100.base, #t~string100.offset, 1);call write~init~int(37, #t~string100.base, 1 + #t~string100.offset, 1);call write~init~int(105, #t~string100.base, 2 + #t~string100.offset, 1);call write~init~int(0, #t~string100.base, 3 + #t~string100.offset, 1);call #t~string103.base, #t~string103.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string103.base, #t~string103.offset, 1);call write~init~int(37, #t~string103.base, 1 + #t~string103.offset, 1);call write~init~int(105, #t~string103.base, 2 + #t~string103.offset, 1);call write~init~int(0, #t~string103.base, 3 + #t~string103.offset, 1);call #t~string106.base, #t~string106.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string106.base, #t~string106.offset, 1);call write~init~int(37, #t~string106.base, 1 + #t~string106.offset, 1);call write~init~int(105, #t~string106.base, 2 + #t~string106.offset, 1);call write~init~int(0, #t~string106.base, 3 + #t~string106.offset, 1);call #t~string109.base, #t~string109.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string109.base, #t~string109.offset, 1);call write~init~int(37, #t~string109.base, 1 + #t~string109.offset, 1);call write~init~int(105, #t~string109.base, 2 + #t~string109.offset, 1);call write~init~int(0, #t~string109.base, 3 + #t~string109.offset, 1);call #t~string112.base, #t~string112.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string112.base, #t~string112.offset, 1);call write~init~int(37, #t~string112.base, 1 + #t~string112.offset, 1);call write~init~int(105, #t~string112.base, 2 + #t~string112.offset, 1);call write~init~int(0, #t~string112.base, 3 + #t~string112.offset, 1);call #t~string114.base, #t~string114.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string114.base, #t~string114.offset, 1);call write~init~int(0, #t~string114.base, 1 + #t~string114.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string136.base, #t~string136.offset := #Ultimate.allocOnStack(30);call #t~string137.base, #t~string137.offset := #Ultimate.allocOnStack(9);call #t~string138.base, #t~string138.offset := #Ultimate.allocOnStack(21);call #t~string139.base, #t~string139.offset := #Ultimate.allocOnStack(30);call #t~string140.base, #t~string140.offset := #Ultimate.allocOnStack(9);call #t~string141.base, #t~string141.offset := #Ultimate.allocOnStack(21);call #t~string145.base, #t~string145.offset := #Ultimate.allocOnStack(30);call #t~string146.base, #t~string146.offset := #Ultimate.allocOnStack(9);call #t~string147.base, #t~string147.offset := #Ultimate.allocOnStack(25);call #t~string148.base, #t~string148.offset := #Ultimate.allocOnStack(30);call #t~string149.base, #t~string149.offset := #Ultimate.allocOnStack(9);call #t~string150.base, #t~string150.offset := #Ultimate.allocOnStack(25); 63979#L-1 havoc main_#res;havoc main_#t~ret166, main_~retValue_acc~31, main_~tmp~29;havoc main_~retValue_acc~31;havoc main_~tmp~29; 63960#L2753 havoc valid_product_#res;havoc valid_product_~retValue_acc~26;havoc valid_product_~retValue_acc~26;valid_product_~retValue_acc~26 := 1;valid_product_#res := valid_product_~retValue_acc~26; 63961#L2761 main_#t~ret166 := valid_product_#res;main_~tmp~29 := main_#t~ret166;havoc main_#t~ret166; 64564#L3468 assume 0 != main_~tmp~29; 64565#L3443 ~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 64829#L968 havoc bigMacCall_#t~ret159, bigMacCall_~tmp~26;havoc bigMacCall_~tmp~26;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~1;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~1; 64830#L85 assume 0 == getOrigin_~person;getOrigin_~retValue_acc~1 := 4;getOrigin_#res := getOrigin_~retValue_acc~1; 63986#L110 bigMacCall_#t~ret159 := getOrigin_#res;bigMacCall_~tmp~26 := bigMacCall_#t~ret159;havoc bigMacCall_#t~ret159;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~26;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 63324#L643 assume 0 == initPersonOnFloor_~floor; 63325#L644 assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 61186#L751-1 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 61989#L435 assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 61990#L447-2 havoc cleanup_#t~ret160, cleanup_#t~ret161, cleanup_~i~3, cleanup_~tmp~27, cleanup_~tmp___0~12, cleanup_~__cil_tmp4~3;havoc cleanup_~i~3;havoc cleanup_~tmp~27;havoc cleanup_~tmp___0~12;havoc cleanup_~__cil_tmp4~3;havoc timeShift_#t~ret58, timeShift_#t~ret59, timeShift_#t~ret60, timeShift_#t~ret61, timeShift_#t~ret62, timeShift_#t~ret63, timeShift_#t~ret64, timeShift_#t~ret65, timeShift_#t~ret66, timeShift_#t~ret67, timeShift_#t~ret68, timeShift_~tmp~16, timeShift_~tmp___0~10, timeShift_~tmp___1~6, timeShift_~tmp___2~3, timeShift_~tmp___3~3, timeShift_~tmp___4~2, timeShift_~tmp___5~2, timeShift_~tmp___6~2, timeShift_~tmp___7~2, timeShift_~tmp___8~2, timeShift_~tmp___9~2;havoc timeShift_~tmp~16;havoc timeShift_~tmp___0~10;havoc timeShift_~tmp___1~6;havoc timeShift_~tmp___2~3;havoc timeShift_~tmp___3~3;havoc timeShift_~tmp___4~2;havoc timeShift_~tmp___5~2;havoc timeShift_~tmp___6~2;havoc timeShift_~tmp___7~2;havoc timeShift_~tmp___8~2;havoc timeShift_~tmp___9~2;havoc stopRequestedAtCurrentFloor_#res;havoc stopRequestedAtCurrentFloor_#t~ret42, stopRequestedAtCurrentFloor_#t~ret43, stopRequestedAtCurrentFloor_#t~ret44, stopRequestedAtCurrentFloor_#t~ret45, stopRequestedAtCurrentFloor_~retValue_acc~20, stopRequestedAtCurrentFloor_~tmp~14, stopRequestedAtCurrentFloor_~tmp___0~8;havoc stopRequestedAtCurrentFloor_~retValue_acc~20;havoc stopRequestedAtCurrentFloor_~tmp~14;havoc stopRequestedAtCurrentFloor_~tmp___0~8;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret116, isExecutiveFloorCalling_~retValue_acc~23;havoc isExecutiveFloorCalling_~retValue_acc~23;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~3;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~3; 63938#L372 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~3 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~3; 63939#L399 isExecutiveFloorCalling_#t~ret116 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~23 := isExecutiveFloorCalling_#t~ret116;havoc isExecutiveFloorCalling_#t~ret116;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~23; 61312#L2714 stopRequestedAtCurrentFloor_#t~ret42 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~14 := stopRequestedAtCurrentFloor_#t~ret42;havoc stopRequestedAtCurrentFloor_#t~ret42; 61313#L2099 assume 0 != stopRequestedAtCurrentFloor_~tmp~14;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~7;havoc getCurrentFloorID_~retValue_acc~7;getCurrentFloorID_~retValue_acc~7 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~7; 62951#L1362 stopRequestedAtCurrentFloor_#t~ret43 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~8 := stopRequestedAtCurrentFloor_#t~ret43;havoc stopRequestedAtCurrentFloor_#t~ret43; 62952#L2103 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~8);stopRequestedAtCurrentFloor_~retValue_acc~20 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~20; 65181#L2116 timeShift_#t~ret58 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret58;havoc timeShift_#t~ret58; 67191#L2251 assume !(0 != timeShift_~tmp___9~2); 67190#L2342 assume !(1 == ~doorState~0); 67189#L2342-2 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret33, stopRequestedInDirection_#t~ret34, stopRequestedInDirection_#t~ret35, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~16, stopRequestedInDirection_~tmp~10, stopRequestedInDirection_~tmp___0~5, stopRequestedInDirection_~__cil_tmp7~0, stopRequestedInDirection_~__cil_tmp8~1;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~16;havoc stopRequestedInDirection_~tmp~10;havoc stopRequestedInDirection_~tmp___0~5;havoc stopRequestedInDirection_~__cil_tmp7~0;havoc stopRequestedInDirection_~__cil_tmp8~1;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret116, isExecutiveFloorCalling_~retValue_acc~23;havoc isExecutiveFloorCalling_~retValue_acc~23;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~3;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~3; 63947#L372-3 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~3 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~3; 62675#L399-3 isExecutiveFloorCalling_#t~ret116 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~23 := isExecutiveFloorCalling_#t~ret116;havoc isExecutiveFloorCalling_#t~ret116;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~23; 61240#L2714-1 stopRequestedInDirection_#t~ret33 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~5 := stopRequestedInDirection_#t~ret33;havoc stopRequestedInDirection_#t~ret33; 61241#L1954 assume 0 != stopRequestedInDirection_~tmp___0~5;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~7;havoc getCurrentFloorID_~retValue_acc~7;getCurrentFloorID_~retValue_acc~7 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~7; 62955#L1362-3 stopRequestedInDirection_#t~ret34 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~10 := stopRequestedInDirection_#t~ret34;havoc stopRequestedInDirection_#t~ret34;stopRequestedInDirection_~__cil_tmp7~0 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~1 := (if stopRequestedInDirection_~tmp~10 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~16 := (if stopRequestedInDirection_~__cil_tmp8~1 == stopRequestedInDirection_~__cil_tmp7~0 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~16; 62956#L1967 timeShift_#t~ret65 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret65;havoc timeShift_#t~ret65; 63034#L2350 assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret36, continueInDirection_~dir, continueInDirection_~tmp~11;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~11;~currentHeading~0 := continueInDirection_~dir; 62281#L2011 assume !(1 == ~currentHeading~0); 62282#L2021 assume !(0 == ~currentFloorID~0); 62252#L2021-2 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 64850#L2027-5 havoc __utac_acc__Specification9_spec__3_#t~ret6, __utac_acc__Specification9_spec__3_#t~ret7, __utac_acc__Specification9_spec__3_#t~ret8, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~2, __utac_acc__Specification9_spec__3_~tmp___0~2, __utac_acc__Specification9_spec__3_~tmp___1~2;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~2;havoc __utac_acc__Specification9_spec__3_~tmp___0~2;havoc __utac_acc__Specification9_spec__3_~tmp___1~2;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~7;havoc getCurrentFloorID_~retValue_acc~7;getCurrentFloorID_~retValue_acc~7 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~7; 73142#L1362-5 __utac_acc__Specification9_spec__3_#t~ret6 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~2 := __utac_acc__Specification9_spec__3_#t~ret6;havoc __utac_acc__Specification9_spec__3_#t~ret6;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~2;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~11;havoc isEmpty_~retValue_acc~11; 73140#L1422-6 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~11 := 0;isEmpty_#res := isEmpty_~retValue_acc~11; 71572#L1454-6 __utac_acc__Specification9_spec__3_#t~ret7 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~2 := __utac_acc__Specification9_spec__3_#t~ret7;havoc __utac_acc__Specification9_spec__3_#t~ret7; 69651#L1011 assume 0 != __utac_acc__Specification9_spec__3_~tmp___1~2;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 69631#L1021-1 cleanup_~i~3 := 0; 69630#L3275-2 [2019-01-01 23:25:45,986 INFO L796 eck$LassoCheckResult]: Loop: 69630#L3275-2 assume !false; 69625#L3276 cleanup_~__cil_tmp4~3 := ~cleanupTimeShifts~0 - 1; 69623#L3279 assume cleanup_~i~3 < cleanup_~__cil_tmp4~3;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~6;havoc isBlocked_~retValue_acc~6;isBlocked_~retValue_acc~6 := 0;isBlocked_#res := isBlocked_~retValue_acc~6; 69622#L1185 cleanup_#t~ret160 := isBlocked_#res;cleanup_~tmp___0~12 := cleanup_#t~ret160;havoc cleanup_#t~ret160; 69621#L3283 assume 1 != cleanup_~tmp___0~12; 69620#L3283-1 havoc isIdle_#res;havoc isIdle_#t~ret17, isIdle_~retValue_acc~13, isIdle_~tmp~7;havoc isIdle_~retValue_acc~13;havoc isIdle_~tmp~7;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret12, anyStopRequested_#t~ret13, anyStopRequested_#t~ret14, anyStopRequested_#t~ret15, anyStopRequested_#t~ret16, anyStopRequested_~retValue_acc~12, anyStopRequested_~tmp~6, anyStopRequested_~tmp___0~3, anyStopRequested_~tmp___1~3, anyStopRequested_~tmp___2~0, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~12;havoc anyStopRequested_~tmp~6;havoc anyStopRequested_~tmp___0~3;havoc anyStopRequested_~tmp___1~3;havoc anyStopRequested_~tmp___2~0;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~3;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~3; 69615#L372-65 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~3 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~3; 69613#L399-65 anyStopRequested_#t~ret12 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret12;havoc anyStopRequested_#t~ret12; 69554#L1470 assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~12 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~12; 69545#L1534 isIdle_#t~ret17 := anyStopRequested_#res;isIdle_~tmp~7 := isIdle_#t~ret17;havoc isIdle_#t~ret17;isIdle_~retValue_acc~13 := (if 0 == isIdle_~tmp~7 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~13; 69544#L1547 cleanup_#t~ret161 := isIdle_#res;cleanup_~tmp~27 := cleanup_#t~ret161;havoc cleanup_#t~ret161; 69543#L3295 assume !(0 != cleanup_~tmp~27);havoc timeShift_#t~ret58, timeShift_#t~ret59, timeShift_#t~ret60, timeShift_#t~ret61, timeShift_#t~ret62, timeShift_#t~ret63, timeShift_#t~ret64, timeShift_#t~ret65, timeShift_#t~ret66, timeShift_#t~ret67, timeShift_#t~ret68, timeShift_~tmp~16, timeShift_~tmp___0~10, timeShift_~tmp___1~6, timeShift_~tmp___2~3, timeShift_~tmp___3~3, timeShift_~tmp___4~2, timeShift_~tmp___5~2, timeShift_~tmp___6~2, timeShift_~tmp___7~2, timeShift_~tmp___8~2, timeShift_~tmp___9~2;havoc timeShift_~tmp~16;havoc timeShift_~tmp___0~10;havoc timeShift_~tmp___1~6;havoc timeShift_~tmp___2~3;havoc timeShift_~tmp___3~3;havoc timeShift_~tmp___4~2;havoc timeShift_~tmp___5~2;havoc timeShift_~tmp___6~2;havoc timeShift_~tmp___7~2;havoc timeShift_~tmp___8~2;havoc timeShift_~tmp___9~2;havoc stopRequestedAtCurrentFloor_#res;havoc stopRequestedAtCurrentFloor_#t~ret42, stopRequestedAtCurrentFloor_#t~ret43, stopRequestedAtCurrentFloor_#t~ret44, stopRequestedAtCurrentFloor_#t~ret45, stopRequestedAtCurrentFloor_~retValue_acc~20, stopRequestedAtCurrentFloor_~tmp~14, stopRequestedAtCurrentFloor_~tmp___0~8;havoc stopRequestedAtCurrentFloor_~retValue_acc~20;havoc stopRequestedAtCurrentFloor_~tmp~14;havoc stopRequestedAtCurrentFloor_~tmp___0~8;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret116, isExecutiveFloorCalling_~retValue_acc~23;havoc isExecutiveFloorCalling_~retValue_acc~23;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~3;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~3; 68331#L372-70 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~3 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~3; 68330#L399-70 isExecutiveFloorCalling_#t~ret116 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~23 := isExecutiveFloorCalling_#t~ret116;havoc isExecutiveFloorCalling_#t~ret116;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~23; 68329#L2714-3 stopRequestedAtCurrentFloor_#t~ret42 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~14 := stopRequestedAtCurrentFloor_#t~ret42;havoc stopRequestedAtCurrentFloor_#t~ret42; 68323#L2099-1 assume 0 != stopRequestedAtCurrentFloor_~tmp~14;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~7;havoc getCurrentFloorID_~retValue_acc~7;getCurrentFloorID_~retValue_acc~7 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~7; 68324#L1362-6 stopRequestedAtCurrentFloor_#t~ret43 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~8 := stopRequestedAtCurrentFloor_#t~ret43;havoc stopRequestedAtCurrentFloor_#t~ret43; 68690#L2103-1 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~8);stopRequestedAtCurrentFloor_~retValue_acc~20 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~20; 68691#L2116-1 timeShift_#t~ret58 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret58;havoc timeShift_#t~ret58; 69495#L2251-1 assume !(0 != timeShift_~tmp___9~2); 69454#L2342-3 assume 1 == ~doorState~0;~doorState~0 := 0; 69449#L2342-5 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret33, stopRequestedInDirection_#t~ret34, stopRequestedInDirection_#t~ret35, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~16, stopRequestedInDirection_~tmp~10, stopRequestedInDirection_~tmp___0~5, stopRequestedInDirection_~__cil_tmp7~0, stopRequestedInDirection_~__cil_tmp8~1;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~16;havoc stopRequestedInDirection_~tmp~10;havoc stopRequestedInDirection_~tmp___0~5;havoc stopRequestedInDirection_~__cil_tmp7~0;havoc stopRequestedInDirection_~__cil_tmp8~1;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret116, isExecutiveFloorCalling_~retValue_acc~23;havoc isExecutiveFloorCalling_~retValue_acc~23;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~3;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~3; 69447#L372-73 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~3 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~3; 69446#L399-73 isExecutiveFloorCalling_#t~ret116 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~23 := isExecutiveFloorCalling_#t~ret116;havoc isExecutiveFloorCalling_#t~ret116;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~23; 68015#L2714-4 stopRequestedInDirection_#t~ret33 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~5 := stopRequestedInDirection_#t~ret33;havoc stopRequestedInDirection_#t~ret33; 67724#L1954-2 assume 0 != stopRequestedInDirection_~tmp___0~5;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~7;havoc getCurrentFloorID_~retValue_acc~7;getCurrentFloorID_~retValue_acc~7 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~7; 67622#L1362-9 stopRequestedInDirection_#t~ret34 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~10 := stopRequestedInDirection_#t~ret34;havoc stopRequestedInDirection_#t~ret34;stopRequestedInDirection_~__cil_tmp7~0 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~1 := (if stopRequestedInDirection_~tmp~10 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~16 := (if stopRequestedInDirection_~__cil_tmp8~1 == stopRequestedInDirection_~__cil_tmp7~0 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~16; 67619#L1967-2 timeShift_#t~ret65 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret65;havoc timeShift_#t~ret65; 67616#L2350-1 assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret36, continueInDirection_~dir, continueInDirection_~tmp~11;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~11;~currentHeading~0 := continueInDirection_~dir; 67613#L2011-3 assume !(1 == ~currentHeading~0); 65159#L2021-9 assume !(0 == ~currentFloorID~0); 67600#L2021-11 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 67597#L2027-11 havoc __utac_acc__Specification9_spec__3_#t~ret6, __utac_acc__Specification9_spec__3_#t~ret7, __utac_acc__Specification9_spec__3_#t~ret8, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~2, __utac_acc__Specification9_spec__3_~tmp___0~2, __utac_acc__Specification9_spec__3_~tmp___1~2;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~2;havoc __utac_acc__Specification9_spec__3_~tmp___0~2;havoc __utac_acc__Specification9_spec__3_~tmp___1~2;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~7;havoc getCurrentFloorID_~retValue_acc~7;getCurrentFloorID_~retValue_acc~7 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~7; 69710#L1362-11 __utac_acc__Specification9_spec__3_#t~ret6 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~2 := __utac_acc__Specification9_spec__3_#t~ret6;havoc __utac_acc__Specification9_spec__3_#t~ret6;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~2;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~11;havoc isEmpty_~retValue_acc~11; 69685#L1422-13 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~11 := 0;isEmpty_#res := isEmpty_~retValue_acc~11; 69682#L1454-13 __utac_acc__Specification9_spec__3_#t~ret7 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~2 := __utac_acc__Specification9_spec__3_#t~ret7;havoc __utac_acc__Specification9_spec__3_#t~ret7; 69634#L1011-2 assume 0 != __utac_acc__Specification9_spec__3_~tmp___1~2;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 69632#L1021-3 cleanup_~i~3 := 1 + cleanup_~i~3; 69630#L3275-2 [2019-01-01 23:25:45,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:25:45,987 INFO L82 PathProgramCache]: Analyzing trace with hash -2000350140, now seen corresponding path program 3 times [2019-01-01 23:25:45,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:25:45,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:25:45,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:25:45,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:25:45,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:25:46,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:25:46,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:25:46,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:25:46,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:25:46,141 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:25:46,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:25:46,141 INFO L82 PathProgramCache]: Analyzing trace with hash 550558516, now seen corresponding path program 1 times [2019-01-01 23:25:46,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:25:46,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:25:46,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:25:46,143 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:25:46,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:25:46,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:25:46,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:25:46,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:25:46,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 23:25:46,278 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:25:46,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 23:25:46,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 23:25:46,279 INFO L87 Difference]: Start difference. First operand 15772 states and 29575 transitions. cyclomatic complexity: 13805 Second operand 4 states. [2019-01-01 23:25:47,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:25:47,673 INFO L93 Difference]: Finished difference Result 43972 states and 82548 transitions. [2019-01-01 23:25:47,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 23:25:47,684 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43972 states and 82548 transitions. [2019-01-01 23:25:47,867 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 36192 [2019-01-01 23:25:48,066 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43972 states to 43972 states and 82548 transitions. [2019-01-01 23:25:48,069 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43972 [2019-01-01 23:25:48,110 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43972 [2019-01-01 23:25:48,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43972 states and 82548 transitions. [2019-01-01 23:25:48,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:25:48,168 INFO L705 BuchiCegarLoop]: Abstraction has 43972 states and 82548 transitions. [2019-01-01 23:25:48,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43972 states and 82548 transitions. [2019-01-01 23:25:48,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43972 to 15794. [2019-01-01 23:25:48,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15794 states. [2019-01-01 23:25:48,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15794 states to 15794 states and 29597 transitions. [2019-01-01 23:25:48,528 INFO L728 BuchiCegarLoop]: Abstraction has 15794 states and 29597 transitions. [2019-01-01 23:25:48,528 INFO L608 BuchiCegarLoop]: Abstraction has 15794 states and 29597 transitions. [2019-01-01 23:25:48,528 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 23:25:48,528 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15794 states and 29597 transitions. [2019-01-01 23:25:48,573 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10556 [2019-01-01 23:25:48,573 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:25:48,573 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:25:48,579 INFO L866 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:25:48,579 INFO L867 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:25:48,580 INFO L794 eck$LassoCheckResult]: Stem: 123901#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~cleanupTimeShifts~0 := 12;~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;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~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~string69.base, #t~string69.offset := #Ultimate.allocOnStack(10);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string71.base, #t~string71.offset, 1);call write~init~int(95, #t~string71.base, 1 + #t~string71.offset, 1);call write~init~int(93, #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(91, #t~string73.base, #t~string73.offset, 1);call write~init~int(93, #t~string73.base, 1 + #t~string73.offset, 1);call write~init~int(32, #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(5);call write~init~int(32, #t~string75.base, #t~string75.offset, 1);call write~init~int(97, #t~string75.base, 1 + #t~string75.offset, 1);call write~init~int(116, #t~string75.base, 2 + #t~string75.offset, 1);call write~init~int(32, #t~string75.base, 3 + #t~string75.offset, 1);call write~init~int(0, #t~string75.base, 4 + #t~string75.offset, 1);call #t~string77.base, #t~string77.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string77.base, #t~string77.offset, 1);call write~init~int(105, #t~string77.base, 1 + #t~string77.offset, 1);call write~init~int(0, #t~string77.base, 2 + #t~string77.offset, 1);call #t~string79.base, #t~string79.offset := #Ultimate.allocOnStack(10);call #t~string81.base, #t~string81.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string81.base, #t~string81.offset, 1);call write~init~int(112, #t~string81.base, 1 + #t~string81.offset, 1);call write~init~int(0, #t~string81.base, 2 + #t~string81.offset, 1);call #t~string83.base, #t~string83.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string83.base, #t~string83.offset, 1);call write~init~int(111, #t~string83.base, 1 + #t~string83.offset, 1);call write~init~int(119, #t~string83.base, 2 + #t~string83.offset, 1);call write~init~int(110, #t~string83.base, 3 + #t~string83.offset, 1);call write~init~int(0, #t~string83.base, 4 + #t~string83.offset, 1);call #t~string85.base, #t~string85.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string85.base, #t~string85.offset, 1);call write~init~int(73, #t~string85.base, 1 + #t~string85.offset, 1);call write~init~int(76, #t~string85.base, 2 + #t~string85.offset, 1);call write~init~int(95, #t~string85.base, 3 + #t~string85.offset, 1);call write~init~int(112, #t~string85.base, 4 + #t~string85.offset, 1);call write~init~int(58, #t~string85.base, 5 + #t~string85.offset, 1);call write~init~int(0, #t~string85.base, 6 + #t~string85.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~string89.base, #t~string89.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string89.base, #t~string89.offset, 1);call write~init~int(37, #t~string89.base, 1 + #t~string89.offset, 1);call write~init~int(105, #t~string89.base, 2 + #t~string89.offset, 1);call write~init~int(0, #t~string89.base, 3 + #t~string89.offset, 1);call #t~string91.base, #t~string91.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string91.base, #t~string91.offset, 1);call write~init~int(37, #t~string91.base, 1 + #t~string91.offset, 1);call write~init~int(105, #t~string91.base, 2 + #t~string91.offset, 1);call write~init~int(0, #t~string91.base, 3 + #t~string91.offset, 1);call #t~string93.base, #t~string93.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string93.base, #t~string93.offset, 1);call write~init~int(37, #t~string93.base, 1 + #t~string93.offset, 1);call write~init~int(105, #t~string93.base, 2 + #t~string93.offset, 1);call write~init~int(0, #t~string93.base, 3 + #t~string93.offset, 1);call #t~string95.base, #t~string95.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string95.base, #t~string95.offset, 1);call write~init~int(37, #t~string95.base, 1 + #t~string95.offset, 1);call write~init~int(105, #t~string95.base, 2 + #t~string95.offset, 1);call write~init~int(0, #t~string95.base, 3 + #t~string95.offset, 1);call #t~string97.base, #t~string97.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string97.base, #t~string97.offset, 1);call write~init~int(70, #t~string97.base, 1 + #t~string97.offset, 1);call write~init~int(95, #t~string97.base, 2 + #t~string97.offset, 1);call write~init~int(112, #t~string97.base, 3 + #t~string97.offset, 1);call write~init~int(58, #t~string97.base, 4 + #t~string97.offset, 1);call write~init~int(0, #t~string97.base, 5 + #t~string97.offset, 1);call #t~string100.base, #t~string100.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string100.base, #t~string100.offset, 1);call write~init~int(37, #t~string100.base, 1 + #t~string100.offset, 1);call write~init~int(105, #t~string100.base, 2 + #t~string100.offset, 1);call write~init~int(0, #t~string100.base, 3 + #t~string100.offset, 1);call #t~string103.base, #t~string103.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string103.base, #t~string103.offset, 1);call write~init~int(37, #t~string103.base, 1 + #t~string103.offset, 1);call write~init~int(105, #t~string103.base, 2 + #t~string103.offset, 1);call write~init~int(0, #t~string103.base, 3 + #t~string103.offset, 1);call #t~string106.base, #t~string106.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string106.base, #t~string106.offset, 1);call write~init~int(37, #t~string106.base, 1 + #t~string106.offset, 1);call write~init~int(105, #t~string106.base, 2 + #t~string106.offset, 1);call write~init~int(0, #t~string106.base, 3 + #t~string106.offset, 1);call #t~string109.base, #t~string109.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string109.base, #t~string109.offset, 1);call write~init~int(37, #t~string109.base, 1 + #t~string109.offset, 1);call write~init~int(105, #t~string109.base, 2 + #t~string109.offset, 1);call write~init~int(0, #t~string109.base, 3 + #t~string109.offset, 1);call #t~string112.base, #t~string112.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string112.base, #t~string112.offset, 1);call write~init~int(37, #t~string112.base, 1 + #t~string112.offset, 1);call write~init~int(105, #t~string112.base, 2 + #t~string112.offset, 1);call write~init~int(0, #t~string112.base, 3 + #t~string112.offset, 1);call #t~string114.base, #t~string114.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string114.base, #t~string114.offset, 1);call write~init~int(0, #t~string114.base, 1 + #t~string114.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string136.base, #t~string136.offset := #Ultimate.allocOnStack(30);call #t~string137.base, #t~string137.offset := #Ultimate.allocOnStack(9);call #t~string138.base, #t~string138.offset := #Ultimate.allocOnStack(21);call #t~string139.base, #t~string139.offset := #Ultimate.allocOnStack(30);call #t~string140.base, #t~string140.offset := #Ultimate.allocOnStack(9);call #t~string141.base, #t~string141.offset := #Ultimate.allocOnStack(21);call #t~string145.base, #t~string145.offset := #Ultimate.allocOnStack(30);call #t~string146.base, #t~string146.offset := #Ultimate.allocOnStack(9);call #t~string147.base, #t~string147.offset := #Ultimate.allocOnStack(25);call #t~string148.base, #t~string148.offset := #Ultimate.allocOnStack(30);call #t~string149.base, #t~string149.offset := #Ultimate.allocOnStack(9);call #t~string150.base, #t~string150.offset := #Ultimate.allocOnStack(25); 123902#L-1 havoc main_#res;havoc main_#t~ret166, main_~retValue_acc~31, main_~tmp~29;havoc main_~retValue_acc~31;havoc main_~tmp~29; 123885#L2753 havoc valid_product_#res;havoc valid_product_~retValue_acc~26;havoc valid_product_~retValue_acc~26;valid_product_~retValue_acc~26 := 1;valid_product_#res := valid_product_~retValue_acc~26; 123886#L2761 main_#t~ret166 := valid_product_#res;main_~tmp~29 := main_#t~ret166;havoc main_#t~ret166; 124545#L3468 assume 0 != main_~tmp~29; 124546#L3443 ~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 124841#L968 havoc bigMacCall_#t~ret159, bigMacCall_~tmp~26;havoc bigMacCall_~tmp~26;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~1;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~1; 124842#L85 assume 0 == getOrigin_~person;getOrigin_~retValue_acc~1 := 4;getOrigin_#res := getOrigin_~retValue_acc~1; 123908#L110 bigMacCall_#t~ret159 := getOrigin_#res;bigMacCall_~tmp~26 := bigMacCall_#t~ret159;havoc bigMacCall_#t~ret159;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~26;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 123196#L643 assume 0 == initPersonOnFloor_~floor; 123197#L644 assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 120941#L751-1 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 121785#L435 assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 121786#L447-2 havoc cleanup_#t~ret160, cleanup_#t~ret161, cleanup_~i~3, cleanup_~tmp~27, cleanup_~tmp___0~12, cleanup_~__cil_tmp4~3;havoc cleanup_~i~3;havoc cleanup_~tmp~27;havoc cleanup_~tmp___0~12;havoc cleanup_~__cil_tmp4~3;havoc timeShift_#t~ret58, timeShift_#t~ret59, timeShift_#t~ret60, timeShift_#t~ret61, timeShift_#t~ret62, timeShift_#t~ret63, timeShift_#t~ret64, timeShift_#t~ret65, timeShift_#t~ret66, timeShift_#t~ret67, timeShift_#t~ret68, timeShift_~tmp~16, timeShift_~tmp___0~10, timeShift_~tmp___1~6, timeShift_~tmp___2~3, timeShift_~tmp___3~3, timeShift_~tmp___4~2, timeShift_~tmp___5~2, timeShift_~tmp___6~2, timeShift_~tmp___7~2, timeShift_~tmp___8~2, timeShift_~tmp___9~2;havoc timeShift_~tmp~16;havoc timeShift_~tmp___0~10;havoc timeShift_~tmp___1~6;havoc timeShift_~tmp___2~3;havoc timeShift_~tmp___3~3;havoc timeShift_~tmp___4~2;havoc timeShift_~tmp___5~2;havoc timeShift_~tmp___6~2;havoc timeShift_~tmp___7~2;havoc timeShift_~tmp___8~2;havoc timeShift_~tmp___9~2;havoc stopRequestedAtCurrentFloor_#res;havoc stopRequestedAtCurrentFloor_#t~ret42, stopRequestedAtCurrentFloor_#t~ret43, stopRequestedAtCurrentFloor_#t~ret44, stopRequestedAtCurrentFloor_#t~ret45, stopRequestedAtCurrentFloor_~retValue_acc~20, stopRequestedAtCurrentFloor_~tmp~14, stopRequestedAtCurrentFloor_~tmp___0~8;havoc stopRequestedAtCurrentFloor_~retValue_acc~20;havoc stopRequestedAtCurrentFloor_~tmp~14;havoc stopRequestedAtCurrentFloor_~tmp___0~8;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret116, isExecutiveFloorCalling_~retValue_acc~23;havoc isExecutiveFloorCalling_~retValue_acc~23;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~3;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~3; 123864#L372 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~3 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~3; 123865#L399 isExecutiveFloorCalling_#t~ret116 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~23 := isExecutiveFloorCalling_#t~ret116;havoc isExecutiveFloorCalling_#t~ret116;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~23; 125280#L2714 stopRequestedAtCurrentFloor_#t~ret42 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~14 := stopRequestedAtCurrentFloor_#t~ret42;havoc stopRequestedAtCurrentFloor_#t~ret42; 125278#L2099 assume 0 != stopRequestedAtCurrentFloor_~tmp~14;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~7;havoc getCurrentFloorID_~retValue_acc~7;getCurrentFloorID_~retValue_acc~7 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~7; 122782#L1362 stopRequestedAtCurrentFloor_#t~ret43 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~8 := stopRequestedAtCurrentFloor_#t~ret43;havoc stopRequestedAtCurrentFloor_#t~ret43; 122783#L2103 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~8);stopRequestedAtCurrentFloor_~retValue_acc~20 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~20; 125256#L2116 timeShift_#t~ret58 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret58;havoc timeShift_#t~ret58; 125248#L2251 assume !(0 != timeShift_~tmp___9~2); 125249#L2342 assume !(1 == ~doorState~0); 123183#L2342-2 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret33, stopRequestedInDirection_#t~ret34, stopRequestedInDirection_#t~ret35, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~16, stopRequestedInDirection_~tmp~10, stopRequestedInDirection_~tmp___0~5, stopRequestedInDirection_~__cil_tmp7~0, stopRequestedInDirection_~__cil_tmp8~1;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~16;havoc stopRequestedInDirection_~tmp~10;havoc stopRequestedInDirection_~tmp___0~5;havoc stopRequestedInDirection_~__cil_tmp7~0;havoc stopRequestedInDirection_~__cil_tmp8~1;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret116, isExecutiveFloorCalling_~retValue_acc~23;havoc isExecutiveFloorCalling_~retValue_acc~23;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~3;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~3; 123184#L372-3 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~3 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~3; 125308#L399-3 isExecutiveFloorCalling_#t~ret116 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~23 := isExecutiveFloorCalling_#t~ret116;havoc isExecutiveFloorCalling_#t~ret116;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~23; 125309#L2714-1 stopRequestedInDirection_#t~ret33 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~5 := stopRequestedInDirection_#t~ret33;havoc stopRequestedInDirection_#t~ret33; 125243#L1954 assume 0 != stopRequestedInDirection_~tmp___0~5;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~7;havoc getCurrentFloorID_~retValue_acc~7;getCurrentFloorID_~retValue_acc~7 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~7; 125244#L1362-3 stopRequestedInDirection_#t~ret34 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~10 := stopRequestedInDirection_#t~ret34;havoc stopRequestedInDirection_#t~ret34;stopRequestedInDirection_~__cil_tmp7~0 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~1 := (if stopRequestedInDirection_~tmp~10 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~16 := (if stopRequestedInDirection_~__cil_tmp8~1 == stopRequestedInDirection_~__cil_tmp7~0 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~16; 125333#L1967 timeShift_#t~ret65 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret65;havoc timeShift_#t~ret65; 125331#L2350 assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret36, continueInDirection_~dir, continueInDirection_~tmp~11;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~11;~currentHeading~0 := continueInDirection_~dir; 125332#L2011 assume !(1 == ~currentHeading~0); 124878#L2021 assume !(0 == ~currentFloorID~0); 122053#L2021-2 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 124867#L2027-5 havoc __utac_acc__Specification9_spec__3_#t~ret6, __utac_acc__Specification9_spec__3_#t~ret7, __utac_acc__Specification9_spec__3_#t~ret8, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~2, __utac_acc__Specification9_spec__3_~tmp___0~2, __utac_acc__Specification9_spec__3_~tmp___1~2;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~2;havoc __utac_acc__Specification9_spec__3_~tmp___0~2;havoc __utac_acc__Specification9_spec__3_~tmp___1~2;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~7;havoc getCurrentFloorID_~retValue_acc~7;getCurrentFloorID_~retValue_acc~7 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~7; 122769#L1362-5 __utac_acc__Specification9_spec__3_#t~ret6 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~2 := __utac_acc__Specification9_spec__3_#t~ret6;havoc __utac_acc__Specification9_spec__3_#t~ret6;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~2;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~11;havoc isEmpty_~retValue_acc~11; 122770#L1422-6 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~11 := 0;isEmpty_#res := isEmpty_~retValue_acc~11; 123644#L1454-6 __utac_acc__Specification9_spec__3_#t~ret7 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~2 := __utac_acc__Specification9_spec__3_#t~ret7;havoc __utac_acc__Specification9_spec__3_#t~ret7; 122603#L1011 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~2);havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~8;havoc areDoorsOpen_~retValue_acc~8;areDoorsOpen_~retValue_acc~8 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~8; 122604#L1371 __utac_acc__Specification9_spec__3_#t~ret8 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~2 := __utac_acc__Specification9_spec__3_#t~ret8;havoc __utac_acc__Specification9_spec__3_#t~ret8; 123176#L1021 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___0~2); 120920#L1021-1 cleanup_~i~3 := 0; 127537#L3275-2 [2019-01-01 23:25:48,580 INFO L796 eck$LassoCheckResult]: Loop: 127537#L3275-2 assume !false; 127533#L3276 cleanup_~__cil_tmp4~3 := ~cleanupTimeShifts~0 - 1; 127530#L3279 assume cleanup_~i~3 < cleanup_~__cil_tmp4~3;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~6;havoc isBlocked_~retValue_acc~6;isBlocked_~retValue_acc~6 := 0;isBlocked_#res := isBlocked_~retValue_acc~6; 127526#L1185 cleanup_#t~ret160 := isBlocked_#res;cleanup_~tmp___0~12 := cleanup_#t~ret160;havoc cleanup_#t~ret160; 127524#L3283 assume 1 != cleanup_~tmp___0~12; 127523#L3283-1 havoc isIdle_#res;havoc isIdle_#t~ret17, isIdle_~retValue_acc~13, isIdle_~tmp~7;havoc isIdle_~retValue_acc~13;havoc isIdle_~tmp~7;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret12, anyStopRequested_#t~ret13, anyStopRequested_#t~ret14, anyStopRequested_#t~ret15, anyStopRequested_#t~ret16, anyStopRequested_~retValue_acc~12, anyStopRequested_~tmp~6, anyStopRequested_~tmp___0~3, anyStopRequested_~tmp___1~3, anyStopRequested_~tmp___2~0, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~12;havoc anyStopRequested_~tmp~6;havoc anyStopRequested_~tmp___0~3;havoc anyStopRequested_~tmp___1~3;havoc anyStopRequested_~tmp___2~0;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~3;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~3; 127522#L372-65 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~3 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~3; 127512#L399-65 anyStopRequested_#t~ret12 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret12;havoc anyStopRequested_#t~ret12; 127504#L1470 assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~12 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~12; 127495#L1534 isIdle_#t~ret17 := anyStopRequested_#res;isIdle_~tmp~7 := isIdle_#t~ret17;havoc isIdle_#t~ret17;isIdle_~retValue_acc~13 := (if 0 == isIdle_~tmp~7 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~13; 127484#L1547 cleanup_#t~ret161 := isIdle_#res;cleanup_~tmp~27 := cleanup_#t~ret161;havoc cleanup_#t~ret161; 127478#L3295 assume !(0 != cleanup_~tmp~27);havoc timeShift_#t~ret58, timeShift_#t~ret59, timeShift_#t~ret60, timeShift_#t~ret61, timeShift_#t~ret62, timeShift_#t~ret63, timeShift_#t~ret64, timeShift_#t~ret65, timeShift_#t~ret66, timeShift_#t~ret67, timeShift_#t~ret68, timeShift_~tmp~16, timeShift_~tmp___0~10, timeShift_~tmp___1~6, timeShift_~tmp___2~3, timeShift_~tmp___3~3, timeShift_~tmp___4~2, timeShift_~tmp___5~2, timeShift_~tmp___6~2, timeShift_~tmp___7~2, timeShift_~tmp___8~2, timeShift_~tmp___9~2;havoc timeShift_~tmp~16;havoc timeShift_~tmp___0~10;havoc timeShift_~tmp___1~6;havoc timeShift_~tmp___2~3;havoc timeShift_~tmp___3~3;havoc timeShift_~tmp___4~2;havoc timeShift_~tmp___5~2;havoc timeShift_~tmp___6~2;havoc timeShift_~tmp___7~2;havoc timeShift_~tmp___8~2;havoc timeShift_~tmp___9~2;havoc stopRequestedAtCurrentFloor_#res;havoc stopRequestedAtCurrentFloor_#t~ret42, stopRequestedAtCurrentFloor_#t~ret43, stopRequestedAtCurrentFloor_#t~ret44, stopRequestedAtCurrentFloor_#t~ret45, stopRequestedAtCurrentFloor_~retValue_acc~20, stopRequestedAtCurrentFloor_~tmp~14, stopRequestedAtCurrentFloor_~tmp___0~8;havoc stopRequestedAtCurrentFloor_~retValue_acc~20;havoc stopRequestedAtCurrentFloor_~tmp~14;havoc stopRequestedAtCurrentFloor_~tmp___0~8;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret116, isExecutiveFloorCalling_~retValue_acc~23;havoc isExecutiveFloorCalling_~retValue_acc~23;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~3;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~3; 127479#L372-70 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~3 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~3; 127415#L399-70 isExecutiveFloorCalling_#t~ret116 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~23 := isExecutiveFloorCalling_#t~ret116;havoc isExecutiveFloorCalling_#t~ret116;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~23; 127470#L2714-3 stopRequestedAtCurrentFloor_#t~ret42 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~14 := stopRequestedAtCurrentFloor_#t~ret42;havoc stopRequestedAtCurrentFloor_#t~ret42; 127457#L2099-1 assume 0 != stopRequestedAtCurrentFloor_~tmp~14;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~7;havoc getCurrentFloorID_~retValue_acc~7;getCurrentFloorID_~retValue_acc~7 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~7; 127453#L1362-6 stopRequestedAtCurrentFloor_#t~ret43 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~8 := stopRequestedAtCurrentFloor_#t~ret43;havoc stopRequestedAtCurrentFloor_#t~ret43; 127448#L2103-1 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~8);stopRequestedAtCurrentFloor_~retValue_acc~20 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~20; 122051#L2116-1 timeShift_#t~ret58 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret58;havoc timeShift_#t~ret58; 134225#L2251-1 assume !(0 != timeShift_~tmp___9~2); 123181#L2342-3 assume 1 == ~doorState~0;~doorState~0 := 0; 123182#L2342-5 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret33, stopRequestedInDirection_#t~ret34, stopRequestedInDirection_#t~ret35, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~16, stopRequestedInDirection_~tmp~10, stopRequestedInDirection_~tmp___0~5, stopRequestedInDirection_~__cil_tmp7~0, stopRequestedInDirection_~__cil_tmp8~1;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~16;havoc stopRequestedInDirection_~tmp~10;havoc stopRequestedInDirection_~tmp___0~5;havoc stopRequestedInDirection_~__cil_tmp7~0;havoc stopRequestedInDirection_~__cil_tmp8~1;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret116, isExecutiveFloorCalling_~retValue_acc~23;havoc isExecutiveFloorCalling_~retValue_acc~23;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~3;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~3; 123187#L372-73 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~3 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~3; 122370#L399-73 isExecutiveFloorCalling_#t~ret116 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~23 := isExecutiveFloorCalling_#t~ret116;havoc isExecutiveFloorCalling_#t~ret116;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~23; 121019#L2714-4 stopRequestedInDirection_#t~ret33 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~5 := stopRequestedInDirection_#t~ret33;havoc stopRequestedInDirection_#t~ret33; 121020#L1954-2 assume 0 != stopRequestedInDirection_~tmp___0~5;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~7;havoc getCurrentFloorID_~retValue_acc~7;getCurrentFloorID_~retValue_acc~7 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~7; 122752#L1362-9 stopRequestedInDirection_#t~ret34 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~10 := stopRequestedInDirection_#t~ret34;havoc stopRequestedInDirection_#t~ret34;stopRequestedInDirection_~__cil_tmp7~0 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~1 := (if stopRequestedInDirection_~tmp~10 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~16 := (if stopRequestedInDirection_~__cil_tmp8~1 == stopRequestedInDirection_~__cil_tmp7~0 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~16; 122753#L1967-2 timeShift_#t~ret65 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret65;havoc timeShift_#t~ret65; 122876#L2350-1 assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret36, continueInDirection_~dir, continueInDirection_~tmp~11;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~11;~currentHeading~0 := continueInDirection_~dir; 122080#L2011-3 assume !(1 == ~currentHeading~0); 122081#L2021-9 assume !(0 == ~currentFloorID~0); 122042#L2021-11 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 124784#L2027-11 havoc __utac_acc__Specification9_spec__3_#t~ret6, __utac_acc__Specification9_spec__3_#t~ret7, __utac_acc__Specification9_spec__3_#t~ret8, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~2, __utac_acc__Specification9_spec__3_~tmp___0~2, __utac_acc__Specification9_spec__3_~tmp___1~2;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~2;havoc __utac_acc__Specification9_spec__3_~tmp___0~2;havoc __utac_acc__Specification9_spec__3_~tmp___1~2;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~7;havoc getCurrentFloorID_~retValue_acc~7;getCurrentFloorID_~retValue_acc~7 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~7; 124785#L1362-11 __utac_acc__Specification9_spec__3_#t~ret6 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~2 := __utac_acc__Specification9_spec__3_#t~ret6;havoc __utac_acc__Specification9_spec__3_#t~ret6;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~2;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~11;havoc isEmpty_~retValue_acc~11; 127571#L1422-13 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~11 := 0;isEmpty_#res := isEmpty_~retValue_acc~11; 127558#L1454-13 __utac_acc__Specification9_spec__3_#t~ret7 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~2 := __utac_acc__Specification9_spec__3_#t~ret7;havoc __utac_acc__Specification9_spec__3_#t~ret7; 128376#L1011-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~2);havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~8;havoc areDoorsOpen_~retValue_acc~8;areDoorsOpen_~retValue_acc~8 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~8; 127547#L1371-1 __utac_acc__Specification9_spec__3_#t~ret8 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~2 := __utac_acc__Specification9_spec__3_#t~ret8;havoc __utac_acc__Specification9_spec__3_#t~ret8; 127550#L1021-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___0~2); 127544#L1021-3 cleanup_~i~3 := 1 + cleanup_~i~3; 127537#L3275-2 [2019-01-01 23:25:48,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:25:48,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1809138305, now seen corresponding path program 1 times [2019-01-01 23:25:48,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:25:48,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:25:48,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:25:48,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:25:48,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:25:48,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:25:48,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:25:48,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:25:48,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:25:48,692 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:25:48,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:25:48,693 INFO L82 PathProgramCache]: Analyzing trace with hash 806310577, now seen corresponding path program 1 times [2019-01-01 23:25:48,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:25:48,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:25:48,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:25:48,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:25:48,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:25:48,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:25:48,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:25:49,504 WARN L181 SmtUtils]: Spent 718.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 165 [2019-01-01 23:25:50,745 WARN L181 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 157 DAG size of output: 129 [2019-01-01 23:25:50,769 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:25:50,770 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:25:50,770 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:25:50,770 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:25:50,771 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:25:50,771 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:25:50,771 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:25:50,771 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:25:50,771 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec9_product31_true-unreach-call_true-termination.cil.c_Iteration4_Loop [2019-01-01 23:25:50,771 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:25:50,771 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:25:50,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:50,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:50,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:50,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:50,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:50,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:50,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:50,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:50,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:50,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:50,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:50,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-01 23:25:50,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:50,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:50,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:50,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:50,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:50,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:50,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:50,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:50,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:50,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:50,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:50,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:51,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:51,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:51,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:51,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:51,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:51,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:51,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:51,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:51,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:51,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:51,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:51,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:51,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:51,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:51,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:51,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:51,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:51,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:51,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:51,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:51,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:51,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:51,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:51,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:51,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:51,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:51,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:51,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:51,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:51,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-01 23:25:51,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:51,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:51,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:51,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-01 23:25:51,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:51,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:51,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:51,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:51,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:51,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:51,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:51,475 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-01 23:25:51,769 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-01 23:25:52,236 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2019-01-01 23:25:52,771 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:25:52,772 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-01 23:25:52,786 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:25:52,787 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:25:52,797 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:25:52,798 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_isIdle_~retValue_acc~13=0} Honda state: {ULTIMATE.start_isIdle_~retValue_acc~13=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-01 23:25:52,819 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:25:52,820 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:25:52,825 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:25:52,825 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_~tmp___7~2=0} Honda state: {ULTIMATE.start_timeShift_~tmp___7~2=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-01 23:25:52,848 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:25:52,849 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:25:52,852 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:25:52,852 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_~tmp___9~2=0, ULTIMATE.start_stopRequestedAtCurrentFloor_#res=0} Honda state: {ULTIMATE.start_timeShift_~tmp___9~2=0, ULTIMATE.start_stopRequestedAtCurrentFloor_#res=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) [2019-01-01 23:25:52,891 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:25:52,892 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:25:52,909 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:25:52,909 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_continueInDirection_#t~ret36=0} Honda state: {ULTIMATE.start_continueInDirection_#t~ret36=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) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:25:53,027 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:25:53,027 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:25:53,043 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:25:53,043 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_isIdle_#t~ret17=0} Honda state: {ULTIMATE.start_isIdle_#t~ret17=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) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:25:53,075 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:25:53,075 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:25:53,079 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:25:53,079 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_~tmp~16=0} Honda state: {ULTIMATE.start_timeShift_~tmp~16=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-01 23:25:53,102 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:25:53,102 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:25:53,105 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:25:53,105 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_isExecutiveFloorCalling_#t~ret116=0} Honda state: {ULTIMATE.start_isExecutiveFloorCalling_#t~ret116=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-01 23:25:53,128 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:25:53,129 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:25:53,146 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:25:53,146 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_#res=1, ULTIMATE.start_anyStopRequested_~retValue_acc~12=1, ULTIMATE.start_isIdle_~tmp~7=1} Honda state: {ULTIMATE.start_anyStopRequested_#res=1, ULTIMATE.start_anyStopRequested_~retValue_acc~12=1, ULTIMATE.start_isIdle_~tmp~7=1} 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-01 23:25:53,174 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:25:53,174 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:25:53,178 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:25:53,178 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_#t~ret59=0} Honda state: {ULTIMATE.start_timeShift_#t~ret59=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) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:25:53,201 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:25:53,201 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:25:53,205 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:25:53,205 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification9_spec__3_~tmp___1~2=0} Honda state: {ULTIMATE.start___utac_acc__Specification9_spec__3_~tmp___1~2=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-01 23:25:53,228 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:25:53,228 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:25:53,231 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:25:53,232 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_~tmp___1~6=0} Honda state: {ULTIMATE.start_timeShift_~tmp___1~6=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-01 23:25:53,253 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:25:53,253 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:25:53,255 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:25:53,256 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 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-01 23:25:53,276 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:25:53,276 INFO L163 nArgumentSynthesizer]: Using integer mode. 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-01 23:25:53,299 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:25:53,300 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:25:53,309 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:25:53,326 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:25:53,326 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:25:53,326 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:25:53,327 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:25:53,327 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:25:53,327 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:25:53,327 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:25:53,327 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:25:53,327 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec9_product31_true-unreach-call_true-termination.cil.c_Iteration4_Loop [2019-01-01 23:25:53,327 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:25:53,327 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:25:53,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:53,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:53,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:53,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:53,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-01 23:25:53,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-01 23:25:53,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:53,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:53,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:53,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:53,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:53,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:53,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:53,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:53,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:53,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:53,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:53,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:53,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:53,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:53,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:53,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:53,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:53,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:53,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:53,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:53,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:53,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:53,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:53,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:53,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:53,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:53,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:53,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:53,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:53,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:53,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:53,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:53,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:53,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:53,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:53,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-01 23:25:53,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:53,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:53,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:53,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:53,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:53,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:53,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:53,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:53,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:53,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:53,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:53,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-01 23:25:53,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:53,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-01 23:25:53,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:53,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:53,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:53,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:53,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:53,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:53,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:53,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:53,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:54,172 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-01 23:25:54,296 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-01 23:25:54,530 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2019-01-01 23:25:55,011 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:25:55,017 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:25:55,019 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:25:55,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:25:55,021 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:25:55,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:25:55,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:25:55,022 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:25:55,024 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:25:55,024 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:25:55,027 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:25:55,028 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:25:55,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:25:55,028 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:25:55,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:25:55,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:25:55,029 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:25:55,029 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:25:55,029 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:25:55,030 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:25:55,030 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:25:55,030 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:25:55,031 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:25:55,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:25:55,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:25:55,031 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:25:55,032 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:25:55,032 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:25:55,033 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:25:55,033 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:25:55,033 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:25:55,034 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:25:55,034 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:25:55,034 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:25:55,034 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:25:55,037 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:25:55,037 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:25:55,045 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:25:55,046 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:25:55,046 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:25:55,047 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:25:55,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:25:55,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:25:55,047 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:25:55,048 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:25:55,048 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:25:55,048 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:25:55,049 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:25:55,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:25:55,049 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:25:55,049 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:25:55,049 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:25:55,050 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:25:55,050 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:25:55,050 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:25:55,052 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:25:55,053 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:25:55,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:25:55,053 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:25:55,054 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:25:55,054 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:25:55,054 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:25:55,054 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:25:55,054 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:25:55,055 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:25:55,055 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:25:55,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:25:55,056 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:25:55,056 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:25:55,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:25:55,056 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:25:55,056 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:25:55,056 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:25:55,057 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:25:55,057 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:25:55,058 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:25:55,058 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:25:55,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:25:55,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:25:55,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:25:55,058 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:25:55,059 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:25:55,059 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:25:55,060 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:25:55,060 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:25:55,060 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:25:55,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:25:55,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:25:55,060 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:25:55,061 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:25:55,061 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:25:55,062 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:25:55,062 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:25:55,062 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:25:55,062 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:25:55,063 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:25:55,063 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:25:55,063 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:25:55,063 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:25:55,064 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:25:55,066 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:25:55,066 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:25:55,067 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:25:55,067 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:25:55,067 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:25:55,067 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:25:55,067 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:25:55,067 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:25:55,068 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:25:55,068 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:25:55,069 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:25:55,069 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:25:55,069 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:25:55,069 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:25:55,069 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:25:55,070 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:25:55,070 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:25:55,070 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:25:55,071 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:25:55,071 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:25:55,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:25:55,071 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:25:55,072 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:25:55,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:25:55,072 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:25:55,072 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:25:55,072 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:25:55,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:25:55,073 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:25:55,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:25:55,074 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:25:55,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:25:55,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:25:55,074 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:25:55,074 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:25:55,074 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:25:55,075 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:25:55,075 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:25:55,076 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:25:55,076 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:25:55,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:25:55,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:25:55,076 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:25:55,077 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:25:55,077 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:25:55,079 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:25:55,087 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 23:25:55,087 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 23:25:55,089 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:25:55,089 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:25:55,090 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:25:55,090 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~doorState~0) = 1*~doorState~0 Supporting invariants [] [2019-01-01 23:25:55,091 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:25:55,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:25:55,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:25:55,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:25:55,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:25:55,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:25:55,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:25:55,610 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 23:25:55,611 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15794 states and 29597 transitions. cyclomatic complexity: 13805 Second operand 4 states. [2019-01-01 23:25:56,523 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15794 states and 29597 transitions. cyclomatic complexity: 13805. Second operand 4 states. Result 26091 states and 48597 transitions. Complement of second has 5 states. [2019-01-01 23:25:56,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 23:25:56,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 23:25:56,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5219 transitions. [2019-01-01 23:25:56,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5219 transitions. Stem has 42 letters. Loop has 40 letters. [2019-01-01 23:25:56,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:25:56,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5219 transitions. Stem has 82 letters. Loop has 40 letters. [2019-01-01 23:25:56,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:25:56,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5219 transitions. Stem has 42 letters. Loop has 80 letters. [2019-01-01 23:25:56,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:25:56,553 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26091 states and 48597 transitions. [2019-01-01 23:25:56,684 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 15620 [2019-01-01 23:25:56,811 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26091 states to 26091 states and 48597 transitions. [2019-01-01 23:25:56,812 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20936 [2019-01-01 23:25:56,838 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20947 [2019-01-01 23:25:56,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26091 states and 48597 transitions. [2019-01-01 23:25:56,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:25:56,842 INFO L705 BuchiCegarLoop]: Abstraction has 26091 states and 48597 transitions. [2019-01-01 23:25:56,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26091 states and 48597 transitions. [2019-01-01 23:25:57,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26091 to 26081. [2019-01-01 23:25:57,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26081 states. [2019-01-01 23:25:57,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26081 states to 26081 states and 48585 transitions. [2019-01-01 23:25:57,200 INFO L728 BuchiCegarLoop]: Abstraction has 26081 states and 48585 transitions. [2019-01-01 23:25:57,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:25:57,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:25:57,203 INFO L87 Difference]: Start difference. First operand 26081 states and 48585 transitions. Second operand 3 states. [2019-01-01 23:25:57,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:25:57,487 INFO L93 Difference]: Finished difference Result 26081 states and 48579 transitions. [2019-01-01 23:25:57,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:25:57,489 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26081 states and 48579 transitions. [2019-01-01 23:25:57,617 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 15620 [2019-01-01 23:25:57,714 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26081 states to 26081 states and 48579 transitions. [2019-01-01 23:25:57,715 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20937 [2019-01-01 23:25:57,738 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20937 [2019-01-01 23:25:57,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26081 states and 48579 transitions. [2019-01-01 23:25:57,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:25:57,767 INFO L705 BuchiCegarLoop]: Abstraction has 26081 states and 48579 transitions. [2019-01-01 23:25:57,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26081 states and 48579 transitions. [2019-01-01 23:25:58,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26081 to 26081. [2019-01-01 23:25:58,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26081 states. [2019-01-01 23:25:58,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26081 states to 26081 states and 48579 transitions. [2019-01-01 23:25:58,117 INFO L728 BuchiCegarLoop]: Abstraction has 26081 states and 48579 transitions. [2019-01-01 23:25:58,117 INFO L608 BuchiCegarLoop]: Abstraction has 26081 states and 48579 transitions. [2019-01-01 23:25:58,117 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 23:25:58,117 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26081 states and 48579 transitions. [2019-01-01 23:25:58,200 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 15620 [2019-01-01 23:25:58,201 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:25:58,201 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:25:58,206 INFO L866 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:25:58,206 INFO L867 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:25:58,207 INFO L794 eck$LassoCheckResult]: Stem: 218814#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~cleanupTimeShifts~0 := 12;~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;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~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~string69.base, #t~string69.offset := #Ultimate.allocOnStack(10);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string71.base, #t~string71.offset, 1);call write~init~int(95, #t~string71.base, 1 + #t~string71.offset, 1);call write~init~int(93, #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(91, #t~string73.base, #t~string73.offset, 1);call write~init~int(93, #t~string73.base, 1 + #t~string73.offset, 1);call write~init~int(32, #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(5);call write~init~int(32, #t~string75.base, #t~string75.offset, 1);call write~init~int(97, #t~string75.base, 1 + #t~string75.offset, 1);call write~init~int(116, #t~string75.base, 2 + #t~string75.offset, 1);call write~init~int(32, #t~string75.base, 3 + #t~string75.offset, 1);call write~init~int(0, #t~string75.base, 4 + #t~string75.offset, 1);call #t~string77.base, #t~string77.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string77.base, #t~string77.offset, 1);call write~init~int(105, #t~string77.base, 1 + #t~string77.offset, 1);call write~init~int(0, #t~string77.base, 2 + #t~string77.offset, 1);call #t~string79.base, #t~string79.offset := #Ultimate.allocOnStack(10);call #t~string81.base, #t~string81.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string81.base, #t~string81.offset, 1);call write~init~int(112, #t~string81.base, 1 + #t~string81.offset, 1);call write~init~int(0, #t~string81.base, 2 + #t~string81.offset, 1);call #t~string83.base, #t~string83.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string83.base, #t~string83.offset, 1);call write~init~int(111, #t~string83.base, 1 + #t~string83.offset, 1);call write~init~int(119, #t~string83.base, 2 + #t~string83.offset, 1);call write~init~int(110, #t~string83.base, 3 + #t~string83.offset, 1);call write~init~int(0, #t~string83.base, 4 + #t~string83.offset, 1);call #t~string85.base, #t~string85.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string85.base, #t~string85.offset, 1);call write~init~int(73, #t~string85.base, 1 + #t~string85.offset, 1);call write~init~int(76, #t~string85.base, 2 + #t~string85.offset, 1);call write~init~int(95, #t~string85.base, 3 + #t~string85.offset, 1);call write~init~int(112, #t~string85.base, 4 + #t~string85.offset, 1);call write~init~int(58, #t~string85.base, 5 + #t~string85.offset, 1);call write~init~int(0, #t~string85.base, 6 + #t~string85.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~string89.base, #t~string89.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string89.base, #t~string89.offset, 1);call write~init~int(37, #t~string89.base, 1 + #t~string89.offset, 1);call write~init~int(105, #t~string89.base, 2 + #t~string89.offset, 1);call write~init~int(0, #t~string89.base, 3 + #t~string89.offset, 1);call #t~string91.base, #t~string91.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string91.base, #t~string91.offset, 1);call write~init~int(37, #t~string91.base, 1 + #t~string91.offset, 1);call write~init~int(105, #t~string91.base, 2 + #t~string91.offset, 1);call write~init~int(0, #t~string91.base, 3 + #t~string91.offset, 1);call #t~string93.base, #t~string93.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string93.base, #t~string93.offset, 1);call write~init~int(37, #t~string93.base, 1 + #t~string93.offset, 1);call write~init~int(105, #t~string93.base, 2 + #t~string93.offset, 1);call write~init~int(0, #t~string93.base, 3 + #t~string93.offset, 1);call #t~string95.base, #t~string95.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string95.base, #t~string95.offset, 1);call write~init~int(37, #t~string95.base, 1 + #t~string95.offset, 1);call write~init~int(105, #t~string95.base, 2 + #t~string95.offset, 1);call write~init~int(0, #t~string95.base, 3 + #t~string95.offset, 1);call #t~string97.base, #t~string97.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string97.base, #t~string97.offset, 1);call write~init~int(70, #t~string97.base, 1 + #t~string97.offset, 1);call write~init~int(95, #t~string97.base, 2 + #t~string97.offset, 1);call write~init~int(112, #t~string97.base, 3 + #t~string97.offset, 1);call write~init~int(58, #t~string97.base, 4 + #t~string97.offset, 1);call write~init~int(0, #t~string97.base, 5 + #t~string97.offset, 1);call #t~string100.base, #t~string100.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string100.base, #t~string100.offset, 1);call write~init~int(37, #t~string100.base, 1 + #t~string100.offset, 1);call write~init~int(105, #t~string100.base, 2 + #t~string100.offset, 1);call write~init~int(0, #t~string100.base, 3 + #t~string100.offset, 1);call #t~string103.base, #t~string103.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string103.base, #t~string103.offset, 1);call write~init~int(37, #t~string103.base, 1 + #t~string103.offset, 1);call write~init~int(105, #t~string103.base, 2 + #t~string103.offset, 1);call write~init~int(0, #t~string103.base, 3 + #t~string103.offset, 1);call #t~string106.base, #t~string106.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string106.base, #t~string106.offset, 1);call write~init~int(37, #t~string106.base, 1 + #t~string106.offset, 1);call write~init~int(105, #t~string106.base, 2 + #t~string106.offset, 1);call write~init~int(0, #t~string106.base, 3 + #t~string106.offset, 1);call #t~string109.base, #t~string109.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string109.base, #t~string109.offset, 1);call write~init~int(37, #t~string109.base, 1 + #t~string109.offset, 1);call write~init~int(105, #t~string109.base, 2 + #t~string109.offset, 1);call write~init~int(0, #t~string109.base, 3 + #t~string109.offset, 1);call #t~string112.base, #t~string112.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string112.base, #t~string112.offset, 1);call write~init~int(37, #t~string112.base, 1 + #t~string112.offset, 1);call write~init~int(105, #t~string112.base, 2 + #t~string112.offset, 1);call write~init~int(0, #t~string112.base, 3 + #t~string112.offset, 1);call #t~string114.base, #t~string114.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string114.base, #t~string114.offset, 1);call write~init~int(0, #t~string114.base, 1 + #t~string114.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string136.base, #t~string136.offset := #Ultimate.allocOnStack(30);call #t~string137.base, #t~string137.offset := #Ultimate.allocOnStack(9);call #t~string138.base, #t~string138.offset := #Ultimate.allocOnStack(21);call #t~string139.base, #t~string139.offset := #Ultimate.allocOnStack(30);call #t~string140.base, #t~string140.offset := #Ultimate.allocOnStack(9);call #t~string141.base, #t~string141.offset := #Ultimate.allocOnStack(21);call #t~string145.base, #t~string145.offset := #Ultimate.allocOnStack(30);call #t~string146.base, #t~string146.offset := #Ultimate.allocOnStack(9);call #t~string147.base, #t~string147.offset := #Ultimate.allocOnStack(25);call #t~string148.base, #t~string148.offset := #Ultimate.allocOnStack(30);call #t~string149.base, #t~string149.offset := #Ultimate.allocOnStack(9);call #t~string150.base, #t~string150.offset := #Ultimate.allocOnStack(25); 218815#L-1 havoc main_#res;havoc main_#t~ret166, main_~retValue_acc~31, main_~tmp~29;havoc main_~retValue_acc~31;havoc main_~tmp~29; 218791#L2753 havoc valid_product_#res;havoc valid_product_~retValue_acc~26;havoc valid_product_~retValue_acc~26;valid_product_~retValue_acc~26 := 1;valid_product_#res := valid_product_~retValue_acc~26; 218792#L2761 main_#t~ret166 := valid_product_#res;main_~tmp~29 := main_#t~ret166;havoc main_#t~ret166; 219566#L3468 assume 0 != main_~tmp~29; 219567#L3443 ~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 219854#L968 havoc bigMacCall_#t~ret159, bigMacCall_~tmp~26;havoc bigMacCall_~tmp~26;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~1;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~1; 219855#L85 assume !(0 == getOrigin_~person); 219814#L89 assume !(1 == getOrigin_~person); 219741#L93 assume !(2 == getOrigin_~person); 219742#L97 assume !(3 == getOrigin_~person); 220042#L101 assume !(4 == getOrigin_~person); 218912#L105 assume 5 == getOrigin_~person;getOrigin_~retValue_acc~1 := 1;getOrigin_#res := getOrigin_~retValue_acc~1; 218822#L110 bigMacCall_#t~ret159 := getOrigin_#res;bigMacCall_~tmp~26 := bigMacCall_#t~ret159;havoc bigMacCall_#t~ret159;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~26;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 217899#L643 assume 0 == initPersonOnFloor_~floor; 217900#L644 assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 215275#L751-1 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 216228#L435 assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 216229#L447-2 havoc cleanup_#t~ret160, cleanup_#t~ret161, cleanup_~i~3, cleanup_~tmp~27, cleanup_~tmp___0~12, cleanup_~__cil_tmp4~3;havoc cleanup_~i~3;havoc cleanup_~tmp~27;havoc cleanup_~tmp___0~12;havoc cleanup_~__cil_tmp4~3;havoc timeShift_#t~ret58, timeShift_#t~ret59, timeShift_#t~ret60, timeShift_#t~ret61, timeShift_#t~ret62, timeShift_#t~ret63, timeShift_#t~ret64, timeShift_#t~ret65, timeShift_#t~ret66, timeShift_#t~ret67, timeShift_#t~ret68, timeShift_~tmp~16, timeShift_~tmp___0~10, timeShift_~tmp___1~6, timeShift_~tmp___2~3, timeShift_~tmp___3~3, timeShift_~tmp___4~2, timeShift_~tmp___5~2, timeShift_~tmp___6~2, timeShift_~tmp___7~2, timeShift_~tmp___8~2, timeShift_~tmp___9~2;havoc timeShift_~tmp~16;havoc timeShift_~tmp___0~10;havoc timeShift_~tmp___1~6;havoc timeShift_~tmp___2~3;havoc timeShift_~tmp___3~3;havoc timeShift_~tmp___4~2;havoc timeShift_~tmp___5~2;havoc timeShift_~tmp___6~2;havoc timeShift_~tmp___7~2;havoc timeShift_~tmp___8~2;havoc timeShift_~tmp___9~2;havoc stopRequestedAtCurrentFloor_#res;havoc stopRequestedAtCurrentFloor_#t~ret42, stopRequestedAtCurrentFloor_#t~ret43, stopRequestedAtCurrentFloor_#t~ret44, stopRequestedAtCurrentFloor_#t~ret45, stopRequestedAtCurrentFloor_~retValue_acc~20, stopRequestedAtCurrentFloor_~tmp~14, stopRequestedAtCurrentFloor_~tmp___0~8;havoc stopRequestedAtCurrentFloor_~retValue_acc~20;havoc stopRequestedAtCurrentFloor_~tmp~14;havoc stopRequestedAtCurrentFloor_~tmp___0~8;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret116, isExecutiveFloorCalling_~retValue_acc~23;havoc isExecutiveFloorCalling_~retValue_acc~23;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~3;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~3; 218767#L372 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~3 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~3; 217106#L399 isExecutiveFloorCalling_#t~ret116 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~23 := isExecutiveFloorCalling_#t~ret116;havoc isExecutiveFloorCalling_#t~ret116;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~23; 215429#L2714 stopRequestedAtCurrentFloor_#t~ret42 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~14 := stopRequestedAtCurrentFloor_#t~ret42;havoc stopRequestedAtCurrentFloor_#t~ret42; 215430#L2099 assume 0 != stopRequestedAtCurrentFloor_~tmp~14;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~7;havoc getCurrentFloorID_~retValue_acc~7;getCurrentFloorID_~retValue_acc~7 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~7; 216585#L1362 stopRequestedAtCurrentFloor_#t~ret43 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~8 := stopRequestedAtCurrentFloor_#t~ret43;havoc stopRequestedAtCurrentFloor_#t~ret43; 216544#L2103 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~8);stopRequestedAtCurrentFloor_~retValue_acc~20 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~20; 216546#L2116 timeShift_#t~ret58 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret58;havoc timeShift_#t~ret58; 223950#L2251 assume !(0 != timeShift_~tmp___9~2); 223947#L2342 assume !(1 == ~doorState~0); 223946#L2342-2 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret33, stopRequestedInDirection_#t~ret34, stopRequestedInDirection_#t~ret35, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~16, stopRequestedInDirection_~tmp~10, stopRequestedInDirection_~tmp___0~5, stopRequestedInDirection_~__cil_tmp7~0, stopRequestedInDirection_~__cil_tmp8~1;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~16;havoc stopRequestedInDirection_~tmp~10;havoc stopRequestedInDirection_~tmp___0~5;havoc stopRequestedInDirection_~__cil_tmp7~0;havoc stopRequestedInDirection_~__cil_tmp8~1;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret116, isExecutiveFloorCalling_~retValue_acc~23;havoc isExecutiveFloorCalling_~retValue_acc~23;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~3;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~3; 223944#L372-3 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~3 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~3; 223943#L399-3 isExecutiveFloorCalling_#t~ret116 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~23 := isExecutiveFloorCalling_#t~ret116;havoc isExecutiveFloorCalling_#t~ret116;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~23; 223940#L2714-1 stopRequestedInDirection_#t~ret33 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~5 := stopRequestedInDirection_#t~ret33;havoc stopRequestedInDirection_#t~ret33; 223939#L1954 assume 0 != stopRequestedInDirection_~tmp___0~5;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~7;havoc getCurrentFloorID_~retValue_acc~7;getCurrentFloorID_~retValue_acc~7 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~7; 223901#L1362-3 stopRequestedInDirection_#t~ret34 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~10 := stopRequestedInDirection_#t~ret34;havoc stopRequestedInDirection_#t~ret34;stopRequestedInDirection_~__cil_tmp7~0 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~1 := (if stopRequestedInDirection_~tmp~10 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~16 := (if stopRequestedInDirection_~__cil_tmp8~1 == stopRequestedInDirection_~__cil_tmp7~0 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~16; 223900#L1967 timeShift_#t~ret65 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret65;havoc timeShift_#t~ret65; 223899#L2350 assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret36, continueInDirection_~dir, continueInDirection_~tmp~11;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~11;~currentHeading~0 := continueInDirection_~dir; 223145#L2011 assume !(1 == ~currentHeading~0); 219885#L2021 assume !(0 == ~currentFloorID~0); 219883#L2021-2 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 219808#L2027-5 havoc __utac_acc__Specification9_spec__3_#t~ret6, __utac_acc__Specification9_spec__3_#t~ret7, __utac_acc__Specification9_spec__3_#t~ret8, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~2, __utac_acc__Specification9_spec__3_~tmp___0~2, __utac_acc__Specification9_spec__3_~tmp___1~2;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~2;havoc __utac_acc__Specification9_spec__3_~tmp___0~2;havoc __utac_acc__Specification9_spec__3_~tmp___1~2;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~7;havoc getCurrentFloorID_~retValue_acc~7;getCurrentFloorID_~retValue_acc~7 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~7; 217432#L1362-5 __utac_acc__Specification9_spec__3_#t~ret6 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~2 := __utac_acc__Specification9_spec__3_#t~ret6;havoc __utac_acc__Specification9_spec__3_#t~ret6;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~2;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~11;havoc isEmpty_~retValue_acc~11; 217433#L1422-6 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~11 := 0;isEmpty_#res := isEmpty_~retValue_acc~11; 217002#L1454-6 __utac_acc__Specification9_spec__3_#t~ret7 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~2 := __utac_acc__Specification9_spec__3_#t~ret7;havoc __utac_acc__Specification9_spec__3_#t~ret7; 217003#L1011 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~2);havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~8;havoc areDoorsOpen_~retValue_acc~8;areDoorsOpen_~retValue_acc~8 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~8; 216843#L1371 __utac_acc__Specification9_spec__3_#t~ret8 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~2 := __utac_acc__Specification9_spec__3_#t~ret8;havoc __utac_acc__Specification9_spec__3_#t~ret8; 216844#L1021 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___0~2); 215248#L1021-1 cleanup_~i~3 := 0; 217873#L3275-2 assume !false; 224114#L3276 [2019-01-01 23:25:58,207 INFO L796 eck$LassoCheckResult]: Loop: 224114#L3276 cleanup_~__cil_tmp4~3 := ~cleanupTimeShifts~0 - 1; 240289#L3279 assume cleanup_~i~3 < cleanup_~__cil_tmp4~3;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~6;havoc isBlocked_~retValue_acc~6;isBlocked_~retValue_acc~6 := 0;isBlocked_#res := isBlocked_~retValue_acc~6; 240288#L1185 cleanup_#t~ret160 := isBlocked_#res;cleanup_~tmp___0~12 := cleanup_#t~ret160;havoc cleanup_#t~ret160; 240287#L3283 assume 1 != cleanup_~tmp___0~12; 240286#L3283-1 havoc isIdle_#res;havoc isIdle_#t~ret17, isIdle_~retValue_acc~13, isIdle_~tmp~7;havoc isIdle_~retValue_acc~13;havoc isIdle_~tmp~7;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret12, anyStopRequested_#t~ret13, anyStopRequested_#t~ret14, anyStopRequested_#t~ret15, anyStopRequested_#t~ret16, anyStopRequested_~retValue_acc~12, anyStopRequested_~tmp~6, anyStopRequested_~tmp___0~3, anyStopRequested_~tmp___1~3, anyStopRequested_~tmp___2~0, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~12;havoc anyStopRequested_~tmp~6;havoc anyStopRequested_~tmp___0~3;havoc anyStopRequested_~tmp___1~3;havoc anyStopRequested_~tmp___2~0;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~3;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~3; 240285#L372-65 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~3 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~3; 240284#L399-65 anyStopRequested_#t~ret12 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret12;havoc anyStopRequested_#t~ret12; 240260#L1470 assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~12 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~12; 240253#L1534 isIdle_#t~ret17 := anyStopRequested_#res;isIdle_~tmp~7 := isIdle_#t~ret17;havoc isIdle_#t~ret17;isIdle_~retValue_acc~13 := (if 0 == isIdle_~tmp~7 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~13; 240252#L1547 cleanup_#t~ret161 := isIdle_#res;cleanup_~tmp~27 := cleanup_#t~ret161;havoc cleanup_#t~ret161; 240251#L3295 assume !(0 != cleanup_~tmp~27);havoc timeShift_#t~ret58, timeShift_#t~ret59, timeShift_#t~ret60, timeShift_#t~ret61, timeShift_#t~ret62, timeShift_#t~ret63, timeShift_#t~ret64, timeShift_#t~ret65, timeShift_#t~ret66, timeShift_#t~ret67, timeShift_#t~ret68, timeShift_~tmp~16, timeShift_~tmp___0~10, timeShift_~tmp___1~6, timeShift_~tmp___2~3, timeShift_~tmp___3~3, timeShift_~tmp___4~2, timeShift_~tmp___5~2, timeShift_~tmp___6~2, timeShift_~tmp___7~2, timeShift_~tmp___8~2, timeShift_~tmp___9~2;havoc timeShift_~tmp~16;havoc timeShift_~tmp___0~10;havoc timeShift_~tmp___1~6;havoc timeShift_~tmp___2~3;havoc timeShift_~tmp___3~3;havoc timeShift_~tmp___4~2;havoc timeShift_~tmp___5~2;havoc timeShift_~tmp___6~2;havoc timeShift_~tmp___7~2;havoc timeShift_~tmp___8~2;havoc timeShift_~tmp___9~2;havoc stopRequestedAtCurrentFloor_#res;havoc stopRequestedAtCurrentFloor_#t~ret42, stopRequestedAtCurrentFloor_#t~ret43, stopRequestedAtCurrentFloor_#t~ret44, stopRequestedAtCurrentFloor_#t~ret45, stopRequestedAtCurrentFloor_~retValue_acc~20, stopRequestedAtCurrentFloor_~tmp~14, stopRequestedAtCurrentFloor_~tmp___0~8;havoc stopRequestedAtCurrentFloor_~retValue_acc~20;havoc stopRequestedAtCurrentFloor_~tmp~14;havoc stopRequestedAtCurrentFloor_~tmp___0~8;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret116, isExecutiveFloorCalling_~retValue_acc~23;havoc isExecutiveFloorCalling_~retValue_acc~23;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~3;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~3; 240250#L372-70 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~3 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~3; 228911#L399-70 isExecutiveFloorCalling_#t~ret116 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~23 := isExecutiveFloorCalling_#t~ret116;havoc isExecutiveFloorCalling_#t~ret116;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~23; 240249#L2714-3 stopRequestedAtCurrentFloor_#t~ret42 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~14 := stopRequestedAtCurrentFloor_#t~ret42;havoc stopRequestedAtCurrentFloor_#t~ret42; 240247#L2099-1 assume 0 != stopRequestedAtCurrentFloor_~tmp~14;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~7;havoc getCurrentFloorID_~retValue_acc~7;getCurrentFloorID_~retValue_acc~7 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~7; 235235#L1362-6 stopRequestedAtCurrentFloor_#t~ret43 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~8 := stopRequestedAtCurrentFloor_#t~ret43;havoc stopRequestedAtCurrentFloor_#t~ret43; 235236#L2103-1 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~8);stopRequestedAtCurrentFloor_~retValue_acc~20 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~20; 240219#L2116-1 timeShift_#t~ret58 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret58;havoc timeShift_#t~ret58; 240218#L2251-1 assume !(0 != timeShift_~tmp___9~2); 240216#L2342-3 assume !(1 == ~doorState~0); 240215#L2342-5 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret33, stopRequestedInDirection_#t~ret34, stopRequestedInDirection_#t~ret35, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~16, stopRequestedInDirection_~tmp~10, stopRequestedInDirection_~tmp___0~5, stopRequestedInDirection_~__cil_tmp7~0, stopRequestedInDirection_~__cil_tmp8~1;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~16;havoc stopRequestedInDirection_~tmp~10;havoc stopRequestedInDirection_~tmp___0~5;havoc stopRequestedInDirection_~__cil_tmp7~0;havoc stopRequestedInDirection_~__cil_tmp8~1;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret116, isExecutiveFloorCalling_~retValue_acc~23;havoc isExecutiveFloorCalling_~retValue_acc~23;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~3;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~3; 240210#L372-73 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~3 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~3; 240208#L399-73 isExecutiveFloorCalling_#t~ret116 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~23 := isExecutiveFloorCalling_#t~ret116;havoc isExecutiveFloorCalling_#t~ret116;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~23; 240207#L2714-4 stopRequestedInDirection_#t~ret33 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~5 := stopRequestedInDirection_#t~ret33;havoc stopRequestedInDirection_#t~ret33; 240180#L1954-2 assume 0 != stopRequestedInDirection_~tmp___0~5;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~7;havoc getCurrentFloorID_~retValue_acc~7;getCurrentFloorID_~retValue_acc~7 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~7; 240178#L1362-9 stopRequestedInDirection_#t~ret34 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~10 := stopRequestedInDirection_#t~ret34;havoc stopRequestedInDirection_#t~ret34;stopRequestedInDirection_~__cil_tmp7~0 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~1 := (if stopRequestedInDirection_~tmp~10 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~16 := (if stopRequestedInDirection_~__cil_tmp8~1 == stopRequestedInDirection_~__cil_tmp7~0 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~16; 240177#L1967-2 timeShift_#t~ret65 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret65;havoc timeShift_#t~ret65; 240175#L2350-1 assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret36, continueInDirection_~dir, continueInDirection_~tmp~11;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~11;~currentHeading~0 := continueInDirection_~dir; 240176#L2011-3 assume !(1 == ~currentHeading~0); 240315#L2021-9 assume !(0 == ~currentFloorID~0); 238889#L2021-11 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 234536#L2027-11 havoc __utac_acc__Specification9_spec__3_#t~ret6, __utac_acc__Specification9_spec__3_#t~ret7, __utac_acc__Specification9_spec__3_#t~ret8, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~2, __utac_acc__Specification9_spec__3_~tmp___0~2, __utac_acc__Specification9_spec__3_~tmp___1~2;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~2;havoc __utac_acc__Specification9_spec__3_~tmp___0~2;havoc __utac_acc__Specification9_spec__3_~tmp___1~2;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~7;havoc getCurrentFloorID_~retValue_acc~7;getCurrentFloorID_~retValue_acc~7 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~7; 240314#L1362-11 __utac_acc__Specification9_spec__3_#t~ret6 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~2 := __utac_acc__Specification9_spec__3_#t~ret6;havoc __utac_acc__Specification9_spec__3_#t~ret6;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~2;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~11;havoc isEmpty_~retValue_acc~11; 240309#L1422-13 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~11 := 0;isEmpty_#res := isEmpty_~retValue_acc~11; 240306#L1454-13 __utac_acc__Specification9_spec__3_#t~ret7 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~2 := __utac_acc__Specification9_spec__3_#t~ret7;havoc __utac_acc__Specification9_spec__3_#t~ret7; 240305#L1011-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~2);havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~8;havoc areDoorsOpen_~retValue_acc~8;areDoorsOpen_~retValue_acc~8 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~8; 240294#L1371-1 __utac_acc__Specification9_spec__3_#t~ret8 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~2 := __utac_acc__Specification9_spec__3_#t~ret8;havoc __utac_acc__Specification9_spec__3_#t~ret8; 240297#L1021-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___0~2); 240291#L1021-3 cleanup_~i~3 := 1 + cleanup_~i~3; 240290#L3275-2 assume !false; 224114#L3276 [2019-01-01 23:25:58,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:25:58,208 INFO L82 PathProgramCache]: Analyzing trace with hash -861478866, now seen corresponding path program 1 times [2019-01-01 23:25:58,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:25:58,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:25:58,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:25:58,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:25:58,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:25:58,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:25:58,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:25:58,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:25:58,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 23:25:58,625 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:25:58,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:25:58,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1189278035, now seen corresponding path program 1 times [2019-01-01 23:25:58,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:25:58,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:25:58,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:25:58,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:25:58,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:25:58,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:25:58,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:25:59,945 WARN L181 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 178 DAG size of output: 161 [2019-01-01 23:26:00,741 WARN L181 SmtUtils]: Spent 781.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 127 [2019-01-01 23:26:00,743 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:26:00,743 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:26:00,743 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:26:00,744 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:26:00,744 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:26:00,744 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:26:00,744 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:26:00,744 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:26:00,744 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec9_product31_true-unreach-call_true-termination.cil.c_Iteration5_Loop [2019-01-01 23:26:00,744 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:26:00,744 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:26:00,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:00,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:00,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:00,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:00,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:00,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:00,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:00,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-01 23:26:00,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:00,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:00,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:00,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:00,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:00,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:00,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:00,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:00,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:00,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:00,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:00,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:00,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:00,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:00,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:00,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:00,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:00,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:00,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:00,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:00,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:00,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:00,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:00,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:00,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:00,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:00,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:00,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:00,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:00,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:00,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:00,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:00,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:00,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:00,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:00,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:00,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:00,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:00,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:00,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:01,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:01,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:01,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:01,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:01,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:01,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:01,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:01,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:01,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:01,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:01,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:01,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-01 23:26:01,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:01,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-01 23:26:01,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:01,328 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2019-01-01 23:26:01,929 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:26:01,929 INFO L412 LassoAnalysis]: Checking for nontermination... 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) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:26:02,148 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:26:02,149 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:26:02,157 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:26:02,158 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stopRequestedInDirection_#t~ret35=0} Honda state: {ULTIMATE.start_stopRequestedInDirection_#t~ret35=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-01 23:26:02,180 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:26:02,180 INFO L163 nArgumentSynthesizer]: Using integer mode. 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-01 23:26:02,205 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:26:02,205 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:26:02,777 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:26:02,780 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:26:02,780 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:26:02,780 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:26:02,780 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:26:02,780 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:26:02,780 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:26:02,780 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:26:02,780 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:26:02,781 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec9_product31_true-unreach-call_true-termination.cil.c_Iteration5_Loop [2019-01-01 23:26:02,781 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:26:02,781 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:26:02,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:02,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:02,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:02,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:02,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:02,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-01 23:26:02,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:02,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:02,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-01 23:26:02,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-01 23:26:02,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:02,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-01 23:26:02,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:02,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:02,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:02,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:02,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:02,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:02,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:02,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:02,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:02,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-01 23:26:02,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:02,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:02,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:02,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:02,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:02,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:02,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:02,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:02,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:02,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:02,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:02,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:02,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:02,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:02,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:02,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:02,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:02,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:02,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:02,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:02,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:02,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:02,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:02,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:02,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:02,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:02,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:02,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:02,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:02,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:02,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:02,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:02,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:02,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:03,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:03,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:03,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:03,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:03,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:03,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:03,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:03,452 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2019-01-01 23:26:03,853 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:26:03,853 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:26:03,853 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:26:03,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:26:03,854 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:26:03,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:26:03,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:26:03,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:26:03,855 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:26:03,855 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:26:03,856 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:26:03,857 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:26:03,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:26:03,857 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:26:03,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:26:03,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:26:03,858 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:26:03,858 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:26:03,858 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:26:03,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:26:03,859 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:26:03,859 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:26:03,859 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:26:03,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:26:03,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:26:03,860 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:26:03,860 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:26:03,860 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:26:03,861 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:26:03,861 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:26:03,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:26:03,862 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:26:03,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:26:03,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:26:03,862 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:26:03,862 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:26:03,863 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:26:03,865 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:26:03,869 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 23:26:03,870 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 23:26:03,870 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:26:03,870 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:26:03,870 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:26:03,870 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-01 23:26:03,871 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:26:03,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:26:04,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:26:04,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:26:04,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:26:04,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:26:04,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:26:04,463 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-01-01 23:26:04,463 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26081 states and 48579 transitions. cyclomatic complexity: 22504 Second operand 5 states. [2019-01-01 23:26:05,266 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26081 states and 48579 transitions. cyclomatic complexity: 22504. Second operand 5 states. Result 46921 states and 87339 transitions. Complement of second has 8 states. [2019-01-01 23:26:05,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 23:26:05,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 23:26:05,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 6892 transitions. [2019-01-01 23:26:05,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6892 transitions. Stem has 48 letters. Loop has 40 letters. [2019-01-01 23:26:05,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:26:05,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6892 transitions. Stem has 88 letters. Loop has 40 letters. [2019-01-01 23:26:05,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:26:05,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6892 transitions. Stem has 48 letters. Loop has 80 letters. [2019-01-01 23:26:05,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:26:05,284 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46921 states and 87339 transitions. [2019-01-01 23:26:05,540 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:26:05,540 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46921 states to 0 states and 0 transitions. [2019-01-01 23:26:05,540 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 23:26:05,540 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 23:26:05,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 23:26:05,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:26:05,541 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:26:05,541 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:26:05,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 23:26:05,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 23:26:05,541 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 6 states. [2019-01-01 23:26:05,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:26:05,542 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-01 23:26:05,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-01 23:26:05,542 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-01 23:26:05,542 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:26:05,542 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 23:26:05,542 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 23:26:05,542 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 23:26:05,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 23:26:05,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:26:05,552 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:26:05,552 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:26:05,552 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:26:05,552 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 23:26:05,552 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 23:26:05,552 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:26:05,552 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 23:26:05,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 11:26:05 BoogieIcfgContainer [2019-01-01 23:26:05,569 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 23:26:05,569 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 23:26:05,570 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 23:26:05,575 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 23:26:05,576 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:25:27" (3/4) ... [2019-01-01 23:26:05,583 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 23:26:05,583 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 23:26:05,584 INFO L168 Benchmark]: Toolchain (without parser) took 51994.76 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.1 GB). Free memory was 940.6 MB in the beginning and 1.3 GB in the end (delta: -315.8 MB). Peak memory consumption was 800.4 MB. Max. memory is 11.5 GB. [2019-01-01 23:26:05,588 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:26:05,589 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1267.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -175.1 MB). Peak memory consumption was 51.6 MB. Max. memory is 11.5 GB. [2019-01-01 23:26:05,590 INFO L168 Benchmark]: Boogie Procedure Inliner took 355.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 47.2 MB). Peak memory consumption was 47.2 MB. Max. memory is 11.5 GB. [2019-01-01 23:26:05,594 INFO L168 Benchmark]: Boogie Preprocessor took 262.31 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: 33.7 MB). Peak memory consumption was 33.7 MB. Max. memory is 11.5 GB. [2019-01-01 23:26:05,595 INFO L168 Benchmark]: RCFGBuilder took 11694.81 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 185.6 MB). Free memory was 1.0 GB in the beginning and 926.8 MB in the end (delta: 108.0 MB). Peak memory consumption was 389.3 MB. Max. memory is 11.5 GB. [2019-01-01 23:26:05,599 INFO L168 Benchmark]: BuchiAutomizer took 38394.49 ms. Allocated memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: 780.1 MB). Free memory was 926.8 MB in the beginning and 1.3 GB in the end (delta: -329.7 MB). Peak memory consumption was 450.5 MB. Max. memory is 11.5 GB. [2019-01-01 23:26:05,600 INFO L168 Benchmark]: Witness Printer took 13.83 ms. Allocated memory is still 2.1 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:26:05,611 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 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1267.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -175.1 MB). Peak memory consumption was 51.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 355.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 47.2 MB). Peak memory consumption was 47.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 262.31 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: 33.7 MB). Peak memory consumption was 33.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 11694.81 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 185.6 MB). Free memory was 1.0 GB in the beginning and 926.8 MB in the end (delta: 108.0 MB). Peak memory consumption was 389.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 38394.49 ms. Allocated memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: 780.1 MB). Free memory was 926.8 MB in the beginning and 1.3 GB in the end (delta: -329.7 MB). Peak memory consumption was 450.5 MB. Max. memory is 11.5 GB. * Witness Printer took 13.83 ms. Allocated memory is still 2.1 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (5 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function doorState and consists of 3 locations. One deterministic module has affine ranking function cleanupTimeShifts + -1 * i and consists of 5 locations. 5 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 38.3s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 13.4s. Construction of modules took 13.2s. Büchi inclusion checks took 6.6s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 2. Automata minimization 2.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 48766 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 1.9s Buchi closure took 0.1s. Biggest automaton had 26081 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 40873 SDtfs, 143314 SDslu, 74628 SDs, 0 SdLazy, 5706 SolverSat, 1566 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI3 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital187 mio100 ax100 hnf99 lsp20 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq210 hnf88 smp90 dnf150 smp100 tf102 neg97 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 12ms VariablesStem: 0 VariablesLoop: 8 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 13 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 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...