./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/elevator_spec9_product27_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_product27_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 fb9c828c93a89ad7d5e84962eb47c2963862e6b6 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:24:40,467 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 23:24:40,469 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 23:24:40,487 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 23:24:40,488 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 23:24:40,490 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 23:24:40,493 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 23:24:40,495 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 23:24:40,496 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 23:24:40,497 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 23:24:40,498 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 23:24:40,498 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 23:24:40,499 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 23:24:40,500 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 23:24:40,501 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 23:24:40,502 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 23:24:40,503 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 23:24:40,505 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 23:24:40,507 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 23:24:40,509 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 23:24:40,510 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 23:24:40,511 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 23:24:40,514 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 23:24:40,514 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 23:24:40,514 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 23:24:40,516 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 23:24:40,517 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 23:24:40,517 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 23:24:40,518 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 23:24:40,524 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 23:24:40,525 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 23:24:40,525 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 23:24:40,525 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 23:24:40,528 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 23:24:40,529 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 23:24:40,530 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 23:24:40,531 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:24:40,568 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 23:24:40,568 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 23:24:40,570 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 23:24:40,570 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 23:24:40,570 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 23:24:40,570 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 23:24:40,571 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 23:24:40,571 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 23:24:40,571 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 23:24:40,571 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 23:24:40,571 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 23:24:40,571 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 23:24:40,572 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 23:24:40,572 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 23:24:40,572 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 23:24:40,572 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 23:24:40,572 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 23:24:40,572 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 23:24:40,573 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 23:24:40,573 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 23:24:40,573 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 23:24:40,573 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 23:24:40,573 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 23:24:40,574 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 23:24:40,574 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 23:24:40,574 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 23:24:40,574 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 23:24:40,574 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 23:24:40,575 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 23:24:40,575 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 23:24:40,575 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 23:24:40,576 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 23:24:40,576 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 -> fb9c828c93a89ad7d5e84962eb47c2963862e6b6 [2019-01-01 23:24:40,621 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 23:24:40,637 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 23:24:40,645 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 23:24:40,646 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 23:24:40,647 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 23:24:40,648 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/elevator_spec9_product27_true-unreach-call_true-termination.cil.c [2019-01-01 23:24:40,715 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28bfd3bc4/2685de4b77244c63b6b511ce63275ed8/FLAG06471e5df [2019-01-01 23:24:41,331 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 23:24:41,332 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/elevator_spec9_product27_true-unreach-call_true-termination.cil.c [2019-01-01 23:24:41,357 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28bfd3bc4/2685de4b77244c63b6b511ce63275ed8/FLAG06471e5df [2019-01-01 23:24:41,527 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28bfd3bc4/2685de4b77244c63b6b511ce63275ed8 [2019-01-01 23:24:41,535 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 23:24:41,537 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 23:24:41,538 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 23:24:41,538 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 23:24:41,544 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 23:24:41,545 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:24:41" (1/1) ... [2019-01-01 23:24:41,549 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12b20f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:24:41, skipping insertion in model container [2019-01-01 23:24:41,550 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:24:41" (1/1) ... [2019-01-01 23:24:41,561 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 23:24:41,666 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 23:24:42,381 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:24:42,405 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 23:24:42,609 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:24:42,680 INFO L195 MainTranslator]: Completed translation [2019-01-01 23:24:42,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:24:42 WrapperNode [2019-01-01 23:24:42,681 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 23:24:42,682 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 23:24:42,682 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 23:24:42,682 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 23:24:42,691 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:24:42" (1/1) ... [2019-01-01 23:24:42,726 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:24:42" (1/1) ... [2019-01-01 23:24:42,925 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 23:24:42,927 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 23:24:42,927 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 23:24:42,927 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 23:24:42,940 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:24:42" (1/1) ... [2019-01-01 23:24:42,941 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:24:42" (1/1) ... [2019-01-01 23:24:42,980 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:24:42" (1/1) ... [2019-01-01 23:24:42,982 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:24:42" (1/1) ... [2019-01-01 23:24:43,049 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:24:42" (1/1) ... [2019-01-01 23:24:43,108 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:24:42" (1/1) ... [2019-01-01 23:24:43,128 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:24:42" (1/1) ... [2019-01-01 23:24:43,157 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 23:24:43,158 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 23:24:43,158 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 23:24:43,158 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 23:24:43,159 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:24:42" (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:24:43,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 23:24:43,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-01 23:24:43,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 23:24:43,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 23:24:54,120 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 23:24:54,121 INFO L280 CfgBuilder]: Removed 649 assue(true) statements. [2019-01-01 23:24:54,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:24:54 BoogieIcfgContainer [2019-01-01 23:24:54,121 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 23:24:54,122 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 23:24:54,122 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 23:24:54,126 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 23:24:54,127 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:24:54,127 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 11:24:41" (1/3) ... [2019-01-01 23:24:54,129 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4c8522e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:24:54, skipping insertion in model container [2019-01-01 23:24:54,129 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:24:54,130 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:24:42" (2/3) ... [2019-01-01 23:24:54,131 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4c8522e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:24:54, skipping insertion in model container [2019-01-01 23:24:54,131 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:24:54,131 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:24:54" (3/3) ... [2019-01-01 23:24:54,134 INFO L375 chiAutomizerObserver]: Analyzing ICFG elevator_spec9_product27_true-unreach-call_true-termination.cil.c [2019-01-01 23:24:54,196 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 23:24:54,197 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 23:24:54,197 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 23:24:54,197 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 23:24:54,197 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 23:24:54,197 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 23:24:54,198 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 23:24:54,198 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 23:24:54,198 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 23:24:54,265 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2599 states. [2019-01-01 23:24:54,411 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1289 [2019-01-01 23:24:54,411 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:24:54,411 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:24:54,437 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:24:54,438 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:24:54,438 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 23:24:54,438 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2599 states. [2019-01-01 23:24:54,483 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1289 [2019-01-01 23:24:54,483 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:24:54,483 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:24:54,487 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:24:54,487 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:24:54,496 INFO L794 eck$LassoCheckResult]: Stem: 357#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(30);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(9);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(21);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(30);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(9);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(21);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(30);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(9);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(25);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(30);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(9);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(25);~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~cleanupTimeShifts~0 := 12;~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~string108.base, #t~string108.offset := #Ultimate.allocOnStack(10);call #t~string110.base, #t~string110.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string110.base, #t~string110.offset, 1);call write~init~int(95, #t~string110.base, 1 + #t~string110.offset, 1);call write~init~int(93, #t~string110.base, 2 + #t~string110.offset, 1);call write~init~int(0, #t~string110.base, 3 + #t~string110.offset, 1);call #t~string112.base, #t~string112.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string112.base, #t~string112.offset, 1);call write~init~int(93, #t~string112.base, 1 + #t~string112.offset, 1);call write~init~int(32, #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(5);call write~init~int(32, #t~string114.base, #t~string114.offset, 1);call write~init~int(97, #t~string114.base, 1 + #t~string114.offset, 1);call write~init~int(116, #t~string114.base, 2 + #t~string114.offset, 1);call write~init~int(32, #t~string114.base, 3 + #t~string114.offset, 1);call write~init~int(0, #t~string114.base, 4 + #t~string114.offset, 1);call #t~string116.base, #t~string116.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string116.base, #t~string116.offset, 1);call write~init~int(105, #t~string116.base, 1 + #t~string116.offset, 1);call write~init~int(0, #t~string116.base, 2 + #t~string116.offset, 1);call #t~string118.base, #t~string118.offset := #Ultimate.allocOnStack(10);call #t~string120.base, #t~string120.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string120.base, #t~string120.offset, 1);call write~init~int(112, #t~string120.base, 1 + #t~string120.offset, 1);call write~init~int(0, #t~string120.base, 2 + #t~string120.offset, 1);call #t~string122.base, #t~string122.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string122.base, #t~string122.offset, 1);call write~init~int(111, #t~string122.base, 1 + #t~string122.offset, 1);call write~init~int(119, #t~string122.base, 2 + #t~string122.offset, 1);call write~init~int(110, #t~string122.base, 3 + #t~string122.offset, 1);call write~init~int(0, #t~string122.base, 4 + #t~string122.offset, 1);call #t~string124.base, #t~string124.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string124.base, #t~string124.offset, 1);call write~init~int(73, #t~string124.base, 1 + #t~string124.offset, 1);call write~init~int(76, #t~string124.base, 2 + #t~string124.offset, 1);call write~init~int(95, #t~string124.base, 3 + #t~string124.offset, 1);call write~init~int(112, #t~string124.base, 4 + #t~string124.offset, 1);call write~init~int(58, #t~string124.base, 5 + #t~string124.offset, 1);call write~init~int(0, #t~string124.base, 6 + #t~string124.offset, 1);call #t~string126.base, #t~string126.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string126.base, #t~string126.offset, 1);call write~init~int(37, #t~string126.base, 1 + #t~string126.offset, 1);call write~init~int(105, #t~string126.base, 2 + #t~string126.offset, 1);call write~init~int(0, #t~string126.base, 3 + #t~string126.offset, 1);call #t~string128.base, #t~string128.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string128.base, #t~string128.offset, 1);call write~init~int(37, #t~string128.base, 1 + #t~string128.offset, 1);call write~init~int(105, #t~string128.base, 2 + #t~string128.offset, 1);call write~init~int(0, #t~string128.base, 3 + #t~string128.offset, 1);call #t~string130.base, #t~string130.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string130.base, #t~string130.offset, 1);call write~init~int(37, #t~string130.base, 1 + #t~string130.offset, 1);call write~init~int(105, #t~string130.base, 2 + #t~string130.offset, 1);call write~init~int(0, #t~string130.base, 3 + #t~string130.offset, 1);call #t~string132.base, #t~string132.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string132.base, #t~string132.offset, 1);call write~init~int(37, #t~string132.base, 1 + #t~string132.offset, 1);call write~init~int(105, #t~string132.base, 2 + #t~string132.offset, 1);call write~init~int(0, #t~string132.base, 3 + #t~string132.offset, 1);call #t~string134.base, #t~string134.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string134.base, #t~string134.offset, 1);call write~init~int(37, #t~string134.base, 1 + #t~string134.offset, 1);call write~init~int(105, #t~string134.base, 2 + #t~string134.offset, 1);call write~init~int(0, #t~string134.base, 3 + #t~string134.offset, 1);call #t~string136.base, #t~string136.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string136.base, #t~string136.offset, 1);call write~init~int(70, #t~string136.base, 1 + #t~string136.offset, 1);call write~init~int(95, #t~string136.base, 2 + #t~string136.offset, 1);call write~init~int(112, #t~string136.base, 3 + #t~string136.offset, 1);call write~init~int(58, #t~string136.base, 4 + #t~string136.offset, 1);call write~init~int(0, #t~string136.base, 5 + #t~string136.offset, 1);call #t~string139.base, #t~string139.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string139.base, #t~string139.offset, 1);call write~init~int(37, #t~string139.base, 1 + #t~string139.offset, 1);call write~init~int(105, #t~string139.base, 2 + #t~string139.offset, 1);call write~init~int(0, #t~string139.base, 3 + #t~string139.offset, 1);call #t~string142.base, #t~string142.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string142.base, #t~string142.offset, 1);call write~init~int(37, #t~string142.base, 1 + #t~string142.offset, 1);call write~init~int(105, #t~string142.base, 2 + #t~string142.offset, 1);call write~init~int(0, #t~string142.base, 3 + #t~string142.offset, 1);call #t~string145.base, #t~string145.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string145.base, #t~string145.offset, 1);call write~init~int(37, #t~string145.base, 1 + #t~string145.offset, 1);call write~init~int(105, #t~string145.base, 2 + #t~string145.offset, 1);call write~init~int(0, #t~string145.base, 3 + #t~string145.offset, 1);call #t~string148.base, #t~string148.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string148.base, #t~string148.offset, 1);call write~init~int(37, #t~string148.base, 1 + #t~string148.offset, 1);call write~init~int(105, #t~string148.base, 2 + #t~string148.offset, 1);call write~init~int(0, #t~string148.base, 3 + #t~string148.offset, 1);call #t~string151.base, #t~string151.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string151.base, #t~string151.offset, 1);call write~init~int(37, #t~string151.base, 1 + #t~string151.offset, 1);call write~init~int(105, #t~string151.base, 2 + #t~string151.offset, 1);call write~init~int(0, #t~string151.base, 3 + #t~string151.offset, 1);call #t~string153.base, #t~string153.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string153.base, #t~string153.offset, 1);call write~init~int(0, #t~string153.base, 1 + #t~string153.offset, 1);~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; 1434#L-1true havoc main_#res;havoc main_#t~ret54, main_~retValue_acc~4, main_~tmp~13;havoc main_~retValue_acc~4;havoc main_~tmp~13; 83#L3286true 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; 814#L3294true main_#t~ret54 := valid_product_#res;main_~tmp~13 := main_#t~ret54;havoc main_#t~ret54; 2176#L850true assume 0 != main_~tmp~13; 7#L819true ~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; 755#L3119true havoc bigMacCall_#t~ret47, bigMacCall_~tmp~10;havoc bigMacCall_~tmp~10;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~28;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~28; 585#L3342true assume 0 == getOrigin_~person;getOrigin_~retValue_acc~28 := 4;getOrigin_#res := getOrigin_~retValue_acc~28; 300#L3367true bigMacCall_#t~ret47 := getOrigin_#res;bigMacCall_~tmp~10 := bigMacCall_#t~ret47;havoc bigMacCall_#t~ret47;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~10;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 1249#L2776true assume 0 == initPersonOnFloor_~floor; 1380#L2777true assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 394#L2884-1true callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 2148#L2568true assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 25#L2580-2true havoc cleanup_#t~ret48, cleanup_#t~ret49, cleanup_~i~2, cleanup_~tmp~11, cleanup_~tmp___0~2, cleanup_~__cil_tmp4~2;havoc cleanup_~i~2;havoc cleanup_~tmp~11;havoc cleanup_~tmp___0~2;havoc cleanup_~__cil_tmp4~2;havoc timeShift_#t~ret97, timeShift_#t~ret98, timeShift_#t~ret99, timeShift_#t~ret100, timeShift_#t~ret101, timeShift_#t~ret102, timeShift_#t~ret103, timeShift_#t~ret104, timeShift_#t~ret105, timeShift_#t~ret106, timeShift_#t~ret107, timeShift_~tmp~25, timeShift_~tmp___0~10, timeShift_~tmp___1~6, timeShift_~tmp___2~4, 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~25;havoc timeShift_~tmp___0~10;havoc timeShift_~tmp___1~6;havoc timeShift_~tmp___2~4;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~ret81, stopRequestedAtCurrentFloor_#t~ret82, stopRequestedAtCurrentFloor_#t~ret83, stopRequestedAtCurrentFloor_#t~ret84, stopRequestedAtCurrentFloor_~retValue_acc~17, stopRequestedAtCurrentFloor_~tmp~23, stopRequestedAtCurrentFloor_~tmp___0~8;havoc stopRequestedAtCurrentFloor_~retValue_acc~17;havoc stopRequestedAtCurrentFloor_~tmp~23;havoc stopRequestedAtCurrentFloor_~tmp___0~8;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 594#L2505true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 370#L2532true isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 867#L2409true stopRequestedAtCurrentFloor_#t~ret81 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~23 := stopRequestedAtCurrentFloor_#t~ret81;havoc stopRequestedAtCurrentFloor_#t~ret81; 854#L1793true assume 0 != stopRequestedAtCurrentFloor_~tmp~23;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 116#L1124true stopRequestedAtCurrentFloor_#t~ret82 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~8 := stopRequestedAtCurrentFloor_#t~ret82;havoc stopRequestedAtCurrentFloor_#t~ret82; 806#L1797true assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~8);stopRequestedAtCurrentFloor_~retValue_acc~17 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~17; 1079#L1810true timeShift_#t~ret97 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret97;havoc timeShift_#t~ret97; 2537#L1946true assume !(0 != timeShift_~tmp___9~2); 2292#L2037true assume !(1 == ~doorState~0); 2263#L2037-2true stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret75, stopRequestedInDirection_#t~ret76, stopRequestedInDirection_#t~ret77, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~14, stopRequestedInDirection_~tmp~20, stopRequestedInDirection_~tmp___0~6, stopRequestedInDirection_~__cil_tmp7~5, stopRequestedInDirection_~__cil_tmp8~5;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~14;havoc stopRequestedInDirection_~tmp~20;havoc stopRequestedInDirection_~tmp___0~6;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 599#L2505-3true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 376#L2532-3true isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 872#L2409-1true stopRequestedInDirection_#t~ret75 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~6 := stopRequestedInDirection_#t~ret75;havoc stopRequestedInDirection_#t~ret75; 1384#L1676true assume 0 != stopRequestedInDirection_~tmp___0~6;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 117#L1124-1true stopRequestedInDirection_#t~ret76 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~20 := stopRequestedInDirection_#t~ret76;havoc stopRequestedInDirection_#t~ret76;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~20 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~14 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~14; 1890#L1689true timeShift_#t~ret104 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret104;havoc timeShift_#t~ret104; 482#L2045true assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret78, continueInDirection_~dir, continueInDirection_~tmp~21;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~21;~currentHeading~0 := continueInDirection_~dir; 1910#L1733true assume !(1 == ~currentHeading~0); 51#L1743true assume !(0 == ~currentFloorID~0); 36#L1743-2true assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 849#L1749-5true havoc __utac_acc__Specification9_spec__3_#t~ret156, __utac_acc__Specification9_spec__3_#t~ret157, __utac_acc__Specification9_spec__3_#t~ret158, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~27, __utac_acc__Specification9_spec__3_~tmp___0~12, __utac_acc__Specification9_spec__3_~tmp___1~8;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~27;havoc __utac_acc__Specification9_spec__3_~tmp___0~12;havoc __utac_acc__Specification9_spec__3_~tmp___1~8;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 123#L1124-3true __utac_acc__Specification9_spec__3_#t~ret156 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~27 := __utac_acc__Specification9_spec__3_#t~ret156;havoc __utac_acc__Specification9_spec__3_#t~ret156;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~27;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~10;havoc isEmpty_~retValue_acc~10; 1799#L1184-6true assume 1 == ~persons_0~0;isEmpty_~retValue_acc~10 := 0;isEmpty_#res := isEmpty_~retValue_acc~10; 79#L1216-6true __utac_acc__Specification9_spec__3_#t~ret157 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~8 := __utac_acc__Specification9_spec__3_#t~ret157;havoc __utac_acc__Specification9_spec__3_#t~ret157; 815#L3162true assume 0 != __utac_acc__Specification9_spec__3_~tmp___1~8;~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; 1261#L3172-1true cleanup_~i~2 := 0; 678#L651-2true [2019-01-01 23:24:54,498 INFO L796 eck$LassoCheckResult]: Loop: 678#L651-2true assume !false; 796#L652true cleanup_~__cil_tmp4~2 := ~cleanupTimeShifts~0 - 1; 632#L655true assume cleanup_~i~2 < cleanup_~__cil_tmp4~2;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~5;havoc isBlocked_~retValue_acc~5;isBlocked_~retValue_acc~5 := 0;isBlocked_#res := isBlocked_~retValue_acc~5; 400#L946true cleanup_#t~ret48 := isBlocked_#res;cleanup_~tmp___0~2 := cleanup_#t~ret48;havoc cleanup_#t~ret48; 1475#L659true assume 1 != cleanup_~tmp___0~2; 1480#L659-1true havoc isIdle_#res;havoc isIdle_#t~ret63, isIdle_~retValue_acc~12, isIdle_~tmp~18;havoc isIdle_~retValue_acc~12;havoc isIdle_~tmp~18;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret58, anyStopRequested_#t~ret59, anyStopRequested_#t~ret60, anyStopRequested_#t~ret61, anyStopRequested_#t~ret62, anyStopRequested_~retValue_acc~11, anyStopRequested_~tmp~17, anyStopRequested_~tmp___0~4, anyStopRequested_~tmp___1~3, anyStopRequested_~tmp___2~1, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~11;havoc anyStopRequested_~tmp~17;havoc anyStopRequested_~tmp___0~4;havoc anyStopRequested_~tmp___1~3;havoc anyStopRequested_~tmp___2~1;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 1772#L2505-25true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 319#L2532-25true anyStopRequested_#t~ret58 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret58;havoc anyStopRequested_#t~ret58; 1450#L1232true assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~11 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~11; 504#L1296true isIdle_#t~ret63 := anyStopRequested_#res;isIdle_~tmp~18 := isIdle_#t~ret63;havoc isIdle_#t~ret63;isIdle_~retValue_acc~12 := (if 0 == isIdle_~tmp~18 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~12; 824#L1309true cleanup_#t~ret49 := isIdle_#res;cleanup_~tmp~11 := cleanup_#t~ret49;havoc cleanup_#t~ret49; 2364#L671true assume !(0 != cleanup_~tmp~11);havoc timeShift_#t~ret97, timeShift_#t~ret98, timeShift_#t~ret99, timeShift_#t~ret100, timeShift_#t~ret101, timeShift_#t~ret102, timeShift_#t~ret103, timeShift_#t~ret104, timeShift_#t~ret105, timeShift_#t~ret106, timeShift_#t~ret107, timeShift_~tmp~25, timeShift_~tmp___0~10, timeShift_~tmp___1~6, timeShift_~tmp___2~4, 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~25;havoc timeShift_~tmp___0~10;havoc timeShift_~tmp___1~6;havoc timeShift_~tmp___2~4;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~ret81, stopRequestedAtCurrentFloor_#t~ret82, stopRequestedAtCurrentFloor_#t~ret83, stopRequestedAtCurrentFloor_#t~ret84, stopRequestedAtCurrentFloor_~retValue_acc~17, stopRequestedAtCurrentFloor_~tmp~23, stopRequestedAtCurrentFloor_~tmp___0~8;havoc stopRequestedAtCurrentFloor_~retValue_acc~17;havoc stopRequestedAtCurrentFloor_~tmp~23;havoc stopRequestedAtCurrentFloor_~tmp___0~8;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 1756#L2505-30true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 157#L2532-30true isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 874#L2409-3true stopRequestedAtCurrentFloor_#t~ret81 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~23 := stopRequestedAtCurrentFloor_#t~ret81;havoc stopRequestedAtCurrentFloor_#t~ret81; 855#L1793-1true assume 0 != stopRequestedAtCurrentFloor_~tmp~23;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 127#L1124-4true stopRequestedAtCurrentFloor_#t~ret82 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~8 := stopRequestedAtCurrentFloor_#t~ret82;havoc stopRequestedAtCurrentFloor_#t~ret82; 793#L1797-1true assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~8);stopRequestedAtCurrentFloor_~retValue_acc~17 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~17; 1086#L1810-1true timeShift_#t~ret97 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret97;havoc timeShift_#t~ret97; 2511#L1946-1true assume !(0 != timeShift_~tmp___9~2); 2267#L2037-3true assume 1 == ~doorState~0;~doorState~0 := 0; 2277#L2037-5true stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret75, stopRequestedInDirection_#t~ret76, stopRequestedInDirection_#t~ret77, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~14, stopRequestedInDirection_~tmp~20, stopRequestedInDirection_~tmp___0~6, stopRequestedInDirection_~__cil_tmp7~5, stopRequestedInDirection_~__cil_tmp8~5;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~14;havoc stopRequestedInDirection_~tmp~20;havoc stopRequestedInDirection_~tmp___0~6;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 1744#L2505-33true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 138#L2532-33true isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 877#L2409-4true stopRequestedInDirection_#t~ret75 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~6 := stopRequestedInDirection_#t~ret75;havoc stopRequestedInDirection_#t~ret75; 1391#L1676-2true assume 0 != stopRequestedInDirection_~tmp___0~6;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 128#L1124-5true stopRequestedInDirection_#t~ret76 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~20 := stopRequestedInDirection_#t~ret76;havoc stopRequestedInDirection_#t~ret76;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~20 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~14 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~14; 1898#L1689-2true timeShift_#t~ret104 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret104;havoc timeShift_#t~ret104; 484#L2045-1true assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret78, continueInDirection_~dir, continueInDirection_~tmp~21;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~21;~currentHeading~0 := continueInDirection_~dir; 1895#L1733-3true assume !(1 == ~currentHeading~0); 29#L1743-9true assume !(0 == ~currentFloorID~0); 17#L1743-11true assume 1 == ~currentHeading~0;~currentFloorID~0 := 1 + ~currentFloorID~0; 842#L1749-11true havoc __utac_acc__Specification9_spec__3_#t~ret156, __utac_acc__Specification9_spec__3_#t~ret157, __utac_acc__Specification9_spec__3_#t~ret158, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~27, __utac_acc__Specification9_spec__3_~tmp___0~12, __utac_acc__Specification9_spec__3_~tmp___1~8;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~27;havoc __utac_acc__Specification9_spec__3_~tmp___0~12;havoc __utac_acc__Specification9_spec__3_~tmp___1~8;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 105#L1124-7true __utac_acc__Specification9_spec__3_#t~ret156 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~27 := __utac_acc__Specification9_spec__3_#t~ret156;havoc __utac_acc__Specification9_spec__3_#t~ret156;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~27;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~10;havoc isEmpty_~retValue_acc~10; 1765#L1184-13true assume 1 == ~persons_0~0;isEmpty_~retValue_acc~10 := 0;isEmpty_#res := isEmpty_~retValue_acc~10; 63#L1216-13true __utac_acc__Specification9_spec__3_#t~ret157 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~8 := __utac_acc__Specification9_spec__3_#t~ret157;havoc __utac_acc__Specification9_spec__3_#t~ret157; 807#L3162-2true assume 0 != __utac_acc__Specification9_spec__3_~tmp___1~8;~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; 1265#L3172-3true cleanup_~i~2 := 1 + cleanup_~i~2; 678#L651-2true [2019-01-01 23:24:54,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:24:54,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1322374021, now seen corresponding path program 1 times [2019-01-01 23:24:54,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:24:54,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:24:54,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:24:54,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:24:54,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:24:54,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:24:54,914 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:24:54,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:24:54,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:24:54,923 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:24:54,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:24:54,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1147060777, now seen corresponding path program 1 times [2019-01-01 23:24:54,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:24:54,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:24:54,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:24:54,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:24:54,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:24:54,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:24:55,047 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:24:55,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:24:55,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:24:55,049 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:24:55,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:24:55,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:24:55,072 INFO L87 Difference]: Start difference. First operand 2599 states. Second operand 3 states. [2019-01-01 23:24:55,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:24:55,970 INFO L93 Difference]: Finished difference Result 3918 states and 7348 transitions. [2019-01-01 23:24:55,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:24:55,972 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3918 states and 7348 transitions. [2019-01-01 23:24:56,012 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2568 [2019-01-01 23:24:56,063 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3918 states to 3890 states and 7315 transitions. [2019-01-01 23:24:56,064 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3890 [2019-01-01 23:24:56,074 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3890 [2019-01-01 23:24:56,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3890 states and 7315 transitions. [2019-01-01 23:24:56,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:24:56,102 INFO L705 BuchiCegarLoop]: Abstraction has 3890 states and 7315 transitions. [2019-01-01 23:24:56,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3890 states and 7315 transitions. [2019-01-01 23:24:56,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3890 to 3888. [2019-01-01 23:24:56,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3888 states. [2019-01-01 23:24:56,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3888 states to 3888 states and 7312 transitions. [2019-01-01 23:24:56,278 INFO L728 BuchiCegarLoop]: Abstraction has 3888 states and 7312 transitions. [2019-01-01 23:24:56,278 INFO L608 BuchiCegarLoop]: Abstraction has 3888 states and 7312 transitions. [2019-01-01 23:24:56,278 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 23:24:56,278 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3888 states and 7312 transitions. [2019-01-01 23:24:56,303 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2566 [2019-01-01 23:24:56,303 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:24:56,303 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:24:56,307 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:24:56,307 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:24:56,308 INFO L794 eck$LassoCheckResult]: Stem: 7134#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(30);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(9);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(21);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(30);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(9);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(21);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(30);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(9);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(25);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(30);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(9);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(25);~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~cleanupTimeShifts~0 := 12;~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~string108.base, #t~string108.offset := #Ultimate.allocOnStack(10);call #t~string110.base, #t~string110.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string110.base, #t~string110.offset, 1);call write~init~int(95, #t~string110.base, 1 + #t~string110.offset, 1);call write~init~int(93, #t~string110.base, 2 + #t~string110.offset, 1);call write~init~int(0, #t~string110.base, 3 + #t~string110.offset, 1);call #t~string112.base, #t~string112.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string112.base, #t~string112.offset, 1);call write~init~int(93, #t~string112.base, 1 + #t~string112.offset, 1);call write~init~int(32, #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(5);call write~init~int(32, #t~string114.base, #t~string114.offset, 1);call write~init~int(97, #t~string114.base, 1 + #t~string114.offset, 1);call write~init~int(116, #t~string114.base, 2 + #t~string114.offset, 1);call write~init~int(32, #t~string114.base, 3 + #t~string114.offset, 1);call write~init~int(0, #t~string114.base, 4 + #t~string114.offset, 1);call #t~string116.base, #t~string116.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string116.base, #t~string116.offset, 1);call write~init~int(105, #t~string116.base, 1 + #t~string116.offset, 1);call write~init~int(0, #t~string116.base, 2 + #t~string116.offset, 1);call #t~string118.base, #t~string118.offset := #Ultimate.allocOnStack(10);call #t~string120.base, #t~string120.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string120.base, #t~string120.offset, 1);call write~init~int(112, #t~string120.base, 1 + #t~string120.offset, 1);call write~init~int(0, #t~string120.base, 2 + #t~string120.offset, 1);call #t~string122.base, #t~string122.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string122.base, #t~string122.offset, 1);call write~init~int(111, #t~string122.base, 1 + #t~string122.offset, 1);call write~init~int(119, #t~string122.base, 2 + #t~string122.offset, 1);call write~init~int(110, #t~string122.base, 3 + #t~string122.offset, 1);call write~init~int(0, #t~string122.base, 4 + #t~string122.offset, 1);call #t~string124.base, #t~string124.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string124.base, #t~string124.offset, 1);call write~init~int(73, #t~string124.base, 1 + #t~string124.offset, 1);call write~init~int(76, #t~string124.base, 2 + #t~string124.offset, 1);call write~init~int(95, #t~string124.base, 3 + #t~string124.offset, 1);call write~init~int(112, #t~string124.base, 4 + #t~string124.offset, 1);call write~init~int(58, #t~string124.base, 5 + #t~string124.offset, 1);call write~init~int(0, #t~string124.base, 6 + #t~string124.offset, 1);call #t~string126.base, #t~string126.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string126.base, #t~string126.offset, 1);call write~init~int(37, #t~string126.base, 1 + #t~string126.offset, 1);call write~init~int(105, #t~string126.base, 2 + #t~string126.offset, 1);call write~init~int(0, #t~string126.base, 3 + #t~string126.offset, 1);call #t~string128.base, #t~string128.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string128.base, #t~string128.offset, 1);call write~init~int(37, #t~string128.base, 1 + #t~string128.offset, 1);call write~init~int(105, #t~string128.base, 2 + #t~string128.offset, 1);call write~init~int(0, #t~string128.base, 3 + #t~string128.offset, 1);call #t~string130.base, #t~string130.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string130.base, #t~string130.offset, 1);call write~init~int(37, #t~string130.base, 1 + #t~string130.offset, 1);call write~init~int(105, #t~string130.base, 2 + #t~string130.offset, 1);call write~init~int(0, #t~string130.base, 3 + #t~string130.offset, 1);call #t~string132.base, #t~string132.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string132.base, #t~string132.offset, 1);call write~init~int(37, #t~string132.base, 1 + #t~string132.offset, 1);call write~init~int(105, #t~string132.base, 2 + #t~string132.offset, 1);call write~init~int(0, #t~string132.base, 3 + #t~string132.offset, 1);call #t~string134.base, #t~string134.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string134.base, #t~string134.offset, 1);call write~init~int(37, #t~string134.base, 1 + #t~string134.offset, 1);call write~init~int(105, #t~string134.base, 2 + #t~string134.offset, 1);call write~init~int(0, #t~string134.base, 3 + #t~string134.offset, 1);call #t~string136.base, #t~string136.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string136.base, #t~string136.offset, 1);call write~init~int(70, #t~string136.base, 1 + #t~string136.offset, 1);call write~init~int(95, #t~string136.base, 2 + #t~string136.offset, 1);call write~init~int(112, #t~string136.base, 3 + #t~string136.offset, 1);call write~init~int(58, #t~string136.base, 4 + #t~string136.offset, 1);call write~init~int(0, #t~string136.base, 5 + #t~string136.offset, 1);call #t~string139.base, #t~string139.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string139.base, #t~string139.offset, 1);call write~init~int(37, #t~string139.base, 1 + #t~string139.offset, 1);call write~init~int(105, #t~string139.base, 2 + #t~string139.offset, 1);call write~init~int(0, #t~string139.base, 3 + #t~string139.offset, 1);call #t~string142.base, #t~string142.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string142.base, #t~string142.offset, 1);call write~init~int(37, #t~string142.base, 1 + #t~string142.offset, 1);call write~init~int(105, #t~string142.base, 2 + #t~string142.offset, 1);call write~init~int(0, #t~string142.base, 3 + #t~string142.offset, 1);call #t~string145.base, #t~string145.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string145.base, #t~string145.offset, 1);call write~init~int(37, #t~string145.base, 1 + #t~string145.offset, 1);call write~init~int(105, #t~string145.base, 2 + #t~string145.offset, 1);call write~init~int(0, #t~string145.base, 3 + #t~string145.offset, 1);call #t~string148.base, #t~string148.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string148.base, #t~string148.offset, 1);call write~init~int(37, #t~string148.base, 1 + #t~string148.offset, 1);call write~init~int(105, #t~string148.base, 2 + #t~string148.offset, 1);call write~init~int(0, #t~string148.base, 3 + #t~string148.offset, 1);call #t~string151.base, #t~string151.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string151.base, #t~string151.offset, 1);call write~init~int(37, #t~string151.base, 1 + #t~string151.offset, 1);call write~init~int(105, #t~string151.base, 2 + #t~string151.offset, 1);call write~init~int(0, #t~string151.base, 3 + #t~string151.offset, 1);call #t~string153.base, #t~string153.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string153.base, #t~string153.offset, 1);call write~init~int(0, #t~string153.base, 1 + #t~string153.offset, 1);~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; 7135#L-1 havoc main_#res;havoc main_#t~ret54, main_~retValue_acc~4, main_~tmp~13;havoc main_~retValue_acc~4;havoc main_~tmp~13; 6710#L3286 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; 6711#L3294 main_#t~ret54 := valid_product_#res;main_~tmp~13 := main_#t~ret54;havoc main_#t~ret54; 7790#L850 assume 0 != main_~tmp~13; 6539#L819 ~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; 6540#L3119 havoc bigMacCall_#t~ret47, bigMacCall_~tmp~10;havoc bigMacCall_~tmp~10;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~28;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~28; 7424#L3342 assume 0 == getOrigin_~person;getOrigin_~retValue_acc~28 := 4;getOrigin_#res := getOrigin_~retValue_acc~28; 7053#L3367 bigMacCall_#t~ret47 := getOrigin_#res;bigMacCall_~tmp~10 := bigMacCall_#t~ret47;havoc bigMacCall_#t~ret47;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~10;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 7054#L2776 assume 0 == initPersonOnFloor_~floor; 8286#L2777 assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 6633#L2884-1 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 7174#L2568 assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 6577#L2580-2 havoc cleanup_#t~ret48, cleanup_#t~ret49, cleanup_~i~2, cleanup_~tmp~11, cleanup_~tmp___0~2, cleanup_~__cil_tmp4~2;havoc cleanup_~i~2;havoc cleanup_~tmp~11;havoc cleanup_~tmp___0~2;havoc cleanup_~__cil_tmp4~2;havoc timeShift_#t~ret97, timeShift_#t~ret98, timeShift_#t~ret99, timeShift_#t~ret100, timeShift_#t~ret101, timeShift_#t~ret102, timeShift_#t~ret103, timeShift_#t~ret104, timeShift_#t~ret105, timeShift_#t~ret106, timeShift_#t~ret107, timeShift_~tmp~25, timeShift_~tmp___0~10, timeShift_~tmp___1~6, timeShift_~tmp___2~4, 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~25;havoc timeShift_~tmp___0~10;havoc timeShift_~tmp___1~6;havoc timeShift_~tmp___2~4;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~ret81, stopRequestedAtCurrentFloor_#t~ret82, stopRequestedAtCurrentFloor_#t~ret83, stopRequestedAtCurrentFloor_#t~ret84, stopRequestedAtCurrentFloor_~retValue_acc~17, stopRequestedAtCurrentFloor_~tmp~23, stopRequestedAtCurrentFloor_~tmp___0~8;havoc stopRequestedAtCurrentFloor_~retValue_acc~17;havoc stopRequestedAtCurrentFloor_~tmp~23;havoc stopRequestedAtCurrentFloor_~tmp___0~8;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 6584#L2505 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 7150#L2532 isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 7151#L2409 stopRequestedAtCurrentFloor_#t~ret81 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~23 := stopRequestedAtCurrentFloor_#t~ret81;havoc stopRequestedAtCurrentFloor_#t~ret81; 7826#L1793 assume 0 != stopRequestedAtCurrentFloor_~tmp~23;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 6769#L1124 stopRequestedAtCurrentFloor_#t~ret82 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~8 := stopRequestedAtCurrentFloor_#t~ret82;havoc stopRequestedAtCurrentFloor_#t~ret82; 6770#L1797 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~8);stopRequestedAtCurrentFloor_~retValue_acc~17 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~17; 7783#L1810 timeShift_#t~ret97 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret97;havoc timeShift_#t~ret97; 7996#L1946 assume !(0 != timeShift_~tmp___9~2); 9052#L2037 assume !(1 == ~doorState~0); 9028#L2037-2 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret75, stopRequestedInDirection_#t~ret76, stopRequestedInDirection_#t~ret77, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~14, stopRequestedInDirection_~tmp~20, stopRequestedInDirection_~tmp___0~6, stopRequestedInDirection_~__cil_tmp7~5, stopRequestedInDirection_~__cil_tmp8~5;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~14;havoc stopRequestedInDirection_~tmp~20;havoc stopRequestedInDirection_~tmp___0~6;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 7454#L2505-3 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 7156#L2532-3 isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 7157#L2409-1 stopRequestedInDirection_#t~ret75 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~6 := stopRequestedInDirection_#t~ret75;havoc stopRequestedInDirection_#t~ret75; 7841#L1676 assume 0 != stopRequestedInDirection_~tmp___0~6;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 6771#L1124-1 stopRequestedInDirection_#t~ret76 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~20 := stopRequestedInDirection_#t~ret76;havoc stopRequestedInDirection_#t~ret76;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~20 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~14 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~14; 6772#L1689 timeShift_#t~ret104 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret104;havoc timeShift_#t~ret104; 7271#L2045 assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret78, continueInDirection_~dir, continueInDirection_~tmp~21;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~21;~currentHeading~0 := continueInDirection_~dir; 7273#L1733 assume !(1 == ~currentHeading~0); 6641#L1743 assume 0 == ~currentFloorID~0;~currentHeading~0 := 1; 6642#L1743-2 assume 1 == ~currentHeading~0;~currentFloorID~0 := 1 + ~currentFloorID~0; 7582#L1749-5 havoc __utac_acc__Specification9_spec__3_#t~ret156, __utac_acc__Specification9_spec__3_#t~ret157, __utac_acc__Specification9_spec__3_#t~ret158, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~27, __utac_acc__Specification9_spec__3_~tmp___0~12, __utac_acc__Specification9_spec__3_~tmp___1~8;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~27;havoc __utac_acc__Specification9_spec__3_~tmp___0~12;havoc __utac_acc__Specification9_spec__3_~tmp___1~8;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 10301#L1124-3 __utac_acc__Specification9_spec__3_#t~ret156 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~27 := __utac_acc__Specification9_spec__3_#t~ret156;havoc __utac_acc__Specification9_spec__3_#t~ret156;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~27;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~10;havoc isEmpty_~retValue_acc~10; 10298#L1184-6 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~10 := 0;isEmpty_#res := isEmpty_~retValue_acc~10; 10294#L1216-6 __utac_acc__Specification9_spec__3_#t~ret157 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~8 := __utac_acc__Specification9_spec__3_#t~ret157;havoc __utac_acc__Specification9_spec__3_#t~ret157; 9404#L3162 assume 0 != __utac_acc__Specification9_spec__3_~tmp___1~8;~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; 9400#L3172-1 cleanup_~i~2 := 0; 9398#L651-2 [2019-01-01 23:24:56,308 INFO L796 eck$LassoCheckResult]: Loop: 9398#L651-2 assume !false; 9397#L652 cleanup_~__cil_tmp4~2 := ~cleanupTimeShifts~0 - 1; 9396#L655 assume cleanup_~i~2 < cleanup_~__cil_tmp4~2;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~5;havoc isBlocked_~retValue_acc~5;isBlocked_~retValue_acc~5 := 0;isBlocked_#res := isBlocked_~retValue_acc~5; 9395#L946 cleanup_#t~ret48 := isBlocked_#res;cleanup_~tmp___0~2 := cleanup_#t~ret48;havoc cleanup_#t~ret48; 9394#L659 assume 1 != cleanup_~tmp___0~2; 9393#L659-1 havoc isIdle_#res;havoc isIdle_#t~ret63, isIdle_~retValue_acc~12, isIdle_~tmp~18;havoc isIdle_~retValue_acc~12;havoc isIdle_~tmp~18;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret58, anyStopRequested_#t~ret59, anyStopRequested_#t~ret60, anyStopRequested_#t~ret61, anyStopRequested_#t~ret62, anyStopRequested_~retValue_acc~11, anyStopRequested_~tmp~17, anyStopRequested_~tmp___0~4, anyStopRequested_~tmp___1~3, anyStopRequested_~tmp___2~1, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~11;havoc anyStopRequested_~tmp~17;havoc anyStopRequested_~tmp___0~4;havoc anyStopRequested_~tmp___1~3;havoc anyStopRequested_~tmp___2~1;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 9388#L2505-25 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 9382#L2532-25 anyStopRequested_#t~ret58 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret58;havoc anyStopRequested_#t~ret58; 9366#L1232 assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~11 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~11; 9357#L1296 isIdle_#t~ret63 := anyStopRequested_#res;isIdle_~tmp~18 := isIdle_#t~ret63;havoc isIdle_#t~ret63;isIdle_~retValue_acc~12 := (if 0 == isIdle_~tmp~18 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~12; 9356#L1309 cleanup_#t~ret49 := isIdle_#res;cleanup_~tmp~11 := cleanup_#t~ret49;havoc cleanup_#t~ret49; 9355#L671 assume !(0 != cleanup_~tmp~11);havoc timeShift_#t~ret97, timeShift_#t~ret98, timeShift_#t~ret99, timeShift_#t~ret100, timeShift_#t~ret101, timeShift_#t~ret102, timeShift_#t~ret103, timeShift_#t~ret104, timeShift_#t~ret105, timeShift_#t~ret106, timeShift_#t~ret107, timeShift_~tmp~25, timeShift_~tmp___0~10, timeShift_~tmp___1~6, timeShift_~tmp___2~4, 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~25;havoc timeShift_~tmp___0~10;havoc timeShift_~tmp___1~6;havoc timeShift_~tmp___2~4;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~ret81, stopRequestedAtCurrentFloor_#t~ret82, stopRequestedAtCurrentFloor_#t~ret83, stopRequestedAtCurrentFloor_#t~ret84, stopRequestedAtCurrentFloor_~retValue_acc~17, stopRequestedAtCurrentFloor_~tmp~23, stopRequestedAtCurrentFloor_~tmp___0~8;havoc stopRequestedAtCurrentFloor_~retValue_acc~17;havoc stopRequestedAtCurrentFloor_~tmp~23;havoc stopRequestedAtCurrentFloor_~tmp___0~8;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 9354#L2505-30 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 9349#L2532-30 isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 9348#L2409-3 stopRequestedAtCurrentFloor_#t~ret81 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~23 := stopRequestedAtCurrentFloor_#t~ret81;havoc stopRequestedAtCurrentFloor_#t~ret81; 9347#L1793-1 assume 0 != stopRequestedAtCurrentFloor_~tmp~23;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 9346#L1124-4 stopRequestedAtCurrentFloor_#t~ret82 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~8 := stopRequestedAtCurrentFloor_#t~ret82;havoc stopRequestedAtCurrentFloor_#t~ret82; 9326#L1797-1 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~8);stopRequestedAtCurrentFloor_~retValue_acc~17 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~17; 9322#L1810-1 timeShift_#t~ret97 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret97;havoc timeShift_#t~ret97; 9320#L1946-1 assume !(0 != timeShift_~tmp___9~2); 9319#L2037-3 assume 1 == ~doorState~0;~doorState~0 := 0; 9318#L2037-5 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret75, stopRequestedInDirection_#t~ret76, stopRequestedInDirection_#t~ret77, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~14, stopRequestedInDirection_~tmp~20, stopRequestedInDirection_~tmp___0~6, stopRequestedInDirection_~__cil_tmp7~5, stopRequestedInDirection_~__cil_tmp8~5;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~14;havoc stopRequestedInDirection_~tmp~20;havoc stopRequestedInDirection_~tmp___0~6;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 9316#L2505-33 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 9312#L2532-33 isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 9311#L2409-4 stopRequestedInDirection_#t~ret75 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~6 := stopRequestedInDirection_#t~ret75;havoc stopRequestedInDirection_#t~ret75; 9310#L1676-2 assume 0 != stopRequestedInDirection_~tmp___0~6;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 9199#L1124-5 stopRequestedInDirection_#t~ret76 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~20 := stopRequestedInDirection_#t~ret76;havoc stopRequestedInDirection_#t~ret76;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~20 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~14 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~14; 9198#L1689-2 timeShift_#t~ret104 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret104;havoc timeShift_#t~ret104; 9195#L2045-1 assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret78, continueInDirection_~dir, continueInDirection_~tmp~21;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~21;~currentHeading~0 := continueInDirection_~dir; 9196#L1733-3 assume !(1 == ~currentHeading~0); 6591#L1743-9 assume 0 == ~currentFloorID~0;~currentHeading~0 := 1; 6592#L1743-11 assume 1 == ~currentHeading~0;~currentFloorID~0 := 1 + ~currentFloorID~0; 9432#L1749-11 havoc __utac_acc__Specification9_spec__3_#t~ret156, __utac_acc__Specification9_spec__3_#t~ret157, __utac_acc__Specification9_spec__3_#t~ret158, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~27, __utac_acc__Specification9_spec__3_~tmp___0~12, __utac_acc__Specification9_spec__3_~tmp___1~8;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~27;havoc __utac_acc__Specification9_spec__3_~tmp___0~12;havoc __utac_acc__Specification9_spec__3_~tmp___1~8;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 9431#L1124-7 __utac_acc__Specification9_spec__3_#t~ret156 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~27 := __utac_acc__Specification9_spec__3_#t~ret156;havoc __utac_acc__Specification9_spec__3_#t~ret156;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~27;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~10;havoc isEmpty_~retValue_acc~10; 9430#L1184-13 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~10 := 0;isEmpty_#res := isEmpty_~retValue_acc~10; 9424#L1216-13 __utac_acc__Specification9_spec__3_#t~ret157 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~8 := __utac_acc__Specification9_spec__3_#t~ret157;havoc __utac_acc__Specification9_spec__3_#t~ret157; 9420#L3162-2 assume 0 != __utac_acc__Specification9_spec__3_~tmp___1~8;~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; 9399#L3172-3 cleanup_~i~2 := 1 + cleanup_~i~2; 9398#L651-2 [2019-01-01 23:24:56,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:24:56,314 INFO L82 PathProgramCache]: Analyzing trace with hash 2006932539, now seen corresponding path program 1 times [2019-01-01 23:24:56,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:24:56,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:24:56,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:24:56,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:24:56,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:24:56,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:24:56,458 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:24:56,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:24:56,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:24:56,460 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:24:56,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:24:56,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1956407403, now seen corresponding path program 1 times [2019-01-01 23:24:56,460 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:24:56,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:24:56,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:24:56,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:24:56,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:24:56,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:24:56,649 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:24:56,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:24:56,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 23:24:56,650 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:24:56,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 23:24:56,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-01 23:24:56,652 INFO L87 Difference]: Start difference. First operand 3888 states and 7312 transitions. cyclomatic complexity: 3425 Second operand 7 states. [2019-01-01 23:24:57,823 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-01 23:25:04,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:25:04,602 INFO L93 Difference]: Finished difference Result 31551 states and 59042 transitions. [2019-01-01 23:25:04,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-01 23:25:04,603 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31551 states and 59042 transitions. [2019-01-01 23:25:04,812 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18920 [2019-01-01 23:25:05,237 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31551 states to 31551 states and 59042 transitions. [2019-01-01 23:25:05,238 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31551 [2019-01-01 23:25:05,282 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31551 [2019-01-01 23:25:05,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31551 states and 59042 transitions. [2019-01-01 23:25:05,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:25:05,334 INFO L705 BuchiCegarLoop]: Abstraction has 31551 states and 59042 transitions. [2019-01-01 23:25:05,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31551 states and 59042 transitions. [2019-01-01 23:25:05,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31551 to 11248. [2019-01-01 23:25:05,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11248 states. [2019-01-01 23:25:05,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11248 states to 11248 states and 21079 transitions. [2019-01-01 23:25:05,773 INFO L728 BuchiCegarLoop]: Abstraction has 11248 states and 21079 transitions. [2019-01-01 23:25:05,773 INFO L608 BuchiCegarLoop]: Abstraction has 11248 states and 21079 transitions. [2019-01-01 23:25:05,773 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 23:25:05,773 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11248 states and 21079 transitions. [2019-01-01 23:25:05,820 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7522 [2019-01-01 23:25:05,820 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:25:05,820 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:25:05,825 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:05,825 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:05,825 INFO L794 eck$LassoCheckResult]: Stem: 42628#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(30);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(9);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(21);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(30);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(9);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(21);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(30);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(9);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(25);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(30);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(9);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(25);~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~cleanupTimeShifts~0 := 12;~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~string108.base, #t~string108.offset := #Ultimate.allocOnStack(10);call #t~string110.base, #t~string110.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string110.base, #t~string110.offset, 1);call write~init~int(95, #t~string110.base, 1 + #t~string110.offset, 1);call write~init~int(93, #t~string110.base, 2 + #t~string110.offset, 1);call write~init~int(0, #t~string110.base, 3 + #t~string110.offset, 1);call #t~string112.base, #t~string112.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string112.base, #t~string112.offset, 1);call write~init~int(93, #t~string112.base, 1 + #t~string112.offset, 1);call write~init~int(32, #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(5);call write~init~int(32, #t~string114.base, #t~string114.offset, 1);call write~init~int(97, #t~string114.base, 1 + #t~string114.offset, 1);call write~init~int(116, #t~string114.base, 2 + #t~string114.offset, 1);call write~init~int(32, #t~string114.base, 3 + #t~string114.offset, 1);call write~init~int(0, #t~string114.base, 4 + #t~string114.offset, 1);call #t~string116.base, #t~string116.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string116.base, #t~string116.offset, 1);call write~init~int(105, #t~string116.base, 1 + #t~string116.offset, 1);call write~init~int(0, #t~string116.base, 2 + #t~string116.offset, 1);call #t~string118.base, #t~string118.offset := #Ultimate.allocOnStack(10);call #t~string120.base, #t~string120.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string120.base, #t~string120.offset, 1);call write~init~int(112, #t~string120.base, 1 + #t~string120.offset, 1);call write~init~int(0, #t~string120.base, 2 + #t~string120.offset, 1);call #t~string122.base, #t~string122.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string122.base, #t~string122.offset, 1);call write~init~int(111, #t~string122.base, 1 + #t~string122.offset, 1);call write~init~int(119, #t~string122.base, 2 + #t~string122.offset, 1);call write~init~int(110, #t~string122.base, 3 + #t~string122.offset, 1);call write~init~int(0, #t~string122.base, 4 + #t~string122.offset, 1);call #t~string124.base, #t~string124.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string124.base, #t~string124.offset, 1);call write~init~int(73, #t~string124.base, 1 + #t~string124.offset, 1);call write~init~int(76, #t~string124.base, 2 + #t~string124.offset, 1);call write~init~int(95, #t~string124.base, 3 + #t~string124.offset, 1);call write~init~int(112, #t~string124.base, 4 + #t~string124.offset, 1);call write~init~int(58, #t~string124.base, 5 + #t~string124.offset, 1);call write~init~int(0, #t~string124.base, 6 + #t~string124.offset, 1);call #t~string126.base, #t~string126.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string126.base, #t~string126.offset, 1);call write~init~int(37, #t~string126.base, 1 + #t~string126.offset, 1);call write~init~int(105, #t~string126.base, 2 + #t~string126.offset, 1);call write~init~int(0, #t~string126.base, 3 + #t~string126.offset, 1);call #t~string128.base, #t~string128.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string128.base, #t~string128.offset, 1);call write~init~int(37, #t~string128.base, 1 + #t~string128.offset, 1);call write~init~int(105, #t~string128.base, 2 + #t~string128.offset, 1);call write~init~int(0, #t~string128.base, 3 + #t~string128.offset, 1);call #t~string130.base, #t~string130.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string130.base, #t~string130.offset, 1);call write~init~int(37, #t~string130.base, 1 + #t~string130.offset, 1);call write~init~int(105, #t~string130.base, 2 + #t~string130.offset, 1);call write~init~int(0, #t~string130.base, 3 + #t~string130.offset, 1);call #t~string132.base, #t~string132.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string132.base, #t~string132.offset, 1);call write~init~int(37, #t~string132.base, 1 + #t~string132.offset, 1);call write~init~int(105, #t~string132.base, 2 + #t~string132.offset, 1);call write~init~int(0, #t~string132.base, 3 + #t~string132.offset, 1);call #t~string134.base, #t~string134.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string134.base, #t~string134.offset, 1);call write~init~int(37, #t~string134.base, 1 + #t~string134.offset, 1);call write~init~int(105, #t~string134.base, 2 + #t~string134.offset, 1);call write~init~int(0, #t~string134.base, 3 + #t~string134.offset, 1);call #t~string136.base, #t~string136.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string136.base, #t~string136.offset, 1);call write~init~int(70, #t~string136.base, 1 + #t~string136.offset, 1);call write~init~int(95, #t~string136.base, 2 + #t~string136.offset, 1);call write~init~int(112, #t~string136.base, 3 + #t~string136.offset, 1);call write~init~int(58, #t~string136.base, 4 + #t~string136.offset, 1);call write~init~int(0, #t~string136.base, 5 + #t~string136.offset, 1);call #t~string139.base, #t~string139.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string139.base, #t~string139.offset, 1);call write~init~int(37, #t~string139.base, 1 + #t~string139.offset, 1);call write~init~int(105, #t~string139.base, 2 + #t~string139.offset, 1);call write~init~int(0, #t~string139.base, 3 + #t~string139.offset, 1);call #t~string142.base, #t~string142.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string142.base, #t~string142.offset, 1);call write~init~int(37, #t~string142.base, 1 + #t~string142.offset, 1);call write~init~int(105, #t~string142.base, 2 + #t~string142.offset, 1);call write~init~int(0, #t~string142.base, 3 + #t~string142.offset, 1);call #t~string145.base, #t~string145.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string145.base, #t~string145.offset, 1);call write~init~int(37, #t~string145.base, 1 + #t~string145.offset, 1);call write~init~int(105, #t~string145.base, 2 + #t~string145.offset, 1);call write~init~int(0, #t~string145.base, 3 + #t~string145.offset, 1);call #t~string148.base, #t~string148.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string148.base, #t~string148.offset, 1);call write~init~int(37, #t~string148.base, 1 + #t~string148.offset, 1);call write~init~int(105, #t~string148.base, 2 + #t~string148.offset, 1);call write~init~int(0, #t~string148.base, 3 + #t~string148.offset, 1);call #t~string151.base, #t~string151.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string151.base, #t~string151.offset, 1);call write~init~int(37, #t~string151.base, 1 + #t~string151.offset, 1);call write~init~int(105, #t~string151.base, 2 + #t~string151.offset, 1);call write~init~int(0, #t~string151.base, 3 + #t~string151.offset, 1);call #t~string153.base, #t~string153.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string153.base, #t~string153.offset, 1);call write~init~int(0, #t~string153.base, 1 + #t~string153.offset, 1);~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; 42629#L-1 havoc main_#res;havoc main_#t~ret54, main_~retValue_acc~4, main_~tmp~13;havoc main_~retValue_acc~4;havoc main_~tmp~13; 42183#L3286 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; 42184#L3294 main_#t~ret54 := valid_product_#res;main_~tmp~13 := main_#t~ret54;havoc main_#t~ret54; 43315#L850 assume 0 != main_~tmp~13; 42018#L819 ~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; 42019#L3119 havoc bigMacCall_#t~ret47, bigMacCall_~tmp~10;havoc bigMacCall_~tmp~10;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~28;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~28; 42932#L3342 assume 0 == getOrigin_~person;getOrigin_~retValue_acc~28 := 4;getOrigin_#res := getOrigin_~retValue_acc~28; 42543#L3367 bigMacCall_#t~ret47 := getOrigin_#res;bigMacCall_~tmp~10 := bigMacCall_#t~ret47;havoc bigMacCall_#t~ret47;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~10;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 42544#L2776 assume 0 == initPersonOnFloor_~floor; 43889#L2777 assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 42107#L2884-1 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 42674#L2568 assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 42054#L2580-2 havoc cleanup_#t~ret48, cleanup_#t~ret49, cleanup_~i~2, cleanup_~tmp~11, cleanup_~tmp___0~2, cleanup_~__cil_tmp4~2;havoc cleanup_~i~2;havoc cleanup_~tmp~11;havoc cleanup_~tmp___0~2;havoc cleanup_~__cil_tmp4~2;havoc timeShift_#t~ret97, timeShift_#t~ret98, timeShift_#t~ret99, timeShift_#t~ret100, timeShift_#t~ret101, timeShift_#t~ret102, timeShift_#t~ret103, timeShift_#t~ret104, timeShift_#t~ret105, timeShift_#t~ret106, timeShift_#t~ret107, timeShift_~tmp~25, timeShift_~tmp___0~10, timeShift_~tmp___1~6, timeShift_~tmp___2~4, 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~25;havoc timeShift_~tmp___0~10;havoc timeShift_~tmp___1~6;havoc timeShift_~tmp___2~4;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~ret81, stopRequestedAtCurrentFloor_#t~ret82, stopRequestedAtCurrentFloor_#t~ret83, stopRequestedAtCurrentFloor_#t~ret84, stopRequestedAtCurrentFloor_~retValue_acc~17, stopRequestedAtCurrentFloor_~tmp~23, stopRequestedAtCurrentFloor_~tmp___0~8;havoc stopRequestedAtCurrentFloor_~retValue_acc~17;havoc stopRequestedAtCurrentFloor_~tmp~23;havoc stopRequestedAtCurrentFloor_~tmp___0~8;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 42060#L2505 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 42650#L2532 isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 42651#L2409 stopRequestedAtCurrentFloor_#t~ret81 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~23 := stopRequestedAtCurrentFloor_#t~ret81;havoc stopRequestedAtCurrentFloor_#t~ret81; 43364#L1793 assume 0 != stopRequestedAtCurrentFloor_~tmp~23;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 42242#L1124 stopRequestedAtCurrentFloor_#t~ret82 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~8 := stopRequestedAtCurrentFloor_#t~ret82;havoc stopRequestedAtCurrentFloor_#t~ret82; 42243#L1797 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~8);stopRequestedAtCurrentFloor_~retValue_acc~17 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~17; 43306#L1810 timeShift_#t~ret97 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret97;havoc timeShift_#t~ret97; 49878#L1946 assume !(0 != timeShift_~tmp___9~2); 49879#L2037 assume !(1 == ~doorState~0); 51051#L2037-2 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret75, stopRequestedInDirection_#t~ret76, stopRequestedInDirection_#t~ret77, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~14, stopRequestedInDirection_~tmp~20, stopRequestedInDirection_~tmp___0~6, stopRequestedInDirection_~__cil_tmp7~5, stopRequestedInDirection_~__cil_tmp8~5;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~14;havoc stopRequestedInDirection_~tmp~20;havoc stopRequestedInDirection_~tmp___0~6;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 51050#L2505-3 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 51049#L2532-3 isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 51048#L2409-1 stopRequestedInDirection_#t~ret75 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~6 := stopRequestedInDirection_#t~ret75;havoc stopRequestedInDirection_#t~ret75; 51046#L1676 assume 0 != stopRequestedInDirection_~tmp___0~6;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 51047#L1124-1 stopRequestedInDirection_#t~ret76 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~20 := stopRequestedInDirection_#t~ret76;havoc stopRequestedInDirection_#t~ret76;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~20 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~14 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~14; 44454#L1689 timeShift_#t~ret104 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret104;havoc timeShift_#t~ret104; 42776#L2045 assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret78, continueInDirection_~dir, continueInDirection_~tmp~21;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~21;~currentHeading~0 := continueInDirection_~dir; 42778#L1733 assume !(1 == ~currentHeading~0); 42115#L1743 assume !(0 == ~currentFloorID~0); 42084#L1743-2 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 42061#L1749-5 havoc __utac_acc__Specification9_spec__3_#t~ret156, __utac_acc__Specification9_spec__3_#t~ret157, __utac_acc__Specification9_spec__3_#t~ret158, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~27, __utac_acc__Specification9_spec__3_~tmp___0~12, __utac_acc__Specification9_spec__3_~tmp___1~8;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~27;havoc __utac_acc__Specification9_spec__3_~tmp___0~12;havoc __utac_acc__Specification9_spec__3_~tmp___1~8;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 51192#L1124-3 __utac_acc__Specification9_spec__3_#t~ret156 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~27 := __utac_acc__Specification9_spec__3_#t~ret156;havoc __utac_acc__Specification9_spec__3_#t~ret156;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~27;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~10;havoc isEmpty_~retValue_acc~10; 51189#L1184-6 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~10 := 0;isEmpty_#res := isEmpty_~retValue_acc~10; 51185#L1216-6 __utac_acc__Specification9_spec__3_#t~ret157 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~8 := __utac_acc__Specification9_spec__3_#t~ret157;havoc __utac_acc__Specification9_spec__3_#t~ret157; 51175#L3162 assume 0 != __utac_acc__Specification9_spec__3_~tmp___1~8;~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; 49082#L3172-1 cleanup_~i~2 := 0; 49081#L651-2 [2019-01-01 23:25:05,832 INFO L796 eck$LassoCheckResult]: Loop: 49081#L651-2 assume !false; 49071#L652 cleanup_~__cil_tmp4~2 := ~cleanupTimeShifts~0 - 1; 49072#L655 assume cleanup_~i~2 < cleanup_~__cil_tmp4~2;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~5;havoc isBlocked_~retValue_acc~5;isBlocked_~retValue_acc~5 := 0;isBlocked_#res := isBlocked_~retValue_acc~5; 49067#L946 cleanup_#t~ret48 := isBlocked_#res;cleanup_~tmp___0~2 := cleanup_#t~ret48;havoc cleanup_#t~ret48; 49068#L659 assume 1 != cleanup_~tmp___0~2; 49063#L659-1 havoc isIdle_#res;havoc isIdle_#t~ret63, isIdle_~retValue_acc~12, isIdle_~tmp~18;havoc isIdle_~retValue_acc~12;havoc isIdle_~tmp~18;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret58, anyStopRequested_#t~ret59, anyStopRequested_#t~ret60, anyStopRequested_#t~ret61, anyStopRequested_#t~ret62, anyStopRequested_~retValue_acc~11, anyStopRequested_~tmp~17, anyStopRequested_~tmp___0~4, anyStopRequested_~tmp___1~3, anyStopRequested_~tmp___2~1, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~11;havoc anyStopRequested_~tmp~17;havoc anyStopRequested_~tmp___0~4;havoc anyStopRequested_~tmp___1~3;havoc anyStopRequested_~tmp___2~1;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 49064#L2505-25 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 42574#L2532-25 anyStopRequested_#t~ret58 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret58;havoc anyStopRequested_#t~ret58; 42575#L1232 assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~11 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~11; 42807#L1296 isIdle_#t~ret63 := anyStopRequested_#res;isIdle_~tmp~18 := isIdle_#t~ret63;havoc isIdle_#t~ret63;isIdle_~retValue_acc~12 := (if 0 == isIdle_~tmp~18 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~12; 42808#L1309 cleanup_#t~ret49 := isIdle_#res;cleanup_~tmp~11 := cleanup_#t~ret49;havoc cleanup_#t~ret49; 45106#L671 assume !(0 != cleanup_~tmp~11);havoc timeShift_#t~ret97, timeShift_#t~ret98, timeShift_#t~ret99, timeShift_#t~ret100, timeShift_#t~ret101, timeShift_#t~ret102, timeShift_#t~ret103, timeShift_#t~ret104, timeShift_#t~ret105, timeShift_#t~ret106, timeShift_#t~ret107, timeShift_~tmp~25, timeShift_~tmp___0~10, timeShift_~tmp___1~6, timeShift_~tmp___2~4, 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~25;havoc timeShift_~tmp___0~10;havoc timeShift_~tmp___1~6;havoc timeShift_~tmp___2~4;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~ret81, stopRequestedAtCurrentFloor_#t~ret82, stopRequestedAtCurrentFloor_#t~ret83, stopRequestedAtCurrentFloor_#t~ret84, stopRequestedAtCurrentFloor_~retValue_acc~17, stopRequestedAtCurrentFloor_~tmp~23, stopRequestedAtCurrentFloor_~tmp___0~8;havoc stopRequestedAtCurrentFloor_~retValue_acc~17;havoc stopRequestedAtCurrentFloor_~tmp~23;havoc stopRequestedAtCurrentFloor_~tmp___0~8;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 45107#L2505-30 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 46980#L2532-30 isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 45090#L2409-3 stopRequestedAtCurrentFloor_#t~ret81 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~23 := stopRequestedAtCurrentFloor_#t~ret81;havoc stopRequestedAtCurrentFloor_#t~ret81; 45091#L1793-1 assume 0 != stopRequestedAtCurrentFloor_~tmp~23;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 45006#L1124-4 stopRequestedAtCurrentFloor_#t~ret82 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~8 := stopRequestedAtCurrentFloor_#t~ret82;havoc stopRequestedAtCurrentFloor_#t~ret82; 45007#L1797-1 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~8);stopRequestedAtCurrentFloor_~retValue_acc~17 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~17; 50630#L1810-1 timeShift_#t~ret97 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret97;havoc timeShift_#t~ret97; 50631#L1946-1 assume !(0 != timeShift_~tmp___9~2); 51152#L2037-3 assume 1 == ~doorState~0;~doorState~0 := 0; 51151#L2037-5 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret75, stopRequestedInDirection_#t~ret76, stopRequestedInDirection_#t~ret77, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~14, stopRequestedInDirection_~tmp~20, stopRequestedInDirection_~tmp___0~6, stopRequestedInDirection_~__cil_tmp7~5, stopRequestedInDirection_~__cil_tmp8~5;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~14;havoc stopRequestedInDirection_~tmp~20;havoc stopRequestedInDirection_~tmp___0~6;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 51150#L2505-33 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 51149#L2532-33 isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 51148#L2409-4 stopRequestedInDirection_#t~ret75 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~6 := stopRequestedInDirection_#t~ret75;havoc stopRequestedInDirection_#t~ret75; 51146#L1676-2 assume 0 != stopRequestedInDirection_~tmp___0~6;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 51144#L1124-5 stopRequestedInDirection_#t~ret76 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~20 := stopRequestedInDirection_#t~ret76;havoc stopRequestedInDirection_#t~ret76;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~20 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~14 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~14; 51143#L1689-2 timeShift_#t~ret104 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret104;havoc timeShift_#t~ret104; 42780#L2045-1 assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret78, continueInDirection_~dir, continueInDirection_~tmp~21;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~21;~currentHeading~0 := continueInDirection_~dir; 42782#L1733-3 assume !(1 == ~currentHeading~0); 42067#L1743-9 assume !(0 == ~currentFloorID~0); 42045#L1743-11 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 42039#L1749-11 havoc __utac_acc__Specification9_spec__3_#t~ret156, __utac_acc__Specification9_spec__3_#t~ret157, __utac_acc__Specification9_spec__3_#t~ret158, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~27, __utac_acc__Specification9_spec__3_~tmp___0~12, __utac_acc__Specification9_spec__3_~tmp___1~8;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~27;havoc __utac_acc__Specification9_spec__3_~tmp___0~12;havoc __utac_acc__Specification9_spec__3_~tmp___1~8;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 51211#L1124-7 __utac_acc__Specification9_spec__3_#t~ret156 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~27 := __utac_acc__Specification9_spec__3_#t~ret156;havoc __utac_acc__Specification9_spec__3_#t~ret156;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~27;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~10;havoc isEmpty_~retValue_acc~10; 51210#L1184-13 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~10 := 0;isEmpty_#res := isEmpty_~retValue_acc~10; 51204#L1216-13 __utac_acc__Specification9_spec__3_#t~ret157 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~8 := __utac_acc__Specification9_spec__3_#t~ret157;havoc __utac_acc__Specification9_spec__3_#t~ret157; 51201#L3162-2 assume 0 != __utac_acc__Specification9_spec__3_~tmp___1~8;~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; 49080#L3172-3 cleanup_~i~2 := 1 + cleanup_~i~2; 49081#L651-2 [2019-01-01 23:25:05,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:25:05,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1322374021, now seen corresponding path program 2 times [2019-01-01 23:25:05,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:25:05,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:25:05,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:25:05,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:25:05,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:25:05,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:25:05,950 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:05,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:25:05,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:25:05,951 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:25:05,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:25:05,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1372899157, now seen corresponding path program 1 times [2019-01-01 23:25:05,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:25:05,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:25:05,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:25:05,956 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:25:05,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:25:05,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:25:06,095 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:06,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:25:06,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 23:25:06,097 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:25:06,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 23:25:06,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 23:25:06,098 INFO L87 Difference]: Start difference. First operand 11248 states and 21079 transitions. cyclomatic complexity: 9833 Second operand 4 states. [2019-01-01 23:25:07,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:25:07,111 INFO L93 Difference]: Finished difference Result 33404 states and 62704 transitions. [2019-01-01 23:25:07,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 23:25:07,112 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33404 states and 62704 transitions. [2019-01-01 23:25:07,260 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 27126 [2019-01-01 23:25:07,421 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33404 states to 33404 states and 62704 transitions. [2019-01-01 23:25:07,422 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33404 [2019-01-01 23:25:07,463 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33404 [2019-01-01 23:25:07,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33404 states and 62704 transitions. [2019-01-01 23:25:07,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:25:07,509 INFO L705 BuchiCegarLoop]: Abstraction has 33404 states and 62704 transitions. [2019-01-01 23:25:07,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33404 states and 62704 transitions. [2019-01-01 23:25:07,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33404 to 11270. [2019-01-01 23:25:07,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11270 states. [2019-01-01 23:25:07,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11270 states to 11270 states and 21101 transitions. [2019-01-01 23:25:07,825 INFO L728 BuchiCegarLoop]: Abstraction has 11270 states and 21101 transitions. [2019-01-01 23:25:07,825 INFO L608 BuchiCegarLoop]: Abstraction has 11270 states and 21101 transitions. [2019-01-01 23:25:07,825 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 23:25:07,825 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11270 states and 21101 transitions. [2019-01-01 23:25:07,860 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7534 [2019-01-01 23:25:07,861 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:25:07,861 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:25:07,864 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:07,865 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:07,865 INFO L794 eck$LassoCheckResult]: Stem: 87307#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(30);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(9);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(21);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(30);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(9);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(21);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(30);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(9);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(25);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(30);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(9);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(25);~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~cleanupTimeShifts~0 := 12;~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~string108.base, #t~string108.offset := #Ultimate.allocOnStack(10);call #t~string110.base, #t~string110.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string110.base, #t~string110.offset, 1);call write~init~int(95, #t~string110.base, 1 + #t~string110.offset, 1);call write~init~int(93, #t~string110.base, 2 + #t~string110.offset, 1);call write~init~int(0, #t~string110.base, 3 + #t~string110.offset, 1);call #t~string112.base, #t~string112.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string112.base, #t~string112.offset, 1);call write~init~int(93, #t~string112.base, 1 + #t~string112.offset, 1);call write~init~int(32, #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(5);call write~init~int(32, #t~string114.base, #t~string114.offset, 1);call write~init~int(97, #t~string114.base, 1 + #t~string114.offset, 1);call write~init~int(116, #t~string114.base, 2 + #t~string114.offset, 1);call write~init~int(32, #t~string114.base, 3 + #t~string114.offset, 1);call write~init~int(0, #t~string114.base, 4 + #t~string114.offset, 1);call #t~string116.base, #t~string116.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string116.base, #t~string116.offset, 1);call write~init~int(105, #t~string116.base, 1 + #t~string116.offset, 1);call write~init~int(0, #t~string116.base, 2 + #t~string116.offset, 1);call #t~string118.base, #t~string118.offset := #Ultimate.allocOnStack(10);call #t~string120.base, #t~string120.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string120.base, #t~string120.offset, 1);call write~init~int(112, #t~string120.base, 1 + #t~string120.offset, 1);call write~init~int(0, #t~string120.base, 2 + #t~string120.offset, 1);call #t~string122.base, #t~string122.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string122.base, #t~string122.offset, 1);call write~init~int(111, #t~string122.base, 1 + #t~string122.offset, 1);call write~init~int(119, #t~string122.base, 2 + #t~string122.offset, 1);call write~init~int(110, #t~string122.base, 3 + #t~string122.offset, 1);call write~init~int(0, #t~string122.base, 4 + #t~string122.offset, 1);call #t~string124.base, #t~string124.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string124.base, #t~string124.offset, 1);call write~init~int(73, #t~string124.base, 1 + #t~string124.offset, 1);call write~init~int(76, #t~string124.base, 2 + #t~string124.offset, 1);call write~init~int(95, #t~string124.base, 3 + #t~string124.offset, 1);call write~init~int(112, #t~string124.base, 4 + #t~string124.offset, 1);call write~init~int(58, #t~string124.base, 5 + #t~string124.offset, 1);call write~init~int(0, #t~string124.base, 6 + #t~string124.offset, 1);call #t~string126.base, #t~string126.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string126.base, #t~string126.offset, 1);call write~init~int(37, #t~string126.base, 1 + #t~string126.offset, 1);call write~init~int(105, #t~string126.base, 2 + #t~string126.offset, 1);call write~init~int(0, #t~string126.base, 3 + #t~string126.offset, 1);call #t~string128.base, #t~string128.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string128.base, #t~string128.offset, 1);call write~init~int(37, #t~string128.base, 1 + #t~string128.offset, 1);call write~init~int(105, #t~string128.base, 2 + #t~string128.offset, 1);call write~init~int(0, #t~string128.base, 3 + #t~string128.offset, 1);call #t~string130.base, #t~string130.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string130.base, #t~string130.offset, 1);call write~init~int(37, #t~string130.base, 1 + #t~string130.offset, 1);call write~init~int(105, #t~string130.base, 2 + #t~string130.offset, 1);call write~init~int(0, #t~string130.base, 3 + #t~string130.offset, 1);call #t~string132.base, #t~string132.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string132.base, #t~string132.offset, 1);call write~init~int(37, #t~string132.base, 1 + #t~string132.offset, 1);call write~init~int(105, #t~string132.base, 2 + #t~string132.offset, 1);call write~init~int(0, #t~string132.base, 3 + #t~string132.offset, 1);call #t~string134.base, #t~string134.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string134.base, #t~string134.offset, 1);call write~init~int(37, #t~string134.base, 1 + #t~string134.offset, 1);call write~init~int(105, #t~string134.base, 2 + #t~string134.offset, 1);call write~init~int(0, #t~string134.base, 3 + #t~string134.offset, 1);call #t~string136.base, #t~string136.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string136.base, #t~string136.offset, 1);call write~init~int(70, #t~string136.base, 1 + #t~string136.offset, 1);call write~init~int(95, #t~string136.base, 2 + #t~string136.offset, 1);call write~init~int(112, #t~string136.base, 3 + #t~string136.offset, 1);call write~init~int(58, #t~string136.base, 4 + #t~string136.offset, 1);call write~init~int(0, #t~string136.base, 5 + #t~string136.offset, 1);call #t~string139.base, #t~string139.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string139.base, #t~string139.offset, 1);call write~init~int(37, #t~string139.base, 1 + #t~string139.offset, 1);call write~init~int(105, #t~string139.base, 2 + #t~string139.offset, 1);call write~init~int(0, #t~string139.base, 3 + #t~string139.offset, 1);call #t~string142.base, #t~string142.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string142.base, #t~string142.offset, 1);call write~init~int(37, #t~string142.base, 1 + #t~string142.offset, 1);call write~init~int(105, #t~string142.base, 2 + #t~string142.offset, 1);call write~init~int(0, #t~string142.base, 3 + #t~string142.offset, 1);call #t~string145.base, #t~string145.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string145.base, #t~string145.offset, 1);call write~init~int(37, #t~string145.base, 1 + #t~string145.offset, 1);call write~init~int(105, #t~string145.base, 2 + #t~string145.offset, 1);call write~init~int(0, #t~string145.base, 3 + #t~string145.offset, 1);call #t~string148.base, #t~string148.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string148.base, #t~string148.offset, 1);call write~init~int(37, #t~string148.base, 1 + #t~string148.offset, 1);call write~init~int(105, #t~string148.base, 2 + #t~string148.offset, 1);call write~init~int(0, #t~string148.base, 3 + #t~string148.offset, 1);call #t~string151.base, #t~string151.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string151.base, #t~string151.offset, 1);call write~init~int(37, #t~string151.base, 1 + #t~string151.offset, 1);call write~init~int(105, #t~string151.base, 2 + #t~string151.offset, 1);call write~init~int(0, #t~string151.base, 3 + #t~string151.offset, 1);call #t~string153.base, #t~string153.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string153.base, #t~string153.offset, 1);call write~init~int(0, #t~string153.base, 1 + #t~string153.offset, 1);~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; 87308#L-1 havoc main_#res;havoc main_#t~ret54, main_~retValue_acc~4, main_~tmp~13;havoc main_~retValue_acc~4;havoc main_~tmp~13; 86847#L3286 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; 86848#L3294 main_#t~ret54 := valid_product_#res;main_~tmp~13 := main_#t~ret54;havoc main_#t~ret54; 88013#L850 assume 0 != main_~tmp~13; 86681#L819 ~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; 86682#L3119 havoc bigMacCall_#t~ret47, bigMacCall_~tmp~10;havoc bigMacCall_~tmp~10;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~28;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~28; 87628#L3342 assume 0 == getOrigin_~person;getOrigin_~retValue_acc~28 := 4;getOrigin_#res := getOrigin_~retValue_acc~28; 87210#L3367 bigMacCall_#t~ret47 := getOrigin_#res;bigMacCall_~tmp~10 := bigMacCall_#t~ret47;havoc bigMacCall_#t~ret47;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~10;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 87211#L2776 assume 0 == initPersonOnFloor_~floor; 88577#L2777 assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 86773#L2884-1 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 87356#L2568 assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 86717#L2580-2 havoc cleanup_#t~ret48, cleanup_#t~ret49, cleanup_~i~2, cleanup_~tmp~11, cleanup_~tmp___0~2, cleanup_~__cil_tmp4~2;havoc cleanup_~i~2;havoc cleanup_~tmp~11;havoc cleanup_~tmp___0~2;havoc cleanup_~__cil_tmp4~2;havoc timeShift_#t~ret97, timeShift_#t~ret98, timeShift_#t~ret99, timeShift_#t~ret100, timeShift_#t~ret101, timeShift_#t~ret102, timeShift_#t~ret103, timeShift_#t~ret104, timeShift_#t~ret105, timeShift_#t~ret106, timeShift_#t~ret107, timeShift_~tmp~25, timeShift_~tmp___0~10, timeShift_~tmp___1~6, timeShift_~tmp___2~4, 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~25;havoc timeShift_~tmp___0~10;havoc timeShift_~tmp___1~6;havoc timeShift_~tmp___2~4;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~ret81, stopRequestedAtCurrentFloor_#t~ret82, stopRequestedAtCurrentFloor_#t~ret83, stopRequestedAtCurrentFloor_#t~ret84, stopRequestedAtCurrentFloor_~retValue_acc~17, stopRequestedAtCurrentFloor_~tmp~23, stopRequestedAtCurrentFloor_~tmp___0~8;havoc stopRequestedAtCurrentFloor_~retValue_acc~17;havoc stopRequestedAtCurrentFloor_~tmp~23;havoc stopRequestedAtCurrentFloor_~tmp___0~8;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 86728#L2505 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 87325#L2532 isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 87326#L2409 stopRequestedAtCurrentFloor_#t~ret81 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~23 := stopRequestedAtCurrentFloor_#t~ret81;havoc stopRequestedAtCurrentFloor_#t~ret81; 88059#L1793 assume 0 != stopRequestedAtCurrentFloor_~tmp~23;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 86906#L1124 stopRequestedAtCurrentFloor_#t~ret82 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~8 := stopRequestedAtCurrentFloor_#t~ret82;havoc stopRequestedAtCurrentFloor_#t~ret82; 86907#L1797 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~8);stopRequestedAtCurrentFloor_~retValue_acc~17 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~17; 88005#L1810 timeShift_#t~ret97 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret97;havoc timeShift_#t~ret97; 89619#L1946 assume !(0 != timeShift_~tmp___9~2); 89621#L2037 assume !(1 == ~doorState~0); 89481#L2037-2 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret75, stopRequestedInDirection_#t~ret76, stopRequestedInDirection_#t~ret77, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~14, stopRequestedInDirection_~tmp~20, stopRequestedInDirection_~tmp___0~6, stopRequestedInDirection_~__cil_tmp7~5, stopRequestedInDirection_~__cil_tmp8~5;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~14;havoc stopRequestedInDirection_~tmp~20;havoc stopRequestedInDirection_~tmp___0~6;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 89482#L2505-3 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 87332#L2532-3 isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 87333#L2409-1 stopRequestedInDirection_#t~ret75 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~6 := stopRequestedInDirection_#t~ret75;havoc stopRequestedInDirection_#t~ret75; 88781#L1676 assume 0 != stopRequestedInDirection_~tmp___0~6;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 86910#L1124-1 stopRequestedInDirection_#t~ret76 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~20 := stopRequestedInDirection_#t~ret76;havoc stopRequestedInDirection_#t~ret76;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~20 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~14 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~14; 86911#L1689 timeShift_#t~ret104 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret104;havoc timeShift_#t~ret104; 87462#L2045 assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret78, continueInDirection_~dir, continueInDirection_~tmp~21;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~21;~currentHeading~0 := continueInDirection_~dir; 87464#L1733 assume !(1 == ~currentHeading~0); 90070#L1743 assume !(0 == ~currentFloorID~0); 90067#L1743-2 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 90058#L1749-5 havoc __utac_acc__Specification9_spec__3_#t~ret156, __utac_acc__Specification9_spec__3_#t~ret157, __utac_acc__Specification9_spec__3_#t~ret158, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~27, __utac_acc__Specification9_spec__3_~tmp___0~12, __utac_acc__Specification9_spec__3_~tmp___1~8;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~27;havoc __utac_acc__Specification9_spec__3_~tmp___0~12;havoc __utac_acc__Specification9_spec__3_~tmp___1~8;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 90054#L1124-3 __utac_acc__Specification9_spec__3_#t~ret156 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~27 := __utac_acc__Specification9_spec__3_#t~ret156;havoc __utac_acc__Specification9_spec__3_#t~ret156;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~27;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~10;havoc isEmpty_~retValue_acc~10; 90055#L1184-6 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~10 := 0;isEmpty_#res := isEmpty_~retValue_acc~10; 90042#L1216-6 __utac_acc__Specification9_spec__3_#t~ret157 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~8 := __utac_acc__Specification9_spec__3_#t~ret157;havoc __utac_acc__Specification9_spec__3_#t~ret157; 91055#L3162 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~8);havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~7;havoc areDoorsOpen_~retValue_acc~7;areDoorsOpen_~retValue_acc~7 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~7; 90029#L1133 __utac_acc__Specification9_spec__3_#t~ret158 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~12 := __utac_acc__Specification9_spec__3_#t~ret158;havoc __utac_acc__Specification9_spec__3_#t~ret158; 90032#L3172 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___0~12); 90024#L3172-1 cleanup_~i~2 := 0; 90022#L651-2 [2019-01-01 23:25:07,865 INFO L796 eck$LassoCheckResult]: Loop: 90022#L651-2 assume !false; 90021#L652 cleanup_~__cil_tmp4~2 := ~cleanupTimeShifts~0 - 1; 90020#L655 assume cleanup_~i~2 < cleanup_~__cil_tmp4~2;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~5;havoc isBlocked_~retValue_acc~5;isBlocked_~retValue_acc~5 := 0;isBlocked_#res := isBlocked_~retValue_acc~5; 90019#L946 cleanup_#t~ret48 := isBlocked_#res;cleanup_~tmp___0~2 := cleanup_#t~ret48;havoc cleanup_#t~ret48; 90018#L659 assume 1 != cleanup_~tmp___0~2; 90013#L659-1 havoc isIdle_#res;havoc isIdle_#t~ret63, isIdle_~retValue_acc~12, isIdle_~tmp~18;havoc isIdle_~retValue_acc~12;havoc isIdle_~tmp~18;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret58, anyStopRequested_#t~ret59, anyStopRequested_#t~ret60, anyStopRequested_#t~ret61, anyStopRequested_#t~ret62, anyStopRequested_~retValue_acc~11, anyStopRequested_~tmp~17, anyStopRequested_~tmp___0~4, anyStopRequested_~tmp___1~3, anyStopRequested_~tmp___2~1, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~11;havoc anyStopRequested_~tmp~17;havoc anyStopRequested_~tmp___0~4;havoc anyStopRequested_~tmp___1~3;havoc anyStopRequested_~tmp___2~1;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 90008#L2505-25 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 89995#L2532-25 anyStopRequested_#t~ret58 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret58;havoc anyStopRequested_#t~ret58; 89985#L1232 assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~11 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~11; 89976#L1296 isIdle_#t~ret63 := anyStopRequested_#res;isIdle_~tmp~18 := isIdle_#t~ret63;havoc isIdle_#t~ret63;isIdle_~retValue_acc~12 := (if 0 == isIdle_~tmp~18 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~12; 89975#L1309 cleanup_#t~ret49 := isIdle_#res;cleanup_~tmp~11 := cleanup_#t~ret49;havoc cleanup_#t~ret49; 89974#L671 assume !(0 != cleanup_~tmp~11);havoc timeShift_#t~ret97, timeShift_#t~ret98, timeShift_#t~ret99, timeShift_#t~ret100, timeShift_#t~ret101, timeShift_#t~ret102, timeShift_#t~ret103, timeShift_#t~ret104, timeShift_#t~ret105, timeShift_#t~ret106, timeShift_#t~ret107, timeShift_~tmp~25, timeShift_~tmp___0~10, timeShift_~tmp___1~6, timeShift_~tmp___2~4, 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~25;havoc timeShift_~tmp___0~10;havoc timeShift_~tmp___1~6;havoc timeShift_~tmp___2~4;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~ret81, stopRequestedAtCurrentFloor_#t~ret82, stopRequestedAtCurrentFloor_#t~ret83, stopRequestedAtCurrentFloor_#t~ret84, stopRequestedAtCurrentFloor_~retValue_acc~17, stopRequestedAtCurrentFloor_~tmp~23, stopRequestedAtCurrentFloor_~tmp___0~8;havoc stopRequestedAtCurrentFloor_~retValue_acc~17;havoc stopRequestedAtCurrentFloor_~tmp~23;havoc stopRequestedAtCurrentFloor_~tmp___0~8;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 89973#L2505-30 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 89966#L2532-30 isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 89972#L2409-3 stopRequestedAtCurrentFloor_#t~ret81 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~23 := stopRequestedAtCurrentFloor_#t~ret81;havoc stopRequestedAtCurrentFloor_#t~ret81; 89970#L1793-1 assume 0 != stopRequestedAtCurrentFloor_~tmp~23;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 89968#L1124-4 stopRequestedAtCurrentFloor_#t~ret82 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~8 := stopRequestedAtCurrentFloor_#t~ret82;havoc stopRequestedAtCurrentFloor_#t~ret82; 89969#L1797-1 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~8);stopRequestedAtCurrentFloor_~retValue_acc~17 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~17; 92205#L1810-1 timeShift_#t~ret97 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret97;havoc timeShift_#t~ret97; 92201#L1946-1 assume !(0 != timeShift_~tmp___9~2); 92161#L2037-3 assume 1 == ~doorState~0;~doorState~0 := 0; 92155#L2037-5 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret75, stopRequestedInDirection_#t~ret76, stopRequestedInDirection_#t~ret77, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~14, stopRequestedInDirection_~tmp~20, stopRequestedInDirection_~tmp___0~6, stopRequestedInDirection_~__cil_tmp7~5, stopRequestedInDirection_~__cil_tmp8~5;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~14;havoc stopRequestedInDirection_~tmp~20;havoc stopRequestedInDirection_~tmp___0~6;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 92153#L2505-33 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 92110#L2532-33 isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 92107#L2409-4 stopRequestedInDirection_#t~ret75 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~6 := stopRequestedInDirection_#t~ret75;havoc stopRequestedInDirection_#t~ret75; 92104#L1676-2 assume 0 != stopRequestedInDirection_~tmp___0~6;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 92011#L1124-5 stopRequestedInDirection_#t~ret76 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~20 := stopRequestedInDirection_#t~ret76;havoc stopRequestedInDirection_#t~ret76;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~20 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~14 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~14; 92009#L1689-2 timeShift_#t~ret104 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret104;havoc timeShift_#t~ret104; 92006#L2045-1 assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret78, continueInDirection_~dir, continueInDirection_~tmp~21;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~21;~currentHeading~0 := continueInDirection_~dir; 92004#L1733-3 assume !(1 == ~currentHeading~0); 92001#L1743-9 assume !(0 == ~currentFloorID~0); 91995#L1743-11 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 91988#L1749-11 havoc __utac_acc__Specification9_spec__3_#t~ret156, __utac_acc__Specification9_spec__3_#t~ret157, __utac_acc__Specification9_spec__3_#t~ret158, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~27, __utac_acc__Specification9_spec__3_~tmp___0~12, __utac_acc__Specification9_spec__3_~tmp___1~8;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~27;havoc __utac_acc__Specification9_spec__3_~tmp___0~12;havoc __utac_acc__Specification9_spec__3_~tmp___1~8;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 92564#L1124-7 __utac_acc__Specification9_spec__3_#t~ret156 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~27 := __utac_acc__Specification9_spec__3_#t~ret156;havoc __utac_acc__Specification9_spec__3_#t~ret156;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~27;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~10;havoc isEmpty_~retValue_acc~10; 91093#L1184-13 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~10 := 0;isEmpty_#res := isEmpty_~retValue_acc~10; 91085#L1216-13 __utac_acc__Specification9_spec__3_#t~ret157 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~8 := __utac_acc__Specification9_spec__3_#t~ret157;havoc __utac_acc__Specification9_spec__3_#t~ret157; 91103#L3162-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~8);havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~7;havoc areDoorsOpen_~retValue_acc~7;areDoorsOpen_~retValue_acc~7 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~7; 91097#L1133-1 __utac_acc__Specification9_spec__3_#t~ret158 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~12 := __utac_acc__Specification9_spec__3_#t~ret158;havoc __utac_acc__Specification9_spec__3_#t~ret158; 91098#L3172-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___0~12); 90023#L3172-3 cleanup_~i~2 := 1 + cleanup_~i~2; 90022#L651-2 [2019-01-01 23:25:07,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:25:07,866 INFO L82 PathProgramCache]: Analyzing trace with hash 509077176, now seen corresponding path program 1 times [2019-01-01 23:25:07,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:25:07,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:25:07,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:25:07,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:25:07,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:25:07,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:25:08,000 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:08,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:25:08,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:25:08,003 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:25:08,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:25:08,003 INFO L82 PathProgramCache]: Analyzing trace with hash -800740888, now seen corresponding path program 1 times [2019-01-01 23:25:08,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:25:08,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:25:08,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:25:08,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:25:08,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:25:08,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:25:08,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:25:09,027 WARN L181 SmtUtils]: Spent 939.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 165 [2019-01-01 23:25:10,355 WARN L181 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 157 DAG size of output: 129 [2019-01-01 23:25:10,369 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:25:10,370 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:25:10,370 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:25:10,370 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:25:10,370 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:25:10,371 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:25:10,371 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:25:10,371 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:25:10,371 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec9_product27_true-unreach-call_true-termination.cil.c_Iteration4_Loop [2019-01-01 23:25:10,371 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:25:10,372 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:25:10,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:10,436 INFO L141 MapEliminator]: 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:10,439 INFO L141 MapEliminator]: 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:10,461 INFO L141 MapEliminator]: 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:10,477 INFO L141 MapEliminator]: 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:10,511 INFO L141 MapEliminator]: 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:10,519 INFO L141 MapEliminator]: 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:10,521 INFO L141 MapEliminator]: 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:10,524 INFO L141 MapEliminator]: 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:10,527 INFO L141 MapEliminator]: 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:10,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:10,532 INFO L141 MapEliminator]: 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:10,540 INFO L141 MapEliminator]: 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:10,577 INFO L141 MapEliminator]: 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:10,643 INFO L141 MapEliminator]: 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:10,672 INFO L141 MapEliminator]: 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:10,686 INFO L141 MapEliminator]: 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:10,714 INFO L141 MapEliminator]: 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:10,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:10,723 INFO L141 MapEliminator]: 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:10,733 INFO L141 MapEliminator]: 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:10,758 INFO L141 MapEliminator]: 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:10,761 INFO L141 MapEliminator]: 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:10,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:10,766 INFO L141 MapEliminator]: 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:10,768 INFO L141 MapEliminator]: 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:10,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:10,777 INFO L141 MapEliminator]: 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:10,779 INFO L141 MapEliminator]: 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:10,799 INFO L141 MapEliminator]: 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:10,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:25:10,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:25:10,806 INFO L141 MapEliminator]: 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:10,808 INFO L141 MapEliminator]: 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:10,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:10,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:10,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:10,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:10,823 INFO L141 MapEliminator]: 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:10,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:25:10,829 INFO L141 MapEliminator]: 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:10,842 INFO L141 MapEliminator]: 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:10,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:10,856 INFO L141 MapEliminator]: 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:10,859 INFO L141 MapEliminator]: 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:10,862 INFO L141 MapEliminator]: 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:10,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:10,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:25:10,891 INFO L141 MapEliminator]: 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:10,898 INFO L141 MapEliminator]: 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:10,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:25:10,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:25:10,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:25:10,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:25:10,921 INFO L141 MapEliminator]: 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:10,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:25:10,926 INFO L141 MapEliminator]: 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:10,954 INFO L141 MapEliminator]: 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:10,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:25:10,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:25:10,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:25:10,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:25:10,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:25:11,168 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2019-01-01 23:25:11,916 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:25:11,917 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:11,930 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:25:11,931 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:25:11,939 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:25:11,939 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 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:11,962 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:25:11,962 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:25:11,966 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:25:11,966 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_#t~ret101=0} Honda state: {ULTIMATE.start_timeShift_#t~ret101=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:11,989 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:25:11,989 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:25:11,993 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:25:11,993 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_#t~ret103=0} Honda state: {ULTIMATE.start_timeShift_#t~ret103=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:25:12,018 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:25:12,018 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:25:12,040 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:25:12,040 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_#t~ret104=0} Honda state: {ULTIMATE.start_timeShift_#t~ret104=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:12,166 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:25:12,167 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 23:25:12,242 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:25:12,242 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:25:12,331 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:25:12,333 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:25:12,333 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:25:12,333 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:25:12,334 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:25:12,334 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:25:12,334 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:25:12,334 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:25:12,334 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:25:12,334 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec9_product27_true-unreach-call_true-termination.cil.c_Iteration4_Loop [2019-01-01 23:25:12,334 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:25:12,334 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:25:12,342 INFO L141 MapEliminator]: 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:12,363 INFO L141 MapEliminator]: 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:12,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:12,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:12,537 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-01 23:25:12,538 INFO L141 MapEliminator]: 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:12,561 INFO L141 MapEliminator]: 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:12,593 INFO L141 MapEliminator]: 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:12,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:12,641 INFO L141 MapEliminator]: 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:12,803 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-01 23:25:12,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:12,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:25:12,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:25:12,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:25:12,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:25:12,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:12,955 INFO L141 MapEliminator]: 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:12,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:25:12,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:12,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:12,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:25:12,990 INFO L141 MapEliminator]: 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:12,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:25:13,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:25:13,009 INFO L141 MapEliminator]: 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:13,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:25:13,014 INFO L141 MapEliminator]: 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:13,016 INFO L141 MapEliminator]: 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:13,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:13,022 INFO L141 MapEliminator]: 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:13,024 INFO L141 MapEliminator]: 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:13,026 INFO L141 MapEliminator]: 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:13,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:13,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:13,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:13,039 INFO L141 MapEliminator]: 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:13,042 INFO L141 MapEliminator]: 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:13,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:25:13,047 INFO L141 MapEliminator]: 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:13,050 INFO L141 MapEliminator]: 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:13,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:13,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:13,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:13,064 INFO L141 MapEliminator]: 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:13,067 INFO L141 MapEliminator]: 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:13,070 INFO L141 MapEliminator]: 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:13,072 INFO L141 MapEliminator]: 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:13,076 INFO L141 MapEliminator]: 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:13,078 INFO L141 MapEliminator]: 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:13,086 INFO L141 MapEliminator]: 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:13,118 INFO L141 MapEliminator]: 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:13,121 INFO L141 MapEliminator]: 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:13,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:13,131 INFO L141 MapEliminator]: 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:13,135 INFO L141 MapEliminator]: 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:13,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:13,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:13,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:13,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:25:13,219 INFO L141 MapEliminator]: 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:13,373 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-01 23:25:13,374 INFO L141 MapEliminator]: 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:13,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:13,429 INFO L141 MapEliminator]: 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:13,461 INFO L141 MapEliminator]: 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:13,708 WARN L181 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-01 23:25:14,153 WARN L181 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2019-01-01 23:25:14,850 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:25:14,856 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:25:14,858 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:14,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:25:14,860 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:25:14,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:25:14,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:25:14,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:25:14,869 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:25:14,869 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:25:14,871 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:25:14,872 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:25:14,872 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:25:14,872 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:25:14,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:25:14,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:25:14,873 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:25:14,873 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:25:14,873 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:25:14,880 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:25:14,881 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:14,881 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:25:14,881 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:25:14,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:25:14,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:25:14,882 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:25:14,882 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:25:14,882 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:25:14,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:25:14,886 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:14,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:25:14,887 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:25:14,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:25:14,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:25:14,887 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:25:14,892 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:25:14,893 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:25:14,895 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:25:14,896 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:14,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:25:14,896 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:25:14,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:25:14,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:25:14,900 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:25:14,900 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:25:14,900 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:25:14,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:25:14,901 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:14,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:25:14,906 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:25:14,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:25:14,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:25:14,907 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:25:14,907 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:25:14,907 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:25:14,908 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:25:14,908 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:14,908 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:25:14,909 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:25:14,909 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:25:14,909 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:25:14,909 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:25:14,909 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:25:14,909 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:25:14,910 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:25:14,910 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:14,914 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:25:14,914 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:25:14,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:25:14,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:25:14,914 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:25:14,915 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:25:14,915 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:25:14,915 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:25:14,916 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:14,916 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:25:14,916 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:25:14,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:25:14,922 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:25:14,922 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:25:14,924 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:25:14,924 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:25:14,935 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:25:14,944 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 23:25:14,944 INFO L444 ModelExtractionUtils]: 9 out of 12 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 23:25:14,951 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:25:14,951 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:25:14,951 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:25:14,952 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~currentFloorID~0) = 1*~currentFloorID~0 Supporting invariants [] [2019-01-01 23:25:14,953 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:25:15,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:25:15,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:25:15,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:25:15,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:25:15,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:25:16,067 WARN L181 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 18 [2019-01-01 23:25:16,191 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:16,196 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 13 loop predicates [2019-01-01 23:25:16,197 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11270 states and 21101 transitions. cyclomatic complexity: 9833 Second operand 15 states. [2019-01-01 23:25:17,109 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-01 23:25:18,088 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-01 23:25:23,801 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 22 [2019-01-01 23:25:29,570 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 20 [2019-01-01 23:25:35,052 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11270 states and 21101 transitions. cyclomatic complexity: 9833. Second operand 15 states. Result 141139 states and 262413 transitions. Complement of second has 168 states. [2019-01-01 23:25:35,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 85 states 1 stem states 82 non-accepting loop states 1 accepting loop states [2019-01-01 23:25:35,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-01 23:25:35,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 35465 transitions. [2019-01-01 23:25:35,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 35465 transitions. Stem has 42 letters. Loop has 40 letters. [2019-01-01 23:25:35,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:25:35,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 35465 transitions. Stem has 82 letters. Loop has 40 letters. [2019-01-01 23:25:35,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:25:35,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 35465 transitions. Stem has 42 letters. Loop has 80 letters. [2019-01-01 23:25:35,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:25:35,097 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 141139 states and 262413 transitions. [2019-01-01 23:25:35,753 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 52250 [2019-01-01 23:25:36,949 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 141139 states to 133363 states and 247753 transitions. [2019-01-01 23:25:36,950 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72191 [2019-01-01 23:25:37,000 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72198 [2019-01-01 23:25:37,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 133363 states and 247753 transitions. [2019-01-01 23:25:37,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:25:37,004 INFO L705 BuchiCegarLoop]: Abstraction has 133363 states and 247753 transitions. [2019-01-01 23:25:37,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133363 states and 247753 transitions. [2019-01-01 23:25:38,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133363 to 32595. [2019-01-01 23:25:38,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32595 states. [2019-01-01 23:25:38,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32595 states to 32595 states and 60791 transitions. [2019-01-01 23:25:38,230 INFO L728 BuchiCegarLoop]: Abstraction has 32595 states and 60791 transitions. [2019-01-01 23:25:38,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:25:38,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:25:38,230 INFO L87 Difference]: Start difference. First operand 32595 states and 60791 transitions. Second operand 3 states. [2019-01-01 23:25:38,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:25:38,530 INFO L93 Difference]: Finished difference Result 32595 states and 60785 transitions. [2019-01-01 23:25:38,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:25:38,532 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32595 states and 60785 transitions. [2019-01-01 23:25:38,692 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 16103 [2019-01-01 23:25:38,819 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32595 states to 32595 states and 60785 transitions. [2019-01-01 23:25:38,819 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21929 [2019-01-01 23:25:38,844 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21929 [2019-01-01 23:25:38,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32595 states and 60785 transitions. [2019-01-01 23:25:38,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:25:38,850 INFO L705 BuchiCegarLoop]: Abstraction has 32595 states and 60785 transitions. [2019-01-01 23:25:38,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32595 states and 60785 transitions. [2019-01-01 23:25:39,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32595 to 32595. [2019-01-01 23:25:39,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32595 states. [2019-01-01 23:25:39,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32595 states to 32595 states and 60785 transitions. [2019-01-01 23:25:39,357 INFO L728 BuchiCegarLoop]: Abstraction has 32595 states and 60785 transitions. [2019-01-01 23:25:39,357 INFO L608 BuchiCegarLoop]: Abstraction has 32595 states and 60785 transitions. [2019-01-01 23:25:39,357 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 23:25:39,357 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32595 states and 60785 transitions. [2019-01-01 23:25:39,457 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 16103 [2019-01-01 23:25:39,457 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:25:39,458 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:25:39,462 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:39,462 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, 1, 1, 1] [2019-01-01 23:25:39,464 INFO L794 eck$LassoCheckResult]: Stem: 305835#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(30);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(9);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(21);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(30);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(9);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(21);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(30);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(9);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(25);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(30);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(9);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(25);~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~cleanupTimeShifts~0 := 12;~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~string108.base, #t~string108.offset := #Ultimate.allocOnStack(10);call #t~string110.base, #t~string110.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string110.base, #t~string110.offset, 1);call write~init~int(95, #t~string110.base, 1 + #t~string110.offset, 1);call write~init~int(93, #t~string110.base, 2 + #t~string110.offset, 1);call write~init~int(0, #t~string110.base, 3 + #t~string110.offset, 1);call #t~string112.base, #t~string112.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string112.base, #t~string112.offset, 1);call write~init~int(93, #t~string112.base, 1 + #t~string112.offset, 1);call write~init~int(32, #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(5);call write~init~int(32, #t~string114.base, #t~string114.offset, 1);call write~init~int(97, #t~string114.base, 1 + #t~string114.offset, 1);call write~init~int(116, #t~string114.base, 2 + #t~string114.offset, 1);call write~init~int(32, #t~string114.base, 3 + #t~string114.offset, 1);call write~init~int(0, #t~string114.base, 4 + #t~string114.offset, 1);call #t~string116.base, #t~string116.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string116.base, #t~string116.offset, 1);call write~init~int(105, #t~string116.base, 1 + #t~string116.offset, 1);call write~init~int(0, #t~string116.base, 2 + #t~string116.offset, 1);call #t~string118.base, #t~string118.offset := #Ultimate.allocOnStack(10);call #t~string120.base, #t~string120.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string120.base, #t~string120.offset, 1);call write~init~int(112, #t~string120.base, 1 + #t~string120.offset, 1);call write~init~int(0, #t~string120.base, 2 + #t~string120.offset, 1);call #t~string122.base, #t~string122.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string122.base, #t~string122.offset, 1);call write~init~int(111, #t~string122.base, 1 + #t~string122.offset, 1);call write~init~int(119, #t~string122.base, 2 + #t~string122.offset, 1);call write~init~int(110, #t~string122.base, 3 + #t~string122.offset, 1);call write~init~int(0, #t~string122.base, 4 + #t~string122.offset, 1);call #t~string124.base, #t~string124.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string124.base, #t~string124.offset, 1);call write~init~int(73, #t~string124.base, 1 + #t~string124.offset, 1);call write~init~int(76, #t~string124.base, 2 + #t~string124.offset, 1);call write~init~int(95, #t~string124.base, 3 + #t~string124.offset, 1);call write~init~int(112, #t~string124.base, 4 + #t~string124.offset, 1);call write~init~int(58, #t~string124.base, 5 + #t~string124.offset, 1);call write~init~int(0, #t~string124.base, 6 + #t~string124.offset, 1);call #t~string126.base, #t~string126.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string126.base, #t~string126.offset, 1);call write~init~int(37, #t~string126.base, 1 + #t~string126.offset, 1);call write~init~int(105, #t~string126.base, 2 + #t~string126.offset, 1);call write~init~int(0, #t~string126.base, 3 + #t~string126.offset, 1);call #t~string128.base, #t~string128.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string128.base, #t~string128.offset, 1);call write~init~int(37, #t~string128.base, 1 + #t~string128.offset, 1);call write~init~int(105, #t~string128.base, 2 + #t~string128.offset, 1);call write~init~int(0, #t~string128.base, 3 + #t~string128.offset, 1);call #t~string130.base, #t~string130.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string130.base, #t~string130.offset, 1);call write~init~int(37, #t~string130.base, 1 + #t~string130.offset, 1);call write~init~int(105, #t~string130.base, 2 + #t~string130.offset, 1);call write~init~int(0, #t~string130.base, 3 + #t~string130.offset, 1);call #t~string132.base, #t~string132.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string132.base, #t~string132.offset, 1);call write~init~int(37, #t~string132.base, 1 + #t~string132.offset, 1);call write~init~int(105, #t~string132.base, 2 + #t~string132.offset, 1);call write~init~int(0, #t~string132.base, 3 + #t~string132.offset, 1);call #t~string134.base, #t~string134.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string134.base, #t~string134.offset, 1);call write~init~int(37, #t~string134.base, 1 + #t~string134.offset, 1);call write~init~int(105, #t~string134.base, 2 + #t~string134.offset, 1);call write~init~int(0, #t~string134.base, 3 + #t~string134.offset, 1);call #t~string136.base, #t~string136.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string136.base, #t~string136.offset, 1);call write~init~int(70, #t~string136.base, 1 + #t~string136.offset, 1);call write~init~int(95, #t~string136.base, 2 + #t~string136.offset, 1);call write~init~int(112, #t~string136.base, 3 + #t~string136.offset, 1);call write~init~int(58, #t~string136.base, 4 + #t~string136.offset, 1);call write~init~int(0, #t~string136.base, 5 + #t~string136.offset, 1);call #t~string139.base, #t~string139.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string139.base, #t~string139.offset, 1);call write~init~int(37, #t~string139.base, 1 + #t~string139.offset, 1);call write~init~int(105, #t~string139.base, 2 + #t~string139.offset, 1);call write~init~int(0, #t~string139.base, 3 + #t~string139.offset, 1);call #t~string142.base, #t~string142.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string142.base, #t~string142.offset, 1);call write~init~int(37, #t~string142.base, 1 + #t~string142.offset, 1);call write~init~int(105, #t~string142.base, 2 + #t~string142.offset, 1);call write~init~int(0, #t~string142.base, 3 + #t~string142.offset, 1);call #t~string145.base, #t~string145.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string145.base, #t~string145.offset, 1);call write~init~int(37, #t~string145.base, 1 + #t~string145.offset, 1);call write~init~int(105, #t~string145.base, 2 + #t~string145.offset, 1);call write~init~int(0, #t~string145.base, 3 + #t~string145.offset, 1);call #t~string148.base, #t~string148.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string148.base, #t~string148.offset, 1);call write~init~int(37, #t~string148.base, 1 + #t~string148.offset, 1);call write~init~int(105, #t~string148.base, 2 + #t~string148.offset, 1);call write~init~int(0, #t~string148.base, 3 + #t~string148.offset, 1);call #t~string151.base, #t~string151.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string151.base, #t~string151.offset, 1);call write~init~int(37, #t~string151.base, 1 + #t~string151.offset, 1);call write~init~int(105, #t~string151.base, 2 + #t~string151.offset, 1);call write~init~int(0, #t~string151.base, 3 + #t~string151.offset, 1);call #t~string153.base, #t~string153.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string153.base, #t~string153.offset, 1);call write~init~int(0, #t~string153.base, 1 + #t~string153.offset, 1);~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; 305836#L-1 havoc main_#res;havoc main_#t~ret54, main_~retValue_acc~4, main_~tmp~13;havoc main_~retValue_acc~4;havoc main_~tmp~13; 305148#L3286 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; 305149#L3294 main_#t~ret54 := valid_product_#res;main_~tmp~13 := main_#t~ret54;havoc main_#t~ret54; 306866#L850 assume 0 != main_~tmp~13; 304886#L819 ~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; 304887#L3119 havoc bigMacCall_#t~ret47, bigMacCall_~tmp~10;havoc bigMacCall_~tmp~10;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~28;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~28; 306296#L3342 assume !(0 == getOrigin_~person); 306297#L3346 assume !(1 == getOrigin_~person); 307992#L3350 assume !(2 == getOrigin_~person); 307993#L3354 assume !(3 == getOrigin_~person); 309141#L3358 assume !(4 == getOrigin_~person); 308644#L3362 assume 5 == getOrigin_~person;getOrigin_~retValue_acc~28 := 1;getOrigin_#res := getOrigin_~retValue_acc~28; 305722#L3367 bigMacCall_#t~ret47 := getOrigin_#res;bigMacCall_~tmp~10 := bigMacCall_#t~ret47;havoc bigMacCall_#t~ret47;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~10;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 305723#L2776 assume 0 == initPersonOnFloor_~floor; 307758#L2777 assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 305026#L2884-1 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 305899#L2568 assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 304941#L2580-2 havoc cleanup_#t~ret48, cleanup_#t~ret49, cleanup_~i~2, cleanup_~tmp~11, cleanup_~tmp___0~2, cleanup_~__cil_tmp4~2;havoc cleanup_~i~2;havoc cleanup_~tmp~11;havoc cleanup_~tmp___0~2;havoc cleanup_~__cil_tmp4~2;havoc timeShift_#t~ret97, timeShift_#t~ret98, timeShift_#t~ret99, timeShift_#t~ret100, timeShift_#t~ret101, timeShift_#t~ret102, timeShift_#t~ret103, timeShift_#t~ret104, timeShift_#t~ret105, timeShift_#t~ret106, timeShift_#t~ret107, timeShift_~tmp~25, timeShift_~tmp___0~10, timeShift_~tmp___1~6, timeShift_~tmp___2~4, 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~25;havoc timeShift_~tmp___0~10;havoc timeShift_~tmp___1~6;havoc timeShift_~tmp___2~4;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~ret81, stopRequestedAtCurrentFloor_#t~ret82, stopRequestedAtCurrentFloor_#t~ret83, stopRequestedAtCurrentFloor_#t~ret84, stopRequestedAtCurrentFloor_~retValue_acc~17, stopRequestedAtCurrentFloor_~tmp~23, stopRequestedAtCurrentFloor_~tmp___0~8;havoc stopRequestedAtCurrentFloor_~retValue_acc~17;havoc stopRequestedAtCurrentFloor_~tmp~23;havoc stopRequestedAtCurrentFloor_~tmp___0~8;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 304947#L2505 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 306316#L2532 isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 309307#L2409 stopRequestedAtCurrentFloor_#t~ret81 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~23 := stopRequestedAtCurrentFloor_#t~ret81;havoc stopRequestedAtCurrentFloor_#t~ret81; 309305#L1793 assume 0 != stopRequestedAtCurrentFloor_~tmp~23;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 309303#L1124 stopRequestedAtCurrentFloor_#t~ret82 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~8 := stopRequestedAtCurrentFloor_#t~ret82;havoc stopRequestedAtCurrentFloor_#t~ret82; 309300#L1797 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~8);stopRequestedAtCurrentFloor_~retValue_acc~17 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~17; 307241#L1810 timeShift_#t~ret97 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret97;havoc timeShift_#t~ret97; 307242#L1946 assume !(0 != timeShift_~tmp___9~2); 309128#L2037 assume !(1 == ~doorState~0); 309094#L2037-2 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret75, stopRequestedInDirection_#t~ret76, stopRequestedInDirection_#t~ret77, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~14, stopRequestedInDirection_~tmp~20, stopRequestedInDirection_~tmp___0~6, stopRequestedInDirection_~__cil_tmp7~5, stopRequestedInDirection_~__cil_tmp8~5;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~14;havoc stopRequestedInDirection_~tmp~20;havoc stopRequestedInDirection_~tmp___0~6;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 309095#L2505-3 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 305871#L2532-3 isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 305872#L2409-1 stopRequestedInDirection_#t~ret75 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~6 := stopRequestedInDirection_#t~ret75;havoc stopRequestedInDirection_#t~ret75; 308058#L1676 assume 0 != stopRequestedInDirection_~tmp___0~6;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 308060#L1124-1 stopRequestedInDirection_#t~ret76 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~20 := stopRequestedInDirection_#t~ret76;havoc stopRequestedInDirection_#t~ret76;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~20 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~14 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~14; 309529#L1689 timeShift_#t~ret104 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret104;havoc timeShift_#t~ret104; 309527#L2045 assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret78, continueInDirection_~dir, continueInDirection_~tmp~21;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~21;~currentHeading~0 := continueInDirection_~dir; 309528#L1733 assume !(1 == ~currentHeading~0); 309629#L1743 assume !(0 == ~currentFloorID~0); 304992#L1743-2 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 304949#L1749-5 havoc __utac_acc__Specification9_spec__3_#t~ret156, __utac_acc__Specification9_spec__3_#t~ret157, __utac_acc__Specification9_spec__3_#t~ret158, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~27, __utac_acc__Specification9_spec__3_~tmp___0~12, __utac_acc__Specification9_spec__3_~tmp___1~8;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~27;havoc __utac_acc__Specification9_spec__3_~tmp___0~12;havoc __utac_acc__Specification9_spec__3_~tmp___1~8;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 315366#L1124-3 __utac_acc__Specification9_spec__3_#t~ret156 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~27 := __utac_acc__Specification9_spec__3_#t~ret156;havoc __utac_acc__Specification9_spec__3_#t~ret156;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~27;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~10;havoc isEmpty_~retValue_acc~10; 315363#L1184-6 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~10 := 0;isEmpty_#res := isEmpty_~retValue_acc~10; 315359#L1216-6 __utac_acc__Specification9_spec__3_#t~ret157 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~8 := __utac_acc__Specification9_spec__3_#t~ret157;havoc __utac_acc__Specification9_spec__3_#t~ret157; 315358#L3162 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~8);havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~7;havoc areDoorsOpen_~retValue_acc~7;areDoorsOpen_~retValue_acc~7 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~7; 315351#L1133 __utac_acc__Specification9_spec__3_#t~ret158 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~12 := __utac_acc__Specification9_spec__3_#t~ret158;havoc __utac_acc__Specification9_spec__3_#t~ret158; 315354#L3172 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___0~12); 307779#L3172-1 cleanup_~i~2 := 0; 307780#L651-2 assume !false; 327863#L652 [2019-01-01 23:25:39,464 INFO L796 eck$LassoCheckResult]: Loop: 327863#L652 cleanup_~__cil_tmp4~2 := ~cleanupTimeShifts~0 - 1; 332276#L655 assume cleanup_~i~2 < cleanup_~__cil_tmp4~2;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~5;havoc isBlocked_~retValue_acc~5;isBlocked_~retValue_acc~5 := 0;isBlocked_#res := isBlocked_~retValue_acc~5; 332275#L946 cleanup_#t~ret48 := isBlocked_#res;cleanup_~tmp___0~2 := cleanup_#t~ret48;havoc cleanup_#t~ret48; 332274#L659 assume 1 != cleanup_~tmp___0~2; 332273#L659-1 havoc isIdle_#res;havoc isIdle_#t~ret63, isIdle_~retValue_acc~12, isIdle_~tmp~18;havoc isIdle_~retValue_acc~12;havoc isIdle_~tmp~18;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret58, anyStopRequested_#t~ret59, anyStopRequested_#t~ret60, anyStopRequested_#t~ret61, anyStopRequested_#t~ret62, anyStopRequested_~retValue_acc~11, anyStopRequested_~tmp~17, anyStopRequested_~tmp___0~4, anyStopRequested_~tmp___1~3, anyStopRequested_~tmp___2~1, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~11;havoc anyStopRequested_~tmp~17;havoc anyStopRequested_~tmp___0~4;havoc anyStopRequested_~tmp___1~3;havoc anyStopRequested_~tmp___2~1;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 332272#L2505-25 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 332271#L2532-25 anyStopRequested_#t~ret58 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret58;havoc anyStopRequested_#t~ret58; 332237#L1232 assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~11 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~11; 332228#L1296 isIdle_#t~ret63 := anyStopRequested_#res;isIdle_~tmp~18 := isIdle_#t~ret63;havoc isIdle_#t~ret63;isIdle_~retValue_acc~12 := (if 0 == isIdle_~tmp~18 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~12; 332227#L1309 cleanup_#t~ret49 := isIdle_#res;cleanup_~tmp~11 := cleanup_#t~ret49;havoc cleanup_#t~ret49; 332226#L671 assume !(0 != cleanup_~tmp~11);havoc timeShift_#t~ret97, timeShift_#t~ret98, timeShift_#t~ret99, timeShift_#t~ret100, timeShift_#t~ret101, timeShift_#t~ret102, timeShift_#t~ret103, timeShift_#t~ret104, timeShift_#t~ret105, timeShift_#t~ret106, timeShift_#t~ret107, timeShift_~tmp~25, timeShift_~tmp___0~10, timeShift_~tmp___1~6, timeShift_~tmp___2~4, 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~25;havoc timeShift_~tmp___0~10;havoc timeShift_~tmp___1~6;havoc timeShift_~tmp___2~4;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~ret81, stopRequestedAtCurrentFloor_#t~ret82, stopRequestedAtCurrentFloor_#t~ret83, stopRequestedAtCurrentFloor_#t~ret84, stopRequestedAtCurrentFloor_~retValue_acc~17, stopRequestedAtCurrentFloor_~tmp~23, stopRequestedAtCurrentFloor_~tmp___0~8;havoc stopRequestedAtCurrentFloor_~retValue_acc~17;havoc stopRequestedAtCurrentFloor_~tmp~23;havoc stopRequestedAtCurrentFloor_~tmp___0~8;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 332225#L2505-30 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 318207#L2532-30 isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 332219#L2409-3 stopRequestedAtCurrentFloor_#t~ret81 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~23 := stopRequestedAtCurrentFloor_#t~ret81;havoc stopRequestedAtCurrentFloor_#t~ret81; 332204#L1793-1 assume 0 != stopRequestedAtCurrentFloor_~tmp~23;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 332202#L1124-4 stopRequestedAtCurrentFloor_#t~ret82 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~8 := stopRequestedAtCurrentFloor_#t~ret82;havoc stopRequestedAtCurrentFloor_#t~ret82; 332173#L1797-1 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~8);stopRequestedAtCurrentFloor_~retValue_acc~17 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~17; 332171#L1810-1 timeShift_#t~ret97 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret97;havoc timeShift_#t~ret97; 332169#L1946-1 assume !(0 != timeShift_~tmp___9~2); 332167#L2037-3 assume 1 == ~doorState~0;~doorState~0 := 0; 332166#L2037-5 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret75, stopRequestedInDirection_#t~ret76, stopRequestedInDirection_#t~ret77, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~14, stopRequestedInDirection_~tmp~20, stopRequestedInDirection_~tmp___0~6, stopRequestedInDirection_~__cil_tmp7~5, stopRequestedInDirection_~__cil_tmp8~5;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~14;havoc stopRequestedInDirection_~tmp~20;havoc stopRequestedInDirection_~tmp___0~6;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 332164#L2505-33 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 332163#L2532-33 isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 332160#L2409-4 stopRequestedInDirection_#t~ret75 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~6 := stopRequestedInDirection_#t~ret75;havoc stopRequestedInDirection_#t~ret75; 332158#L1676-2 assume !(0 != stopRequestedInDirection_~tmp___0~6);stopRequestedInDirection__wrappee__empty_#in~dir, stopRequestedInDirection__wrappee__empty_#in~respectFloorCalls, stopRequestedInDirection__wrappee__empty_#in~respectInLiftCalls := stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls;havoc stopRequestedInDirection__wrappee__empty_#res;havoc stopRequestedInDirection__wrappee__empty_#t~ret64, stopRequestedInDirection__wrappee__empty_#t~ret65, stopRequestedInDirection__wrappee__empty_#t~ret66, stopRequestedInDirection__wrappee__empty_#t~ret67, stopRequestedInDirection__wrappee__empty_#t~ret68, stopRequestedInDirection__wrappee__empty_#t~ret69, stopRequestedInDirection__wrappee__empty_#t~ret70, stopRequestedInDirection__wrappee__empty_#t~ret71, stopRequestedInDirection__wrappee__empty_#t~ret72, stopRequestedInDirection__wrappee__empty_#t~ret73, stopRequestedInDirection__wrappee__empty_#t~ret74, stopRequestedInDirection__wrappee__empty_~dir, stopRequestedInDirection__wrappee__empty_~respectFloorCalls, stopRequestedInDirection__wrappee__empty_~respectInLiftCalls, stopRequestedInDirection__wrappee__empty_~retValue_acc~13, stopRequestedInDirection__wrappee__empty_~tmp~19, stopRequestedInDirection__wrappee__empty_~tmp___0~5, stopRequestedInDirection__wrappee__empty_~tmp___1~4, stopRequestedInDirection__wrappee__empty_~tmp___2~2, stopRequestedInDirection__wrappee__empty_~tmp___3~1, stopRequestedInDirection__wrappee__empty_~tmp___4~0, stopRequestedInDirection__wrappee__empty_~tmp___5~0, stopRequestedInDirection__wrappee__empty_~tmp___6~0, stopRequestedInDirection__wrappee__empty_~tmp___7~0, stopRequestedInDirection__wrappee__empty_~tmp___8~0, stopRequestedInDirection__wrappee__empty_~tmp___9~0;stopRequestedInDirection__wrappee__empty_~dir := stopRequestedInDirection__wrappee__empty_#in~dir;stopRequestedInDirection__wrappee__empty_~respectFloorCalls := stopRequestedInDirection__wrappee__empty_#in~respectFloorCalls;stopRequestedInDirection__wrappee__empty_~respectInLiftCalls := stopRequestedInDirection__wrappee__empty_#in~respectInLiftCalls;havoc stopRequestedInDirection__wrappee__empty_~retValue_acc~13;havoc stopRequestedInDirection__wrappee__empty_~tmp~19;havoc stopRequestedInDirection__wrappee__empty_~tmp___0~5;havoc stopRequestedInDirection__wrappee__empty_~tmp___1~4;havoc stopRequestedInDirection__wrappee__empty_~tmp___2~2;havoc stopRequestedInDirection__wrappee__empty_~tmp___3~1;havoc stopRequestedInDirection__wrappee__empty_~tmp___4~0;havoc stopRequestedInDirection__wrappee__empty_~tmp___5~0;havoc stopRequestedInDirection__wrappee__empty_~tmp___6~0;havoc stopRequestedInDirection__wrappee__empty_~tmp___7~0;havoc stopRequestedInDirection__wrappee__empty_~tmp___8~0;havoc stopRequestedInDirection__wrappee__empty_~tmp___9~0; 332155#L1328-2 assume 1 == stopRequestedInDirection__wrappee__empty_~dir;isTopFloor_#in~floorID := ~currentFloorID~0;havoc isTopFloor_#res;havoc isTopFloor_~floorID, isTopFloor_~retValue_acc~24;isTopFloor_~floorID := isTopFloor_#in~floorID;havoc isTopFloor_~retValue_acc~24;isTopFloor_~retValue_acc~24 := (if 4 == isTopFloor_~floorID then 1 else 0);isTopFloor_#res := isTopFloor_~retValue_acc~24; 332156#L3079-5 stopRequestedInDirection__wrappee__empty_#t~ret64 := isTopFloor_#res;stopRequestedInDirection__wrappee__empty_~tmp~19 := stopRequestedInDirection__wrappee__empty_#t~ret64;havoc stopRequestedInDirection__wrappee__empty_#t~ret64; 332077#L1332-2 assume 0 != stopRequestedInDirection__wrappee__empty_~tmp~19;stopRequestedInDirection__wrappee__empty_~retValue_acc~13 := 0;stopRequestedInDirection__wrappee__empty_#res := stopRequestedInDirection__wrappee__empty_~retValue_acc~13; 305839#L1650-2 stopRequestedInDirection_#t~ret77 := stopRequestedInDirection__wrappee__empty_#res;stopRequestedInDirection_~retValue_acc~14 := stopRequestedInDirection_#t~ret77;havoc stopRequestedInDirection_#t~ret77;stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~14; 332054#L1689-2 timeShift_#t~ret104 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret104;havoc timeShift_#t~ret104; 332052#L2045-1 assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret78, continueInDirection_~dir, continueInDirection_~tmp~21;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~21;~currentHeading~0 := continueInDirection_~dir; 332048#L1733-3 assume !(1 == ~currentHeading~0); 304960#L1743-9 assume !(0 == ~currentFloorID~0); 304923#L1743-11 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 304910#L1749-11 havoc __utac_acc__Specification9_spec__3_#t~ret156, __utac_acc__Specification9_spec__3_#t~ret157, __utac_acc__Specification9_spec__3_#t~ret158, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~27, __utac_acc__Specification9_spec__3_~tmp___0~12, __utac_acc__Specification9_spec__3_~tmp___1~8;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~27;havoc __utac_acc__Specification9_spec__3_~tmp___0~12;havoc __utac_acc__Specification9_spec__3_~tmp___1~8;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 332305#L1124-7 __utac_acc__Specification9_spec__3_#t~ret156 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~27 := __utac_acc__Specification9_spec__3_#t~ret156;havoc __utac_acc__Specification9_spec__3_#t~ret156;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~27;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~10;havoc isEmpty_~retValue_acc~10; 332304#L1184-13 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~10 := 0;isEmpty_#res := isEmpty_~retValue_acc~10; 332299#L1216-13 __utac_acc__Specification9_spec__3_#t~ret157 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~8 := __utac_acc__Specification9_spec__3_#t~ret157;havoc __utac_acc__Specification9_spec__3_#t~ret157; 332307#L3162-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~8);havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~7;havoc areDoorsOpen_~retValue_acc~7;areDoorsOpen_~retValue_acc~7 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~7; 332294#L1133-1 __utac_acc__Specification9_spec__3_#t~ret158 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~12 := __utac_acc__Specification9_spec__3_#t~ret158;havoc __utac_acc__Specification9_spec__3_#t~ret158; 332284#L3172-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___0~12); 332283#L3172-3 cleanup_~i~2 := 1 + cleanup_~i~2; 332282#L651-2 assume !false; 327863#L652 [2019-01-01 23:25:39,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:25:39,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1786296517, now seen corresponding path program 1 times [2019-01-01 23:25:39,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:25:39,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:25:39,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:25:39,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:25:39,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:25:39,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:25:39,869 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:39,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:25:39,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 23:25:39,870 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:25:39,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:25:39,870 INFO L82 PathProgramCache]: Analyzing trace with hash -586911933, now seen corresponding path program 1 times [2019-01-01 23:25:39,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:25:39,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:25:39,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:25:39,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:25:39,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:25:39,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:25:40,442 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:40,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:25:40,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-01 23:25:40,444 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:25:40,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 23:25:40,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-01 23:25:40,444 INFO L87 Difference]: Start difference. First operand 32595 states and 60785 transitions. cyclomatic complexity: 28205 Second operand 8 states. [2019-01-01 23:25:47,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:25:47,445 INFO L93 Difference]: Finished difference Result 415791 states and 779502 transitions. [2019-01-01 23:25:47,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-01 23:25:47,447 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 415791 states and 779502 transitions. [2019-01-01 23:25:56,394 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 202584 [2019-01-01 23:25:57,516 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 415791 states to 415791 states and 779502 transitions. [2019-01-01 23:25:57,517 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 269035 [2019-01-01 23:25:57,694 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 269035 [2019-01-01 23:25:57,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 415791 states and 779502 transitions. [2019-01-01 23:25:57,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:25:57,702 INFO L705 BuchiCegarLoop]: Abstraction has 415791 states and 779502 transitions. [2019-01-01 23:25:57,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415791 states and 779502 transitions. [2019-01-01 23:25:59,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415791 to 61785. [2019-01-01 23:25:59,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61785 states. [2019-01-01 23:25:59,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61785 states to 61785 states and 115156 transitions. [2019-01-01 23:25:59,852 INFO L728 BuchiCegarLoop]: Abstraction has 61785 states and 115156 transitions. [2019-01-01 23:25:59,852 INFO L608 BuchiCegarLoop]: Abstraction has 61785 states and 115156 transitions. [2019-01-01 23:25:59,852 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 23:25:59,852 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61785 states and 115156 transitions. [2019-01-01 23:25:59,981 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 31115 [2019-01-01 23:25:59,981 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:25:59,981 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:25:59,983 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:59,983 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:25:59,984 INFO L794 eck$LassoCheckResult]: Stem: 754306#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(30);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(9);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(21);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(30);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(9);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(21);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(30);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(9);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(25);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(30);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(9);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(25);~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~cleanupTimeShifts~0 := 12;~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~string108.base, #t~string108.offset := #Ultimate.allocOnStack(10);call #t~string110.base, #t~string110.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string110.base, #t~string110.offset, 1);call write~init~int(95, #t~string110.base, 1 + #t~string110.offset, 1);call write~init~int(93, #t~string110.base, 2 + #t~string110.offset, 1);call write~init~int(0, #t~string110.base, 3 + #t~string110.offset, 1);call #t~string112.base, #t~string112.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string112.base, #t~string112.offset, 1);call write~init~int(93, #t~string112.base, 1 + #t~string112.offset, 1);call write~init~int(32, #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(5);call write~init~int(32, #t~string114.base, #t~string114.offset, 1);call write~init~int(97, #t~string114.base, 1 + #t~string114.offset, 1);call write~init~int(116, #t~string114.base, 2 + #t~string114.offset, 1);call write~init~int(32, #t~string114.base, 3 + #t~string114.offset, 1);call write~init~int(0, #t~string114.base, 4 + #t~string114.offset, 1);call #t~string116.base, #t~string116.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string116.base, #t~string116.offset, 1);call write~init~int(105, #t~string116.base, 1 + #t~string116.offset, 1);call write~init~int(0, #t~string116.base, 2 + #t~string116.offset, 1);call #t~string118.base, #t~string118.offset := #Ultimate.allocOnStack(10);call #t~string120.base, #t~string120.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string120.base, #t~string120.offset, 1);call write~init~int(112, #t~string120.base, 1 + #t~string120.offset, 1);call write~init~int(0, #t~string120.base, 2 + #t~string120.offset, 1);call #t~string122.base, #t~string122.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string122.base, #t~string122.offset, 1);call write~init~int(111, #t~string122.base, 1 + #t~string122.offset, 1);call write~init~int(119, #t~string122.base, 2 + #t~string122.offset, 1);call write~init~int(110, #t~string122.base, 3 + #t~string122.offset, 1);call write~init~int(0, #t~string122.base, 4 + #t~string122.offset, 1);call #t~string124.base, #t~string124.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string124.base, #t~string124.offset, 1);call write~init~int(73, #t~string124.base, 1 + #t~string124.offset, 1);call write~init~int(76, #t~string124.base, 2 + #t~string124.offset, 1);call write~init~int(95, #t~string124.base, 3 + #t~string124.offset, 1);call write~init~int(112, #t~string124.base, 4 + #t~string124.offset, 1);call write~init~int(58, #t~string124.base, 5 + #t~string124.offset, 1);call write~init~int(0, #t~string124.base, 6 + #t~string124.offset, 1);call #t~string126.base, #t~string126.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string126.base, #t~string126.offset, 1);call write~init~int(37, #t~string126.base, 1 + #t~string126.offset, 1);call write~init~int(105, #t~string126.base, 2 + #t~string126.offset, 1);call write~init~int(0, #t~string126.base, 3 + #t~string126.offset, 1);call #t~string128.base, #t~string128.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string128.base, #t~string128.offset, 1);call write~init~int(37, #t~string128.base, 1 + #t~string128.offset, 1);call write~init~int(105, #t~string128.base, 2 + #t~string128.offset, 1);call write~init~int(0, #t~string128.base, 3 + #t~string128.offset, 1);call #t~string130.base, #t~string130.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string130.base, #t~string130.offset, 1);call write~init~int(37, #t~string130.base, 1 + #t~string130.offset, 1);call write~init~int(105, #t~string130.base, 2 + #t~string130.offset, 1);call write~init~int(0, #t~string130.base, 3 + #t~string130.offset, 1);call #t~string132.base, #t~string132.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string132.base, #t~string132.offset, 1);call write~init~int(37, #t~string132.base, 1 + #t~string132.offset, 1);call write~init~int(105, #t~string132.base, 2 + #t~string132.offset, 1);call write~init~int(0, #t~string132.base, 3 + #t~string132.offset, 1);call #t~string134.base, #t~string134.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string134.base, #t~string134.offset, 1);call write~init~int(37, #t~string134.base, 1 + #t~string134.offset, 1);call write~init~int(105, #t~string134.base, 2 + #t~string134.offset, 1);call write~init~int(0, #t~string134.base, 3 + #t~string134.offset, 1);call #t~string136.base, #t~string136.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string136.base, #t~string136.offset, 1);call write~init~int(70, #t~string136.base, 1 + #t~string136.offset, 1);call write~init~int(95, #t~string136.base, 2 + #t~string136.offset, 1);call write~init~int(112, #t~string136.base, 3 + #t~string136.offset, 1);call write~init~int(58, #t~string136.base, 4 + #t~string136.offset, 1);call write~init~int(0, #t~string136.base, 5 + #t~string136.offset, 1);call #t~string139.base, #t~string139.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string139.base, #t~string139.offset, 1);call write~init~int(37, #t~string139.base, 1 + #t~string139.offset, 1);call write~init~int(105, #t~string139.base, 2 + #t~string139.offset, 1);call write~init~int(0, #t~string139.base, 3 + #t~string139.offset, 1);call #t~string142.base, #t~string142.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string142.base, #t~string142.offset, 1);call write~init~int(37, #t~string142.base, 1 + #t~string142.offset, 1);call write~init~int(105, #t~string142.base, 2 + #t~string142.offset, 1);call write~init~int(0, #t~string142.base, 3 + #t~string142.offset, 1);call #t~string145.base, #t~string145.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string145.base, #t~string145.offset, 1);call write~init~int(37, #t~string145.base, 1 + #t~string145.offset, 1);call write~init~int(105, #t~string145.base, 2 + #t~string145.offset, 1);call write~init~int(0, #t~string145.base, 3 + #t~string145.offset, 1);call #t~string148.base, #t~string148.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string148.base, #t~string148.offset, 1);call write~init~int(37, #t~string148.base, 1 + #t~string148.offset, 1);call write~init~int(105, #t~string148.base, 2 + #t~string148.offset, 1);call write~init~int(0, #t~string148.base, 3 + #t~string148.offset, 1);call #t~string151.base, #t~string151.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string151.base, #t~string151.offset, 1);call write~init~int(37, #t~string151.base, 1 + #t~string151.offset, 1);call write~init~int(105, #t~string151.base, 2 + #t~string151.offset, 1);call write~init~int(0, #t~string151.base, 3 + #t~string151.offset, 1);call #t~string153.base, #t~string153.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string153.base, #t~string153.offset, 1);call write~init~int(0, #t~string153.base, 1 + #t~string153.offset, 1);~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; 754307#L-1 havoc main_#res;havoc main_#t~ret54, main_~retValue_acc~4, main_~tmp~13;havoc main_~retValue_acc~4;havoc main_~tmp~13; 753627#L3286 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; 753628#L3294 main_#t~ret54 := valid_product_#res;main_~tmp~13 := main_#t~ret54;havoc main_#t~ret54; 755348#L850 assume 0 != main_~tmp~13; 753368#L819 ~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; 753369#L3119 havoc bigMacCall_#t~ret47, bigMacCall_~tmp~10;havoc bigMacCall_~tmp~10;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~28;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~28; 754767#L3342 assume !(0 == getOrigin_~person); 754768#L3346 assume !(1 == getOrigin_~person); 756468#L3350 assume !(2 == getOrigin_~person); 756469#L3354 assume !(3 == getOrigin_~person); 757605#L3358 assume !(4 == getOrigin_~person); 757113#L3362 assume 5 == getOrigin_~person;getOrigin_~retValue_acc~28 := 1;getOrigin_#res := getOrigin_~retValue_acc~28; 754194#L3367 bigMacCall_#t~ret47 := getOrigin_#res;bigMacCall_~tmp~10 := bigMacCall_#t~ret47;havoc bigMacCall_#t~ret47;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~10;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 754195#L2776 assume 0 == initPersonOnFloor_~floor; 756227#L2777 assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 753505#L2884-1 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 754369#L2568 assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 757450#L2580-2 havoc cleanup_#t~ret48, cleanup_#t~ret49, cleanup_~i~2, cleanup_~tmp~11, cleanup_~tmp___0~2, cleanup_~__cil_tmp4~2;havoc cleanup_~i~2;havoc cleanup_~tmp~11;havoc cleanup_~tmp___0~2;havoc cleanup_~__cil_tmp4~2;havoc timeShift_#t~ret97, timeShift_#t~ret98, timeShift_#t~ret99, timeShift_#t~ret100, timeShift_#t~ret101, timeShift_#t~ret102, timeShift_#t~ret103, timeShift_#t~ret104, timeShift_#t~ret105, timeShift_#t~ret106, timeShift_#t~ret107, timeShift_~tmp~25, timeShift_~tmp___0~10, timeShift_~tmp___1~6, timeShift_~tmp___2~4, 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~25;havoc timeShift_~tmp___0~10;havoc timeShift_~tmp___1~6;havoc timeShift_~tmp___2~4;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~ret81, stopRequestedAtCurrentFloor_#t~ret82, stopRequestedAtCurrentFloor_#t~ret83, stopRequestedAtCurrentFloor_#t~ret84, stopRequestedAtCurrentFloor_~retValue_acc~17, stopRequestedAtCurrentFloor_~tmp~23, stopRequestedAtCurrentFloor_~tmp___0~8;havoc stopRequestedAtCurrentFloor_~retValue_acc~17;havoc stopRequestedAtCurrentFloor_~tmp~23;havoc stopRequestedAtCurrentFloor_~tmp___0~8;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 754787#L2505 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 754788#L2532 isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 757831#L2409 stopRequestedAtCurrentFloor_#t~ret81 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~23 := stopRequestedAtCurrentFloor_#t~ret81;havoc stopRequestedAtCurrentFloor_#t~ret81; 757816#L1793 assume 0 != stopRequestedAtCurrentFloor_~tmp~23;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 757817#L1124 stopRequestedAtCurrentFloor_#t~ret82 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~8 := stopRequestedAtCurrentFloor_#t~ret82;havoc stopRequestedAtCurrentFloor_#t~ret82; 757803#L1797 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~8);stopRequestedAtCurrentFloor_~retValue_acc~17 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~17; 757804#L1810 timeShift_#t~ret97 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret97;havoc timeShift_#t~ret97; 758434#L1946 assume !(0 != timeShift_~tmp___9~2); 758433#L2037 assume !(1 == ~doorState~0); 757559#L2037-2 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret75, stopRequestedInDirection_#t~ret76, stopRequestedInDirection_#t~ret77, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~14, stopRequestedInDirection_~tmp~20, stopRequestedInDirection_~tmp___0~6, stopRequestedInDirection_~__cil_tmp7~5, stopRequestedInDirection_~__cil_tmp8~5;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~14;havoc stopRequestedInDirection_~tmp~20;havoc stopRequestedInDirection_~tmp___0~6;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 757560#L2505-3 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 754342#L2532-3 isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 754343#L2409-1 stopRequestedInDirection_#t~ret75 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~6 := stopRequestedInDirection_#t~ret75;havoc stopRequestedInDirection_#t~ret75; 756534#L1676 assume 0 != stopRequestedInDirection_~tmp___0~6;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 756535#L1124-1 stopRequestedInDirection_#t~ret76 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~20 := stopRequestedInDirection_#t~ret76;havoc stopRequestedInDirection_#t~ret76;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~20 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~14 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~14; 757956#L1689 timeShift_#t~ret104 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret104;havoc timeShift_#t~ret104; 757957#L2045 assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret78, continueInDirection_~dir, continueInDirection_~tmp~21;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~21;~currentHeading~0 := continueInDirection_~dir; 758432#L1733 assume !(1 == ~currentHeading~0); 763335#L1743 assume !(0 == ~currentFloorID~0); 763326#L1743-2 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 763316#L1749-5 havoc __utac_acc__Specification9_spec__3_#t~ret156, __utac_acc__Specification9_spec__3_#t~ret157, __utac_acc__Specification9_spec__3_#t~ret158, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~27, __utac_acc__Specification9_spec__3_~tmp___0~12, __utac_acc__Specification9_spec__3_~tmp___1~8;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~27;havoc __utac_acc__Specification9_spec__3_~tmp___0~12;havoc __utac_acc__Specification9_spec__3_~tmp___1~8;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 764854#L1124-3 __utac_acc__Specification9_spec__3_#t~ret156 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~27 := __utac_acc__Specification9_spec__3_#t~ret156;havoc __utac_acc__Specification9_spec__3_#t~ret156;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~27;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~10;havoc isEmpty_~retValue_acc~10; 764851#L1184-6 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~10 := 0;isEmpty_#res := isEmpty_~retValue_acc~10; 764847#L1216-6 __utac_acc__Specification9_spec__3_#t~ret157 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~8 := __utac_acc__Specification9_spec__3_#t~ret157;havoc __utac_acc__Specification9_spec__3_#t~ret157; 764848#L3162 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~8);havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~7;havoc areDoorsOpen_~retValue_acc~7;areDoorsOpen_~retValue_acc~7 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~7; 764836#L1133 __utac_acc__Specification9_spec__3_#t~ret158 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~12 := __utac_acc__Specification9_spec__3_#t~ret158;havoc __utac_acc__Specification9_spec__3_#t~ret158; 764839#L3172 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___0~12); 764831#L3172-1 cleanup_~i~2 := 0; 763287#L651-2 assume !false; 763288#L652 [2019-01-01 23:25:59,984 INFO L796 eck$LassoCheckResult]: Loop: 763288#L652 cleanup_~__cil_tmp4~2 := ~cleanupTimeShifts~0 - 1; 801777#L655 assume cleanup_~i~2 < cleanup_~__cil_tmp4~2;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~5;havoc isBlocked_~retValue_acc~5;isBlocked_~retValue_acc~5 := 0;isBlocked_#res := isBlocked_~retValue_acc~5; 801778#L946 cleanup_#t~ret48 := isBlocked_#res;cleanup_~tmp___0~2 := cleanup_#t~ret48;havoc cleanup_#t~ret48; 801755#L659 assume 1 != cleanup_~tmp___0~2; 756670#L659-1 havoc isIdle_#res;havoc isIdle_#t~ret63, isIdle_~retValue_acc~12, isIdle_~tmp~18;havoc isIdle_~retValue_acc~12;havoc isIdle_~tmp~18;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret58, anyStopRequested_#t~ret59, anyStopRequested_#t~ret60, anyStopRequested_#t~ret61, anyStopRequested_#t~ret62, anyStopRequested_~retValue_acc~11, anyStopRequested_~tmp~17, anyStopRequested_~tmp___0~4, anyStopRequested_~tmp___1~3, anyStopRequested_~tmp___2~1, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~11;havoc anyStopRequested_~tmp~17;havoc anyStopRequested_~tmp___0~4;havoc anyStopRequested_~tmp___1~3;havoc anyStopRequested_~tmp___2~1;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 756671#L2505-25 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 799579#L2532-25 anyStopRequested_#t~ret58 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret58;havoc anyStopRequested_#t~ret58; 799580#L1232 assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~11 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~11; 802115#L1296 isIdle_#t~ret63 := anyStopRequested_#res;isIdle_~tmp~18 := isIdle_#t~ret63;havoc isIdle_#t~ret63;isIdle_~retValue_acc~12 := (if 0 == isIdle_~tmp~18 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~12; 802114#L1309 cleanup_#t~ret49 := isIdle_#res;cleanup_~tmp~11 := cleanup_#t~ret49;havoc cleanup_#t~ret49; 800493#L671 assume !(0 != cleanup_~tmp~11);havoc timeShift_#t~ret97, timeShift_#t~ret98, timeShift_#t~ret99, timeShift_#t~ret100, timeShift_#t~ret101, timeShift_#t~ret102, timeShift_#t~ret103, timeShift_#t~ret104, timeShift_#t~ret105, timeShift_#t~ret106, timeShift_#t~ret107, timeShift_~tmp~25, timeShift_~tmp___0~10, timeShift_~tmp___1~6, timeShift_~tmp___2~4, 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~25;havoc timeShift_~tmp___0~10;havoc timeShift_~tmp___1~6;havoc timeShift_~tmp___2~4;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~ret81, stopRequestedAtCurrentFloor_#t~ret82, stopRequestedAtCurrentFloor_#t~ret83, stopRequestedAtCurrentFloor_#t~ret84, stopRequestedAtCurrentFloor_~retValue_acc~17, stopRequestedAtCurrentFloor_~tmp~23, stopRequestedAtCurrentFloor_~tmp___0~8;havoc stopRequestedAtCurrentFloor_~retValue_acc~17;havoc stopRequestedAtCurrentFloor_~tmp~23;havoc stopRequestedAtCurrentFloor_~tmp___0~8;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 800494#L2505-30 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 786284#L2532-30 isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 802099#L2409-3 stopRequestedAtCurrentFloor_#t~ret81 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~23 := stopRequestedAtCurrentFloor_#t~ret81;havoc stopRequestedAtCurrentFloor_#t~ret81; 800464#L1793-1 assume 0 != stopRequestedAtCurrentFloor_~tmp~23;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 800466#L1124-4 stopRequestedAtCurrentFloor_#t~ret82 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~8 := stopRequestedAtCurrentFloor_#t~ret82;havoc stopRequestedAtCurrentFloor_#t~ret82; 800439#L1797-1 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~8);stopRequestedAtCurrentFloor_~retValue_acc~17 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~17; 800440#L1810-1 timeShift_#t~ret97 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret97;havoc timeShift_#t~ret97; 802062#L1946-1 assume !(0 != timeShift_~tmp___9~2); 802061#L2037-3 assume 1 == ~doorState~0;~doorState~0 := 0; 802050#L2037-5 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret75, stopRequestedInDirection_#t~ret76, stopRequestedInDirection_#t~ret77, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~14, stopRequestedInDirection_~tmp~20, stopRequestedInDirection_~tmp___0~6, stopRequestedInDirection_~__cil_tmp7~5, stopRequestedInDirection_~__cil_tmp8~5;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~14;havoc stopRequestedInDirection_~tmp~20;havoc stopRequestedInDirection_~tmp___0~6;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 802049#L2505-33 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 802048#L2532-33 isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 755454#L2409-4 stopRequestedInDirection_#t~ret75 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~6 := stopRequestedInDirection_#t~ret75;havoc stopRequestedInDirection_#t~ret75; 755455#L1676-2 assume 0 != stopRequestedInDirection_~tmp___0~6;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 756551#L1124-5 stopRequestedInDirection_#t~ret76 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~20 := stopRequestedInDirection_#t~ret76;havoc stopRequestedInDirection_#t~ret76;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~20 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~14 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~14; 799302#L1689-2 timeShift_#t~ret104 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret104;havoc timeShift_#t~ret104; 799293#L2045-1 assume !(0 != timeShift_~tmp___8~2);getReverseHeading_#in~ofHeading := ~currentHeading~0;havoc getReverseHeading_#res;havoc getReverseHeading_~ofHeading, getReverseHeading_~retValue_acc~18;getReverseHeading_~ofHeading := getReverseHeading_#in~ofHeading;havoc getReverseHeading_~retValue_acc~18; 798971#L1819-2 assume 0 == getReverseHeading_~ofHeading;getReverseHeading_~retValue_acc~18 := 1;getReverseHeading_#res := getReverseHeading_~retValue_acc~18; 754610#L1824-2 timeShift_#t~ret105 := getReverseHeading_#res;timeShift_~tmp___6~2 := timeShift_#t~ret105;havoc timeShift_#t~ret105;stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := timeShift_~tmp___6~2, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret75, stopRequestedInDirection_#t~ret76, stopRequestedInDirection_#t~ret77, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~14, stopRequestedInDirection_~tmp~20, stopRequestedInDirection_~tmp___0~6, stopRequestedInDirection_~__cil_tmp7~5, stopRequestedInDirection_~__cil_tmp8~5;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~14;havoc stopRequestedInDirection_~tmp~20;havoc stopRequestedInDirection_~tmp___0~6;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 754611#L2505-44 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 756946#L2532-44 isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 755431#L2409-5 stopRequestedInDirection_#t~ret75 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~6 := stopRequestedInDirection_#t~ret75;havoc stopRequestedInDirection_#t~ret75; 755432#L1676-3 assume 0 != stopRequestedInDirection_~tmp___0~6;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 756476#L1124-6 stopRequestedInDirection_#t~ret76 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~20 := stopRequestedInDirection_#t~ret76;havoc stopRequestedInDirection_#t~ret76;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~20 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~14 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~14; 802043#L1689-3 timeShift_#t~ret106 := stopRequestedInDirection_#res;timeShift_~tmp___7~2 := timeShift_#t~ret106;havoc timeShift_#t~ret106; 802044#L2054-1 assume !(0 != timeShift_~tmp___7~2);continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret78, continueInDirection_~dir, continueInDirection_~tmp~21;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~21;~currentHeading~0 := continueInDirection_~dir; 803898#L1733-5 assume !(1 == ~currentHeading~0); 803896#L1743-15 assume !(0 == ~currentFloorID~0); 803891#L1743-17 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 803860#L1749-11 havoc __utac_acc__Specification9_spec__3_#t~ret156, __utac_acc__Specification9_spec__3_#t~ret157, __utac_acc__Specification9_spec__3_#t~ret158, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~27, __utac_acc__Specification9_spec__3_~tmp___0~12, __utac_acc__Specification9_spec__3_~tmp___1~8;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~27;havoc __utac_acc__Specification9_spec__3_~tmp___0~12;havoc __utac_acc__Specification9_spec__3_~tmp___1~8;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 803850#L1124-7 __utac_acc__Specification9_spec__3_#t~ret156 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~27 := __utac_acc__Specification9_spec__3_#t~ret156;havoc __utac_acc__Specification9_spec__3_#t~ret156;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~27;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~10;havoc isEmpty_~retValue_acc~10; 801859#L1184-13 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~10 := 0;isEmpty_#res := isEmpty_~retValue_acc~10; 801852#L1216-13 __utac_acc__Specification9_spec__3_#t~ret157 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~8 := __utac_acc__Specification9_spec__3_#t~ret157;havoc __utac_acc__Specification9_spec__3_#t~ret157; 801850#L3162-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~8);havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~7;havoc areDoorsOpen_~retValue_acc~7;areDoorsOpen_~retValue_acc~7 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~7; 801814#L1133-1 __utac_acc__Specification9_spec__3_#t~ret158 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~12 := __utac_acc__Specification9_spec__3_#t~ret158;havoc __utac_acc__Specification9_spec__3_#t~ret158; 801803#L3172-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___0~12); 801804#L3172-3 cleanup_~i~2 := 1 + cleanup_~i~2; 801784#L651-2 assume !false; 763288#L652 [2019-01-01 23:25:59,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:25:59,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1786296517, now seen corresponding path program 2 times [2019-01-01 23:25:59,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:25:59,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:25:59,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:25:59,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:25:59,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:26:00,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:26:00,359 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:00,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:26:00,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 23:26:00,360 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:26:00,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:26:00,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1020838168, now seen corresponding path program 1 times [2019-01-01 23:26:00,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:26:00,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:26:00,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:26:00,363 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:26:00,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:26:00,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:26:00,645 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:00,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:26:00,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-01-01 23:26:00,645 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:26:00,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 23:26:00,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 23:26:00,646 INFO L87 Difference]: Start difference. First operand 61785 states and 115156 transitions. cyclomatic complexity: 53386 Second operand 6 states. [2019-01-01 23:26:00,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:26:00,891 INFO L93 Difference]: Finished difference Result 61779 states and 115143 transitions. [2019-01-01 23:26:00,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 23:26:00,893 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61779 states and 115143 transitions. [2019-01-01 23:26:02,199 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 31115 [2019-01-01 23:26:02,366 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61779 states to 61779 states and 115143 transitions. [2019-01-01 23:26:02,366 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41544 [2019-01-01 23:26:02,396 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41544 [2019-01-01 23:26:02,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61779 states and 115143 transitions. [2019-01-01 23:26:02,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:26:02,400 INFO L705 BuchiCegarLoop]: Abstraction has 61779 states and 115143 transitions. [2019-01-01 23:26:02,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61779 states and 115143 transitions. [2019-01-01 23:26:02,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61779 to 61779. [2019-01-01 23:26:02,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61779 states. [2019-01-01 23:26:03,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61779 states to 61779 states and 115143 transitions. [2019-01-01 23:26:03,006 INFO L728 BuchiCegarLoop]: Abstraction has 61779 states and 115143 transitions. [2019-01-01 23:26:03,007 INFO L608 BuchiCegarLoop]: Abstraction has 61779 states and 115143 transitions. [2019-01-01 23:26:03,007 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-01 23:26:03,007 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61779 states and 115143 transitions. [2019-01-01 23:26:03,144 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 31115 [2019-01-01 23:26:03,144 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:26:03,144 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:26:03,147 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, 1] [2019-01-01 23:26:03,147 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:26:03,147 INFO L794 eck$LassoCheckResult]: Stem: 877907#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(30);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(9);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(21);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(30);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(9);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(21);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(30);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(9);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(25);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(30);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(9);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(25);~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~cleanupTimeShifts~0 := 12;~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~string108.base, #t~string108.offset := #Ultimate.allocOnStack(10);call #t~string110.base, #t~string110.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string110.base, #t~string110.offset, 1);call write~init~int(95, #t~string110.base, 1 + #t~string110.offset, 1);call write~init~int(93, #t~string110.base, 2 + #t~string110.offset, 1);call write~init~int(0, #t~string110.base, 3 + #t~string110.offset, 1);call #t~string112.base, #t~string112.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string112.base, #t~string112.offset, 1);call write~init~int(93, #t~string112.base, 1 + #t~string112.offset, 1);call write~init~int(32, #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(5);call write~init~int(32, #t~string114.base, #t~string114.offset, 1);call write~init~int(97, #t~string114.base, 1 + #t~string114.offset, 1);call write~init~int(116, #t~string114.base, 2 + #t~string114.offset, 1);call write~init~int(32, #t~string114.base, 3 + #t~string114.offset, 1);call write~init~int(0, #t~string114.base, 4 + #t~string114.offset, 1);call #t~string116.base, #t~string116.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string116.base, #t~string116.offset, 1);call write~init~int(105, #t~string116.base, 1 + #t~string116.offset, 1);call write~init~int(0, #t~string116.base, 2 + #t~string116.offset, 1);call #t~string118.base, #t~string118.offset := #Ultimate.allocOnStack(10);call #t~string120.base, #t~string120.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string120.base, #t~string120.offset, 1);call write~init~int(112, #t~string120.base, 1 + #t~string120.offset, 1);call write~init~int(0, #t~string120.base, 2 + #t~string120.offset, 1);call #t~string122.base, #t~string122.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string122.base, #t~string122.offset, 1);call write~init~int(111, #t~string122.base, 1 + #t~string122.offset, 1);call write~init~int(119, #t~string122.base, 2 + #t~string122.offset, 1);call write~init~int(110, #t~string122.base, 3 + #t~string122.offset, 1);call write~init~int(0, #t~string122.base, 4 + #t~string122.offset, 1);call #t~string124.base, #t~string124.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string124.base, #t~string124.offset, 1);call write~init~int(73, #t~string124.base, 1 + #t~string124.offset, 1);call write~init~int(76, #t~string124.base, 2 + #t~string124.offset, 1);call write~init~int(95, #t~string124.base, 3 + #t~string124.offset, 1);call write~init~int(112, #t~string124.base, 4 + #t~string124.offset, 1);call write~init~int(58, #t~string124.base, 5 + #t~string124.offset, 1);call write~init~int(0, #t~string124.base, 6 + #t~string124.offset, 1);call #t~string126.base, #t~string126.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string126.base, #t~string126.offset, 1);call write~init~int(37, #t~string126.base, 1 + #t~string126.offset, 1);call write~init~int(105, #t~string126.base, 2 + #t~string126.offset, 1);call write~init~int(0, #t~string126.base, 3 + #t~string126.offset, 1);call #t~string128.base, #t~string128.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string128.base, #t~string128.offset, 1);call write~init~int(37, #t~string128.base, 1 + #t~string128.offset, 1);call write~init~int(105, #t~string128.base, 2 + #t~string128.offset, 1);call write~init~int(0, #t~string128.base, 3 + #t~string128.offset, 1);call #t~string130.base, #t~string130.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string130.base, #t~string130.offset, 1);call write~init~int(37, #t~string130.base, 1 + #t~string130.offset, 1);call write~init~int(105, #t~string130.base, 2 + #t~string130.offset, 1);call write~init~int(0, #t~string130.base, 3 + #t~string130.offset, 1);call #t~string132.base, #t~string132.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string132.base, #t~string132.offset, 1);call write~init~int(37, #t~string132.base, 1 + #t~string132.offset, 1);call write~init~int(105, #t~string132.base, 2 + #t~string132.offset, 1);call write~init~int(0, #t~string132.base, 3 + #t~string132.offset, 1);call #t~string134.base, #t~string134.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string134.base, #t~string134.offset, 1);call write~init~int(37, #t~string134.base, 1 + #t~string134.offset, 1);call write~init~int(105, #t~string134.base, 2 + #t~string134.offset, 1);call write~init~int(0, #t~string134.base, 3 + #t~string134.offset, 1);call #t~string136.base, #t~string136.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string136.base, #t~string136.offset, 1);call write~init~int(70, #t~string136.base, 1 + #t~string136.offset, 1);call write~init~int(95, #t~string136.base, 2 + #t~string136.offset, 1);call write~init~int(112, #t~string136.base, 3 + #t~string136.offset, 1);call write~init~int(58, #t~string136.base, 4 + #t~string136.offset, 1);call write~init~int(0, #t~string136.base, 5 + #t~string136.offset, 1);call #t~string139.base, #t~string139.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string139.base, #t~string139.offset, 1);call write~init~int(37, #t~string139.base, 1 + #t~string139.offset, 1);call write~init~int(105, #t~string139.base, 2 + #t~string139.offset, 1);call write~init~int(0, #t~string139.base, 3 + #t~string139.offset, 1);call #t~string142.base, #t~string142.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string142.base, #t~string142.offset, 1);call write~init~int(37, #t~string142.base, 1 + #t~string142.offset, 1);call write~init~int(105, #t~string142.base, 2 + #t~string142.offset, 1);call write~init~int(0, #t~string142.base, 3 + #t~string142.offset, 1);call #t~string145.base, #t~string145.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string145.base, #t~string145.offset, 1);call write~init~int(37, #t~string145.base, 1 + #t~string145.offset, 1);call write~init~int(105, #t~string145.base, 2 + #t~string145.offset, 1);call write~init~int(0, #t~string145.base, 3 + #t~string145.offset, 1);call #t~string148.base, #t~string148.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string148.base, #t~string148.offset, 1);call write~init~int(37, #t~string148.base, 1 + #t~string148.offset, 1);call write~init~int(105, #t~string148.base, 2 + #t~string148.offset, 1);call write~init~int(0, #t~string148.base, 3 + #t~string148.offset, 1);call #t~string151.base, #t~string151.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string151.base, #t~string151.offset, 1);call write~init~int(37, #t~string151.base, 1 + #t~string151.offset, 1);call write~init~int(105, #t~string151.base, 2 + #t~string151.offset, 1);call write~init~int(0, #t~string151.base, 3 + #t~string151.offset, 1);call #t~string153.base, #t~string153.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string153.base, #t~string153.offset, 1);call write~init~int(0, #t~string153.base, 1 + #t~string153.offset, 1);~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; 877908#L-1 havoc main_#res;havoc main_#t~ret54, main_~retValue_acc~4, main_~tmp~13;havoc main_~retValue_acc~4;havoc main_~tmp~13; 877218#L3286 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; 877219#L3294 main_#t~ret54 := valid_product_#res;main_~tmp~13 := main_#t~ret54;havoc main_#t~ret54; 878947#L850 assume 0 != main_~tmp~13; 876960#L819 ~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; 876961#L3119 havoc bigMacCall_#t~ret47, bigMacCall_~tmp~10;havoc bigMacCall_~tmp~10;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~28;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~28; 878368#L3342 assume !(0 == getOrigin_~person); 878369#L3346 assume !(1 == getOrigin_~person); 880066#L3350 assume !(2 == getOrigin_~person); 880067#L3354 assume !(3 == getOrigin_~person); 881230#L3358 assume !(4 == getOrigin_~person); 880734#L3362 assume 5 == getOrigin_~person;getOrigin_~retValue_acc~28 := 1;getOrigin_#res := getOrigin_~retValue_acc~28; 877791#L3367 bigMacCall_#t~ret47 := getOrigin_#res;bigMacCall_~tmp~10 := bigMacCall_#t~ret47;havoc bigMacCall_#t~ret47;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~10;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 877792#L2776 assume !(0 == initPersonOnFloor_~floor); 879159#L2803 assume 1 == initPersonOnFloor_~floor; 879160#L2804 assume 0 == initPersonOnFloor_~person;~personOnFloor_0_1~0 := 1; 877096#L2884-1 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 877971#L2568 assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 881058#L2580-2 havoc cleanup_#t~ret48, cleanup_#t~ret49, cleanup_~i~2, cleanup_~tmp~11, cleanup_~tmp___0~2, cleanup_~__cil_tmp4~2;havoc cleanup_~i~2;havoc cleanup_~tmp~11;havoc cleanup_~tmp___0~2;havoc cleanup_~__cil_tmp4~2;havoc timeShift_#t~ret97, timeShift_#t~ret98, timeShift_#t~ret99, timeShift_#t~ret100, timeShift_#t~ret101, timeShift_#t~ret102, timeShift_#t~ret103, timeShift_#t~ret104, timeShift_#t~ret105, timeShift_#t~ret106, timeShift_#t~ret107, timeShift_~tmp~25, timeShift_~tmp___0~10, timeShift_~tmp___1~6, timeShift_~tmp___2~4, 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~25;havoc timeShift_~tmp___0~10;havoc timeShift_~tmp___1~6;havoc timeShift_~tmp___2~4;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~ret81, stopRequestedAtCurrentFloor_#t~ret82, stopRequestedAtCurrentFloor_#t~ret83, stopRequestedAtCurrentFloor_#t~ret84, stopRequestedAtCurrentFloor_~retValue_acc~17, stopRequestedAtCurrentFloor_~tmp~23, stopRequestedAtCurrentFloor_~tmp___0~8;havoc stopRequestedAtCurrentFloor_~retValue_acc~17;havoc stopRequestedAtCurrentFloor_~tmp~23;havoc stopRequestedAtCurrentFloor_~tmp___0~8;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 881501#L2505 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 877935#L2532 isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 877936#L2409 stopRequestedAtCurrentFloor_#t~ret81 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~23 := stopRequestedAtCurrentFloor_#t~ret81;havoc stopRequestedAtCurrentFloor_#t~ret81; 879017#L1793 assume 0 != stopRequestedAtCurrentFloor_~tmp~23;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 879018#L1124 stopRequestedAtCurrentFloor_#t~ret82 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~8 := stopRequestedAtCurrentFloor_#t~ret82;havoc stopRequestedAtCurrentFloor_#t~ret82; 881423#L1797 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~8);stopRequestedAtCurrentFloor_~retValue_acc~17 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~17; 879326#L1810 timeShift_#t~ret97 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret97;havoc timeShift_#t~ret97; 879327#L1946 assume !(0 != timeShift_~tmp___9~2); 881217#L2037 assume !(1 == ~doorState~0); 881218#L2037-2 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret75, stopRequestedInDirection_#t~ret76, stopRequestedInDirection_#t~ret77, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~14, stopRequestedInDirection_~tmp~20, stopRequestedInDirection_~tmp___0~6, stopRequestedInDirection_~__cil_tmp7~5, stopRequestedInDirection_~__cil_tmp8~5;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~14;havoc stopRequestedInDirection_~tmp~20;havoc stopRequestedInDirection_~tmp___0~6;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 878405#L2505-3 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 878406#L2532-3 isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 879056#L2409-1 stopRequestedInDirection_#t~ret75 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~6 := stopRequestedInDirection_#t~ret75;havoc stopRequestedInDirection_#t~ret75; 879057#L1676 assume 0 != stopRequestedInDirection_~tmp___0~6;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 877319#L1124-1 stopRequestedInDirection_#t~ret76 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~20 := stopRequestedInDirection_#t~ret76;havoc stopRequestedInDirection_#t~ret76;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~20 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~14 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~14; 877320#L1689 timeShift_#t~ret104 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret104;havoc timeShift_#t~ret104; 878123#L2045 assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret78, continueInDirection_~dir, continueInDirection_~tmp~21;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~21;~currentHeading~0 := continueInDirection_~dir; 878125#L1733 assume !(1 == ~currentHeading~0); 885755#L1743 assume !(0 == ~currentFloorID~0); 885748#L1743-2 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 885726#L1749-5 havoc __utac_acc__Specification9_spec__3_#t~ret156, __utac_acc__Specification9_spec__3_#t~ret157, __utac_acc__Specification9_spec__3_#t~ret158, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~27, __utac_acc__Specification9_spec__3_~tmp___0~12, __utac_acc__Specification9_spec__3_~tmp___1~8;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~27;havoc __utac_acc__Specification9_spec__3_~tmp___0~12;havoc __utac_acc__Specification9_spec__3_~tmp___1~8;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 887399#L1124-3 __utac_acc__Specification9_spec__3_#t~ret156 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~27 := __utac_acc__Specification9_spec__3_#t~ret156;havoc __utac_acc__Specification9_spec__3_#t~ret156;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~27;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~10;havoc isEmpty_~retValue_acc~10; 887394#L1184-6 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~10 := 0;isEmpty_#res := isEmpty_~retValue_acc~10; 887391#L1216-6 __utac_acc__Specification9_spec__3_#t~ret157 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~8 := __utac_acc__Specification9_spec__3_#t~ret157;havoc __utac_acc__Specification9_spec__3_#t~ret157; 887390#L3162 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~8);havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~7;havoc areDoorsOpen_~retValue_acc~7;areDoorsOpen_~retValue_acc~7 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~7; 887381#L1133 __utac_acc__Specification9_spec__3_#t~ret158 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~12 := __utac_acc__Specification9_spec__3_#t~ret158;havoc __utac_acc__Specification9_spec__3_#t~ret158; 887384#L3172 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___0~12); 887376#L3172-1 cleanup_~i~2 := 0; 887336#L651-2 assume !false; 887337#L652 [2019-01-01 23:26:03,147 INFO L796 eck$LassoCheckResult]: Loop: 887337#L652 cleanup_~__cil_tmp4~2 := ~cleanupTimeShifts~0 - 1; 933050#L655 assume cleanup_~i~2 < cleanup_~__cil_tmp4~2;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~5;havoc isBlocked_~retValue_acc~5;isBlocked_~retValue_acc~5 := 0;isBlocked_#res := isBlocked_~retValue_acc~5; 933049#L946 cleanup_#t~ret48 := isBlocked_#res;cleanup_~tmp___0~2 := cleanup_#t~ret48;havoc cleanup_#t~ret48; 933048#L659 assume 1 != cleanup_~tmp___0~2; 933047#L659-1 havoc isIdle_#res;havoc isIdle_#t~ret63, isIdle_~retValue_acc~12, isIdle_~tmp~18;havoc isIdle_~retValue_acc~12;havoc isIdle_~tmp~18;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret58, anyStopRequested_#t~ret59, anyStopRequested_#t~ret60, anyStopRequested_#t~ret61, anyStopRequested_#t~ret62, anyStopRequested_~retValue_acc~11, anyStopRequested_~tmp~17, anyStopRequested_~tmp___0~4, anyStopRequested_~tmp___1~3, anyStopRequested_~tmp___2~1, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~11;havoc anyStopRequested_~tmp~17;havoc anyStopRequested_~tmp___0~4;havoc anyStopRequested_~tmp___1~3;havoc anyStopRequested_~tmp___2~1;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 933046#L2505-25 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 933045#L2532-25 anyStopRequested_#t~ret58 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret58;havoc anyStopRequested_#t~ret58; 933044#L1232 assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~11 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~11; 931100#L1296 isIdle_#t~ret63 := anyStopRequested_#res;isIdle_~tmp~18 := isIdle_#t~ret63;havoc isIdle_#t~ret63;isIdle_~retValue_acc~12 := (if 0 == isIdle_~tmp~18 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~12; 933037#L1309 cleanup_#t~ret49 := isIdle_#res;cleanup_~tmp~11 := cleanup_#t~ret49;havoc cleanup_#t~ret49; 933036#L671 assume !(0 != cleanup_~tmp~11);havoc timeShift_#t~ret97, timeShift_#t~ret98, timeShift_#t~ret99, timeShift_#t~ret100, timeShift_#t~ret101, timeShift_#t~ret102, timeShift_#t~ret103, timeShift_#t~ret104, timeShift_#t~ret105, timeShift_#t~ret106, timeShift_#t~ret107, timeShift_~tmp~25, timeShift_~tmp___0~10, timeShift_~tmp___1~6, timeShift_~tmp___2~4, 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~25;havoc timeShift_~tmp___0~10;havoc timeShift_~tmp___1~6;havoc timeShift_~tmp___2~4;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~ret81, stopRequestedAtCurrentFloor_#t~ret82, stopRequestedAtCurrentFloor_#t~ret83, stopRequestedAtCurrentFloor_#t~ret84, stopRequestedAtCurrentFloor_~retValue_acc~17, stopRequestedAtCurrentFloor_~tmp~23, stopRequestedAtCurrentFloor_~tmp___0~8;havoc stopRequestedAtCurrentFloor_~retValue_acc~17;havoc stopRequestedAtCurrentFloor_~tmp~23;havoc stopRequestedAtCurrentFloor_~tmp___0~8;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 933035#L2505-30 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 910487#L2532-30 isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 933034#L2409-3 stopRequestedAtCurrentFloor_#t~ret81 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~23 := stopRequestedAtCurrentFloor_#t~ret81;havoc stopRequestedAtCurrentFloor_#t~ret81; 933033#L1793-1 assume 0 != stopRequestedAtCurrentFloor_~tmp~23;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 933032#L1124-4 stopRequestedAtCurrentFloor_#t~ret82 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~8 := stopRequestedAtCurrentFloor_#t~ret82;havoc stopRequestedAtCurrentFloor_#t~ret82; 933030#L1797-1 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~8);stopRequestedAtCurrentFloor_~retValue_acc~17 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~17; 933031#L1810-1 timeShift_#t~ret97 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret97;havoc timeShift_#t~ret97; 934518#L1946-1 assume !(0 != timeShift_~tmp___9~2); 934519#L2037-3 assume 1 == ~doorState~0;~doorState~0 := 0; 938292#L2037-5 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret75, stopRequestedInDirection_#t~ret76, stopRequestedInDirection_#t~ret77, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~14, stopRequestedInDirection_~tmp~20, stopRequestedInDirection_~tmp___0~6, stopRequestedInDirection_~__cil_tmp7~5, stopRequestedInDirection_~__cil_tmp8~5;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~14;havoc stopRequestedInDirection_~tmp~20;havoc stopRequestedInDirection_~tmp___0~6;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 938290#L2505-33 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 938288#L2532-33 isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 938286#L2409-4 stopRequestedInDirection_#t~ret75 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~6 := stopRequestedInDirection_#t~ret75;havoc stopRequestedInDirection_#t~ret75; 938284#L1676-2 assume 0 != stopRequestedInDirection_~tmp___0~6;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 938282#L1124-5 stopRequestedInDirection_#t~ret76 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~20 := stopRequestedInDirection_#t~ret76;havoc stopRequestedInDirection_#t~ret76;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~20 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~14 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~14; 938280#L1689-2 timeShift_#t~ret104 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret104;havoc timeShift_#t~ret104; 938278#L2045-1 assume !(0 != timeShift_~tmp___8~2);getReverseHeading_#in~ofHeading := ~currentHeading~0;havoc getReverseHeading_#res;havoc getReverseHeading_~ofHeading, getReverseHeading_~retValue_acc~18;getReverseHeading_~ofHeading := getReverseHeading_#in~ofHeading;havoc getReverseHeading_~retValue_acc~18; 938276#L1819-2 assume 0 == getReverseHeading_~ofHeading;getReverseHeading_~retValue_acc~18 := 1;getReverseHeading_#res := getReverseHeading_~retValue_acc~18; 938274#L1824-2 timeShift_#t~ret105 := getReverseHeading_#res;timeShift_~tmp___6~2 := timeShift_#t~ret105;havoc timeShift_#t~ret105;stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := timeShift_~tmp___6~2, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret75, stopRequestedInDirection_#t~ret76, stopRequestedInDirection_#t~ret77, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~14, stopRequestedInDirection_~tmp~20, stopRequestedInDirection_~tmp___0~6, stopRequestedInDirection_~__cil_tmp7~5, stopRequestedInDirection_~__cil_tmp8~5;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~14;havoc stopRequestedInDirection_~tmp~20;havoc stopRequestedInDirection_~tmp___0~6;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 938272#L2505-44 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 915673#L2532-44 isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 938270#L2409-5 stopRequestedInDirection_#t~ret75 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~6 := stopRequestedInDirection_#t~ret75;havoc stopRequestedInDirection_#t~ret75; 938268#L1676-3 assume 0 != stopRequestedInDirection_~tmp___0~6;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 938266#L1124-6 stopRequestedInDirection_#t~ret76 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~20 := stopRequestedInDirection_#t~ret76;havoc stopRequestedInDirection_#t~ret76;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~20 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~14 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~14; 938264#L1689-3 timeShift_#t~ret106 := stopRequestedInDirection_#res;timeShift_~tmp___7~2 := timeShift_#t~ret106;havoc timeShift_#t~ret106; 938261#L2054-1 assume !(0 != timeShift_~tmp___7~2);continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret78, continueInDirection_~dir, continueInDirection_~tmp~21;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~21;~currentHeading~0 := continueInDirection_~dir; 938260#L1733-5 assume !(1 == ~currentHeading~0); 877005#L1743-15 assume !(0 == ~currentFloorID~0); 876983#L1743-17 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 876984#L1749-11 havoc __utac_acc__Specification9_spec__3_#t~ret156, __utac_acc__Specification9_spec__3_#t~ret157, __utac_acc__Specification9_spec__3_#t~ret158, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~27, __utac_acc__Specification9_spec__3_~tmp___0~12, __utac_acc__Specification9_spec__3_~tmp___1~8;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~27;havoc __utac_acc__Specification9_spec__3_~tmp___0~12;havoc __utac_acc__Specification9_spec__3_~tmp___1~8;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 933096#L1124-7 __utac_acc__Specification9_spec__3_#t~ret156 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~27 := __utac_acc__Specification9_spec__3_#t~ret156;havoc __utac_acc__Specification9_spec__3_#t~ret156;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~27;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~10;havoc isEmpty_~retValue_acc~10; 933095#L1184-13 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~10 := 0;isEmpty_#res := isEmpty_~retValue_acc~10; 933089#L1216-13 __utac_acc__Specification9_spec__3_#t~ret157 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~8 := __utac_acc__Specification9_spec__3_#t~ret157;havoc __utac_acc__Specification9_spec__3_#t~ret157; 933094#L3162-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~8);havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~7;havoc areDoorsOpen_~retValue_acc~7;areDoorsOpen_~retValue_acc~7 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~7; 933072#L1133-1 __utac_acc__Specification9_spec__3_#t~ret158 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~12 := __utac_acc__Specification9_spec__3_#t~ret158;havoc __utac_acc__Specification9_spec__3_#t~ret158; 933062#L3172-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___0~12); 933060#L3172-3 cleanup_~i~2 := 1 + cleanup_~i~2; 933058#L651-2 assume !false; 887337#L652 [2019-01-01 23:26:03,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:26:03,148 INFO L82 PathProgramCache]: Analyzing trace with hash -61251997, now seen corresponding path program 1 times [2019-01-01 23:26:03,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:26:03,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:26:03,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:26:03,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:26:03,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:26:03,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:26:03,340 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:03,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:26:03,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 23:26:03,340 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:26:03,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:26:03,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1020838168, now seen corresponding path program 2 times [2019-01-01 23:26:03,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:26:03,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:26:03,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:26:03,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:26:03,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:26:03,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:26:03,989 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-01 23:26:04,287 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,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:26:04,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-01-01 23:26:04,288 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:26:04,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-01 23:26:04,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-01-01 23:26:04,289 INFO L87 Difference]: Start difference. First operand 61779 states and 115143 transitions. cyclomatic complexity: 53379 Second operand 14 states. [2019-01-01 23:26:11,026 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-01-01 23:26:17,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:26:17,048 INFO L93 Difference]: Finished difference Result 465504 states and 865666 transitions. [2019-01-01 23:26:17,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-01-01 23:26:17,049 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 465504 states and 865666 transitions. [2019-01-01 23:26:18,969 INFO L131 ngComponentsAnalysis]: Automaton has 39 accepting balls. 268106 [2019-01-01 23:26:20,391 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 465504 states to 465478 states and 865564 transitions. [2019-01-01 23:26:20,391 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 296236 [2019-01-01 23:26:20,665 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 296236 [2019-01-01 23:26:20,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 465478 states and 865564 transitions. [2019-01-01 23:26:20,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:26:20,667 INFO L705 BuchiCegarLoop]: Abstraction has 465478 states and 865564 transitions. [2019-01-01 23:26:20,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465478 states and 865564 transitions. [2019-01-01 23:26:33,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465478 to 91088. [2019-01-01 23:26:33,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91088 states. [2019-01-01 23:26:33,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91088 states to 91088 states and 169547 transitions. [2019-01-01 23:26:33,861 INFO L728 BuchiCegarLoop]: Abstraction has 91088 states and 169547 transitions. [2019-01-01 23:26:33,861 INFO L608 BuchiCegarLoop]: Abstraction has 91088 states and 169547 transitions. [2019-01-01 23:26:33,861 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-01 23:26:33,861 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91088 states and 169547 transitions. [2019-01-01 23:26:34,061 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 47851 [2019-01-01 23:26:34,061 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:26:34,061 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:26:34,064 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, 1] [2019-01-01 23:26:34,066 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:26:34,066 INFO L794 eck$LassoCheckResult]: Stem: 1405494#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(30);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(9);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(21);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(30);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(9);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(21);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(30);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(9);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(25);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(30);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(9);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(25);~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~cleanupTimeShifts~0 := 12;~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~string108.base, #t~string108.offset := #Ultimate.allocOnStack(10);call #t~string110.base, #t~string110.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string110.base, #t~string110.offset, 1);call write~init~int(95, #t~string110.base, 1 + #t~string110.offset, 1);call write~init~int(93, #t~string110.base, 2 + #t~string110.offset, 1);call write~init~int(0, #t~string110.base, 3 + #t~string110.offset, 1);call #t~string112.base, #t~string112.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string112.base, #t~string112.offset, 1);call write~init~int(93, #t~string112.base, 1 + #t~string112.offset, 1);call write~init~int(32, #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(5);call write~init~int(32, #t~string114.base, #t~string114.offset, 1);call write~init~int(97, #t~string114.base, 1 + #t~string114.offset, 1);call write~init~int(116, #t~string114.base, 2 + #t~string114.offset, 1);call write~init~int(32, #t~string114.base, 3 + #t~string114.offset, 1);call write~init~int(0, #t~string114.base, 4 + #t~string114.offset, 1);call #t~string116.base, #t~string116.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string116.base, #t~string116.offset, 1);call write~init~int(105, #t~string116.base, 1 + #t~string116.offset, 1);call write~init~int(0, #t~string116.base, 2 + #t~string116.offset, 1);call #t~string118.base, #t~string118.offset := #Ultimate.allocOnStack(10);call #t~string120.base, #t~string120.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string120.base, #t~string120.offset, 1);call write~init~int(112, #t~string120.base, 1 + #t~string120.offset, 1);call write~init~int(0, #t~string120.base, 2 + #t~string120.offset, 1);call #t~string122.base, #t~string122.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string122.base, #t~string122.offset, 1);call write~init~int(111, #t~string122.base, 1 + #t~string122.offset, 1);call write~init~int(119, #t~string122.base, 2 + #t~string122.offset, 1);call write~init~int(110, #t~string122.base, 3 + #t~string122.offset, 1);call write~init~int(0, #t~string122.base, 4 + #t~string122.offset, 1);call #t~string124.base, #t~string124.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string124.base, #t~string124.offset, 1);call write~init~int(73, #t~string124.base, 1 + #t~string124.offset, 1);call write~init~int(76, #t~string124.base, 2 + #t~string124.offset, 1);call write~init~int(95, #t~string124.base, 3 + #t~string124.offset, 1);call write~init~int(112, #t~string124.base, 4 + #t~string124.offset, 1);call write~init~int(58, #t~string124.base, 5 + #t~string124.offset, 1);call write~init~int(0, #t~string124.base, 6 + #t~string124.offset, 1);call #t~string126.base, #t~string126.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string126.base, #t~string126.offset, 1);call write~init~int(37, #t~string126.base, 1 + #t~string126.offset, 1);call write~init~int(105, #t~string126.base, 2 + #t~string126.offset, 1);call write~init~int(0, #t~string126.base, 3 + #t~string126.offset, 1);call #t~string128.base, #t~string128.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string128.base, #t~string128.offset, 1);call write~init~int(37, #t~string128.base, 1 + #t~string128.offset, 1);call write~init~int(105, #t~string128.base, 2 + #t~string128.offset, 1);call write~init~int(0, #t~string128.base, 3 + #t~string128.offset, 1);call #t~string130.base, #t~string130.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string130.base, #t~string130.offset, 1);call write~init~int(37, #t~string130.base, 1 + #t~string130.offset, 1);call write~init~int(105, #t~string130.base, 2 + #t~string130.offset, 1);call write~init~int(0, #t~string130.base, 3 + #t~string130.offset, 1);call #t~string132.base, #t~string132.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string132.base, #t~string132.offset, 1);call write~init~int(37, #t~string132.base, 1 + #t~string132.offset, 1);call write~init~int(105, #t~string132.base, 2 + #t~string132.offset, 1);call write~init~int(0, #t~string132.base, 3 + #t~string132.offset, 1);call #t~string134.base, #t~string134.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string134.base, #t~string134.offset, 1);call write~init~int(37, #t~string134.base, 1 + #t~string134.offset, 1);call write~init~int(105, #t~string134.base, 2 + #t~string134.offset, 1);call write~init~int(0, #t~string134.base, 3 + #t~string134.offset, 1);call #t~string136.base, #t~string136.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string136.base, #t~string136.offset, 1);call write~init~int(70, #t~string136.base, 1 + #t~string136.offset, 1);call write~init~int(95, #t~string136.base, 2 + #t~string136.offset, 1);call write~init~int(112, #t~string136.base, 3 + #t~string136.offset, 1);call write~init~int(58, #t~string136.base, 4 + #t~string136.offset, 1);call write~init~int(0, #t~string136.base, 5 + #t~string136.offset, 1);call #t~string139.base, #t~string139.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string139.base, #t~string139.offset, 1);call write~init~int(37, #t~string139.base, 1 + #t~string139.offset, 1);call write~init~int(105, #t~string139.base, 2 + #t~string139.offset, 1);call write~init~int(0, #t~string139.base, 3 + #t~string139.offset, 1);call #t~string142.base, #t~string142.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string142.base, #t~string142.offset, 1);call write~init~int(37, #t~string142.base, 1 + #t~string142.offset, 1);call write~init~int(105, #t~string142.base, 2 + #t~string142.offset, 1);call write~init~int(0, #t~string142.base, 3 + #t~string142.offset, 1);call #t~string145.base, #t~string145.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string145.base, #t~string145.offset, 1);call write~init~int(37, #t~string145.base, 1 + #t~string145.offset, 1);call write~init~int(105, #t~string145.base, 2 + #t~string145.offset, 1);call write~init~int(0, #t~string145.base, 3 + #t~string145.offset, 1);call #t~string148.base, #t~string148.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string148.base, #t~string148.offset, 1);call write~init~int(37, #t~string148.base, 1 + #t~string148.offset, 1);call write~init~int(105, #t~string148.base, 2 + #t~string148.offset, 1);call write~init~int(0, #t~string148.base, 3 + #t~string148.offset, 1);call #t~string151.base, #t~string151.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string151.base, #t~string151.offset, 1);call write~init~int(37, #t~string151.base, 1 + #t~string151.offset, 1);call write~init~int(105, #t~string151.base, 2 + #t~string151.offset, 1);call write~init~int(0, #t~string151.base, 3 + #t~string151.offset, 1);call #t~string153.base, #t~string153.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string153.base, #t~string153.offset, 1);call write~init~int(0, #t~string153.base, 1 + #t~string153.offset, 1);~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; 1405495#L-1 havoc main_#res;havoc main_#t~ret54, main_~retValue_acc~4, main_~tmp~13;havoc main_~retValue_acc~4;havoc main_~tmp~13; 1404795#L3286 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; 1404796#L3294 main_#t~ret54 := valid_product_#res;main_~tmp~13 := main_#t~ret54;havoc main_#t~ret54; 1406549#L850 assume 0 != main_~tmp~13; 1404531#L819 ~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; 1404532#L3119 havoc bigMacCall_#t~ret47, bigMacCall_~tmp~10;havoc bigMacCall_~tmp~10;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~28;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~28; 1405969#L3342 assume !(0 == getOrigin_~person); 1405970#L3346 assume !(1 == getOrigin_~person); 1407711#L3350 assume !(2 == getOrigin_~person); 1407712#L3354 assume !(3 == getOrigin_~person); 1408926#L3358 assume !(4 == getOrigin_~person); 1408419#L3362 assume 5 == getOrigin_~person;getOrigin_~retValue_acc~28 := 1;getOrigin_#res := getOrigin_~retValue_acc~28; 1405381#L3367 bigMacCall_#t~ret47 := getOrigin_#res;bigMacCall_~tmp~10 := bigMacCall_#t~ret47;havoc bigMacCall_#t~ret47;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~10;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 1405382#L2776 assume !(0 == initPersonOnFloor_~floor); 1406776#L2803 assume 1 == initPersonOnFloor_~floor; 1406777#L2804 assume 0 == initPersonOnFloor_~person;~personOnFloor_0_1~0 := 1; 1404677#L2884-1 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 1405562#L2568 assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 1404602#L2580-2 havoc cleanup_#t~ret48, cleanup_#t~ret49, cleanup_~i~2, cleanup_~tmp~11, cleanup_~tmp___0~2, cleanup_~__cil_tmp4~2;havoc cleanup_~i~2;havoc cleanup_~tmp~11;havoc cleanup_~tmp___0~2;havoc cleanup_~__cil_tmp4~2;havoc timeShift_#t~ret97, timeShift_#t~ret98, timeShift_#t~ret99, timeShift_#t~ret100, timeShift_#t~ret101, timeShift_#t~ret102, timeShift_#t~ret103, timeShift_#t~ret104, timeShift_#t~ret105, timeShift_#t~ret106, timeShift_#t~ret107, timeShift_~tmp~25, timeShift_~tmp___0~10, timeShift_~tmp___1~6, timeShift_~tmp___2~4, 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~25;havoc timeShift_~tmp___0~10;havoc timeShift_~tmp___1~6;havoc timeShift_~tmp___2~4;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~ret81, stopRequestedAtCurrentFloor_#t~ret82, stopRequestedAtCurrentFloor_#t~ret83, stopRequestedAtCurrentFloor_#t~ret84, stopRequestedAtCurrentFloor_~retValue_acc~17, stopRequestedAtCurrentFloor_~tmp~23, stopRequestedAtCurrentFloor_~tmp___0~8;havoc stopRequestedAtCurrentFloor_~retValue_acc~17;havoc stopRequestedAtCurrentFloor_~tmp~23;havoc stopRequestedAtCurrentFloor_~tmp___0~8;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 1404603#L2505 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 1405525#L2532 isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 1405526#L2409 stopRequestedAtCurrentFloor_#t~ret81 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~23 := stopRequestedAtCurrentFloor_#t~ret81;havoc stopRequestedAtCurrentFloor_#t~ret81; 1409120#L1793 assume 0 != stopRequestedAtCurrentFloor_~tmp~23;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 1409121#L1124 stopRequestedAtCurrentFloor_#t~ret82 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~8 := stopRequestedAtCurrentFloor_#t~ret82;havoc stopRequestedAtCurrentFloor_#t~ret82; 1409103#L1797 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~8);stopRequestedAtCurrentFloor_~retValue_acc~17 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~17; 1406940#L1810 timeShift_#t~ret97 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret97;havoc timeShift_#t~ret97; 1406941#L1946 assume !(0 != timeShift_~tmp___9~2); 1409209#L2037 assume !(1 == ~doorState~0); 1409208#L2037-2 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret75, stopRequestedInDirection_#t~ret76, stopRequestedInDirection_#t~ret77, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~14, stopRequestedInDirection_~tmp~20, stopRequestedInDirection_~tmp___0~6, stopRequestedInDirection_~__cil_tmp7~5, stopRequestedInDirection_~__cil_tmp8~5;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~14;havoc stopRequestedInDirection_~tmp~20;havoc stopRequestedInDirection_~tmp___0~6;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 1406015#L2505-3 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 1405533#L2532-3 isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 1405534#L2409-1 stopRequestedInDirection_#t~ret75 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~6 := stopRequestedInDirection_#t~ret75;havoc stopRequestedInDirection_#t~ret75; 1407780#L1676 assume 0 != stopRequestedInDirection_~tmp___0~6;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 1407781#L1124-1 stopRequestedInDirection_#t~ret76 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~20 := stopRequestedInDirection_#t~ret76;havoc stopRequestedInDirection_#t~ret76;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~20 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~14 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~14; 1409499#L1689 timeShift_#t~ret104 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret104;havoc timeShift_#t~ret104; 1409500#L2045 assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret78, continueInDirection_~dir, continueInDirection_~tmp~21;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~21;~currentHeading~0 := continueInDirection_~dir; 1409518#L1733 assume !(1 == ~currentHeading~0); 1420863#L1743 assume !(0 == ~currentFloorID~0); 1420860#L1743-2 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 1420848#L1749-5 havoc __utac_acc__Specification9_spec__3_#t~ret156, __utac_acc__Specification9_spec__3_#t~ret157, __utac_acc__Specification9_spec__3_#t~ret158, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~27, __utac_acc__Specification9_spec__3_~tmp___0~12, __utac_acc__Specification9_spec__3_~tmp___1~8;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~27;havoc __utac_acc__Specification9_spec__3_~tmp___0~12;havoc __utac_acc__Specification9_spec__3_~tmp___1~8;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 1433778#L1124-3 __utac_acc__Specification9_spec__3_#t~ret156 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~27 := __utac_acc__Specification9_spec__3_#t~ret156;havoc __utac_acc__Specification9_spec__3_#t~ret156;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~27;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~10;havoc isEmpty_~retValue_acc~10; 1433775#L1184-6 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~10 := 0;isEmpty_#res := isEmpty_~retValue_acc~10; 1433771#L1216-6 __utac_acc__Specification9_spec__3_#t~ret157 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~8 := __utac_acc__Specification9_spec__3_#t~ret157;havoc __utac_acc__Specification9_spec__3_#t~ret157; 1433772#L3162 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~8);havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~7;havoc areDoorsOpen_~retValue_acc~7;areDoorsOpen_~retValue_acc~7 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~7; 1433760#L1133 __utac_acc__Specification9_spec__3_#t~ret158 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~12 := __utac_acc__Specification9_spec__3_#t~ret158;havoc __utac_acc__Specification9_spec__3_#t~ret158; 1433763#L3172 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___0~12); 1433755#L3172-1 cleanup_~i~2 := 0; 1433753#L651-2 assume !false; 1433754#L652 [2019-01-01 23:26:34,067 INFO L796 eck$LassoCheckResult]: Loop: 1433754#L652 cleanup_~__cil_tmp4~2 := ~cleanupTimeShifts~0 - 1; 1491474#L655 assume cleanup_~i~2 < cleanup_~__cil_tmp4~2;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~5;havoc isBlocked_~retValue_acc~5;isBlocked_~retValue_acc~5 := 0;isBlocked_#res := isBlocked_~retValue_acc~5; 1441240#L946 cleanup_#t~ret48 := isBlocked_#res;cleanup_~tmp___0~2 := cleanup_#t~ret48;havoc cleanup_#t~ret48; 1441239#L659 assume 1 != cleanup_~tmp___0~2; 1441238#L659-1 havoc isIdle_#res;havoc isIdle_#t~ret63, isIdle_~retValue_acc~12, isIdle_~tmp~18;havoc isIdle_~retValue_acc~12;havoc isIdle_~tmp~18;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret58, anyStopRequested_#t~ret59, anyStopRequested_#t~ret60, anyStopRequested_#t~ret61, anyStopRequested_#t~ret62, anyStopRequested_~retValue_acc~11, anyStopRequested_~tmp~17, anyStopRequested_~tmp___0~4, anyStopRequested_~tmp___1~3, anyStopRequested_~tmp___2~1, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~11;havoc anyStopRequested_~tmp~17;havoc anyStopRequested_~tmp___0~4;havoc anyStopRequested_~tmp___1~3;havoc anyStopRequested_~tmp___2~1;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 1441237#L2505-25 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 1441236#L2532-25 anyStopRequested_#t~ret58 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret58;havoc anyStopRequested_#t~ret58; 1441235#L1232 assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~11 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~11; 1438395#L1296 isIdle_#t~ret63 := anyStopRequested_#res;isIdle_~tmp~18 := isIdle_#t~ret63;havoc isIdle_#t~ret63;isIdle_~retValue_acc~12 := (if 0 == isIdle_~tmp~18 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~12; 1441232#L1309 cleanup_#t~ret49 := isIdle_#res;cleanup_~tmp~11 := cleanup_#t~ret49;havoc cleanup_#t~ret49; 1441174#L671 assume !(0 != cleanup_~tmp~11);havoc timeShift_#t~ret97, timeShift_#t~ret98, timeShift_#t~ret99, timeShift_#t~ret100, timeShift_#t~ret101, timeShift_#t~ret102, timeShift_#t~ret103, timeShift_#t~ret104, timeShift_#t~ret105, timeShift_#t~ret106, timeShift_#t~ret107, timeShift_~tmp~25, timeShift_~tmp___0~10, timeShift_~tmp___1~6, timeShift_~tmp___2~4, 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~25;havoc timeShift_~tmp___0~10;havoc timeShift_~tmp___1~6;havoc timeShift_~tmp___2~4;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~ret81, stopRequestedAtCurrentFloor_#t~ret82, stopRequestedAtCurrentFloor_#t~ret83, stopRequestedAtCurrentFloor_#t~ret84, stopRequestedAtCurrentFloor_~retValue_acc~17, stopRequestedAtCurrentFloor_~tmp~23, stopRequestedAtCurrentFloor_~tmp___0~8;havoc stopRequestedAtCurrentFloor_~retValue_acc~17;havoc stopRequestedAtCurrentFloor_~tmp~23;havoc stopRequestedAtCurrentFloor_~tmp___0~8;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 1438321#L2505-30 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 1438320#L2532-30 isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 1438319#L2409-3 stopRequestedAtCurrentFloor_#t~ret81 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~23 := stopRequestedAtCurrentFloor_#t~ret81;havoc stopRequestedAtCurrentFloor_#t~ret81; 1438317#L1793-1 assume 0 != stopRequestedAtCurrentFloor_~tmp~23;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 1438318#L1124-4 stopRequestedAtCurrentFloor_#t~ret82 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~8 := stopRequestedAtCurrentFloor_#t~ret82;havoc stopRequestedAtCurrentFloor_#t~ret82; 1474369#L1797-1 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~8);stopRequestedAtCurrentFloor_~retValue_acc~17 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~17; 1437135#L1810-1 timeShift_#t~ret97 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret97;havoc timeShift_#t~ret97; 1437134#L1946-1 assume !(0 != timeShift_~tmp___9~2); 1408879#L2037-3 assume 1 == ~doorState~0;~doorState~0 := 0; 1408880#L2037-5 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret75, stopRequestedInDirection_#t~ret76, stopRequestedInDirection_#t~ret77, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~14, stopRequestedInDirection_~tmp~20, stopRequestedInDirection_~tmp___0~6, stopRequestedInDirection_~__cil_tmp7~5, stopRequestedInDirection_~__cil_tmp8~5;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~14;havoc stopRequestedInDirection_~tmp~20;havoc stopRequestedInDirection_~tmp___0~6;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 1474372#L2505-33 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 1474371#L2532-33 isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 1474370#L2409-4 stopRequestedInDirection_#t~ret75 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~6 := stopRequestedInDirection_#t~ret75;havoc stopRequestedInDirection_#t~ret75; 1407799#L1676-2 assume 0 != stopRequestedInDirection_~tmp___0~6;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 1407800#L1124-5 stopRequestedInDirection_#t~ret76 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~20 := stopRequestedInDirection_#t~ret76;havoc stopRequestedInDirection_#t~ret76;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~20 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~14 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~14; 1478685#L1689-2 timeShift_#t~ret104 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret104;havoc timeShift_#t~ret104; 1469856#L2045-1 assume !(0 != timeShift_~tmp___8~2);getReverseHeading_#in~ofHeading := ~currentHeading~0;havoc getReverseHeading_#res;havoc getReverseHeading_~ofHeading, getReverseHeading_~retValue_acc~18;getReverseHeading_~ofHeading := getReverseHeading_#in~ofHeading;havoc getReverseHeading_~retValue_acc~18; 1469854#L1819-2 assume !(0 == getReverseHeading_~ofHeading);getReverseHeading_~retValue_acc~18 := 0;getReverseHeading_#res := getReverseHeading_~retValue_acc~18; 1469855#L1824-2 timeShift_#t~ret105 := getReverseHeading_#res;timeShift_~tmp___6~2 := timeShift_#t~ret105;havoc timeShift_#t~ret105;stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := timeShift_~tmp___6~2, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret75, stopRequestedInDirection_#t~ret76, stopRequestedInDirection_#t~ret77, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~14, stopRequestedInDirection_~tmp~20, stopRequestedInDirection_~tmp___0~6, stopRequestedInDirection_~__cil_tmp7~5, stopRequestedInDirection_~__cil_tmp8~5;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~14;havoc stopRequestedInDirection_~tmp~20;havoc stopRequestedInDirection_~tmp___0~6;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 1408224#L2505-44 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 1408225#L2532-44 isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 1489137#L2409-5 stopRequestedInDirection_#t~ret75 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~6 := stopRequestedInDirection_#t~ret75;havoc stopRequestedInDirection_#t~ret75; 1489119#L1676-3 assume 0 != stopRequestedInDirection_~tmp___0~6;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 1489118#L1124-6 stopRequestedInDirection_#t~ret76 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~20 := stopRequestedInDirection_#t~ret76;havoc stopRequestedInDirection_#t~ret76;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~20 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~14 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~14; 1489116#L1689-3 timeShift_#t~ret106 := stopRequestedInDirection_#res;timeShift_~tmp___7~2 := timeShift_#t~ret106;havoc timeShift_#t~ret106; 1489113#L2054-1 assume !(0 != timeShift_~tmp___7~2);continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret78, continueInDirection_~dir, continueInDirection_~tmp~21;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~21;~currentHeading~0 := continueInDirection_~dir; 1489114#L1733-5 assume !(1 == ~currentHeading~0); 1489072#L1743-15 assume !(0 == ~currentFloorID~0); 1489065#L1743-17 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 1491516#L1749-11 havoc __utac_acc__Specification9_spec__3_#t~ret156, __utac_acc__Specification9_spec__3_#t~ret157, __utac_acc__Specification9_spec__3_#t~ret158, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~27, __utac_acc__Specification9_spec__3_~tmp___0~12, __utac_acc__Specification9_spec__3_~tmp___1~8;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~27;havoc __utac_acc__Specification9_spec__3_~tmp___0~12;havoc __utac_acc__Specification9_spec__3_~tmp___1~8;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 1491514#L1124-7 __utac_acc__Specification9_spec__3_#t~ret156 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~27 := __utac_acc__Specification9_spec__3_#t~ret156;havoc __utac_acc__Specification9_spec__3_#t~ret156;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~27;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~10;havoc isEmpty_~retValue_acc~10; 1491513#L1184-13 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~10 := 0;isEmpty_#res := isEmpty_~retValue_acc~10; 1491508#L1216-13 __utac_acc__Specification9_spec__3_#t~ret157 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~8 := __utac_acc__Specification9_spec__3_#t~ret157;havoc __utac_acc__Specification9_spec__3_#t~ret157; 1491506#L3162-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~8);havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~7;havoc areDoorsOpen_~retValue_acc~7;areDoorsOpen_~retValue_acc~7 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~7; 1491502#L1133-1 __utac_acc__Specification9_spec__3_#t~ret158 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~12 := __utac_acc__Specification9_spec__3_#t~ret158;havoc __utac_acc__Specification9_spec__3_#t~ret158; 1491492#L3172-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___0~12); 1491491#L3172-3 cleanup_~i~2 := 1 + cleanup_~i~2; 1491490#L651-2 assume !false; 1433754#L652 [2019-01-01 23:26:34,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:26:34,067 INFO L82 PathProgramCache]: Analyzing trace with hash -61251997, now seen corresponding path program 2 times [2019-01-01 23:26:34,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:26:34,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:26:34,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:26:34,068 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:26:34,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:26:34,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:26:34,256 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:34,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:26:34,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 23:26:34,257 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:26:34,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:26:34,257 INFO L82 PathProgramCache]: Analyzing trace with hash -598136342, now seen corresponding path program 1 times [2019-01-01 23:26:34,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:26:34,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:26:34,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:26:34,263 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:26:34,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:26:34,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:26:34,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:26:35,698 WARN L181 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 242 DAG size of output: 220 [2019-01-01 23:26:35,700 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-01-01 23:26:37,084 WARN L181 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 185 DAG size of output: 140 [2019-01-01 23:26:37,087 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:26:37,087 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:26:37,087 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:26:37,087 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:26:37,087 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:26:37,087 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:26:37,087 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:26:37,087 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:26:37,087 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec9_product27_true-unreach-call_true-termination.cil.c_Iteration8_Loop [2019-01-01 23:26:37,088 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:26:37,088 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:26:37,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:26:37,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:26:37,161 INFO L141 MapEliminator]: 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:37,169 INFO L141 MapEliminator]: 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:37,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:26:37,174 INFO L141 MapEliminator]: 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:37,180 INFO L141 MapEliminator]: 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:37,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:37,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:37,190 INFO L141 MapEliminator]: 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:37,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:26:37,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:37,210 INFO L141 MapEliminator]: 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:37,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:26:37,214 INFO L141 MapEliminator]: 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:37,216 INFO L141 MapEliminator]: 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:37,219 INFO L141 MapEliminator]: 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:37,222 INFO L141 MapEliminator]: 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:37,224 INFO L141 MapEliminator]: 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:37,225 INFO L141 MapEliminator]: 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:37,233 INFO L141 MapEliminator]: 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:37,242 INFO L141 MapEliminator]: 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:37,249 INFO L141 MapEliminator]: 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:37,252 INFO L141 MapEliminator]: 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:37,257 INFO L141 MapEliminator]: 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:37,260 INFO L141 MapEliminator]: 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:37,262 INFO L141 MapEliminator]: 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:37,264 INFO L141 MapEliminator]: 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:37,267 INFO L141 MapEliminator]: 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:37,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:37,294 INFO L141 MapEliminator]: 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:37,303 INFO L141 MapEliminator]: 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:37,306 INFO L141 MapEliminator]: 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:37,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:37,311 INFO L141 MapEliminator]: 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:37,318 INFO L141 MapEliminator]: 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:37,321 INFO L141 MapEliminator]: 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:37,335 INFO L141 MapEliminator]: 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:37,338 INFO L141 MapEliminator]: 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:37,340 INFO L141 MapEliminator]: 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:37,345 INFO L141 MapEliminator]: 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:37,348 INFO L141 MapEliminator]: 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:37,351 INFO L141 MapEliminator]: 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:37,355 INFO L141 MapEliminator]: 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:37,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:37,362 INFO L141 MapEliminator]: 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:37,364 INFO L141 MapEliminator]: 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:37,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:37,373 INFO L141 MapEliminator]: 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:37,381 INFO L141 MapEliminator]: 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:37,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:37,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:37,411 INFO L141 MapEliminator]: 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:37,413 INFO L141 MapEliminator]: 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:37,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:37,423 INFO L141 MapEliminator]: 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:37,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:26:37,432 INFO L141 MapEliminator]: 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:37,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:37,441 INFO L141 MapEliminator]: 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:37,443 INFO L141 MapEliminator]: 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:37,459 INFO L141 MapEliminator]: 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:37,462 INFO L141 MapEliminator]: 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:38,403 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 25 [2019-01-01 23:26:38,566 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:26:38,567 INFO L412 LassoAnalysis]: Checking for nontermination... 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:26:38,580 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:26:38,580 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:26:38,586 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:26:38,586 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_~tmp___9~2=0, ULTIMATE.start_stopRequestedAtCurrentFloor_#res=0, ULTIMATE.start_stopRequestedAtCurrentFloor_~retValue_acc~17=0} Honda state: {ULTIMATE.start_timeShift_~tmp___9~2=0, ULTIMATE.start_stopRequestedAtCurrentFloor_#res=0, ULTIMATE.start_stopRequestedAtCurrentFloor_~retValue_acc~17=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:26:38,609 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:26:38,609 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:26:38,617 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:26:38,617 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_#t~ret99=0} Honda state: {ULTIMATE.start_timeShift_#t~ret99=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 23:26:38,646 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:26:38,646 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:26:38,657 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:26:38,657 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_continueInDirection_#t~ret78=0} Honda state: {ULTIMATE.start_continueInDirection_#t~ret78=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:26:38,681 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:26:38,681 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:26:38,684 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:26:38,684 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_#t~ret107=0} Honda state: {ULTIMATE.start_timeShift_#t~ret107=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:26:38,707 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:26:38,707 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:26:38,710 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:26:38,710 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_~tmp___0~4=0} Honda state: {ULTIMATE.start_anyStopRequested_~tmp___0~4=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:26:38,733 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:26:38,734 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:26:38,739 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:26:38,739 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_isExecutiveFloorCalling_#t~ret155=0} Honda state: {ULTIMATE.start_isExecutiveFloorCalling_#t~ret155=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:26:38,762 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:26:38,762 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:26:38,765 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:26:38,765 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_#t~ret103=0} Honda state: {ULTIMATE.start_timeShift_#t~ret103=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:26:38,789 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:26:38,789 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:26:38,794 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:26:38,794 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stopRequestedInDirection_~__cil_tmp7~5=0} Honda state: {ULTIMATE.start_stopRequestedInDirection_~__cil_tmp7~5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:26:38,817 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:26:38,818 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:26:38,821 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:26:38,821 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_~tmp___1~3=0} Honda state: {ULTIMATE.start_anyStopRequested_~tmp___1~3=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:38,843 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:26:38,843 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:26:38,849 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:26:38,850 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_#res=1, ULTIMATE.start_isIdle_~tmp~18=1, ULTIMATE.start_anyStopRequested_~retValue_acc~11=1} Honda state: {ULTIMATE.start_anyStopRequested_#res=1, ULTIMATE.start_isIdle_~tmp~18=1, ULTIMATE.start_anyStopRequested_~retValue_acc~11=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:26:38,890 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:26:38,890 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:26:38,908 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:26:38,909 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stopRequestedInDirection_#in~dir=0, ULTIMATE.start_getReverseHeading_~retValue_acc~18=0, ULTIMATE.start_stopRequestedInDirection_~dir=0, ULTIMATE.start_timeShift_~tmp___6~2=0, ULTIMATE.start_getReverseHeading_#res=0} Honda state: {ULTIMATE.start_stopRequestedInDirection_#in~dir=0, ULTIMATE.start_getReverseHeading_~retValue_acc~18=0, ULTIMATE.start_stopRequestedInDirection_~dir=0, ULTIMATE.start_timeShift_~tmp___6~2=0, ULTIMATE.start_getReverseHeading_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:26:38,940 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:26:38,940 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:26:38,943 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:26:38,943 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_cleanup_#t~ret48=0} Honda state: {ULTIMATE.start_cleanup_#t~ret48=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:26:38,966 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:26:38,966 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:26:38,971 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:26:38,971 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stopRequestedInDirection_~__cil_tmp8~5=1} Honda state: {ULTIMATE.start_stopRequestedInDirection_~__cil_tmp8~5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:26:38,994 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:26:38,994 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:26:39,523 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:26:39,523 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_#t~ret60=0} Honda state: {ULTIMATE.start_anyStopRequested_#t~ret60=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:26:39,545 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:26:39,545 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:26:39,551 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:26:39,551 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_#t~ret62=0} Honda state: {ULTIMATE.start_anyStopRequested_#t~ret62=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:26:39,575 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:26:39,575 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:26:39,578 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:26:39,578 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stopRequestedAtCurrentFloor_#t~ret83=0} Honda state: {ULTIMATE.start_stopRequestedAtCurrentFloor_#t~ret83=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:26:39,603 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:26:39,603 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:26:39,610 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:26:39,610 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 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:26:39,633 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:26:39,633 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:26:39,638 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:26:39,638 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_~tmp___2~4=0} Honda state: {ULTIMATE.start_timeShift_~tmp___2~4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:26:39,666 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:26:39,666 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:26:39,670 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:26:39,671 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_#t~ret59=0} Honda state: {ULTIMATE.start_anyStopRequested_#t~ret59=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:26:39,692 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:26:39,692 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:26:39,696 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:26:39,696 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_#t~ret100=0} Honda state: {ULTIMATE.start_timeShift_#t~ret100=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:26:39,717 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:26:39,717 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:26:39,737 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:26:39,738 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_isIdle_#res=0, ULTIMATE.start_isIdle_~retValue_acc~12=0, ULTIMATE.start_cleanup_~tmp~11=0} Honda state: {ULTIMATE.start_isIdle_#res=0, ULTIMATE.start_isIdle_~retValue_acc~12=0, ULTIMATE.start_cleanup_~tmp~11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:26:39,765 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:26:39,765 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:26:39,790 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:26:39,790 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:26:39,809 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:26:39,829 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:26:39,829 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:26:39,829 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:26:39,829 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:26:39,829 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:26:39,829 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:26:39,830 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:26:39,830 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:26:39,830 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec9_product27_true-unreach-call_true-termination.cil.c_Iteration8_Loop [2019-01-01 23:26:39,830 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:26:39,830 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:26:39,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:39,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:39,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:39,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:26:39,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:39,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:39,886 INFO L141 MapEliminator]: 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:39,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:39,891 INFO L141 MapEliminator]: 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:39,894 INFO L141 MapEliminator]: 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:39,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:39,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:39,904 INFO L141 MapEliminator]: 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:39,906 INFO L141 MapEliminator]: 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:39,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:39,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:39,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:39,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:39,956 INFO L141 MapEliminator]: 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:40,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:40,009 INFO L141 MapEliminator]: 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:40,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:26:40,024 INFO L141 MapEliminator]: 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:40,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:26:40,041 INFO L141 MapEliminator]: 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:40,043 INFO L141 MapEliminator]: 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:40,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:40,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:40,070 INFO L141 MapEliminator]: 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:40,073 INFO L141 MapEliminator]: 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:40,081 INFO L141 MapEliminator]: 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:40,084 INFO L141 MapEliminator]: 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:40,087 INFO L141 MapEliminator]: 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:40,089 INFO L141 MapEliminator]: 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:40,091 INFO L141 MapEliminator]: 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:40,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:26:40,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:26:40,098 INFO L141 MapEliminator]: 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:40,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:40,102 INFO L141 MapEliminator]: 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:40,116 INFO L141 MapEliminator]: 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:40,123 INFO L141 MapEliminator]: 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:40,127 INFO L141 MapEliminator]: 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:40,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:26:40,131 INFO L141 MapEliminator]: 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:40,135 INFO L141 MapEliminator]: 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:40,139 INFO L141 MapEliminator]: 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:40,142 INFO L141 MapEliminator]: 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:40,144 INFO L141 MapEliminator]: 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:40,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:26:40,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:40,154 INFO L141 MapEliminator]: 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:40,157 INFO L141 MapEliminator]: 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:40,159 INFO L141 MapEliminator]: 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:40,168 INFO L141 MapEliminator]: 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:40,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:26:40,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:26:40,174 INFO L141 MapEliminator]: 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:40,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:40,178 INFO L141 MapEliminator]: 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:40,194 INFO L141 MapEliminator]: 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:40,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:26:40,205 INFO L141 MapEliminator]: 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:40,848 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 25 [2019-01-01 23:26:40,999 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:26:40,999 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:26:40,999 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:41,000 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:26:41,000 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:26:41,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:26:41,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:26:41,009 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:26:41,010 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:26:41,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:26:41,011 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:26:41,015 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:41,015 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:26:41,015 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:26:41,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:26:41,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:26:41,016 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:26:41,016 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:26:41,017 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:26:41,017 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:26:41,017 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:41,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:26:41,018 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:26:41,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:26:41,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:26:41,018 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:26:41,018 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:26:41,018 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:26:41,022 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:26:41,023 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:41,023 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:26:41,023 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:26:41,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:26:41,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:26:41,023 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:26:41,025 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:26:41,025 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:26:41,025 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:26:41,026 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:41,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:26:41,026 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:26:41,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:26:41,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:26:41,027 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:26:41,029 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:26:41,029 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:26:41,030 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:26:41,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:26:41,030 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:26:41,030 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:26:41,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:26:41,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:26:41,031 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:26:41,031 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:26:41,031 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:26:41,036 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:26:41,036 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:41,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:26:41,037 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:26:41,037 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:26:41,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:26:41,037 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:26:41,037 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:26:41,037 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:26:41,040 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:26:41,041 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:41,041 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:26:41,041 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:26:41,041 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:26:41,041 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:26:41,041 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:26:41,042 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:26:41,042 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:26:41,042 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:26:41,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:26:41,046 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:26:41,046 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:26:41,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:26:41,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:26:41,047 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:26:41,047 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:26:41,047 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:26:41,051 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:26:41,051 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:41,052 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:26:41,052 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:26:41,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:26:41,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:26:41,052 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:26:41,053 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:26:41,053 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:26:41,053 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:26:41,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:26:41,057 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:26:41,057 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:26:41,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:26:41,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:26:41,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:26:41,058 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:26:41,058 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:26:41,059 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:26:41,059 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:41,059 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:26:41,059 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:26:41,059 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:26:41,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:26:41,060 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:26:41,060 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:26:41,060 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:26:41,061 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:26:41,061 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:41,061 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:26:41,061 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:26:41,061 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:26:41,061 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:26:41,067 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:26:41,067 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:26:41,067 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:26:41,068 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:26:41,068 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:41,069 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:26:41,069 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:26:41,069 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:26:41,069 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:26:41,069 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:26:41,070 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:26:41,070 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:26:41,071 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:26:41,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:26:41,072 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:26:41,075 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:26:41,075 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:26:41,075 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:26:41,075 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:26:41,076 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:26:41,076 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:26:41,077 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:26:41,080 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:41,080 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:26:41,081 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:26:41,081 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:26:41,081 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:26:41,081 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:26:41,081 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:26:41,081 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:26:41,082 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:26:41,082 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:41,086 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:26:41,086 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:26:41,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:26:41,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:26:41,087 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:26:41,087 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:26:41,087 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:26:41,087 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:26:41,091 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:41,091 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:26:41,092 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:26:41,092 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:26:41,092 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:26:41,092 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:26:41,092 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:26:41,092 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:26:41,093 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:26:41,093 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:41,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:26:41,098 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:26:41,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:26:41,098 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:26:41,098 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:26:41,099 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:26:41,099 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:26:41,100 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:26:41,100 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:41,100 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:26:41,100 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:26:41,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:26:41,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:26:41,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:26:41,105 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:26:41,105 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:26:41,106 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:26:41,111 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 23:26:41,111 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 23:26:41,112 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:26:41,112 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:26:41,112 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:26:41,112 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~doorState~0) = 1*~doorState~0 Supporting invariants [] [2019-01-01 23:26:41,116 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:26:41,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:26:41,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:26:41,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:26:41,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:26:41,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:26:41,528 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:41,528 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:26:41,528 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 91088 states and 169547 transitions. cyclomatic complexity: 78474 Second operand 4 states. [2019-01-01 23:26:42,165 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 91088 states and 169547 transitions. cyclomatic complexity: 78474. Second operand 4 states. Result 137872 states and 252373 transitions. Complement of second has 5 states. [2019-01-01 23:26:42,166 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:26:42,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 23:26:42,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3173 transitions. [2019-01-01 23:26:42,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3173 transitions. Stem has 49 letters. Loop has 49 letters. [2019-01-01 23:26:42,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:26:42,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3173 transitions. Stem has 98 letters. Loop has 49 letters. [2019-01-01 23:26:42,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:26:42,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3173 transitions. Stem has 49 letters. Loop has 98 letters. [2019-01-01 23:26:42,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:26:42,174 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 137872 states and 252373 transitions. [2019-01-01 23:26:42,669 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 57113 [2019-01-01 23:26:43,087 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 137872 states to 137872 states and 252373 transitions. [2019-01-01 23:26:43,088 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 74238 [2019-01-01 23:26:43,162 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 74292 [2019-01-01 23:26:43,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 137872 states and 252373 transitions. [2019-01-01 23:26:43,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:26:43,164 INFO L705 BuchiCegarLoop]: Abstraction has 137872 states and 252373 transitions. [2019-01-01 23:26:43,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137872 states and 252373 transitions. [2019-01-01 23:26:44,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137872 to 137738. [2019-01-01 23:26:44,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137738 states. [2019-01-01 23:26:44,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137738 states to 137738 states and 252179 transitions. [2019-01-01 23:26:44,624 INFO L728 BuchiCegarLoop]: Abstraction has 137738 states and 252179 transitions. [2019-01-01 23:26:44,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 23:26:44,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 23:26:44,624 INFO L87 Difference]: Start difference. First operand 137738 states and 252179 transitions. Second operand 4 states. [2019-01-01 23:26:46,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:26:46,549 INFO L93 Difference]: Finished difference Result 137738 states and 252175 transitions. [2019-01-01 23:26:46,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 23:26:46,550 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 137738 states and 252175 transitions. [2019-01-01 23:26:47,037 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 57113 [2019-01-01 23:26:47,469 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 137738 states to 137738 states and 252175 transitions. [2019-01-01 23:26:47,470 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 74243 [2019-01-01 23:26:47,518 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 74243 [2019-01-01 23:26:47,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 137738 states and 252175 transitions. [2019-01-01 23:26:47,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:26:47,528 INFO L705 BuchiCegarLoop]: Abstraction has 137738 states and 252175 transitions. [2019-01-01 23:26:47,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137738 states and 252175 transitions. [2019-01-01 23:26:48,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137738 to 137738. [2019-01-01 23:26:48,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137738 states. [2019-01-01 23:26:48,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137738 states to 137738 states and 252175 transitions. [2019-01-01 23:26:48,973 INFO L728 BuchiCegarLoop]: Abstraction has 137738 states and 252175 transitions. [2019-01-01 23:26:48,973 INFO L608 BuchiCegarLoop]: Abstraction has 137738 states and 252175 transitions. [2019-01-01 23:26:48,973 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-01 23:26:48,973 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 137738 states and 252175 transitions. [2019-01-01 23:26:49,299 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 57113 [2019-01-01 23:26:49,299 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:26:49,299 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:26:49,300 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, 1, 1, 1] [2019-01-01 23:26:49,301 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:26:49,301 INFO L794 eck$LassoCheckResult]: Stem: 1910240#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(30);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(9);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(21);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(30);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(9);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(21);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(30);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(9);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(25);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(30);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(9);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(25);~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~cleanupTimeShifts~0 := 12;~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~string108.base, #t~string108.offset := #Ultimate.allocOnStack(10);call #t~string110.base, #t~string110.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string110.base, #t~string110.offset, 1);call write~init~int(95, #t~string110.base, 1 + #t~string110.offset, 1);call write~init~int(93, #t~string110.base, 2 + #t~string110.offset, 1);call write~init~int(0, #t~string110.base, 3 + #t~string110.offset, 1);call #t~string112.base, #t~string112.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string112.base, #t~string112.offset, 1);call write~init~int(93, #t~string112.base, 1 + #t~string112.offset, 1);call write~init~int(32, #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(5);call write~init~int(32, #t~string114.base, #t~string114.offset, 1);call write~init~int(97, #t~string114.base, 1 + #t~string114.offset, 1);call write~init~int(116, #t~string114.base, 2 + #t~string114.offset, 1);call write~init~int(32, #t~string114.base, 3 + #t~string114.offset, 1);call write~init~int(0, #t~string114.base, 4 + #t~string114.offset, 1);call #t~string116.base, #t~string116.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string116.base, #t~string116.offset, 1);call write~init~int(105, #t~string116.base, 1 + #t~string116.offset, 1);call write~init~int(0, #t~string116.base, 2 + #t~string116.offset, 1);call #t~string118.base, #t~string118.offset := #Ultimate.allocOnStack(10);call #t~string120.base, #t~string120.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string120.base, #t~string120.offset, 1);call write~init~int(112, #t~string120.base, 1 + #t~string120.offset, 1);call write~init~int(0, #t~string120.base, 2 + #t~string120.offset, 1);call #t~string122.base, #t~string122.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string122.base, #t~string122.offset, 1);call write~init~int(111, #t~string122.base, 1 + #t~string122.offset, 1);call write~init~int(119, #t~string122.base, 2 + #t~string122.offset, 1);call write~init~int(110, #t~string122.base, 3 + #t~string122.offset, 1);call write~init~int(0, #t~string122.base, 4 + #t~string122.offset, 1);call #t~string124.base, #t~string124.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string124.base, #t~string124.offset, 1);call write~init~int(73, #t~string124.base, 1 + #t~string124.offset, 1);call write~init~int(76, #t~string124.base, 2 + #t~string124.offset, 1);call write~init~int(95, #t~string124.base, 3 + #t~string124.offset, 1);call write~init~int(112, #t~string124.base, 4 + #t~string124.offset, 1);call write~init~int(58, #t~string124.base, 5 + #t~string124.offset, 1);call write~init~int(0, #t~string124.base, 6 + #t~string124.offset, 1);call #t~string126.base, #t~string126.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string126.base, #t~string126.offset, 1);call write~init~int(37, #t~string126.base, 1 + #t~string126.offset, 1);call write~init~int(105, #t~string126.base, 2 + #t~string126.offset, 1);call write~init~int(0, #t~string126.base, 3 + #t~string126.offset, 1);call #t~string128.base, #t~string128.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string128.base, #t~string128.offset, 1);call write~init~int(37, #t~string128.base, 1 + #t~string128.offset, 1);call write~init~int(105, #t~string128.base, 2 + #t~string128.offset, 1);call write~init~int(0, #t~string128.base, 3 + #t~string128.offset, 1);call #t~string130.base, #t~string130.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string130.base, #t~string130.offset, 1);call write~init~int(37, #t~string130.base, 1 + #t~string130.offset, 1);call write~init~int(105, #t~string130.base, 2 + #t~string130.offset, 1);call write~init~int(0, #t~string130.base, 3 + #t~string130.offset, 1);call #t~string132.base, #t~string132.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string132.base, #t~string132.offset, 1);call write~init~int(37, #t~string132.base, 1 + #t~string132.offset, 1);call write~init~int(105, #t~string132.base, 2 + #t~string132.offset, 1);call write~init~int(0, #t~string132.base, 3 + #t~string132.offset, 1);call #t~string134.base, #t~string134.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string134.base, #t~string134.offset, 1);call write~init~int(37, #t~string134.base, 1 + #t~string134.offset, 1);call write~init~int(105, #t~string134.base, 2 + #t~string134.offset, 1);call write~init~int(0, #t~string134.base, 3 + #t~string134.offset, 1);call #t~string136.base, #t~string136.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string136.base, #t~string136.offset, 1);call write~init~int(70, #t~string136.base, 1 + #t~string136.offset, 1);call write~init~int(95, #t~string136.base, 2 + #t~string136.offset, 1);call write~init~int(112, #t~string136.base, 3 + #t~string136.offset, 1);call write~init~int(58, #t~string136.base, 4 + #t~string136.offset, 1);call write~init~int(0, #t~string136.base, 5 + #t~string136.offset, 1);call #t~string139.base, #t~string139.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string139.base, #t~string139.offset, 1);call write~init~int(37, #t~string139.base, 1 + #t~string139.offset, 1);call write~init~int(105, #t~string139.base, 2 + #t~string139.offset, 1);call write~init~int(0, #t~string139.base, 3 + #t~string139.offset, 1);call #t~string142.base, #t~string142.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string142.base, #t~string142.offset, 1);call write~init~int(37, #t~string142.base, 1 + #t~string142.offset, 1);call write~init~int(105, #t~string142.base, 2 + #t~string142.offset, 1);call write~init~int(0, #t~string142.base, 3 + #t~string142.offset, 1);call #t~string145.base, #t~string145.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string145.base, #t~string145.offset, 1);call write~init~int(37, #t~string145.base, 1 + #t~string145.offset, 1);call write~init~int(105, #t~string145.base, 2 + #t~string145.offset, 1);call write~init~int(0, #t~string145.base, 3 + #t~string145.offset, 1);call #t~string148.base, #t~string148.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string148.base, #t~string148.offset, 1);call write~init~int(37, #t~string148.base, 1 + #t~string148.offset, 1);call write~init~int(105, #t~string148.base, 2 + #t~string148.offset, 1);call write~init~int(0, #t~string148.base, 3 + #t~string148.offset, 1);call #t~string151.base, #t~string151.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string151.base, #t~string151.offset, 1);call write~init~int(37, #t~string151.base, 1 + #t~string151.offset, 1);call write~init~int(105, #t~string151.base, 2 + #t~string151.offset, 1);call write~init~int(0, #t~string151.base, 3 + #t~string151.offset, 1);call #t~string153.base, #t~string153.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string153.base, #t~string153.offset, 1);call write~init~int(0, #t~string153.base, 1 + #t~string153.offset, 1);~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; 1910241#L-1 havoc main_#res;havoc main_#t~ret54, main_~retValue_acc~4, main_~tmp~13;havoc main_~retValue_acc~4;havoc main_~tmp~13; 1909545#L3286 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; 1909546#L3294 main_#t~ret54 := valid_product_#res;main_~tmp~13 := main_#t~ret54;havoc main_#t~ret54; 1911287#L850 assume 0 != main_~tmp~13; 1909284#L819 ~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; 1909285#L3119 havoc bigMacCall_#t~ret47, bigMacCall_~tmp~10;havoc bigMacCall_~tmp~10;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~28;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~28; 1910708#L3342 assume !(0 == getOrigin_~person); 1910709#L3346 assume !(1 == getOrigin_~person); 1912432#L3350 assume !(2 == getOrigin_~person); 1912433#L3354 assume !(3 == getOrigin_~person); 1913596#L3358 assume !(4 == getOrigin_~person); 1913085#L3362 assume 5 == getOrigin_~person;getOrigin_~retValue_acc~28 := 1;getOrigin_#res := getOrigin_~retValue_acc~28; 1910123#L3367 bigMacCall_#t~ret47 := getOrigin_#res;bigMacCall_~tmp~10 := bigMacCall_#t~ret47;havoc bigMacCall_#t~ret47;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~10;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 1910124#L2776 assume !(0 == initPersonOnFloor_~floor); 1911498#L2803 assume 1 == initPersonOnFloor_~floor; 1911499#L2804 assume !(0 == initPersonOnFloor_~person); 1911484#L2807 assume 1 == initPersonOnFloor_~person;~personOnFloor_1_1~0 := 1; 1909427#L2884-1 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 1910306#L2568 assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 1909353#L2580-2 havoc cleanup_#t~ret48, cleanup_#t~ret49, cleanup_~i~2, cleanup_~tmp~11, cleanup_~tmp___0~2, cleanup_~__cil_tmp4~2;havoc cleanup_~i~2;havoc cleanup_~tmp~11;havoc cleanup_~tmp___0~2;havoc cleanup_~__cil_tmp4~2;havoc timeShift_#t~ret97, timeShift_#t~ret98, timeShift_#t~ret99, timeShift_#t~ret100, timeShift_#t~ret101, timeShift_#t~ret102, timeShift_#t~ret103, timeShift_#t~ret104, timeShift_#t~ret105, timeShift_#t~ret106, timeShift_#t~ret107, timeShift_~tmp~25, timeShift_~tmp___0~10, timeShift_~tmp___1~6, timeShift_~tmp___2~4, 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~25;havoc timeShift_~tmp___0~10;havoc timeShift_~tmp___1~6;havoc timeShift_~tmp___2~4;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~ret81, stopRequestedAtCurrentFloor_#t~ret82, stopRequestedAtCurrentFloor_#t~ret83, stopRequestedAtCurrentFloor_#t~ret84, stopRequestedAtCurrentFloor_~retValue_acc~17, stopRequestedAtCurrentFloor_~tmp~23, stopRequestedAtCurrentFloor_~tmp___0~8;havoc stopRequestedAtCurrentFloor_~retValue_acc~17;havoc stopRequestedAtCurrentFloor_~tmp~23;havoc stopRequestedAtCurrentFloor_~tmp___0~8;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 1909354#L2505 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 1910270#L2532 isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 1910271#L2409 stopRequestedAtCurrentFloor_#t~ret81 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~23 := stopRequestedAtCurrentFloor_#t~ret81;havoc stopRequestedAtCurrentFloor_#t~ret81; 1911392#L1793 assume 0 != stopRequestedAtCurrentFloor_~tmp~23;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 1913762#L1124 stopRequestedAtCurrentFloor_#t~ret82 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~8 := stopRequestedAtCurrentFloor_#t~ret82;havoc stopRequestedAtCurrentFloor_#t~ret82; 1913763#L1797 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~8);stopRequestedAtCurrentFloor_~retValue_acc~17 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~17; 1913862#L1810 timeShift_#t~ret97 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret97;havoc timeShift_#t~ret97; 1913742#L1946 assume !(0 != timeShift_~tmp___9~2); 1913582#L2037 assume !(1 == ~doorState~0); 1913549#L2037-2 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret75, stopRequestedInDirection_#t~ret76, stopRequestedInDirection_#t~ret77, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~14, stopRequestedInDirection_~tmp~20, stopRequestedInDirection_~tmp___0~6, stopRequestedInDirection_~__cil_tmp7~5, stopRequestedInDirection_~__cil_tmp8~5;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~14;havoc stopRequestedInDirection_~tmp~20;havoc stopRequestedInDirection_~tmp___0~6;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 1910754#L2505-3 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 1910278#L2532-3 isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 1910279#L2409-1 stopRequestedInDirection_#t~ret75 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~6 := stopRequestedInDirection_#t~ret75;havoc stopRequestedInDirection_#t~ret75; 1911399#L1676 assume 0 != stopRequestedInDirection_~tmp___0~6;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 1914096#L1124-1 stopRequestedInDirection_#t~ret76 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~20 := stopRequestedInDirection_#t~ret76;havoc stopRequestedInDirection_#t~ret76;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~20 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~14 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~14; 1914097#L1689 timeShift_#t~ret104 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret104;havoc timeShift_#t~ret104; 1914092#L2045 assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret78, continueInDirection_~dir, continueInDirection_~tmp~21;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~21;~currentHeading~0 := continueInDirection_~dir; 1914093#L1733 assume !(1 == ~currentHeading~0); 1914203#L1743 assume !(0 == ~currentFloorID~0); 1909388#L1743-2 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 1909355#L1749-5 havoc __utac_acc__Specification9_spec__3_#t~ret156, __utac_acc__Specification9_spec__3_#t~ret157, __utac_acc__Specification9_spec__3_#t~ret158, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~27, __utac_acc__Specification9_spec__3_~tmp___0~12, __utac_acc__Specification9_spec__3_~tmp___1~8;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~27;havoc __utac_acc__Specification9_spec__3_~tmp___0~12;havoc __utac_acc__Specification9_spec__3_~tmp___1~8;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 2015459#L1124-3 __utac_acc__Specification9_spec__3_#t~ret156 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~27 := __utac_acc__Specification9_spec__3_#t~ret156;havoc __utac_acc__Specification9_spec__3_#t~ret156;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~27;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~10;havoc isEmpty_~retValue_acc~10; 2015452#L1184-6 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~10 := 0;isEmpty_#res := isEmpty_~retValue_acc~10; 2015444#L1216-6 __utac_acc__Specification9_spec__3_#t~ret157 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~8 := __utac_acc__Specification9_spec__3_#t~ret157;havoc __utac_acc__Specification9_spec__3_#t~ret157; 2015445#L3162 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~8);havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~7;havoc areDoorsOpen_~retValue_acc~7;areDoorsOpen_~retValue_acc~7 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~7; 2015419#L1133 __utac_acc__Specification9_spec__3_#t~ret158 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~12 := __utac_acc__Specification9_spec__3_#t~ret158;havoc __utac_acc__Specification9_spec__3_#t~ret158; 2015422#L3172 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___0~12); 2015413#L3172-1 cleanup_~i~2 := 0; 2015396#L651-2 assume !false; 2015398#L652 cleanup_~__cil_tmp4~2 := ~cleanupTimeShifts~0 - 1; 2016639#L655 [2019-01-01 23:26:49,301 INFO L796 eck$LassoCheckResult]: Loop: 2016639#L655 assume cleanup_~i~2 < cleanup_~__cil_tmp4~2;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~5;havoc isBlocked_~retValue_acc~5;isBlocked_~retValue_acc~5 := 0;isBlocked_#res := isBlocked_~retValue_acc~5; 2046464#L946 cleanup_#t~ret48 := isBlocked_#res;cleanup_~tmp___0~2 := cleanup_#t~ret48;havoc cleanup_#t~ret48; 2046462#L659 assume 1 != cleanup_~tmp___0~2; 2046460#L659-1 havoc isIdle_#res;havoc isIdle_#t~ret63, isIdle_~retValue_acc~12, isIdle_~tmp~18;havoc isIdle_~retValue_acc~12;havoc isIdle_~tmp~18;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret58, anyStopRequested_#t~ret59, anyStopRequested_#t~ret60, anyStopRequested_#t~ret61, anyStopRequested_#t~ret62, anyStopRequested_~retValue_acc~11, anyStopRequested_~tmp~17, anyStopRequested_~tmp___0~4, anyStopRequested_~tmp___1~3, anyStopRequested_~tmp___2~1, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~11;havoc anyStopRequested_~tmp~17;havoc anyStopRequested_~tmp___0~4;havoc anyStopRequested_~tmp___1~3;havoc anyStopRequested_~tmp___2~1;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 2046458#L2505-25 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 2046456#L2532-25 anyStopRequested_#t~ret58 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret58;havoc anyStopRequested_#t~ret58; 2046454#L1232 assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~11 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~11; 2037535#L1296 isIdle_#t~ret63 := anyStopRequested_#res;isIdle_~tmp~18 := isIdle_#t~ret63;havoc isIdle_#t~ret63;isIdle_~retValue_acc~12 := (if 0 == isIdle_~tmp~18 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~12; 2046451#L1309 cleanup_#t~ret49 := isIdle_#res;cleanup_~tmp~11 := cleanup_#t~ret49;havoc cleanup_#t~ret49; 2046449#L671 assume !(0 != cleanup_~tmp~11);havoc timeShift_#t~ret97, timeShift_#t~ret98, timeShift_#t~ret99, timeShift_#t~ret100, timeShift_#t~ret101, timeShift_#t~ret102, timeShift_#t~ret103, timeShift_#t~ret104, timeShift_#t~ret105, timeShift_#t~ret106, timeShift_#t~ret107, timeShift_~tmp~25, timeShift_~tmp___0~10, timeShift_~tmp___1~6, timeShift_~tmp___2~4, 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~25;havoc timeShift_~tmp___0~10;havoc timeShift_~tmp___1~6;havoc timeShift_~tmp___2~4;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~ret81, stopRequestedAtCurrentFloor_#t~ret82, stopRequestedAtCurrentFloor_#t~ret83, stopRequestedAtCurrentFloor_#t~ret84, stopRequestedAtCurrentFloor_~retValue_acc~17, stopRequestedAtCurrentFloor_~tmp~23, stopRequestedAtCurrentFloor_~tmp___0~8;havoc stopRequestedAtCurrentFloor_~retValue_acc~17;havoc stopRequestedAtCurrentFloor_~tmp~23;havoc stopRequestedAtCurrentFloor_~tmp___0~8;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 2046448#L2505-30 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 1987396#L2532-30 isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 2046445#L2409-3 stopRequestedAtCurrentFloor_#t~ret81 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~23 := stopRequestedAtCurrentFloor_#t~ret81;havoc stopRequestedAtCurrentFloor_#t~ret81; 2046442#L1793-1 assume 0 != stopRequestedAtCurrentFloor_~tmp~23;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 2046441#L1124-4 stopRequestedAtCurrentFloor_#t~ret82 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~8 := stopRequestedAtCurrentFloor_#t~ret82;havoc stopRequestedAtCurrentFloor_#t~ret82; 2046438#L1797-1 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~8);stopRequestedAtCurrentFloor_~retValue_acc~17 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~17; 2046436#L1810-1 timeShift_#t~ret97 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret97;havoc timeShift_#t~ret97; 2046430#L1946-1 assume !(0 != timeShift_~tmp___9~2); 2046428#L2037-3 assume !(1 == ~doorState~0); 2046429#L2037-5 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret75, stopRequestedInDirection_#t~ret76, stopRequestedInDirection_#t~ret77, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~14, stopRequestedInDirection_~tmp~20, stopRequestedInDirection_~tmp___0~6, stopRequestedInDirection_~__cil_tmp7~5, stopRequestedInDirection_~__cil_tmp8~5;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~14;havoc stopRequestedInDirection_~tmp~20;havoc stopRequestedInDirection_~tmp___0~6;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 2046427#L2505-33 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 2046651#L2532-33 isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 2046650#L2409-4 stopRequestedInDirection_#t~ret75 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~6 := stopRequestedInDirection_#t~ret75;havoc stopRequestedInDirection_#t~ret75; 2046649#L1676-2 assume 0 != stopRequestedInDirection_~tmp___0~6;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 2046648#L1124-5 stopRequestedInDirection_#t~ret76 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~20 := stopRequestedInDirection_#t~ret76;havoc stopRequestedInDirection_#t~ret76;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~20 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~14 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~14; 2046647#L1689-2 timeShift_#t~ret104 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret104;havoc timeShift_#t~ret104; 2046646#L2045-1 assume !(0 != timeShift_~tmp___8~2);getReverseHeading_#in~ofHeading := ~currentHeading~0;havoc getReverseHeading_#res;havoc getReverseHeading_~ofHeading, getReverseHeading_~retValue_acc~18;getReverseHeading_~ofHeading := getReverseHeading_#in~ofHeading;havoc getReverseHeading_~retValue_acc~18; 2046643#L1819-2 assume !(0 == getReverseHeading_~ofHeading);getReverseHeading_~retValue_acc~18 := 0;getReverseHeading_#res := getReverseHeading_~retValue_acc~18; 2046644#L1824-2 timeShift_#t~ret105 := getReverseHeading_#res;timeShift_~tmp___6~2 := timeShift_#t~ret105;havoc timeShift_#t~ret105;stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := timeShift_~tmp___6~2, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret75, stopRequestedInDirection_#t~ret76, stopRequestedInDirection_#t~ret77, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~14, stopRequestedInDirection_~tmp~20, stopRequestedInDirection_~tmp___0~6, stopRequestedInDirection_~__cil_tmp7~5, stopRequestedInDirection_~__cil_tmp8~5;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~14;havoc stopRequestedInDirection_~tmp~20;havoc stopRequestedInDirection_~tmp___0~6;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 2046760#L2505-44 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 1988933#L2532-44 isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 2046757#L2409-5 stopRequestedInDirection_#t~ret75 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~6 := stopRequestedInDirection_#t~ret75;havoc stopRequestedInDirection_#t~ret75; 2046755#L1676-3 assume 0 != stopRequestedInDirection_~tmp___0~6;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 2046753#L1124-6 stopRequestedInDirection_#t~ret76 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~20 := stopRequestedInDirection_#t~ret76;havoc stopRequestedInDirection_#t~ret76;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~20 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~14 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~14; 2046417#L1689-3 timeShift_#t~ret106 := stopRequestedInDirection_#res;timeShift_~tmp___7~2 := timeShift_#t~ret106;havoc timeShift_#t~ret106; 2046416#L2054-1 assume !(0 != timeShift_~tmp___7~2);continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret78, continueInDirection_~dir, continueInDirection_~tmp~21;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~21;~currentHeading~0 := continueInDirection_~dir; 1913038#L1733-5 assume !(1 == ~currentHeading~0); 1909329#L1743-15 assume !(0 == ~currentFloorID~0); 1909330#L1743-17 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 2046698#L1749-11 havoc __utac_acc__Specification9_spec__3_#t~ret156, __utac_acc__Specification9_spec__3_#t~ret157, __utac_acc__Specification9_spec__3_#t~ret158, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~27, __utac_acc__Specification9_spec__3_~tmp___0~12, __utac_acc__Specification9_spec__3_~tmp___1~8;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~27;havoc __utac_acc__Specification9_spec__3_~tmp___0~12;havoc __utac_acc__Specification9_spec__3_~tmp___1~8;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 2046697#L1124-7 __utac_acc__Specification9_spec__3_#t~ret156 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~27 := __utac_acc__Specification9_spec__3_#t~ret156;havoc __utac_acc__Specification9_spec__3_#t~ret156;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~27;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~10;havoc isEmpty_~retValue_acc~10; 2046696#L1184-13 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~10 := 0;isEmpty_#res := isEmpty_~retValue_acc~10; 2046691#L1216-13 __utac_acc__Specification9_spec__3_#t~ret157 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~8 := __utac_acc__Specification9_spec__3_#t~ret157;havoc __utac_acc__Specification9_spec__3_#t~ret157; 2046689#L3162-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~8);havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~7;havoc areDoorsOpen_~retValue_acc~7;areDoorsOpen_~retValue_acc~7 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~7; 2046685#L1133-1 __utac_acc__Specification9_spec__3_#t~ret158 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~12 := __utac_acc__Specification9_spec__3_#t~ret158;havoc __utac_acc__Specification9_spec__3_#t~ret158; 2046675#L3172-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___0~12); 2046674#L3172-3 cleanup_~i~2 := 1 + cleanup_~i~2; 2046500#L651-2 assume !false; 2046486#L652 cleanup_~__cil_tmp4~2 := ~cleanupTimeShifts~0 - 1; 2016639#L655 [2019-01-01 23:26:49,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:26:49,302 INFO L82 PathProgramCache]: Analyzing trace with hash -329673631, now seen corresponding path program 1 times [2019-01-01 23:26:49,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:26:49,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:26:49,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:26:49,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:26:49,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:26:49,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:26:49,429 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:49,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:26:49,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 23:26:49,430 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:26:49,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:26:49,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1245119064, now seen corresponding path program 1 times [2019-01-01 23:26:49,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:26:49,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:26:49,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:26:49,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:26:49,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:26:49,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:26:49,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:26:50,629 WARN L181 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 242 DAG size of output: 219 [2019-01-01 23:26:50,631 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-01-01 23:26:51,992 WARN L181 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 184 DAG size of output: 139 [2019-01-01 23:26:51,996 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:26:51,996 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:26:51,996 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:26:51,997 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:26:51,997 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:26:51,997 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:26:51,997 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:26:51,997 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:26:51,997 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec9_product27_true-unreach-call_true-termination.cil.c_Iteration9_Loop [2019-01-01 23:26:51,997 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:26:51,997 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:26:52,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:52,009 INFO L141 MapEliminator]: 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:52,017 INFO L141 MapEliminator]: 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:52,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:52,032 INFO L141 MapEliminator]: 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:52,039 INFO L141 MapEliminator]: 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:52,043 INFO L141 MapEliminator]: 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:52,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:52,047 INFO L141 MapEliminator]: 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:52,050 INFO L141 MapEliminator]: 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:52,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:52,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:26:52,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:52,064 INFO L141 MapEliminator]: 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:52,067 INFO L141 MapEliminator]: 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:52,070 INFO L141 MapEliminator]: 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:52,080 INFO L141 MapEliminator]: 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:52,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:52,088 INFO L141 MapEliminator]: 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:52,091 INFO L141 MapEliminator]: 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:52,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:26:52,107 INFO L141 MapEliminator]: 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:52,110 INFO L141 MapEliminator]: 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:52,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:52,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:52,132 INFO L141 MapEliminator]: 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:52,136 INFO L141 MapEliminator]: 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:52,161 INFO L141 MapEliminator]: 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:52,164 INFO L141 MapEliminator]: 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:52,167 INFO L141 MapEliminator]: 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:52,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:26:52,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:52,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:52,179 INFO L141 MapEliminator]: 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:52,181 INFO L141 MapEliminator]: 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:52,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:26:52,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:52,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:26:52,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:26:52,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:26:52,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:52,212 INFO L141 MapEliminator]: 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:52,216 INFO L141 MapEliminator]: 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:52,218 INFO L141 MapEliminator]: 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:52,220 INFO L141 MapEliminator]: 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:52,228 INFO L141 MapEliminator]: 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:52,233 INFO L141 MapEliminator]: 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:52,236 INFO L141 MapEliminator]: 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:52,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:52,247 INFO L141 MapEliminator]: 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:52,249 INFO L141 MapEliminator]: 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:52,251 INFO L141 MapEliminator]: 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:52,253 INFO L141 MapEliminator]: 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:52,257 INFO L141 MapEliminator]: 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:52,260 INFO L141 MapEliminator]: 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:52,262 INFO L141 MapEliminator]: 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:52,263 INFO L141 MapEliminator]: 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:52,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:52,271 INFO L141 MapEliminator]: 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:52,286 INFO L141 MapEliminator]: 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:52,290 INFO L141 MapEliminator]: 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:52,296 INFO L141 MapEliminator]: 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:52,300 INFO L141 MapEliminator]: 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:53,101 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 25 [2019-01-01 23:26:53,134 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:26:53,134 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:26:53,143 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:26:53,143 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:26:53,146 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:26:53,146 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_~tmp___0~4=0} Honda state: {ULTIMATE.start_anyStopRequested_~tmp___0~4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:26:53,168 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:26:53,169 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:26:53,174 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:26:53,174 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_areDoorsOpen_#res=0, ~doorState~0=0, ULTIMATE.start_areDoorsOpen_~retValue_acc~7=0, ULTIMATE.start___utac_acc__Specification9_spec__3_~tmp___0~12=0} Honda state: {ULTIMATE.start_areDoorsOpen_#res=0, ~doorState~0=0, ULTIMATE.start_areDoorsOpen_~retValue_acc~7=0, ULTIMATE.start___utac_acc__Specification9_spec__3_~tmp___0~12=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:26:53,195 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:26:53,195 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:26:53,199 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:26:53,200 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_cleanup_#t~ret48=0} Honda state: {ULTIMATE.start_cleanup_#t~ret48=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:26:53,817 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:26:53,818 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:26:53,823 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:26:53,823 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_isBlocked_~retValue_acc~5=0, ULTIMATE.start_cleanup_~tmp___0~2=0, ULTIMATE.start_isBlocked_#res=0} Honda state: {ULTIMATE.start_isBlocked_~retValue_acc~5=0, ULTIMATE.start_cleanup_~tmp___0~2=0, ULTIMATE.start_isBlocked_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 23:26:53,843 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:26:53,844 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:26:53,848 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:26:53,848 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stopRequestedInDirection_#res=0, ULTIMATE.start_timeShift_~tmp___7~2=0, ULTIMATE.start_stopRequestedInDirection_~retValue_acc~14=0} Honda state: {ULTIMATE.start_stopRequestedInDirection_#res=0, ULTIMATE.start_timeShift_~tmp___7~2=0, ULTIMATE.start_stopRequestedInDirection_~retValue_acc~14=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:26:53,872 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:26:53,872 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:26:53,875 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:26:53,875 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_#t~ret107=0} Honda state: {ULTIMATE.start_timeShift_#t~ret107=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:26:53,897 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:26:53,897 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:26:53,900 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:26:53,900 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification9_spec__3_#t~ret156=0} Honda state: {ULTIMATE.start___utac_acc__Specification9_spec__3_#t~ret156=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:26:53,921 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:26:53,921 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:26:53,925 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:26:53,925 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_#t~ret103=0} Honda state: {ULTIMATE.start_timeShift_#t~ret103=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 23:26:53,946 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:26:53,947 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:26:53,950 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:26:53,950 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_~tmp___0~10=0} Honda state: {ULTIMATE.start_timeShift_~tmp___0~10=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:26:53,972 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:26:53,972 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:26:53,975 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:26:53,975 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_~tmp___1~3=0} Honda state: {ULTIMATE.start_anyStopRequested_~tmp___1~3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:26:53,996 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:26:53,996 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:26:54,000 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:26:54,000 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_#t~ret99=0} Honda state: {ULTIMATE.start_timeShift_#t~ret99=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:26:54,022 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:26:54,022 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:26:54,025 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:26:54,025 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 43 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:26:54,047 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:26:54,047 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:26:54,050 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:26:54,050 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_continueInDirection_#t~ret78=0} Honda state: {ULTIMATE.start_continueInDirection_#t~ret78=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 23:26:54,071 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:26:54,071 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:26:54,078 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:26:54,078 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stopRequestedInDirection_#t~ret75=0} Honda state: {ULTIMATE.start_stopRequestedInDirection_#t~ret75=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 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 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:26:54,099 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:26:54,099 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:26:54,103 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:26:54,103 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stopRequestedAtCurrentFloor_#t~ret83=0} Honda state: {ULTIMATE.start_stopRequestedAtCurrentFloor_#t~ret83=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 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 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:26:54,125 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:26:54,125 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:26:54,133 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:26:54,133 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stopRequestedInDirection_#in~dir=0, ULTIMATE.start_getReverseHeading_~retValue_acc~18=0, ULTIMATE.start_stopRequestedInDirection_~dir=0, ULTIMATE.start_timeShift_~tmp___6~2=0, ULTIMATE.start_getReverseHeading_#res=0} Honda state: {ULTIMATE.start_stopRequestedInDirection_#in~dir=0, ULTIMATE.start_getReverseHeading_~retValue_acc~18=0, ULTIMATE.start_stopRequestedInDirection_~dir=0, ULTIMATE.start_timeShift_~tmp___6~2=0, ULTIMATE.start_getReverseHeading_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:26:54,157 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:26:54,157 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:26:54,161 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:26:54,161 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stopRequestedInDirection_~respectInLiftCalls=1, ULTIMATE.start_stopRequestedInDirection_#in~respectInLiftCalls=1} Honda state: {ULTIMATE.start_stopRequestedInDirection_~respectInLiftCalls=1, ULTIMATE.start_stopRequestedInDirection_#in~respectInLiftCalls=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:26:54,189 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:26:54,189 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:26:54,193 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:26:54,193 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_~tmp___2~4=0} Honda state: {ULTIMATE.start_timeShift_~tmp___2~4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 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 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:26:54,214 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:26:54,215 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:26:54,218 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:26:54,218 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_~tmp___9~2=0} Honda state: {ULTIMATE.start_timeShift_~tmp___9~2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 23:26:54,239 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:26:54,239 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:26:54,243 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:26:54,244 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_#res=1, ULTIMATE.start_isIdle_~tmp~18=1, ULTIMATE.start_anyStopRequested_~retValue_acc~11=1} Honda state: {ULTIMATE.start_anyStopRequested_#res=1, ULTIMATE.start_isIdle_~tmp~18=1, ULTIMATE.start_anyStopRequested_~retValue_acc~11=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 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 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:26:54,266 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:26:54,267 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:26:54,271 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:26:54,271 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_isIdle_#res=0, ULTIMATE.start_isIdle_~retValue_acc~12=0, ULTIMATE.start_cleanup_~tmp~11=0} Honda state: {ULTIMATE.start_isIdle_#res=0, ULTIMATE.start_isIdle_~retValue_acc~12=0, ULTIMATE.start_cleanup_~tmp~11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 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 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:26:54,295 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:26:54,296 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:26:54,300 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:26:54,300 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_#t~ret104=0} Honda state: {ULTIMATE.start_timeShift_#t~ret104=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 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 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:26:54,322 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:26:54,322 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:26:54,326 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:26:54,326 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_#t~ret60=0} Honda state: {ULTIMATE.start_anyStopRequested_#t~ret60=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 23:26:54,346 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:26:54,347 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:26:54,350 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:26:54,351 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_#t~ret98=0} Honda state: {ULTIMATE.start_timeShift_#t~ret98=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 23:26:54,375 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:26:54,376 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:26:54,387 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:26:54,388 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stopRequestedAtCurrentFloor_~tmp~23=1, ULTIMATE.start_isFloorCalling_#res=1, ~calls_0~0=1, ULTIMATE.start_isExecutiveFloorCalling_#res=1, ULTIMATE.start_anyStopRequested_~tmp___3~0=1, ULTIMATE.start_isFloorCalling_~retValue_acc~22=1, ULTIMATE.start_stopRequestedInDirection_~tmp___0~6=1, ULTIMATE.start_isExecutiveFloorCalling_~retValue_acc~20=1} Honda state: {ULTIMATE.start_stopRequestedAtCurrentFloor_~tmp~23=1, ULTIMATE.start_isFloorCalling_#res=1, ~calls_0~0=1, ULTIMATE.start_isExecutiveFloorCalling_#res=1, ULTIMATE.start_anyStopRequested_~tmp___3~0=1, ULTIMATE.start_isFloorCalling_~retValue_acc~22=1, ULTIMATE.start_stopRequestedInDirection_~tmp___0~6=1, ULTIMATE.start_isExecutiveFloorCalling_~retValue_acc~20=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 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 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:26:54,410 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:26:54,410 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:26:54,413 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:26:54,413 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~persons_0~0=1} Honda state: {~persons_0~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 23:26:54,434 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:26:54,434 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 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 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:26:54,461 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:26:54,461 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:26:55,390 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:26:55,390 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~executiveFloor~0=0, ~currentFloorID~0=-8, ULTIMATE.start_getCurrentFloorID_~retValue_acc~6=-5, ULTIMATE.start___utac_acc__Specification9_spec__3_~tmp~27=-8, ULTIMATE.start_getCurrentFloorID_#res=-8, ULTIMATE.start_stopRequestedInDirection_~tmp~20=1, ULTIMATE.start___utac_acc__Specification9_spec__3_~floor~0=-8, ULTIMATE.start_isFloorCalling_#in~floorID=0, ULTIMATE.start_stopRequestedAtCurrentFloor_~tmp___0~8=-2, ULTIMATE.start_isFloorCalling_~floorID=-4} Honda state: {~executiveFloor~0=0, ~currentFloorID~0=-8, ULTIMATE.start_getCurrentFloorID_~retValue_acc~6=-5, ULTIMATE.start___utac_acc__Specification9_spec__3_~tmp~27=-8, ULTIMATE.start_getCurrentFloorID_#res=-8, ULTIMATE.start_stopRequestedInDirection_~tmp~20=1, ULTIMATE.start___utac_acc__Specification9_spec__3_~floor~0=-8, ULTIMATE.start_isFloorCalling_#in~floorID=0, ULTIMATE.start_stopRequestedAtCurrentFloor_~tmp___0~8=-2, ULTIMATE.start_isFloorCalling_~floorID=-4} Generalized eigenvectors: [{~executiveFloor~0=0, ~currentFloorID~0=-1, ULTIMATE.start_getCurrentFloorID_~retValue_acc~6=-1, ULTIMATE.start___utac_acc__Specification9_spec__3_~tmp~27=-1, ULTIMATE.start_getCurrentFloorID_#res=-1, ULTIMATE.start_stopRequestedInDirection_~tmp~20=-1, ULTIMATE.start___utac_acc__Specification9_spec__3_~floor~0=-1, ULTIMATE.start_isFloorCalling_#in~floorID=0, ULTIMATE.start_stopRequestedAtCurrentFloor_~tmp___0~8=-1, ULTIMATE.start_isFloorCalling_~floorID=0}, {~executiveFloor~0=0, ~currentFloorID~0=0, ULTIMATE.start_getCurrentFloorID_~retValue_acc~6=-3, ULTIMATE.start___utac_acc__Specification9_spec__3_~tmp~27=0, ULTIMATE.start_getCurrentFloorID_#res=0, ULTIMATE.start_stopRequestedInDirection_~tmp~20=-8, ULTIMATE.start___utac_acc__Specification9_spec__3_~floor~0=0, ULTIMATE.start_isFloorCalling_#in~floorID=0, ULTIMATE.start_stopRequestedAtCurrentFloor_~tmp___0~8=-5, ULTIMATE.start_isFloorCalling_~floorID=4}, {~executiveFloor~0=0, ~currentFloorID~0=0, ULTIMATE.start_getCurrentFloorID_~retValue_acc~6=0, ULTIMATE.start___utac_acc__Specification9_spec__3_~tmp~27=0, ULTIMATE.start_getCurrentFloorID_#res=0, ULTIMATE.start_stopRequestedInDirection_~tmp~20=0, ULTIMATE.start___utac_acc__Specification9_spec__3_~floor~0=0, ULTIMATE.start_isFloorCalling_#in~floorID=0, ULTIMATE.start_stopRequestedAtCurrentFloor_~tmp___0~8=0, ULTIMATE.start_isFloorCalling_~floorID=0}] Lambdas: [1, 0, 8] Nus: [0, 0] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 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 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:26:55,424 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:26:55,424 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:26:55,439 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:26:55,439 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification9_spec__3_#t~ret158=0} Honda state: {ULTIMATE.start___utac_acc__Specification9_spec__3_#t~ret158=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 23:26:55,479 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:26:55,480 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:26:55,489 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:26:55,489 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stopRequestedInDirection_#t~ret76=0} Honda state: {ULTIMATE.start_stopRequestedInDirection_#t~ret76=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 23:26:55,530 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:26:55,530 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:26:55,542 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:26:55,542 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stopRequestedAtCurrentFloor_#t~ret84=0} Honda state: {ULTIMATE.start_stopRequestedAtCurrentFloor_#t~ret84=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 23:26:55,590 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:26:55,590 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:26:55,602 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:26:55,602 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stopRequestedInDirection_~__cil_tmp7~5=0} Honda state: {ULTIMATE.start_stopRequestedInDirection_~__cil_tmp7~5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 23:26:55,642 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:26:55,642 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:26:55,653 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:26:55,653 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_continueInDirection_~tmp~21=0} Honda state: {ULTIMATE.start_continueInDirection_~tmp~21=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 23:26:55,693 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:26:55,693 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:26:55,703 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:26:55,703 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification9_spec__3_~tmp___1~8=0} Honda state: {ULTIMATE.start___utac_acc__Specification9_spec__3_~tmp___1~8=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 23:26:55,747 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:26:55,747 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:26:55,758 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:26:55,758 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_isIdle_#t~ret63=0} Honda state: {ULTIMATE.start_isIdle_#t~ret63=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 23:26:55,798 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:26:55,798 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:26:55,810 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:26:55,810 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_#t~ret59=0} Honda state: {ULTIMATE.start_anyStopRequested_#t~ret59=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 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 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:26:55,841 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:26:55,841 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:26:55,846 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:26:55,846 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_isEmpty_~retValue_acc~10=0, ULTIMATE.start_isEmpty_#res=0} Honda state: {ULTIMATE.start_isEmpty_~retValue_acc~10=0, ULTIMATE.start_isEmpty_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 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 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:26:55,867 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:26:55,867 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:26:55,871 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:26:55,871 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_~tmp___4~2=0} Honda state: {ULTIMATE.start_timeShift_~tmp___4~2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 23:26:55,892 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:26:55,892 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:26:55,896 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:26:55,896 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_#t~ret61=0} Honda state: {ULTIMATE.start_anyStopRequested_#t~ret61=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 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 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:26:55,919 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:26:55,919 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:26:55,923 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:26:55,923 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stopRequestedAtCurrentFloor_#res=0, ULTIMATE.start_stopRequestedAtCurrentFloor_~retValue_acc~17=0} Honda state: {ULTIMATE.start_stopRequestedAtCurrentFloor_#res=0, ULTIMATE.start_stopRequestedAtCurrentFloor_~retValue_acc~17=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 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 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:26:55,943 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:26:55,944 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:26:55,948 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:26:55,948 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_#t~ret105=0} Honda state: {ULTIMATE.start_timeShift_#t~ret105=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 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 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:26:55,969 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:26:55,970 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:26:55,974 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:26:55,974 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stopRequestedAtCurrentFloor_#t~ret81=0} Honda state: {ULTIMATE.start_stopRequestedAtCurrentFloor_#t~ret81=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 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 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:26:55,995 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:26:55,995 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:26:56,001 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:26:56,001 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stopRequestedInDirection_#t~ret77=0} Honda state: {ULTIMATE.start_stopRequestedInDirection_#t~ret77=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 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 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:26:56,023 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:26:56,023 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:26:56,026 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:26:56,026 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_#t~ret101=0} Honda state: {ULTIMATE.start_timeShift_#t~ret101=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 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 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:26:56,049 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:26:56,049 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:26:56,053 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:26:56,054 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_isExecutiveFloorCalling_#t~ret155=0} Honda state: {ULTIMATE.start_isExecutiveFloorCalling_#t~ret155=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 23:26:56,075 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:26:56,075 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 23:26:56,099 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:26:56,099 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:26:58,575 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:26:58,578 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:26:58,578 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:26:58,578 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:26:58,578 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:26:58,578 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:26:58,578 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:26:58,578 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:26:58,578 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:26:58,579 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec9_product27_true-unreach-call_true-termination.cil.c_Iteration9_Loop [2019-01-01 23:26:58,579 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:26:58,579 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:26:58,583 INFO L141 MapEliminator]: 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:58,595 INFO L141 MapEliminator]: 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:58,598 INFO L141 MapEliminator]: 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:58,613 INFO L141 MapEliminator]: 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:58,617 INFO L141 MapEliminator]: 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:58,630 INFO L141 MapEliminator]: 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:58,632 INFO L141 MapEliminator]: 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:58,637 INFO L141 MapEliminator]: 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:58,645 INFO L141 MapEliminator]: 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:58,651 INFO L141 MapEliminator]: 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:58,656 INFO L141 MapEliminator]: 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:58,673 INFO L141 MapEliminator]: 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:58,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:58,683 INFO L141 MapEliminator]: 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:58,687 INFO L141 MapEliminator]: 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:58,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:26:58,702 INFO L141 MapEliminator]: 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:58,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:26:58,708 INFO L141 MapEliminator]: 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:58,711 INFO L141 MapEliminator]: 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:58,716 INFO L141 MapEliminator]: 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:58,718 INFO L141 MapEliminator]: 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:58,724 INFO L141 MapEliminator]: 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:58,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:26:58,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:58,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:58,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:26:58,771 INFO L141 MapEliminator]: 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:58,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:26:58,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:58,779 INFO L141 MapEliminator]: 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:58,782 INFO L141 MapEliminator]: 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:58,784 INFO L141 MapEliminator]: 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:58,787 INFO L141 MapEliminator]: 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:58,789 INFO L141 MapEliminator]: 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:58,797 INFO L141 MapEliminator]: 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:58,799 INFO L141 MapEliminator]: 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:58,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:58,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:58,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:26:58,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:58,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:26:58,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:58,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:58,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:58,828 INFO L141 MapEliminator]: 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:58,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:58,842 INFO L141 MapEliminator]: 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:58,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:58,849 INFO L141 MapEliminator]: 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:58,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:58,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:58,859 INFO L141 MapEliminator]: 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:58,862 INFO L141 MapEliminator]: 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:58,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:26:58,868 INFO L141 MapEliminator]: 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:58,871 INFO L141 MapEliminator]: 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:58,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:26:58,878 INFO L141 MapEliminator]: 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:58,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:58,888 INFO L141 MapEliminator]: 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:58,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:58,896 INFO L141 MapEliminator]: 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:59,440 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 25 [2019-01-01 23:26:59,718 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:26:59,720 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:26:59,721 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:59,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:26:59,726 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:26:59,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:26:59,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:26:59,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:26:59,727 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:26:59,727 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:26:59,728 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:26:59,728 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:59,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:26:59,729 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:26:59,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:26:59,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:26:59,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:26:59,729 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:26:59,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:26:59,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:26:59,739 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:59,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:26:59,739 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:26:59,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:26:59,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:26:59,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:26:59,740 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:26:59,740 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:26:59,746 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:26:59,747 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:59,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:26:59,751 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:26:59,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:26:59,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:26:59,752 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:26:59,752 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:26:59,752 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:26:59,753 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:26:59,753 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:59,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:26:59,753 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:26:59,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:26:59,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:26:59,754 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:26:59,754 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:26:59,754 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:26:59,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:26:59,755 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:59,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:26:59,759 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:26:59,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:26:59,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:26:59,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:26:59,760 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:26:59,760 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:26:59,760 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:26:59,764 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:59,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:26:59,765 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:26:59,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:26:59,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:26:59,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:26:59,765 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:26:59,765 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:26:59,767 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:26:59,767 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:59,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:26:59,768 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:26:59,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:26:59,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:26:59,768 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:26:59,768 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:26:59,768 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:26:59,769 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:26:59,769 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:59,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:26:59,773 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:26:59,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:26:59,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:26:59,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:26:59,774 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:26:59,774 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:26:59,778 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:26:59,778 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:59,779 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:26:59,779 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:26:59,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:26:59,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:26:59,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:26:59,779 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:26:59,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:26:59,783 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:26:59,784 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:59,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:26:59,784 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:26:59,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:26:59,784 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:26:59,785 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:26:59,785 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:26:59,788 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:26:59,798 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:26:59,806 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:59,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:26:59,806 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:26:59,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:26:59,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:26:59,807 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:26:59,807 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:26:59,807 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:26:59,808 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:26:59,808 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:26:59,808 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:26:59,808 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:26:59,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:26:59,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:26:59,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:26:59,813 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:26:59,813 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:26:59,813 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:26:59,814 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:26:59,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:26:59,814 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:26:59,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:26:59,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:26:59,815 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:26:59,815 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:26:59,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:26:59,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:26:59,824 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:59,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:26:59,824 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:26:59,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:26:59,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:26:59,825 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:26:59,825 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:26:59,826 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:26:59,829 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:26:59,829 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:59,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:26:59,830 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:26:59,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:26:59,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:26:59,830 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:26:59,830 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:26:59,830 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:26:59,833 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:26:59,833 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:59,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:26:59,834 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:26:59,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:26:59,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:26:59,834 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:26:59,834 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:26:59,834 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:26:59,840 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:26:59,840 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:59,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:26:59,843 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:26:59,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:26:59,843 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:26:59,843 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:26:59,844 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:26:59,844 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:26:59,844 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:26:59,845 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:59,849 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:26:59,849 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:26:59,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:26:59,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:26:59,849 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:26:59,850 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:26:59,850 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:26:59,850 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:26:59,854 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:59,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:26:59,854 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:26:59,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:26:59,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:26:59,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:26:59,855 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:26:59,855 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:26:59,860 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:26:59,860 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:59,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:26:59,860 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:26:59,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:26:59,861 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:26:59,861 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:26:59,861 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:26:59,861 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:26:59,864 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:26:59,864 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:59,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:26:59,865 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:26:59,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:26:59,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:26:59,865 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:26:59,865 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:26:59,869 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:26:59,870 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:26:59,871 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:59,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:26:59,871 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:26:59,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:26:59,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:26:59,874 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:26:59,874 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:26:59,874 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:26:59,875 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:26:59,875 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:59,876 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:26:59,876 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:26:59,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:26:59,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:26:59,876 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:26:59,876 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:26:59,876 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:26:59,881 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:26:59,882 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:59,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:26:59,883 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:26:59,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:26:59,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:26:59,893 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:26:59,894 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:26:59,894 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:26:59,903 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:26:59,904 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:59,904 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:26:59,904 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:26:59,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:26:59,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:26:59,904 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:26:59,911 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:26:59,911 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:26:59,912 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:26:59,912 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:59,912 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:26:59,912 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:26:59,916 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:26:59,916 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:26:59,916 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:26:59,916 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:26:59,916 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:26:59,917 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:26:59,917 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:59,922 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:26:59,923 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:26:59,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:26:59,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:26:59,923 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:26:59,924 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:26:59,924 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:26:59,924 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:26:59,925 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:59,925 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:26:59,925 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:26:59,925 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:26:59,925 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:26:59,925 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:26:59,926 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:26:59,926 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:26:59,926 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:26:59,930 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:59,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:26:59,930 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:26:59,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:26:59,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:26:59,931 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:26:59,931 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:26:59,931 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:26:59,934 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:26:59,934 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:59,934 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:26:59,935 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:26:59,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:26:59,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:26:59,935 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:26:59,935 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:26:59,935 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:26:59,936 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:26:59,936 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:59,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:26:59,936 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:26:59,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:26:59,942 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:26:59,942 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:26:59,942 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:26:59,942 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:26:59,943 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:26:59,943 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:59,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:26:59,944 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:26:59,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:26:59,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:26:59,944 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:26:59,944 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:26:59,944 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:26:59,948 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:26:59,948 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:59,949 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:26:59,949 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:26:59,949 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:26:59,949 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:26:59,949 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:26:59,950 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:26:59,950 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:26:59,953 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:26:59,953 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:59,954 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:26:59,954 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:26:59,954 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:26:59,954 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:26:59,954 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:26:59,954 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:26:59,955 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:26:59,955 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:26:59,955 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:59,959 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:26:59,959 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:26:59,959 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:26:59,959 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:26:59,959 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:26:59,960 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:26:59,960 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:26:59,960 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:26:59,962 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:59,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:26:59,962 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:26:59,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:26:59,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:26:59,963 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:26:59,963 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:26:59,963 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:26:59,964 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:26:59,968 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:59,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:26:59,969 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:26:59,969 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:26:59,969 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:26:59,969 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:26:59,969 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:26:59,969 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:26:59,970 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:26:59,970 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:59,970 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:26:59,984 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:26:59,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:26:59,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:26:59,984 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:26:59,984 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:26:59,985 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:26:59,985 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:26:59,985 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:59,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:26:59,986 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:26:59,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:26:59,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:26:59,987 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:26:59,987 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:26:59,987 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:26:59,987 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:26:59,988 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:59,988 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:26:59,988 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:26:59,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:26:59,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:26:59,988 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:26:59,989 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:26:59,989 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:26:59,989 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:26:59,990 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:59,990 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:26:59,990 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:26:59,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:26:59,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:26:59,990 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:26:59,991 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:26:59,993 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:26:59,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:26:59,995 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:59,995 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:26:59,995 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:26:59,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:26:59,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:26:59,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:26:59,998 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:26:59,998 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:26:59,999 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:26:59,999 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:59,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:27:00,000 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:27:00,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:27:00,000 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:27:00,000 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:27:00,000 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:27:00,000 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:27:00,004 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:27:00,005 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:27:00,005 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:27:00,005 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:27:00,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:27:00,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:27:00,005 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:27:00,008 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:27:00,008 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:27:00,009 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:27:00,009 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:27:00,009 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:27:00,010 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:27:00,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:27:00,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:27:00,010 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:27:00,010 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:27:00,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:27:00,014 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:27:00,015 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:27:00,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:27:00,018 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:27:00,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:27:00,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:27:00,018 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:27:00,019 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:27:00,019 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:27:00,019 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:27:00,020 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:27:00,020 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:27:00,020 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:27:00,020 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:27:00,020 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:27:00,020 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:27:00,024 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:27:00,024 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:27:00,025 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:27:00,025 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:27:00,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:27:00,028 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:27:00,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:27:00,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:27:00,028 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:27:00,029 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:27:00,029 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:27:00,029 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:27:00,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:27:00,033 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:27:00,033 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:27:00,034 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:27:00,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:27:00,034 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:27:00,034 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:27:00,034 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:27:00,035 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:27:00,035 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:27:00,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:27:00,035 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:27:00,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:27:00,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:27:00,036 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:27:00,036 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:27:00,036 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:27:00,040 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:27:00,040 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:27:00,041 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:27:00,041 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:27:00,041 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:27:00,041 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:27:00,041 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:27:00,041 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:27:00,041 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:27:00,042 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:27:00,042 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:27:00,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:27:00,045 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:27:00,045 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:27:00,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:27:00,045 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:27:00,045 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:27:00,046 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:27:00,046 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:27:00,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:27:00,050 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:27:00,050 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:27:00,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:27:00,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:27:00,051 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:27:00,051 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:27:00,051 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:27:00,051 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:27:00,052 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:27:00,052 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:27:00,052 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:27:00,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:27:00,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:27:00,052 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:27:00,056 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:27:00,056 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:27:00,057 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:27:00,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:27:00,057 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:27:00,058 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:27:00,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:27:00,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:27:00,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:27:00,058 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:27:00,058 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:27:00,061 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:27:00,061 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:27:00,062 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:27:00,062 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:27:00,062 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:27:00,062 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:27:00,062 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:27:00,062 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:27:00,062 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:27:00,065 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:27:00,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:27:00,066 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:27:00,066 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:27:00,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:27:00,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:27:00,066 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:27:00,070 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:27:00,070 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:27:00,071 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:27:00,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:27:00,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:27:00,071 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:27:00,075 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:27:00,075 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:27:00,075 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:27:00,076 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:27:00,076 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:27:00,076 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:27:00,077 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:27:00,077 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:27:00,077 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:27:00,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:27:00,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:27:00,078 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:27:00,080 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:27:00,080 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:27:00,081 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:27:00,081 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:27:00,082 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:27:00,082 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:27:00,082 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:27:00,082 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:27:00,082 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:27:00,084 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:27:00,084 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:27:00,085 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:27:00,086 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:27:00,088 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:27:00,088 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:27:00,088 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:27:00,088 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:27:00,089 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:27:00,089 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:27:00,089 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:27:00,093 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:27:00,093 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:27:00,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:27:00,094 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:27:00,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:27:00,094 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:27:00,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:27:00,095 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:27:00,095 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:27:00,102 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:27:00,106 INFO L497 LassoAnalysis]: Using template '2-nested'. [2019-01-01 23:27:00,106 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:27:00,107 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:27:00,107 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:27:00,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:27:00,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:27:00,107 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:27:00,107 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:27:00,110 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:27:00,110 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:27:00,111 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:27:00,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:27:00,111 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:27:00,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:27:00,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:27:00,112 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:27:00,112 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:27:00,112 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:27:00,116 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:27:00,116 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:27:00,117 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:27:00,117 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:27:00,117 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:27:00,117 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:27:00,117 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:27:00,118 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:27:00,118 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:27:00,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:27:00,124 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:27:00,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:27:00,124 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:27:00,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:27:00,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:27:00,124 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:27:00,125 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:27:00,125 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:27:00,126 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:27:00,128 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:27:00,128 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:27:00,129 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:27:00,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:27:00,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:27:00,129 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:27:00,129 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:27:00,129 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:27:00,130 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:27:00,134 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:27:00,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:27:00,135 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:27:00,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:27:00,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:27:00,135 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:27:00,135 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:27:00,135 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:27:00,140 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:27:00,140 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:27:00,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:27:00,141 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:27:00,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:27:00,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:27:00,141 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:27:00,142 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:27:00,142 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:27:00,142 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:27:00,146 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:27:00,150 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:27:00,150 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:27:00,150 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:27:00,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:27:00,151 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:27:00,151 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:27:00,151 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:27:00,152 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:27:00,152 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:27:00,153 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:27:00,153 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:27:00,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:27:00,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:27:00,153 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:27:00,153 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:27:00,154 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:27:00,155 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:27:00,155 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:27:00,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:27:00,155 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:27:00,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:27:00,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:27:00,159 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:27:00,159 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:27:00,159 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:27:00,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:27:00,160 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:27:00,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:27:00,161 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:27:00,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:27:00,214 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:27:00,214 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:27:00,215 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:27:00,215 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:27:00,223 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:27:00,226 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:27:00,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:27:00,227 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:27:00,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:27:00,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:27:00,227 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:27:00,227 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:27:00,228 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:27:00,228 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:27:00,229 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:27:00,229 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:27:00,229 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:27:00,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:27:00,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:27:00,230 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:27:00,233 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:27:00,233 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:27:00,234 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:27:00,238 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:27:00,238 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:27:00,238 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:27:00,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:27:00,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:27:00,239 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:27:00,239 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:27:00,239 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:27:00,280 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:27:00,281 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:27:00,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:27:00,281 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:27:00,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:27:00,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:27:00,282 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:27:00,282 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:27:00,283 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:27:00,284 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:27:00,284 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:27:00,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:27:00,285 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:27:00,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:27:00,285 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:27:00,285 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:27:00,285 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:27:00,285 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:27:00,286 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:27:00,289 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:27:00,289 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:27:00,289 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:27:00,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:27:00,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:27:00,290 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:27:00,290 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:27:00,290 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:27:00,291 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:27:00,291 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:27:00,332 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:27:00,332 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:27:00,332 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:27:00,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:27:00,333 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:27:00,333 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:27:00,333 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:27:00,334 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:27:00,335 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:27:00,335 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:27:00,335 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:27:00,336 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:27:00,336 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:27:00,336 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:27:00,336 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:27:00,336 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:27:00,339 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:27:00,340 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:27:00,340 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:27:00,341 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:27:00,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:27:00,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:27:00,341 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:27:00,341 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:27:00,341 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:27:00,348 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:27:00,348 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:27:00,348 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:27:00,349 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:27:00,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:27:00,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:27:00,403 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:27:00,403 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:27:00,404 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:27:00,404 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:27:00,405 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:27:00,405 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:27:00,405 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:27:00,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:27:00,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:27:00,406 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:27:00,406 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:27:00,406 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:27:00,411 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:27:00,414 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:27:00,415 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:27:00,415 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:27:00,415 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:27:00,415 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:27:00,415 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:27:00,416 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:27:00,417 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:27:00,418 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:27:00,421 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:27:00,421 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:27:00,421 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:27:00,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:27:00,422 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:27:00,422 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:27:00,422 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:27:00,422 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:27:00,468 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:27:00,468 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:27:00,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:27:00,469 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:27:00,469 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:27:00,469 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:27:00,469 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:27:00,472 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:27:00,473 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:27:00,482 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:27:00,483 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:27:00,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:27:00,483 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:27:00,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:27:00,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:27:00,484 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:27:00,484 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:27:00,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:27:00,487 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:27:00,487 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:27:00,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:27:00,488 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:27:00,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:27:00,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:27:00,488 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:27:00,488 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:27:00,489 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:27:00,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:27:00,489 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:27:00,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:27:00,530 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:27:00,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:27:00,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:27:00,531 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:27:00,531 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:27:00,531 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:27:00,532 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:27:00,532 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:27:00,532 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:27:00,532 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:27:00,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:27:00,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:27:00,533 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:27:00,533 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:27:00,533 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:27:00,535 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:27:00,536 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:27:00,536 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:27:00,536 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:27:00,536 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:27:00,536 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:27:00,540 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:27:00,540 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:27:00,540 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:27:00,541 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:27:00,541 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:27:00,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:27:00,545 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:27:00,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:27:00,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:27:00,602 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:27:00,603 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:27:00,603 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:27:00,604 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:27:00,604 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:27:00,605 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:27:00,605 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:27:00,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:27:00,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:27:00,605 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:27:00,605 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:27:00,606 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:27:00,606 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:27:00,607 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:27:00,607 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:27:00,607 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:27:00,607 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:27:00,607 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:27:00,607 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:27:00,608 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:27:00,608 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:27:00,608 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:27:00,609 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:27:00,609 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:27:00,609 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:27:00,609 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:27:00,609 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:27:00,609 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:27:00,614 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:27:00,615 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:27:00,657 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:27:00,657 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:27:00,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:27:00,657 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:27:00,658 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:27:00,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:27:00,659 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:27:00,659 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:27:00,659 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:27:00,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:27:00,661 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:27:00,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:27:00,661 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:27:00,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:27:00,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:27:00,661 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:27:00,662 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:27:00,662 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:27:00,662 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:27:00,663 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:27:00,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:27:00,663 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:27:00,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:27:00,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:27:00,663 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:27:00,665 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:27:00,665 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:27:00,666 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:27:00,667 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:27:00,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:27:00,726 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:27:00,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:27:00,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:27:00,727 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:27:00,727 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:27:00,727 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:27:00,728 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:27:00,728 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:27:00,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:27:00,729 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:27:00,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:27:00,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:27:00,729 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:27:00,729 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:27:00,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:27:00,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:27:00,730 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:27:00,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:27:00,730 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:27:00,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:27:00,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:27:00,733 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:27:00,733 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:27:00,733 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:27:00,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:27:00,737 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:27:00,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:27:00,738 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:27:00,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:27:00,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:27:00,787 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:27:00,787 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:27:00,787 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:27:00,788 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:27:00,788 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:27:00,789 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:27:00,789 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:27:00,789 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:27:00,789 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:27:00,789 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:27:00,789 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:27:00,794 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:27:00,795 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:27:00,795 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:27:00,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:27:00,796 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:27:00,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:27:00,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:27:00,796 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:27:00,796 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:27:00,796 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:27:00,797 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:27:00,797 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:27:00,797 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:27:00,798 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:27:00,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:27:00,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:27:00,798 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:27:00,798 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:27:00,798 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:27:00,839 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:27:00,839 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:27:00,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:27:00,840 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:27:00,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:27:00,840 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:27:00,840 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:27:00,840 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:27:00,840 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:27:00,841 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:27:00,841 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:27:00,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:27:00,842 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:27:00,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:27:00,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:27:00,842 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:27:00,843 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:27:00,843 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:27:00,845 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:27:00,882 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-01-01 23:27:00,882 INFO L444 ModelExtractionUtils]: 2 out of 9 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-01 23:27:00,883 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:27:00,883 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:27:00,883 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:27:00,883 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function 2-nested ranking function: f0 = 1*~cleanupTimeShifts~0 - 1*ULTIMATE.start_cleanup_~i~2 f1 = 1*ULTIMATE.start_cleanup_~__cil_tmp4~2 - 1*ULTIMATE.start_cleanup_~i~2 Supporting invariants [] [2019-01-01 23:27:00,884 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:27:01,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:27:01,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:27:01,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:27:01,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:27:01,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:27:01,910 WARN L181 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 19 [2019-01-01 23:27:02,050 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:27:02,050 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 23:27:02,051 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 137738 states and 252175 transitions. cyclomatic complexity: 114480 Second operand 4 states. [2019-01-01 23:27:04,025 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 137738 states and 252175 transitions. cyclomatic complexity: 114480. Second operand 4 states. Result 280606 states and 515455 transitions. Complement of second has 7 states. [2019-01-01 23:27:04,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 23:27:04,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 23:27:04,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4846 transitions. [2019-01-01 23:27:04,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 4846 transitions. Stem has 51 letters. Loop has 49 letters. [2019-01-01 23:27:04,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:27:04,031 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 23:27:04,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:27:04,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:27:04,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:27:04,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:27:04,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:27:04,495 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:27:04,495 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 23:27:04,496 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 137738 states and 252175 transitions. cyclomatic complexity: 114480 Second operand 4 states. [2019-01-01 23:27:05,553 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 137738 states and 252175 transitions. cyclomatic complexity: 114480. Second operand 4 states. Result 278264 states and 508653 transitions. Complement of second has 6 states. [2019-01-01 23:27:05,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 23:27:05,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 23:27:05,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4847 transitions. [2019-01-01 23:27:05,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 4847 transitions. Stem has 51 letters. Loop has 49 letters. [2019-01-01 23:27:05,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:27:05,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 4847 transitions. Stem has 100 letters. Loop has 49 letters. [2019-01-01 23:27:05,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:27:05,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 4847 transitions. Stem has 51 letters. Loop has 98 letters. [2019-01-01 23:27:05,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:27:05,560 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 278264 states and 508653 transitions. [2019-01-01 23:27:06,405 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:27:06,406 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 278264 states to 0 states and 0 transitions. [2019-01-01 23:27:06,406 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 23:27:06,406 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 23:27:06,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 23:27:06,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:27:06,406 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:27:06,406 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:27:06,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 23:27:06,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 23:27:06,407 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 4 states. [2019-01-01 23:27:06,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:27:06,407 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-01 23:27:06,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-01 23:27:06,407 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-01 23:27:06,407 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:27:06,407 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 23:27:06,407 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 23:27:06,408 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 23:27:06,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 23:27:06,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:27:06,408 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:27:06,408 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:27:06,408 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:27:06,408 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-01 23:27:06,408 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 23:27:06,408 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:27:06,408 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 23:27:06,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 11:27:06 BoogieIcfgContainer [2019-01-01 23:27:06,416 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 23:27:06,417 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 23:27:06,417 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 23:27:06,417 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 23:27:06,418 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:24:54" (3/4) ... [2019-01-01 23:27:06,422 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 23:27:06,422 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 23:27:06,423 INFO L168 Benchmark]: Toolchain (without parser) took 144887.82 ms. Allocated memory was 1.0 GB in the beginning and 6.3 GB in the end (delta: 5.3 GB). Free memory was 941.8 MB in the beginning and 2.8 GB in the end (delta: -1.9 GB). Peak memory consumption was 3.4 GB. Max. memory is 11.5 GB. [2019-01-01 23:27:06,424 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:27:06,425 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1142.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 941.8 MB in the beginning and 1.1 GB in the end (delta: -174.1 MB). Peak memory consumption was 51.1 MB. Max. memory is 11.5 GB. [2019-01-01 23:27:06,425 INFO L168 Benchmark]: Boogie Procedure Inliner took 245.38 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: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. [2019-01-01 23:27:06,427 INFO L168 Benchmark]: Boogie Preprocessor took 230.09 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: 33.7 MB). Peak memory consumption was 33.7 MB. Max. memory is 11.5 GB. [2019-01-01 23:27:06,428 INFO L168 Benchmark]: RCFGBuilder took 10963.88 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.1 GB in the beginning and 1.2 GB in the end (delta: -188.4 MB). Peak memory consumption was 376.7 MB. Max. memory is 11.5 GB. [2019-01-01 23:27:06,428 INFO L168 Benchmark]: BuchiAutomizer took 132294.48 ms. Allocated memory was 1.4 GB in the beginning and 6.3 GB in the end (delta: 4.9 GB). Free memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: -1.6 GB). Peak memory consumption was 3.4 GB. Max. memory is 11.5 GB. [2019-01-01 23:27:06,429 INFO L168 Benchmark]: Witness Printer took 5.57 ms. Allocated memory is still 6.3 GB. Free memory is still 2.8 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:27:06,440 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 1142.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 941.8 MB in the beginning and 1.1 GB in the end (delta: -174.1 MB). Peak memory consumption was 51.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 245.38 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: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 230.09 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: 33.7 MB). Peak memory consumption was 33.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 10963.88 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.1 GB in the beginning and 1.2 GB in the end (delta: -188.4 MB). Peak memory consumption was 376.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 132294.48 ms. Allocated memory was 1.4 GB in the beginning and 6.3 GB in the end (delta: 4.9 GB). Free memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: -1.6 GB). Peak memory consumption was 3.4 GB. Max. memory is 11.5 GB. * Witness Printer took 5.57 ms. Allocated memory is still 6.3 GB. Free memory is still 2.8 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 12 terminating modules (9 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function currentFloorID and consists of 85 locations. One deterministic module has affine ranking function doorState and consists of 3 locations. One deterministic module has 2-nested ranking function (if cleanupTimeShifts + -1 * i > 0 then 1 else 0), (if cleanupTimeShifts + -1 * i > 0 then cleanupTimeShifts + -1 * i else __cil_tmp4 + -1 * i) and consists of 4 locations. 9 modules have a trivial ranking function, the largest among these consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 132.2s and 10 iterations. TraceHistogramMax:1. Analysis of lassos took 29.7s. Construction of modules took 22.5s. Büchi inclusion checks took 35.3s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 7. Automata minimization 21.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 871737 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 20.7s Buchi closure took 0.7s. Biggest automaton had 137738 states and ocurred in iteration 8. Nontrivial modules had stage [2, 1, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 72314 SDtfs, 428422 SDslu, 226119 SDs, 0 SdLazy, 14107 SolverSat, 2731 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22.5s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI6 SILT3 lasso0 LassoPreprocessingBenchmarks: Lassos: inital199 mio100 ax100 hnf99 lsp19 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq213 hnf87 smp96 dnf198 smp73 tf102 neg97 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 61ms VariablesStem: 0 VariablesLoop: 6 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 68 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 5.6s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...