./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/elevator_spec2_product23_true-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/product-lines/elevator_spec2_product23_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 5e4f3b5735edc8786938ae1ba6d0b1655a9d7c04 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 04:01:14,396 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:01:14,398 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:01:14,416 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:01:14,417 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:01:14,418 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:01:14,420 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:01:14,422 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:01:14,424 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:01:14,428 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:01:14,431 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:01:14,432 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:01:14,432 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:01:14,435 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:01:14,436 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:01:14,444 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:01:14,445 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:01:14,449 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:01:14,454 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:01:14,456 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:01:14,457 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:01:14,458 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:01:14,460 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:01:14,460 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:01:14,461 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:01:14,462 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:01:14,463 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:01:14,464 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:01:14,464 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:01:14,466 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:01:14,466 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:01:14,467 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:01:14,467 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:01:14,467 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:01:14,468 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:01:14,469 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:01:14,469 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 04:01:14,491 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:01:14,491 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:01:14,493 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:01:14,493 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:01:14,493 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:01:14,494 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:01:14,494 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:01:14,494 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:01:14,494 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:01:14,494 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:01:14,495 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:01:14,495 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:01:14,495 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:01:14,495 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:01:14,495 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:01:14,495 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:01:14,496 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:01:14,497 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:01:14,497 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:01:14,497 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:01:14,497 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:01:14,497 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:01:14,497 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:01:14,498 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:01:14,498 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:01:14,498 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:01:14,498 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:01:14,498 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:01:14,499 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:01:14,501 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:01:14,501 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:01:14,502 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:01:14,502 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 -> 5e4f3b5735edc8786938ae1ba6d0b1655a9d7c04 [2019-01-14 04:01:14,546 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:01:14,558 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:01:14,562 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:01:14,564 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:01:14,564 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:01:14,565 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/elevator_spec2_product23_true-unreach-call_true-termination.cil.c [2019-01-14 04:01:14,619 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/213d6dedf/5ec08b20169a47e2a9a9f1fc2785db0f/FLAGee9efbb03 [2019-01-14 04:01:15,222 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:01:15,223 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/elevator_spec2_product23_true-unreach-call_true-termination.cil.c [2019-01-14 04:01:15,246 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/213d6dedf/5ec08b20169a47e2a9a9f1fc2785db0f/FLAGee9efbb03 [2019-01-14 04:01:15,415 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/213d6dedf/5ec08b20169a47e2a9a9f1fc2785db0f [2019-01-14 04:01:15,419 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:01:15,420 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:01:15,421 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:01:15,422 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:01:15,425 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:01:15,426 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:01:15" (1/1) ... [2019-01-14 04:01:15,430 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b9e4c70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:01:15, skipping insertion in model container [2019-01-14 04:01:15,430 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:01:15" (1/1) ... [2019-01-14 04:01:15,438 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:01:15,523 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:01:16,270 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:01:16,394 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:01:16,527 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:01:16,607 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:01:16,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:01:16 WrapperNode [2019-01-14 04:01:16,608 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:01:16,609 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:01:16,609 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:01:16,609 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:01:16,618 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:01:16" (1/1) ... [2019-01-14 04:01:16,672 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:01:16" (1/1) ... [2019-01-14 04:01:16,941 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:01:16,941 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:01:16,942 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:01:16,942 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:01:16,957 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:01:16" (1/1) ... [2019-01-14 04:01:16,957 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:01:16" (1/1) ... [2019-01-14 04:01:16,986 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:01:16" (1/1) ... [2019-01-14 04:01:16,987 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:01:16" (1/1) ... [2019-01-14 04:01:17,076 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:01:16" (1/1) ... [2019-01-14 04:01:17,160 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:01:16" (1/1) ... [2019-01-14 04:01:17,182 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:01:16" (1/1) ... [2019-01-14 04:01:17,216 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:01:17,217 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:01:17,217 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:01:17,217 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:01:17,219 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:01:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:01:17,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 04:01:17,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-14 04:01:17,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:01:17,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:01:30,295 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:01:30,295 INFO L286 CfgBuilder]: Removed 845 assue(true) statements. [2019-01-14 04:01:30,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:01:30 BoogieIcfgContainer [2019-01-14 04:01:30,299 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:01:30,300 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:01:30,300 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:01:30,303 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:01:30,304 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:01:30,305 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:01:15" (1/3) ... [2019-01-14 04:01:30,306 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7cd99084 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:01:30, skipping insertion in model container [2019-01-14 04:01:30,306 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:01:30,306 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:01:16" (2/3) ... [2019-01-14 04:01:30,307 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7cd99084 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:01:30, skipping insertion in model container [2019-01-14 04:01:30,307 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:01:30,308 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:01:30" (3/3) ... [2019-01-14 04:01:30,310 INFO L375 chiAutomizerObserver]: Analyzing ICFG elevator_spec2_product23_true-unreach-call_true-termination.cil.c [2019-01-14 04:01:30,356 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:01:30,357 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:01:30,357 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:01:30,357 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:01:30,357 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:01:30,357 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:01:30,358 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:01:30,358 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:01:30,358 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:01:30,444 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3563 states. [2019-01-14 04:01:30,585 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1771 [2019-01-14 04:01:30,585 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:01:30,585 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:01:30,611 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:01:30,612 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:01:30,612 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:01:30,612 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3563 states. [2019-01-14 04:01:30,663 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1771 [2019-01-14 04:01:30,663 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:01:30,663 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:01:30,669 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:01:30,669 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:01:30,684 INFO L794 eck$LassoCheckResult]: Stem: 1561#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~floorButtons_spc2_0~0 := 0;~floorButtons_spc2_1~0 := 0;~floorButtons_spc2_2~0 := 0;~floorButtons_spc2_3~0 := 0;~floorButtons_spc2_4~0 := 0;~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~head~0.base, ~head~0.offset := 0, 0;call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(30);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(9);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(21);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(30);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(9);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(21);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(30);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(9);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(25);call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(30);call #t~string38.base, #t~string38.offset := #Ultimate.allocOnStack(9);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(25);~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~string121.base, #t~string121.offset := #Ultimate.allocOnStack(10);call #t~string123.base, #t~string123.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string123.base, #t~string123.offset, 1);call write~init~int(95, #t~string123.base, 1 + #t~string123.offset, 1);call write~init~int(93, #t~string123.base, 2 + #t~string123.offset, 1);call write~init~int(0, #t~string123.base, 3 + #t~string123.offset, 1);call #t~string125.base, #t~string125.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string125.base, #t~string125.offset, 1);call write~init~int(93, #t~string125.base, 1 + #t~string125.offset, 1);call write~init~int(32, #t~string125.base, 2 + #t~string125.offset, 1);call write~init~int(0, #t~string125.base, 3 + #t~string125.offset, 1);call #t~string127.base, #t~string127.offset := #Ultimate.allocOnStack(5);call write~init~int(32, #t~string127.base, #t~string127.offset, 1);call write~init~int(97, #t~string127.base, 1 + #t~string127.offset, 1);call write~init~int(116, #t~string127.base, 2 + #t~string127.offset, 1);call write~init~int(32, #t~string127.base, 3 + #t~string127.offset, 1);call write~init~int(0, #t~string127.base, 4 + #t~string127.offset, 1);call #t~string129.base, #t~string129.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string129.base, #t~string129.offset, 1);call write~init~int(105, #t~string129.base, 1 + #t~string129.offset, 1);call write~init~int(0, #t~string129.base, 2 + #t~string129.offset, 1);call #t~string131.base, #t~string131.offset := #Ultimate.allocOnStack(10);call #t~string133.base, #t~string133.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string133.base, #t~string133.offset, 1);call write~init~int(112, #t~string133.base, 1 + #t~string133.offset, 1);call write~init~int(0, #t~string133.base, 2 + #t~string133.offset, 1);call #t~string135.base, #t~string135.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string135.base, #t~string135.offset, 1);call write~init~int(111, #t~string135.base, 1 + #t~string135.offset, 1);call write~init~int(119, #t~string135.base, 2 + #t~string135.offset, 1);call write~init~int(110, #t~string135.base, 3 + #t~string135.offset, 1);call write~init~int(0, #t~string135.base, 4 + #t~string135.offset, 1);call #t~string137.base, #t~string137.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string137.base, #t~string137.offset, 1);call write~init~int(73, #t~string137.base, 1 + #t~string137.offset, 1);call write~init~int(76, #t~string137.base, 2 + #t~string137.offset, 1);call write~init~int(95, #t~string137.base, 3 + #t~string137.offset, 1);call write~init~int(112, #t~string137.base, 4 + #t~string137.offset, 1);call write~init~int(58, #t~string137.base, 5 + #t~string137.offset, 1);call write~init~int(0, #t~string137.base, 6 + #t~string137.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~string141.base, #t~string141.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string141.base, #t~string141.offset, 1);call write~init~int(37, #t~string141.base, 1 + #t~string141.offset, 1);call write~init~int(105, #t~string141.base, 2 + #t~string141.offset, 1);call write~init~int(0, #t~string141.base, 3 + #t~string141.offset, 1);call #t~string143.base, #t~string143.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string143.base, #t~string143.offset, 1);call write~init~int(37, #t~string143.base, 1 + #t~string143.offset, 1);call write~init~int(105, #t~string143.base, 2 + #t~string143.offset, 1);call write~init~int(0, #t~string143.base, 3 + #t~string143.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~string147.base, #t~string147.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string147.base, #t~string147.offset, 1);call write~init~int(37, #t~string147.base, 1 + #t~string147.offset, 1);call write~init~int(105, #t~string147.base, 2 + #t~string147.offset, 1);call write~init~int(0, #t~string147.base, 3 + #t~string147.offset, 1);call #t~string149.base, #t~string149.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string149.base, #t~string149.offset, 1);call write~init~int(70, #t~string149.base, 1 + #t~string149.offset, 1);call write~init~int(95, #t~string149.base, 2 + #t~string149.offset, 1);call write~init~int(112, #t~string149.base, 3 + #t~string149.offset, 1);call write~init~int(58, #t~string149.base, 4 + #t~string149.offset, 1);call write~init~int(0, #t~string149.base, 5 + #t~string149.offset, 1);call #t~string152.base, #t~string152.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string152.base, #t~string152.offset, 1);call write~init~int(37, #t~string152.base, 1 + #t~string152.offset, 1);call write~init~int(105, #t~string152.base, 2 + #t~string152.offset, 1);call write~init~int(0, #t~string152.base, 3 + #t~string152.offset, 1);call #t~string155.base, #t~string155.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string155.base, #t~string155.offset, 1);call write~init~int(37, #t~string155.base, 1 + #t~string155.offset, 1);call write~init~int(105, #t~string155.base, 2 + #t~string155.offset, 1);call write~init~int(0, #t~string155.base, 3 + #t~string155.offset, 1);call #t~string158.base, #t~string158.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string158.base, #t~string158.offset, 1);call write~init~int(37, #t~string158.base, 1 + #t~string158.offset, 1);call write~init~int(105, #t~string158.base, 2 + #t~string158.offset, 1);call write~init~int(0, #t~string158.base, 3 + #t~string158.offset, 1);call #t~string161.base, #t~string161.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string161.base, #t~string161.offset, 1);call write~init~int(37, #t~string161.base, 1 + #t~string161.offset, 1);call write~init~int(105, #t~string161.base, 2 + #t~string161.offset, 1);call write~init~int(0, #t~string161.base, 3 + #t~string161.offset, 1);call #t~string164.base, #t~string164.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string164.base, #t~string164.offset, 1);call write~init~int(37, #t~string164.base, 1 + #t~string164.offset, 1);call write~init~int(105, #t~string164.base, 2 + #t~string164.offset, 1);call write~init~int(0, #t~string164.base, 3 + #t~string164.offset, 1);call #t~string166.base, #t~string166.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string166.base, #t~string166.offset, 1);call write~init~int(0, #t~string166.base, 1 + #t~string166.offset, 1); 2711#L-1true havoc main_#res;havoc main_#t~ret55, main_~retValue_acc~9, main_~tmp~12;havoc main_~retValue_acc~9;havoc main_~tmp~12; 442#L251true havoc valid_product_#res;havoc valid_product_~retValue_acc~1;havoc valid_product_~retValue_acc~1;valid_product_~retValue_acc~1 := 1;valid_product_#res := valid_product_~retValue_acc~1; 299#L259true main_#t~ret55 := valid_product_#res;main_~tmp~12 := main_#t~ret55;havoc main_#t~ret55; 1197#L1642true assume 0 != main_~tmp~12; 2264#L1616true ~floorButtons_spc2_0~0 := 0;~floorButtons_spc2_1~0 := 0;~floorButtons_spc2_2~0 := 0;~floorButtons_spc2_3~0 := 0;~floorButtons_spc2_4~0 := 0; 1096#L59true havoc bigMacCall_#t~ret48, bigMacCall_~tmp~9;havoc bigMacCall_~tmp~9;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~11;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~11; 1308#L1814true assume 0 == getOrigin_~person;getOrigin_~retValue_acc~11 := 4;getOrigin_#res := getOrigin_~retValue_acc~11; 477#L1839true bigMacCall_#t~ret48 := getOrigin_#res;bigMacCall_~tmp~9 := bigMacCall_#t~ret48;havoc bigMacCall_#t~ret48;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~9;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 3562#L624true assume 0 == initPersonOnFloor_~floor; 3507#L625true assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 1373#L732-1true callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 241#L416true assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 415#L428-2true havoc cleanup_#t~ret49, cleanup_#t~ret50, cleanup_~i~0, cleanup_~tmp~10, cleanup_~tmp___0~1, cleanup_~__cil_tmp4~2;havoc cleanup_~i~0;havoc cleanup_~tmp~10;havoc cleanup_~tmp___0~1;havoc cleanup_~__cil_tmp4~2;havoc timeShift_#t~ret110, timeShift_#t~ret111, timeShift_#t~ret112, timeShift_#t~ret113, timeShift_#t~ret114, timeShift_#t~ret115, timeShift_#t~ret116, timeShift_#t~ret117, timeShift_#t~ret118, timeShift_#t~ret119, timeShift_#t~ret120, timeShift_~tmp~27, timeShift_~tmp___0~12, timeShift_~tmp___1~7, timeShift_~tmp___2~5, timeShift_~tmp___3~4, timeShift_~tmp___4~3, timeShift_~tmp___5~2, timeShift_~tmp___6~2, timeShift_~tmp___7~2, timeShift_~tmp___8~2, timeShift_~tmp___9~2;havoc timeShift_~tmp~27;havoc timeShift_~tmp___0~12;havoc timeShift_~tmp___1~7;havoc timeShift_~tmp___2~5;havoc timeShift_~tmp___3~4;havoc timeShift_~tmp___4~3;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~ret94, stopRequestedAtCurrentFloor_#t~ret95, stopRequestedAtCurrentFloor_#t~ret96, stopRequestedAtCurrentFloor_#t~ret97, stopRequestedAtCurrentFloor_~retValue_acc~27, stopRequestedAtCurrentFloor_~tmp~25, stopRequestedAtCurrentFloor_~tmp___0~10;havoc stopRequestedAtCurrentFloor_~retValue_acc~27;havoc stopRequestedAtCurrentFloor_~tmp~25;havoc stopRequestedAtCurrentFloor_~tmp___0~10;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret168, isExecutiveFloorCalling_~retValue_acc~30;havoc isExecutiveFloorCalling_~retValue_acc~30;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~2;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~2; 2589#L353true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~2 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~2; 1364#L380true isExecutiveFloorCalling_#t~ret168 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~30 := isExecutiveFloorCalling_#t~ret168;havoc isExecutiveFloorCalling_#t~ret168;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~30; 1911#L3470true stopRequestedAtCurrentFloor_#t~ret94 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~25 := stopRequestedAtCurrentFloor_#t~ret94;havoc stopRequestedAtCurrentFloor_#t~ret94; 1833#L2855true assume 0 != stopRequestedAtCurrentFloor_~tmp~25;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~14;havoc getCurrentFloorID_~retValue_acc~14;getCurrentFloorID_~retValue_acc~14 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~14; 2376#L2118true stopRequestedAtCurrentFloor_#t~ret95 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~10 := stopRequestedAtCurrentFloor_#t~ret95;havoc stopRequestedAtCurrentFloor_#t~ret95; 1013#L2859true assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~10);stopRequestedAtCurrentFloor_~retValue_acc~27 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~27; 1274#L2872true timeShift_#t~ret110 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret110;havoc timeShift_#t~ret110; 3114#L3007true assume !(0 != timeShift_~tmp___9~2); 2907#L3098true assume !(1 == ~doorState~0); 2893#L3098-2true stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret85, stopRequestedInDirection_#t~ret86, stopRequestedInDirection_#t~ret87, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~23, stopRequestedInDirection_~tmp~21, stopRequestedInDirection_~tmp___0~7, stopRequestedInDirection_~__cil_tmp7~5, stopRequestedInDirection_~__cil_tmp8~6;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~23;havoc stopRequestedInDirection_~tmp~21;havoc stopRequestedInDirection_~tmp___0~7;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~6;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret168, isExecutiveFloorCalling_~retValue_acc~30;havoc isExecutiveFloorCalling_~retValue_acc~30;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~2;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~2; 2579#L353-3true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~2 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~2; 1352#L380-3true isExecutiveFloorCalling_#t~ret168 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~30 := isExecutiveFloorCalling_#t~ret168;havoc isExecutiveFloorCalling_#t~ret168;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~30; 1906#L3470-1true stopRequestedInDirection_#t~ret85 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~7 := stopRequestedInDirection_#t~ret85;havoc stopRequestedInDirection_#t~ret85; 119#L2710true assume 0 != stopRequestedInDirection_~tmp___0~7;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~14;havoc getCurrentFloorID_~retValue_acc~14;getCurrentFloorID_~retValue_acc~14 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~14; 2354#L2118-3true stopRequestedInDirection_#t~ret86 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~21 := stopRequestedInDirection_#t~ret86;havoc stopRequestedInDirection_#t~ret86;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~6 := (if stopRequestedInDirection_~tmp~21 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~23 := (if stopRequestedInDirection_~__cil_tmp8~6 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~23; 281#L2723true timeShift_#t~ret117 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret117;havoc timeShift_#t~ret117; 1418#L3106true assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret88, continueInDirection_~dir, continueInDirection_~tmp~22;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~22;~currentHeading~0 := continueInDirection_~dir; 1839#L2767true assume !(1 == ~currentHeading~0); 865#L2777true assume !(0 == ~currentFloorID~0); 867#L2777-2true assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 1305#L2783-5true havoc __utac_acc__Specification2_spec__3_#t~ret0, __utac_acc__Specification2_spec__3_#t~ret1, __utac_acc__Specification2_spec__3_#t~ret2, __utac_acc__Specification2_spec__3_#t~ret3, __utac_acc__Specification2_spec__3_#t~ret4, __utac_acc__Specification2_spec__3_#t~ret5, __utac_acc__Specification2_spec__3_~floor~0, __utac_acc__Specification2_spec__3_~tmp~0, __utac_acc__Specification2_spec__3_~tmp___0~0, __utac_acc__Specification2_spec__3_~tmp___1~0, __utac_acc__Specification2_spec__3_~tmp___2~0, __utac_acc__Specification2_spec__3_~tmp___3~0, __utac_acc__Specification2_spec__3_~tmp___4~0;havoc __utac_acc__Specification2_spec__3_~floor~0;havoc __utac_acc__Specification2_spec__3_~tmp~0;havoc __utac_acc__Specification2_spec__3_~tmp___0~0;havoc __utac_acc__Specification2_spec__3_~tmp___1~0;havoc __utac_acc__Specification2_spec__3_~tmp___2~0;havoc __utac_acc__Specification2_spec__3_~tmp___3~0;havoc __utac_acc__Specification2_spec__3_~tmp___4~0;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~14;havoc getCurrentFloorID_~retValue_acc~14;getCurrentFloorID_~retValue_acc~14 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~14; 2363#L2118-5true __utac_acc__Specification2_spec__3_#t~ret0 := getCurrentFloorID_#res;__utac_acc__Specification2_spec__3_~tmp~0 := __utac_acc__Specification2_spec__3_#t~ret0;havoc __utac_acc__Specification2_spec__3_#t~ret0;__utac_acc__Specification2_spec__3_~floor~0 := __utac_acc__Specification2_spec__3_~tmp~0; 3003#L104true assume 0 == __utac_acc__Specification2_spec__3_~floor~0; 1673#L105true assume 0 != ~floorButtons_spc2_0~0;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~15;havoc areDoorsOpen_~retValue_acc~15;areDoorsOpen_~retValue_acc~15 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~15; 3264#L2127true __utac_acc__Specification2_spec__3_#t~ret1 := areDoorsOpen_#res;__utac_acc__Specification2_spec__3_~tmp___4~0 := __utac_acc__Specification2_spec__3_#t~ret1;havoc __utac_acc__Specification2_spec__3_#t~ret1; 1487#L109true assume 0 != __utac_acc__Specification2_spec__3_~tmp___4~0;~floorButtons_spc2_0~0 := 0; 404#L164true cleanup_~i~0 := 0; 1811#L1446-2true [2019-01-14 04:01:30,695 INFO L796 eck$LassoCheckResult]: Loop: 1811#L1446-2true assume !false; 1899#L1447true cleanup_~__cil_tmp4~2 := ~cleanupTimeShifts~0 - 1; 1083#L1450true assume cleanup_~i~0 < cleanup_~__cil_tmp4~2;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~13;havoc isBlocked_~retValue_acc~13;isBlocked_~retValue_acc~13 := 0;isBlocked_#res := isBlocked_~retValue_acc~13; 1413#L1961true cleanup_#t~ret49 := isBlocked_#res;cleanup_~tmp___0~1 := cleanup_#t~ret49;havoc cleanup_#t~ret49; 781#L1454true assume 1 != cleanup_~tmp___0~1; 783#L1454-1true havoc isIdle_#res;havoc isIdle_#t~ret69, isIdle_~retValue_acc~20, isIdle_~tmp~18;havoc isIdle_~retValue_acc~20;havoc isIdle_~tmp~18;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret64, anyStopRequested_#t~ret65, anyStopRequested_#t~ret66, anyStopRequested_#t~ret67, anyStopRequested_#t~ret68, anyStopRequested_~retValue_acc~19, anyStopRequested_~tmp~17, anyStopRequested_~tmp___0~5, anyStopRequested_~tmp___1~4, anyStopRequested_~tmp___2~2, anyStopRequested_~tmp___3~1;havoc anyStopRequested_~retValue_acc~19;havoc anyStopRequested_~tmp~17;havoc anyStopRequested_~tmp___0~5;havoc anyStopRequested_~tmp___1~4;havoc anyStopRequested_~tmp___2~2;havoc anyStopRequested_~tmp___3~1;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~2;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~2; 2630#L353-65true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~2 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~2; 2308#L380-65true anyStopRequested_#t~ret64 := isFloorCalling_#res;anyStopRequested_~tmp___3~1 := anyStopRequested_#t~ret64;havoc anyStopRequested_#t~ret64; 1463#L2226true assume 0 != anyStopRequested_~tmp___3~1;anyStopRequested_~retValue_acc~19 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~19; 2768#L2290true isIdle_#t~ret69 := anyStopRequested_#res;isIdle_~tmp~18 := isIdle_#t~ret69;havoc isIdle_#t~ret69;isIdle_~retValue_acc~20 := (if 0 == isIdle_~tmp~18 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~20; 3078#L2303true cleanup_#t~ret50 := isIdle_#res;cleanup_~tmp~10 := cleanup_#t~ret50;havoc cleanup_#t~ret50; 1196#L1466true assume !(0 != cleanup_~tmp~10);havoc timeShift_#t~ret110, timeShift_#t~ret111, timeShift_#t~ret112, timeShift_#t~ret113, timeShift_#t~ret114, timeShift_#t~ret115, timeShift_#t~ret116, timeShift_#t~ret117, timeShift_#t~ret118, timeShift_#t~ret119, timeShift_#t~ret120, timeShift_~tmp~27, timeShift_~tmp___0~12, timeShift_~tmp___1~7, timeShift_~tmp___2~5, timeShift_~tmp___3~4, timeShift_~tmp___4~3, timeShift_~tmp___5~2, timeShift_~tmp___6~2, timeShift_~tmp___7~2, timeShift_~tmp___8~2, timeShift_~tmp___9~2;havoc timeShift_~tmp~27;havoc timeShift_~tmp___0~12;havoc timeShift_~tmp___1~7;havoc timeShift_~tmp___2~5;havoc timeShift_~tmp___3~4;havoc timeShift_~tmp___4~3;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~ret94, stopRequestedAtCurrentFloor_#t~ret95, stopRequestedAtCurrentFloor_#t~ret96, stopRequestedAtCurrentFloor_#t~ret97, stopRequestedAtCurrentFloor_~retValue_acc~27, stopRequestedAtCurrentFloor_~tmp~25, stopRequestedAtCurrentFloor_~tmp___0~10;havoc stopRequestedAtCurrentFloor_~retValue_acc~27;havoc stopRequestedAtCurrentFloor_~tmp~25;havoc stopRequestedAtCurrentFloor_~tmp___0~10;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret168, isExecutiveFloorCalling_~retValue_acc~30;havoc isExecutiveFloorCalling_~retValue_acc~30;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~2;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~2; 2612#L353-70true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~2 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~2; 2290#L380-70true isExecutiveFloorCalling_#t~ret168 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~30 := isExecutiveFloorCalling_#t~ret168;havoc isExecutiveFloorCalling_#t~ret168;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~30; 1918#L3470-3true stopRequestedAtCurrentFloor_#t~ret94 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~25 := stopRequestedAtCurrentFloor_#t~ret94;havoc stopRequestedAtCurrentFloor_#t~ret94; 1837#L2855-1true assume 0 != stopRequestedAtCurrentFloor_~tmp~25;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~14;havoc getCurrentFloorID_~retValue_acc~14;getCurrentFloorID_~retValue_acc~14 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~14; 2366#L2118-6true stopRequestedAtCurrentFloor_#t~ret95 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~10 := stopRequestedAtCurrentFloor_#t~ret95;havoc stopRequestedAtCurrentFloor_#t~ret95; 1016#L2859-1true assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~10);stopRequestedAtCurrentFloor_~retValue_acc~27 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~27; 1273#L2872-1true timeShift_#t~ret110 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret110;havoc timeShift_#t~ret110; 3101#L3007-1true assume !(0 != timeShift_~tmp___9~2); 2890#L3098-3true assume 1 == ~doorState~0;~doorState~0 := 0; 2899#L3098-5true stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret85, stopRequestedInDirection_#t~ret86, stopRequestedInDirection_#t~ret87, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~23, stopRequestedInDirection_~tmp~21, stopRequestedInDirection_~tmp___0~7, stopRequestedInDirection_~__cil_tmp7~5, stopRequestedInDirection_~__cil_tmp8~6;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~23;havoc stopRequestedInDirection_~tmp~21;havoc stopRequestedInDirection_~tmp___0~7;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~6;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret168, isExecutiveFloorCalling_~retValue_acc~30;havoc isExecutiveFloorCalling_~retValue_acc~30;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~2;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~2; 2596#L353-73true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~2 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~2; 2273#L380-73true isExecutiveFloorCalling_#t~ret168 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~30 := isExecutiveFloorCalling_#t~ret168;havoc isExecutiveFloorCalling_#t~ret168;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~30; 1914#L3470-4true stopRequestedInDirection_#t~ret85 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~7 := stopRequestedInDirection_#t~ret85;havoc stopRequestedInDirection_#t~ret85; 113#L2710-2true assume 0 != stopRequestedInDirection_~tmp___0~7;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~14;havoc getCurrentFloorID_~retValue_acc~14;getCurrentFloorID_~retValue_acc~14 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~14; 2346#L2118-9true stopRequestedInDirection_#t~ret86 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~21 := stopRequestedInDirection_#t~ret86;havoc stopRequestedInDirection_#t~ret86;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~6 := (if stopRequestedInDirection_~tmp~21 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~23 := (if stopRequestedInDirection_~__cil_tmp8~6 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~23; 284#L2723-2true timeShift_#t~ret117 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret117;havoc timeShift_#t~ret117; 1419#L3106-1true assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret88, continueInDirection_~dir, continueInDirection_~tmp~22;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~22;~currentHeading~0 := continueInDirection_~dir; 1828#L2767-3true assume !(1 == ~currentHeading~0); 862#L2777-9true assume 0 == ~currentFloorID~0;~currentHeading~0 := 1; 825#L2777-11true assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 1282#L2783-11true havoc __utac_acc__Specification2_spec__3_#t~ret0, __utac_acc__Specification2_spec__3_#t~ret1, __utac_acc__Specification2_spec__3_#t~ret2, __utac_acc__Specification2_spec__3_#t~ret3, __utac_acc__Specification2_spec__3_#t~ret4, __utac_acc__Specification2_spec__3_#t~ret5, __utac_acc__Specification2_spec__3_~floor~0, __utac_acc__Specification2_spec__3_~tmp~0, __utac_acc__Specification2_spec__3_~tmp___0~0, __utac_acc__Specification2_spec__3_~tmp___1~0, __utac_acc__Specification2_spec__3_~tmp___2~0, __utac_acc__Specification2_spec__3_~tmp___3~0, __utac_acc__Specification2_spec__3_~tmp___4~0;havoc __utac_acc__Specification2_spec__3_~floor~0;havoc __utac_acc__Specification2_spec__3_~tmp~0;havoc __utac_acc__Specification2_spec__3_~tmp___0~0;havoc __utac_acc__Specification2_spec__3_~tmp___1~0;havoc __utac_acc__Specification2_spec__3_~tmp___2~0;havoc __utac_acc__Specification2_spec__3_~tmp___3~0;havoc __utac_acc__Specification2_spec__3_~tmp___4~0;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~14;havoc getCurrentFloorID_~retValue_acc~14;getCurrentFloorID_~retValue_acc~14 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~14; 2347#L2118-11true __utac_acc__Specification2_spec__3_#t~ret0 := getCurrentFloorID_#res;__utac_acc__Specification2_spec__3_~tmp~0 := __utac_acc__Specification2_spec__3_#t~ret0;havoc __utac_acc__Specification2_spec__3_#t~ret0;__utac_acc__Specification2_spec__3_~floor~0 := __utac_acc__Specification2_spec__3_~tmp~0; 3001#L104-1true assume 0 == __utac_acc__Specification2_spec__3_~floor~0; 1671#L105-1true assume 0 != ~floorButtons_spc2_0~0;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~15;havoc areDoorsOpen_~retValue_acc~15;areDoorsOpen_~retValue_acc~15 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~15; 3244#L2127-5true __utac_acc__Specification2_spec__3_#t~ret1 := areDoorsOpen_#res;__utac_acc__Specification2_spec__3_~tmp___4~0 := __utac_acc__Specification2_spec__3_#t~ret1;havoc __utac_acc__Specification2_spec__3_#t~ret1; 1483#L109-2true assume 0 != __utac_acc__Specification2_spec__3_~tmp___4~0;~floorButtons_spc2_0~0 := 0; 403#L164-1true cleanup_~i~0 := 1 + cleanup_~i~0; 1811#L1446-2true [2019-01-14 04:01:30,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:01:30,716 INFO L82 PathProgramCache]: Analyzing trace with hash 722053063, now seen corresponding path program 1 times [2019-01-14 04:01:30,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:01:30,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:01:30,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:01:30,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:01:30,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:01:30,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:01:31,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:01:31,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:01:31,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:01:31,131 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:01:31,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:01:31,132 INFO L82 PathProgramCache]: Analyzing trace with hash -103885846, now seen corresponding path program 1 times [2019-01-14 04:01:31,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:01:31,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:01:31,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:01:31,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:01:31,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:01:31,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:01:31,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:01:31,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:01:31,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 04:01:31,397 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:01:31,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 04:01:31,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-14 04:01:31,413 INFO L87 Difference]: Start difference. First operand 3563 states. Second operand 7 states. [2019-01-14 04:01:47,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:01:47,568 INFO L93 Difference]: Finished difference Result 30150 states and 56419 transitions. [2019-01-14 04:01:47,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-14 04:01:47,578 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30150 states and 56419 transitions. [2019-01-14 04:01:47,929 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13127 [2019-01-14 04:01:48,191 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30150 states to 30010 states and 56261 transitions. [2019-01-14 04:01:48,193 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30010 [2019-01-14 04:01:48,258 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30010 [2019-01-14 04:01:48,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30010 states and 56261 transitions. [2019-01-14 04:01:48,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:01:48,363 INFO L706 BuchiCegarLoop]: Abstraction has 30010 states and 56261 transitions. [2019-01-14 04:01:48,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30010 states and 56261 transitions. [2019-01-14 04:01:48,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30010 to 10142. [2019-01-14 04:01:48,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10142 states. [2019-01-14 04:01:48,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10142 states to 10142 states and 19050 transitions. [2019-01-14 04:01:48,859 INFO L729 BuchiCegarLoop]: Abstraction has 10142 states and 19050 transitions. [2019-01-14 04:01:48,859 INFO L609 BuchiCegarLoop]: Abstraction has 10142 states and 19050 transitions. [2019-01-14 04:01:48,859 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:01:48,860 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10142 states and 19050 transitions. [2019-01-14 04:01:48,915 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5128 [2019-01-14 04:01:48,917 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:01:48,917 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:01:48,930 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:01:48,932 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:01:48,933 INFO L794 eck$LassoCheckResult]: Stem: 35936#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~floorButtons_spc2_0~0 := 0;~floorButtons_spc2_1~0 := 0;~floorButtons_spc2_2~0 := 0;~floorButtons_spc2_3~0 := 0;~floorButtons_spc2_4~0 := 0;~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~head~0.base, ~head~0.offset := 0, 0;call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(30);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(9);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(21);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(30);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(9);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(21);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(30);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(9);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(25);call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(30);call #t~string38.base, #t~string38.offset := #Ultimate.allocOnStack(9);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(25);~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~string121.base, #t~string121.offset := #Ultimate.allocOnStack(10);call #t~string123.base, #t~string123.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string123.base, #t~string123.offset, 1);call write~init~int(95, #t~string123.base, 1 + #t~string123.offset, 1);call write~init~int(93, #t~string123.base, 2 + #t~string123.offset, 1);call write~init~int(0, #t~string123.base, 3 + #t~string123.offset, 1);call #t~string125.base, #t~string125.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string125.base, #t~string125.offset, 1);call write~init~int(93, #t~string125.base, 1 + #t~string125.offset, 1);call write~init~int(32, #t~string125.base, 2 + #t~string125.offset, 1);call write~init~int(0, #t~string125.base, 3 + #t~string125.offset, 1);call #t~string127.base, #t~string127.offset := #Ultimate.allocOnStack(5);call write~init~int(32, #t~string127.base, #t~string127.offset, 1);call write~init~int(97, #t~string127.base, 1 + #t~string127.offset, 1);call write~init~int(116, #t~string127.base, 2 + #t~string127.offset, 1);call write~init~int(32, #t~string127.base, 3 + #t~string127.offset, 1);call write~init~int(0, #t~string127.base, 4 + #t~string127.offset, 1);call #t~string129.base, #t~string129.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string129.base, #t~string129.offset, 1);call write~init~int(105, #t~string129.base, 1 + #t~string129.offset, 1);call write~init~int(0, #t~string129.base, 2 + #t~string129.offset, 1);call #t~string131.base, #t~string131.offset := #Ultimate.allocOnStack(10);call #t~string133.base, #t~string133.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string133.base, #t~string133.offset, 1);call write~init~int(112, #t~string133.base, 1 + #t~string133.offset, 1);call write~init~int(0, #t~string133.base, 2 + #t~string133.offset, 1);call #t~string135.base, #t~string135.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string135.base, #t~string135.offset, 1);call write~init~int(111, #t~string135.base, 1 + #t~string135.offset, 1);call write~init~int(119, #t~string135.base, 2 + #t~string135.offset, 1);call write~init~int(110, #t~string135.base, 3 + #t~string135.offset, 1);call write~init~int(0, #t~string135.base, 4 + #t~string135.offset, 1);call #t~string137.base, #t~string137.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string137.base, #t~string137.offset, 1);call write~init~int(73, #t~string137.base, 1 + #t~string137.offset, 1);call write~init~int(76, #t~string137.base, 2 + #t~string137.offset, 1);call write~init~int(95, #t~string137.base, 3 + #t~string137.offset, 1);call write~init~int(112, #t~string137.base, 4 + #t~string137.offset, 1);call write~init~int(58, #t~string137.base, 5 + #t~string137.offset, 1);call write~init~int(0, #t~string137.base, 6 + #t~string137.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~string141.base, #t~string141.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string141.base, #t~string141.offset, 1);call write~init~int(37, #t~string141.base, 1 + #t~string141.offset, 1);call write~init~int(105, #t~string141.base, 2 + #t~string141.offset, 1);call write~init~int(0, #t~string141.base, 3 + #t~string141.offset, 1);call #t~string143.base, #t~string143.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string143.base, #t~string143.offset, 1);call write~init~int(37, #t~string143.base, 1 + #t~string143.offset, 1);call write~init~int(105, #t~string143.base, 2 + #t~string143.offset, 1);call write~init~int(0, #t~string143.base, 3 + #t~string143.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~string147.base, #t~string147.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string147.base, #t~string147.offset, 1);call write~init~int(37, #t~string147.base, 1 + #t~string147.offset, 1);call write~init~int(105, #t~string147.base, 2 + #t~string147.offset, 1);call write~init~int(0, #t~string147.base, 3 + #t~string147.offset, 1);call #t~string149.base, #t~string149.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string149.base, #t~string149.offset, 1);call write~init~int(70, #t~string149.base, 1 + #t~string149.offset, 1);call write~init~int(95, #t~string149.base, 2 + #t~string149.offset, 1);call write~init~int(112, #t~string149.base, 3 + #t~string149.offset, 1);call write~init~int(58, #t~string149.base, 4 + #t~string149.offset, 1);call write~init~int(0, #t~string149.base, 5 + #t~string149.offset, 1);call #t~string152.base, #t~string152.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string152.base, #t~string152.offset, 1);call write~init~int(37, #t~string152.base, 1 + #t~string152.offset, 1);call write~init~int(105, #t~string152.base, 2 + #t~string152.offset, 1);call write~init~int(0, #t~string152.base, 3 + #t~string152.offset, 1);call #t~string155.base, #t~string155.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string155.base, #t~string155.offset, 1);call write~init~int(37, #t~string155.base, 1 + #t~string155.offset, 1);call write~init~int(105, #t~string155.base, 2 + #t~string155.offset, 1);call write~init~int(0, #t~string155.base, 3 + #t~string155.offset, 1);call #t~string158.base, #t~string158.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string158.base, #t~string158.offset, 1);call write~init~int(37, #t~string158.base, 1 + #t~string158.offset, 1);call write~init~int(105, #t~string158.base, 2 + #t~string158.offset, 1);call write~init~int(0, #t~string158.base, 3 + #t~string158.offset, 1);call #t~string161.base, #t~string161.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string161.base, #t~string161.offset, 1);call write~init~int(37, #t~string161.base, 1 + #t~string161.offset, 1);call write~init~int(105, #t~string161.base, 2 + #t~string161.offset, 1);call write~init~int(0, #t~string161.base, 3 + #t~string161.offset, 1);call #t~string164.base, #t~string164.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string164.base, #t~string164.offset, 1);call write~init~int(37, #t~string164.base, 1 + #t~string164.offset, 1);call write~init~int(105, #t~string164.base, 2 + #t~string164.offset, 1);call write~init~int(0, #t~string164.base, 3 + #t~string164.offset, 1);call #t~string166.base, #t~string166.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string166.base, #t~string166.offset, 1);call write~init~int(0, #t~string166.base, 1 + #t~string166.offset, 1); 35937#L-1 havoc main_#res;havoc main_#t~ret55, main_~retValue_acc~9, main_~tmp~12;havoc main_~retValue_acc~9;havoc main_~tmp~12; 34573#L251 havoc valid_product_#res;havoc valid_product_~retValue_acc~1;havoc valid_product_~retValue_acc~1;valid_product_~retValue_acc~1 := 1;valid_product_#res := valid_product_~retValue_acc~1; 34372#L259 main_#t~ret55 := valid_product_#res;main_~tmp~12 := main_#t~ret55;havoc main_#t~ret55; 34373#L1642 assume 0 != main_~tmp~12; 35443#L1616 ~floorButtons_spc2_0~0 := 0;~floorButtons_spc2_1~0 := 0;~floorButtons_spc2_2~0 := 0;~floorButtons_spc2_3~0 := 0;~floorButtons_spc2_4~0 := 0; 35326#L59 havoc bigMacCall_#t~ret48, bigMacCall_~tmp~9;havoc bigMacCall_~tmp~9;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~11;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~11; 35327#L1814 assume 0 == getOrigin_~person;getOrigin_~retValue_acc~11 := 4;getOrigin_#res := getOrigin_~retValue_acc~11; 34142#L1839 bigMacCall_#t~ret48 := getOrigin_#res;bigMacCall_~tmp~9 := bigMacCall_#t~ret48;havoc bigMacCall_#t~ret48;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~9;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 34604#L624 assume 0 == initPersonOnFloor_~floor; 37645#L625 assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 33954#L732-1 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 34262#L416 assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 33888#L428-2 havoc cleanup_#t~ret49, cleanup_#t~ret50, cleanup_~i~0, cleanup_~tmp~10, cleanup_~tmp___0~1, cleanup_~__cil_tmp4~2;havoc cleanup_~i~0;havoc cleanup_~tmp~10;havoc cleanup_~tmp___0~1;havoc cleanup_~__cil_tmp4~2;havoc timeShift_#t~ret110, timeShift_#t~ret111, timeShift_#t~ret112, timeShift_#t~ret113, timeShift_#t~ret114, timeShift_#t~ret115, timeShift_#t~ret116, timeShift_#t~ret117, timeShift_#t~ret118, timeShift_#t~ret119, timeShift_#t~ret120, timeShift_~tmp~27, timeShift_~tmp___0~12, timeShift_~tmp___1~7, timeShift_~tmp___2~5, timeShift_~tmp___3~4, timeShift_~tmp___4~3, timeShift_~tmp___5~2, timeShift_~tmp___6~2, timeShift_~tmp___7~2, timeShift_~tmp___8~2, timeShift_~tmp___9~2;havoc timeShift_~tmp~27;havoc timeShift_~tmp___0~12;havoc timeShift_~tmp___1~7;havoc timeShift_~tmp___2~5;havoc timeShift_~tmp___3~4;havoc timeShift_~tmp___4~3;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~ret94, stopRequestedAtCurrentFloor_#t~ret95, stopRequestedAtCurrentFloor_#t~ret96, stopRequestedAtCurrentFloor_#t~ret97, stopRequestedAtCurrentFloor_~retValue_acc~27, stopRequestedAtCurrentFloor_~tmp~25, stopRequestedAtCurrentFloor_~tmp___0~10;havoc stopRequestedAtCurrentFloor_~retValue_acc~27;havoc stopRequestedAtCurrentFloor_~tmp~25;havoc stopRequestedAtCurrentFloor_~tmp___0~10;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret168, isExecutiveFloorCalling_~retValue_acc~30;havoc isExecutiveFloorCalling_~retValue_acc~30;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~2;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~2; 34544#L353 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~2 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~2; 36988#L380 isExecutiveFloorCalling_#t~ret168 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~30 := isExecutiveFloorCalling_#t~ret168;havoc isExecutiveFloorCalling_#t~ret168;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~30; 37885#L3470 stopRequestedAtCurrentFloor_#t~ret94 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~25 := stopRequestedAtCurrentFloor_#t~ret94;havoc stopRequestedAtCurrentFloor_#t~ret94; 37884#L2855 assume 0 != stopRequestedAtCurrentFloor_~tmp~25;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~14;havoc getCurrentFloorID_~retValue_acc~14;getCurrentFloorID_~retValue_acc~14 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~14; 36713#L2118 stopRequestedAtCurrentFloor_#t~ret95 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~10 := stopRequestedAtCurrentFloor_#t~ret95;havoc stopRequestedAtCurrentFloor_#t~ret95; 35227#L2859 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~10);stopRequestedAtCurrentFloor_~retValue_acc~27 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~27; 35229#L2872 timeShift_#t~ret110 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret110;havoc timeShift_#t~ret110; 43392#L3007 assume !(0 != timeShift_~tmp___9~2); 43393#L3098 assume !(1 == ~doorState~0); 43683#L3098-2 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret85, stopRequestedInDirection_#t~ret86, stopRequestedInDirection_#t~ret87, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~23, stopRequestedInDirection_~tmp~21, stopRequestedInDirection_~tmp___0~7, stopRequestedInDirection_~__cil_tmp7~5, stopRequestedInDirection_~__cil_tmp8~6;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~23;havoc stopRequestedInDirection_~tmp~21;havoc stopRequestedInDirection_~tmp___0~7;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~6;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret168, isExecutiveFloorCalling_~retValue_acc~30;havoc isExecutiveFloorCalling_~retValue_acc~30;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~2;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~2; 43682#L353-3 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~2 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~2; 43681#L380-3 isExecutiveFloorCalling_#t~ret168 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~30 := isExecutiveFloorCalling_#t~ret168;havoc isExecutiveFloorCalling_#t~ret168;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~30; 43680#L3470-1 stopRequestedInDirection_#t~ret85 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~7 := stopRequestedInDirection_#t~ret85;havoc stopRequestedInDirection_#t~ret85; 43678#L2710 assume 0 != stopRequestedInDirection_~tmp___0~7;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~14;havoc getCurrentFloorID_~retValue_acc~14;getCurrentFloorID_~retValue_acc~14 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~14; 43676#L2118-3 stopRequestedInDirection_#t~ret86 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~21 := stopRequestedInDirection_#t~ret86;havoc stopRequestedInDirection_#t~ret86;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~6 := (if stopRequestedInDirection_~tmp~21 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~23 := (if stopRequestedInDirection_~__cil_tmp8~6 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~23; 43606#L2723 timeShift_#t~ret117 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret117;havoc timeShift_#t~ret117; 43574#L3106 assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret88, continueInDirection_~dir, continueInDirection_~tmp~22;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~22;~currentHeading~0 := continueInDirection_~dir; 43575#L2767 assume !(1 == ~currentHeading~0); 35018#L2777 assume !(0 == ~currentFloorID~0); 35019#L2777-2 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 34998#L2783-5 havoc __utac_acc__Specification2_spec__3_#t~ret0, __utac_acc__Specification2_spec__3_#t~ret1, __utac_acc__Specification2_spec__3_#t~ret2, __utac_acc__Specification2_spec__3_#t~ret3, __utac_acc__Specification2_spec__3_#t~ret4, __utac_acc__Specification2_spec__3_#t~ret5, __utac_acc__Specification2_spec__3_~floor~0, __utac_acc__Specification2_spec__3_~tmp~0, __utac_acc__Specification2_spec__3_~tmp___0~0, __utac_acc__Specification2_spec__3_~tmp___1~0, __utac_acc__Specification2_spec__3_~tmp___2~0, __utac_acc__Specification2_spec__3_~tmp___3~0, __utac_acc__Specification2_spec__3_~tmp___4~0;havoc __utac_acc__Specification2_spec__3_~floor~0;havoc __utac_acc__Specification2_spec__3_~tmp~0;havoc __utac_acc__Specification2_spec__3_~tmp___0~0;havoc __utac_acc__Specification2_spec__3_~tmp___1~0;havoc __utac_acc__Specification2_spec__3_~tmp___2~0;havoc __utac_acc__Specification2_spec__3_~tmp___3~0;havoc __utac_acc__Specification2_spec__3_~tmp___4~0;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~14;havoc getCurrentFloorID_~retValue_acc~14;getCurrentFloorID_~retValue_acc~14 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~14; 41246#L2118-5 __utac_acc__Specification2_spec__3_#t~ret0 := getCurrentFloorID_#res;__utac_acc__Specification2_spec__3_~tmp~0 := __utac_acc__Specification2_spec__3_#t~ret0;havoc __utac_acc__Specification2_spec__3_#t~ret0;__utac_acc__Specification2_spec__3_~floor~0 := __utac_acc__Specification2_spec__3_~tmp~0; 41245#L104 assume 0 == __utac_acc__Specification2_spec__3_~floor~0; 41243#L105 assume 0 != ~floorButtons_spc2_0~0;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~15;havoc areDoorsOpen_~retValue_acc~15;areDoorsOpen_~retValue_acc~15 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~15; 41241#L2127 __utac_acc__Specification2_spec__3_#t~ret1 := areDoorsOpen_#res;__utac_acc__Specification2_spec__3_~tmp___4~0 := __utac_acc__Specification2_spec__3_#t~ret1;havoc __utac_acc__Specification2_spec__3_#t~ret1; 41240#L109 assume 0 != __utac_acc__Specification2_spec__3_~tmp___4~0;~floorButtons_spc2_0~0 := 0; 41226#L164 cleanup_~i~0 := 0; 41224#L1446-2 [2019-01-14 04:01:48,933 INFO L796 eck$LassoCheckResult]: Loop: 41224#L1446-2 assume !false; 41223#L1447 cleanup_~__cil_tmp4~2 := ~cleanupTimeShifts~0 - 1; 40273#L1450 assume cleanup_~i~0 < cleanup_~__cil_tmp4~2;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~13;havoc isBlocked_~retValue_acc~13;isBlocked_~retValue_acc~13 := 0;isBlocked_#res := isBlocked_~retValue_acc~13; 40269#L1961 cleanup_#t~ret49 := isBlocked_#res;cleanup_~tmp___0~1 := cleanup_#t~ret49;havoc cleanup_#t~ret49; 40252#L1454 assume 1 != cleanup_~tmp___0~1; 40247#L1454-1 havoc isIdle_#res;havoc isIdle_#t~ret69, isIdle_~retValue_acc~20, isIdle_~tmp~18;havoc isIdle_~retValue_acc~20;havoc isIdle_~tmp~18;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret64, anyStopRequested_#t~ret65, anyStopRequested_#t~ret66, anyStopRequested_#t~ret67, anyStopRequested_#t~ret68, anyStopRequested_~retValue_acc~19, anyStopRequested_~tmp~17, anyStopRequested_~tmp___0~5, anyStopRequested_~tmp___1~4, anyStopRequested_~tmp___2~2, anyStopRequested_~tmp___3~1;havoc anyStopRequested_~retValue_acc~19;havoc anyStopRequested_~tmp~17;havoc anyStopRequested_~tmp___0~5;havoc anyStopRequested_~tmp___1~4;havoc anyStopRequested_~tmp___2~2;havoc anyStopRequested_~tmp___3~1;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~2;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~2; 37027#L353-65 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~2 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~2; 36657#L380-65 anyStopRequested_#t~ret64 := isFloorCalling_#res;anyStopRequested_~tmp___3~1 := anyStopRequested_#t~ret64;havoc anyStopRequested_#t~ret64; 35789#L2226 assume 0 != anyStopRequested_~tmp___3~1;anyStopRequested_~retValue_acc~19 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~19; 33923#L2290 isIdle_#t~ret69 := anyStopRequested_#res;isIdle_~tmp~18 := isIdle_#t~ret69;havoc isIdle_#t~ret69;isIdle_~retValue_acc~20 := (if 0 == isIdle_~tmp~18 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~20; 37144#L2303 cleanup_#t~ret50 := isIdle_#res;cleanup_~tmp~10 := cleanup_#t~ret50;havoc cleanup_#t~ret50; 35441#L1466 assume !(0 != cleanup_~tmp~10);havoc timeShift_#t~ret110, timeShift_#t~ret111, timeShift_#t~ret112, timeShift_#t~ret113, timeShift_#t~ret114, timeShift_#t~ret115, timeShift_#t~ret116, timeShift_#t~ret117, timeShift_#t~ret118, timeShift_#t~ret119, timeShift_#t~ret120, timeShift_~tmp~27, timeShift_~tmp___0~12, timeShift_~tmp___1~7, timeShift_~tmp___2~5, timeShift_~tmp___3~4, timeShift_~tmp___4~3, timeShift_~tmp___5~2, timeShift_~tmp___6~2, timeShift_~tmp___7~2, timeShift_~tmp___8~2, timeShift_~tmp___9~2;havoc timeShift_~tmp~27;havoc timeShift_~tmp___0~12;havoc timeShift_~tmp___1~7;havoc timeShift_~tmp___2~5;havoc timeShift_~tmp___3~4;havoc timeShift_~tmp___4~3;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~ret94, stopRequestedAtCurrentFloor_#t~ret95, stopRequestedAtCurrentFloor_#t~ret96, stopRequestedAtCurrentFloor_#t~ret97, stopRequestedAtCurrentFloor_~retValue_acc~27, stopRequestedAtCurrentFloor_~tmp~25, stopRequestedAtCurrentFloor_~tmp___0~10;havoc stopRequestedAtCurrentFloor_~retValue_acc~27;havoc stopRequestedAtCurrentFloor_~tmp~25;havoc stopRequestedAtCurrentFloor_~tmp___0~10;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret168, isExecutiveFloorCalling_~retValue_acc~30;havoc isExecutiveFloorCalling_~retValue_acc~30;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~2;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~2; 35442#L353-70 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~2 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~2; 37702#L380-70 isExecutiveFloorCalling_#t~ret168 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~30 := isExecutiveFloorCalling_#t~ret168;havoc isExecutiveFloorCalling_#t~ret168;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~30; 38047#L3470-3 stopRequestedAtCurrentFloor_#t~ret94 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~25 := stopRequestedAtCurrentFloor_#t~ret94;havoc stopRequestedAtCurrentFloor_#t~ret94; 37972#L2855-1 assume 0 != stopRequestedAtCurrentFloor_~tmp~25;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~14;havoc getCurrentFloorID_~retValue_acc~14;getCurrentFloorID_~retValue_acc~14 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~14; 37973#L2118-6 stopRequestedAtCurrentFloor_#t~ret95 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~10 := stopRequestedAtCurrentFloor_#t~ret95;havoc stopRequestedAtCurrentFloor_#t~ret95; 37952#L2859-1 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~10);stopRequestedAtCurrentFloor_~retValue_acc~27 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~27; 35233#L2872-1 timeShift_#t~ret110 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret110;havoc timeShift_#t~ret110; 35498#L3007-1 assume !(0 != timeShift_~tmp___9~2); 37393#L3098-3 assume 1 == ~doorState~0;~doorState~0 := 0; 43441#L3098-5 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret85, stopRequestedInDirection_#t~ret86, stopRequestedInDirection_#t~ret87, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~23, stopRequestedInDirection_~tmp~21, stopRequestedInDirection_~tmp___0~7, stopRequestedInDirection_~__cil_tmp7~5, stopRequestedInDirection_~__cil_tmp8~6;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~23;havoc stopRequestedInDirection_~tmp~21;havoc stopRequestedInDirection_~tmp___0~7;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~6;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret168, isExecutiveFloorCalling_~retValue_acc~30;havoc isExecutiveFloorCalling_~retValue_acc~30;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~2;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~2; 43440#L353-73 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~2 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~2; 43439#L380-73 isExecutiveFloorCalling_#t~ret168 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~30 := isExecutiveFloorCalling_#t~ret168;havoc isExecutiveFloorCalling_#t~ret168;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~30; 43438#L3470-4 stopRequestedInDirection_#t~ret85 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~7 := stopRequestedInDirection_#t~ret85;havoc stopRequestedInDirection_#t~ret85; 34043#L2710-2 assume 0 != stopRequestedInDirection_~tmp___0~7;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~14;havoc getCurrentFloorID_~retValue_acc~14;getCurrentFloorID_~retValue_acc~14 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~14; 34044#L2118-9 stopRequestedInDirection_#t~ret86 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~21 := stopRequestedInDirection_#t~ret86;havoc stopRequestedInDirection_#t~ret86;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~6 := (if stopRequestedInDirection_~tmp~21 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~23 := (if stopRequestedInDirection_~__cil_tmp8~6 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~23; 43436#L2723-2 timeShift_#t~ret117 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret117;havoc timeShift_#t~ret117; 43435#L3106-1 assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret88, continueInDirection_~dir, continueInDirection_~tmp~22;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~22;~currentHeading~0 := continueInDirection_~dir; 36323#L2767-3 assume !(1 == ~currentHeading~0); 35013#L2777-9 assume !(0 == ~currentFloorID~0); 34974#L2777-11 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 34084#L2783-11 havoc __utac_acc__Specification2_spec__3_#t~ret0, __utac_acc__Specification2_spec__3_#t~ret1, __utac_acc__Specification2_spec__3_#t~ret2, __utac_acc__Specification2_spec__3_#t~ret3, __utac_acc__Specification2_spec__3_#t~ret4, __utac_acc__Specification2_spec__3_#t~ret5, __utac_acc__Specification2_spec__3_~floor~0, __utac_acc__Specification2_spec__3_~tmp~0, __utac_acc__Specification2_spec__3_~tmp___0~0, __utac_acc__Specification2_spec__3_~tmp___1~0, __utac_acc__Specification2_spec__3_~tmp___2~0, __utac_acc__Specification2_spec__3_~tmp___3~0, __utac_acc__Specification2_spec__3_~tmp___4~0;havoc __utac_acc__Specification2_spec__3_~floor~0;havoc __utac_acc__Specification2_spec__3_~tmp~0;havoc __utac_acc__Specification2_spec__3_~tmp___0~0;havoc __utac_acc__Specification2_spec__3_~tmp___1~0;havoc __utac_acc__Specification2_spec__3_~tmp___2~0;havoc __utac_acc__Specification2_spec__3_~tmp___3~0;havoc __utac_acc__Specification2_spec__3_~tmp___4~0;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~14;havoc getCurrentFloorID_~retValue_acc~14;getCurrentFloorID_~retValue_acc~14 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~14; 41254#L2118-11 __utac_acc__Specification2_spec__3_#t~ret0 := getCurrentFloorID_#res;__utac_acc__Specification2_spec__3_~tmp~0 := __utac_acc__Specification2_spec__3_#t~ret0;havoc __utac_acc__Specification2_spec__3_#t~ret0;__utac_acc__Specification2_spec__3_~floor~0 := __utac_acc__Specification2_spec__3_~tmp~0; 41253#L104-1 assume 0 == __utac_acc__Specification2_spec__3_~floor~0; 41252#L105-1 assume 0 != ~floorButtons_spc2_0~0;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~15;havoc areDoorsOpen_~retValue_acc~15;areDoorsOpen_~retValue_acc~15 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~15; 41251#L2127-5 __utac_acc__Specification2_spec__3_#t~ret1 := areDoorsOpen_#res;__utac_acc__Specification2_spec__3_~tmp___4~0 := __utac_acc__Specification2_spec__3_#t~ret1;havoc __utac_acc__Specification2_spec__3_#t~ret1; 41229#L109-2 assume 0 != __utac_acc__Specification2_spec__3_~tmp___4~0;~floorButtons_spc2_0~0 := 0; 41225#L164-1 cleanup_~i~0 := 1 + cleanup_~i~0; 41224#L1446-2 [2019-01-14 04:01:48,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:01:48,934 INFO L82 PathProgramCache]: Analyzing trace with hash 722053063, now seen corresponding path program 2 times [2019-01-14 04:01:48,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:01:48,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:01:48,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:01:48,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:01:48,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:01:49,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:01:49,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:01:49,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:01:49,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:01:49,138 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:01:49,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:01:49,138 INFO L82 PathProgramCache]: Analyzing trace with hash 576172524, now seen corresponding path program 1 times [2019-01-14 04:01:49,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:01:49,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:01:49,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:01:49,143 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:01:49,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:01:49,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:01:49,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:01:49,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:01:49,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:01:49,315 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:01:49,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 04:01:49,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 04:01:49,316 INFO L87 Difference]: Start difference. First operand 10142 states and 19050 transitions. cyclomatic complexity: 8910 Second operand 5 states. [2019-01-14 04:01:51,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:01:51,127 INFO L93 Difference]: Finished difference Result 35165 states and 65806 transitions. [2019-01-14 04:01:51,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 04:01:51,129 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35165 states and 65806 transitions. [2019-01-14 04:01:51,661 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 27721 [2019-01-14 04:01:51,819 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35165 states to 35165 states and 65806 transitions. [2019-01-14 04:01:51,819 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35165 [2019-01-14 04:01:51,874 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35165 [2019-01-14 04:01:51,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35165 states and 65806 transitions. [2019-01-14 04:01:51,921 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:01:51,922 INFO L706 BuchiCegarLoop]: Abstraction has 35165 states and 65806 transitions. [2019-01-14 04:01:51,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35165 states and 65806 transitions. [2019-01-14 04:01:52,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35165 to 15019. [2019-01-14 04:01:52,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15019 states. [2019-01-14 04:01:52,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15019 states to 15019 states and 28092 transitions. [2019-01-14 04:01:52,325 INFO L729 BuchiCegarLoop]: Abstraction has 15019 states and 28092 transitions. [2019-01-14 04:01:52,325 INFO L609 BuchiCegarLoop]: Abstraction has 15019 states and 28092 transitions. [2019-01-14 04:01:52,326 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:01:52,326 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15019 states and 28092 transitions. [2019-01-14 04:01:52,380 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7674 [2019-01-14 04:01:52,380 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:01:52,380 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:01:52,385 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:01:52,386 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:01:52,386 INFO L794 eck$LassoCheckResult]: Stem: 81257#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~floorButtons_spc2_0~0 := 0;~floorButtons_spc2_1~0 := 0;~floorButtons_spc2_2~0 := 0;~floorButtons_spc2_3~0 := 0;~floorButtons_spc2_4~0 := 0;~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~head~0.base, ~head~0.offset := 0, 0;call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(30);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(9);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(21);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(30);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(9);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(21);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(30);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(9);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(25);call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(30);call #t~string38.base, #t~string38.offset := #Ultimate.allocOnStack(9);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(25);~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~string121.base, #t~string121.offset := #Ultimate.allocOnStack(10);call #t~string123.base, #t~string123.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string123.base, #t~string123.offset, 1);call write~init~int(95, #t~string123.base, 1 + #t~string123.offset, 1);call write~init~int(93, #t~string123.base, 2 + #t~string123.offset, 1);call write~init~int(0, #t~string123.base, 3 + #t~string123.offset, 1);call #t~string125.base, #t~string125.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string125.base, #t~string125.offset, 1);call write~init~int(93, #t~string125.base, 1 + #t~string125.offset, 1);call write~init~int(32, #t~string125.base, 2 + #t~string125.offset, 1);call write~init~int(0, #t~string125.base, 3 + #t~string125.offset, 1);call #t~string127.base, #t~string127.offset := #Ultimate.allocOnStack(5);call write~init~int(32, #t~string127.base, #t~string127.offset, 1);call write~init~int(97, #t~string127.base, 1 + #t~string127.offset, 1);call write~init~int(116, #t~string127.base, 2 + #t~string127.offset, 1);call write~init~int(32, #t~string127.base, 3 + #t~string127.offset, 1);call write~init~int(0, #t~string127.base, 4 + #t~string127.offset, 1);call #t~string129.base, #t~string129.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string129.base, #t~string129.offset, 1);call write~init~int(105, #t~string129.base, 1 + #t~string129.offset, 1);call write~init~int(0, #t~string129.base, 2 + #t~string129.offset, 1);call #t~string131.base, #t~string131.offset := #Ultimate.allocOnStack(10);call #t~string133.base, #t~string133.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string133.base, #t~string133.offset, 1);call write~init~int(112, #t~string133.base, 1 + #t~string133.offset, 1);call write~init~int(0, #t~string133.base, 2 + #t~string133.offset, 1);call #t~string135.base, #t~string135.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string135.base, #t~string135.offset, 1);call write~init~int(111, #t~string135.base, 1 + #t~string135.offset, 1);call write~init~int(119, #t~string135.base, 2 + #t~string135.offset, 1);call write~init~int(110, #t~string135.base, 3 + #t~string135.offset, 1);call write~init~int(0, #t~string135.base, 4 + #t~string135.offset, 1);call #t~string137.base, #t~string137.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string137.base, #t~string137.offset, 1);call write~init~int(73, #t~string137.base, 1 + #t~string137.offset, 1);call write~init~int(76, #t~string137.base, 2 + #t~string137.offset, 1);call write~init~int(95, #t~string137.base, 3 + #t~string137.offset, 1);call write~init~int(112, #t~string137.base, 4 + #t~string137.offset, 1);call write~init~int(58, #t~string137.base, 5 + #t~string137.offset, 1);call write~init~int(0, #t~string137.base, 6 + #t~string137.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~string141.base, #t~string141.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string141.base, #t~string141.offset, 1);call write~init~int(37, #t~string141.base, 1 + #t~string141.offset, 1);call write~init~int(105, #t~string141.base, 2 + #t~string141.offset, 1);call write~init~int(0, #t~string141.base, 3 + #t~string141.offset, 1);call #t~string143.base, #t~string143.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string143.base, #t~string143.offset, 1);call write~init~int(37, #t~string143.base, 1 + #t~string143.offset, 1);call write~init~int(105, #t~string143.base, 2 + #t~string143.offset, 1);call write~init~int(0, #t~string143.base, 3 + #t~string143.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~string147.base, #t~string147.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string147.base, #t~string147.offset, 1);call write~init~int(37, #t~string147.base, 1 + #t~string147.offset, 1);call write~init~int(105, #t~string147.base, 2 + #t~string147.offset, 1);call write~init~int(0, #t~string147.base, 3 + #t~string147.offset, 1);call #t~string149.base, #t~string149.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string149.base, #t~string149.offset, 1);call write~init~int(70, #t~string149.base, 1 + #t~string149.offset, 1);call write~init~int(95, #t~string149.base, 2 + #t~string149.offset, 1);call write~init~int(112, #t~string149.base, 3 + #t~string149.offset, 1);call write~init~int(58, #t~string149.base, 4 + #t~string149.offset, 1);call write~init~int(0, #t~string149.base, 5 + #t~string149.offset, 1);call #t~string152.base, #t~string152.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string152.base, #t~string152.offset, 1);call write~init~int(37, #t~string152.base, 1 + #t~string152.offset, 1);call write~init~int(105, #t~string152.base, 2 + #t~string152.offset, 1);call write~init~int(0, #t~string152.base, 3 + #t~string152.offset, 1);call #t~string155.base, #t~string155.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string155.base, #t~string155.offset, 1);call write~init~int(37, #t~string155.base, 1 + #t~string155.offset, 1);call write~init~int(105, #t~string155.base, 2 + #t~string155.offset, 1);call write~init~int(0, #t~string155.base, 3 + #t~string155.offset, 1);call #t~string158.base, #t~string158.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string158.base, #t~string158.offset, 1);call write~init~int(37, #t~string158.base, 1 + #t~string158.offset, 1);call write~init~int(105, #t~string158.base, 2 + #t~string158.offset, 1);call write~init~int(0, #t~string158.base, 3 + #t~string158.offset, 1);call #t~string161.base, #t~string161.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string161.base, #t~string161.offset, 1);call write~init~int(37, #t~string161.base, 1 + #t~string161.offset, 1);call write~init~int(105, #t~string161.base, 2 + #t~string161.offset, 1);call write~init~int(0, #t~string161.base, 3 + #t~string161.offset, 1);call #t~string164.base, #t~string164.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string164.base, #t~string164.offset, 1);call write~init~int(37, #t~string164.base, 1 + #t~string164.offset, 1);call write~init~int(105, #t~string164.base, 2 + #t~string164.offset, 1);call write~init~int(0, #t~string164.base, 3 + #t~string164.offset, 1);call #t~string166.base, #t~string166.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string166.base, #t~string166.offset, 1);call write~init~int(0, #t~string166.base, 1 + #t~string166.offset, 1); 81258#L-1 havoc main_#res;havoc main_#t~ret55, main_~retValue_acc~9, main_~tmp~12;havoc main_~retValue_acc~9;havoc main_~tmp~12; 79886#L251 havoc valid_product_#res;havoc valid_product_~retValue_acc~1;havoc valid_product_~retValue_acc~1;valid_product_~retValue_acc~1 := 1;valid_product_#res := valid_product_~retValue_acc~1; 79692#L259 main_#t~ret55 := valid_product_#res;main_~tmp~12 := main_#t~ret55;havoc main_#t~ret55; 79693#L1642 assume 0 != main_~tmp~12; 80781#L1616 ~floorButtons_spc2_0~0 := 0;~floorButtons_spc2_1~0 := 0;~floorButtons_spc2_2~0 := 0;~floorButtons_spc2_3~0 := 0;~floorButtons_spc2_4~0 := 0; 80657#L59 havoc bigMacCall_#t~ret48, bigMacCall_~tmp~9;havoc bigMacCall_~tmp~9;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~11;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~11; 80658#L1814 assume 0 == getOrigin_~person;getOrigin_~retValue_acc~11 := 4;getOrigin_#res := getOrigin_~retValue_acc~11; 79457#L1839 bigMacCall_#t~ret48 := getOrigin_#res;bigMacCall_~tmp~9 := bigMacCall_#t~ret48;havoc bigMacCall_#t~ret48;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~9;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 79914#L624 assume 0 == initPersonOnFloor_~floor; 82966#L625 assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 79274#L732-1 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 79576#L416 assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 79214#L428-2 havoc cleanup_#t~ret49, cleanup_#t~ret50, cleanup_~i~0, cleanup_~tmp~10, cleanup_~tmp___0~1, cleanup_~__cil_tmp4~2;havoc cleanup_~i~0;havoc cleanup_~tmp~10;havoc cleanup_~tmp___0~1;havoc cleanup_~__cil_tmp4~2;havoc timeShift_#t~ret110, timeShift_#t~ret111, timeShift_#t~ret112, timeShift_#t~ret113, timeShift_#t~ret114, timeShift_#t~ret115, timeShift_#t~ret116, timeShift_#t~ret117, timeShift_#t~ret118, timeShift_#t~ret119, timeShift_#t~ret120, timeShift_~tmp~27, timeShift_~tmp___0~12, timeShift_~tmp___1~7, timeShift_~tmp___2~5, timeShift_~tmp___3~4, timeShift_~tmp___4~3, timeShift_~tmp___5~2, timeShift_~tmp___6~2, timeShift_~tmp___7~2, timeShift_~tmp___8~2, timeShift_~tmp___9~2;havoc timeShift_~tmp~27;havoc timeShift_~tmp___0~12;havoc timeShift_~tmp___1~7;havoc timeShift_~tmp___2~5;havoc timeShift_~tmp___3~4;havoc timeShift_~tmp___4~3;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~ret94, stopRequestedAtCurrentFloor_#t~ret95, stopRequestedAtCurrentFloor_#t~ret96, stopRequestedAtCurrentFloor_#t~ret97, stopRequestedAtCurrentFloor_~retValue_acc~27, stopRequestedAtCurrentFloor_~tmp~25, stopRequestedAtCurrentFloor_~tmp___0~10;havoc stopRequestedAtCurrentFloor_~retValue_acc~27;havoc stopRequestedAtCurrentFloor_~tmp~25;havoc stopRequestedAtCurrentFloor_~tmp___0~10;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret168, isExecutiveFloorCalling_~retValue_acc~30;havoc isExecutiveFloorCalling_~retValue_acc~30;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~2;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~2; 79858#L353 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~2 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~2; 82318#L380 isExecutiveFloorCalling_#t~ret168 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~30 := isExecutiveFloorCalling_#t~ret168;havoc isExecutiveFloorCalling_#t~ret168;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~30; 83079#L3470 stopRequestedAtCurrentFloor_#t~ret94 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~25 := stopRequestedAtCurrentFloor_#t~ret94;havoc stopRequestedAtCurrentFloor_#t~ret94; 83078#L2855 assume 0 != stopRequestedAtCurrentFloor_~tmp~25;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~14;havoc getCurrentFloorID_~retValue_acc~14;getCurrentFloorID_~retValue_acc~14 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~14; 82038#L2118 stopRequestedAtCurrentFloor_#t~ret95 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~10 := stopRequestedAtCurrentFloor_#t~ret95;havoc stopRequestedAtCurrentFloor_#t~ret95; 80558#L2859 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~10);stopRequestedAtCurrentFloor_~retValue_acc~27 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~27; 80560#L2872 timeShift_#t~ret110 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret110;havoc timeShift_#t~ret110; 80823#L3007 assume !(0 != timeShift_~tmp___9~2); 82538#L3098 assume !(1 == ~doorState~0); 82525#L3098-2 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret85, stopRequestedInDirection_#t~ret86, stopRequestedInDirection_#t~ret87, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~23, stopRequestedInDirection_~tmp~21, stopRequestedInDirection_~tmp___0~7, stopRequestedInDirection_~__cil_tmp7~5, stopRequestedInDirection_~__cil_tmp8~6;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~23;havoc stopRequestedInDirection_~tmp~21;havoc stopRequestedInDirection_~tmp___0~7;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~6;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret168, isExecutiveFloorCalling_~retValue_acc~30;havoc isExecutiveFloorCalling_~retValue_acc~30;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~2;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~2; 82303#L353-3 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~2 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~2; 80926#L380-3 isExecutiveFloorCalling_#t~ret168 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~30 := isExecutiveFloorCalling_#t~ret168;havoc isExecutiveFloorCalling_#t~ret168;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~30; 80927#L3470-1 stopRequestedInDirection_#t~ret85 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~7 := stopRequestedInDirection_#t~ret85;havoc stopRequestedInDirection_#t~ret85; 81693#L2710 assume 0 != stopRequestedInDirection_~tmp___0~7;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~14;havoc getCurrentFloorID_~retValue_acc~14;getCurrentFloorID_~retValue_acc~14 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~14; 83714#L2118-3 stopRequestedInDirection_#t~ret86 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~21 := stopRequestedInDirection_#t~ret86;havoc stopRequestedInDirection_#t~ret86;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~6 := (if stopRequestedInDirection_~tmp~21 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~23 := (if stopRequestedInDirection_~__cil_tmp8~6 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~23; 83712#L2723 timeShift_#t~ret117 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret117;havoc timeShift_#t~ret117; 83711#L3106 assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret88, continueInDirection_~dir, continueInDirection_~tmp~22;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~22;~currentHeading~0 := continueInDirection_~dir; 81666#L2767 assume !(1 == ~currentHeading~0); 81667#L2777 assume !(0 == ~currentFloorID~0); 80352#L2777-2 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 79422#L2783-5 havoc __utac_acc__Specification2_spec__3_#t~ret0, __utac_acc__Specification2_spec__3_#t~ret1, __utac_acc__Specification2_spec__3_#t~ret2, __utac_acc__Specification2_spec__3_#t~ret3, __utac_acc__Specification2_spec__3_#t~ret4, __utac_acc__Specification2_spec__3_#t~ret5, __utac_acc__Specification2_spec__3_~floor~0, __utac_acc__Specification2_spec__3_~tmp~0, __utac_acc__Specification2_spec__3_~tmp___0~0, __utac_acc__Specification2_spec__3_~tmp___1~0, __utac_acc__Specification2_spec__3_~tmp___2~0, __utac_acc__Specification2_spec__3_~tmp___3~0, __utac_acc__Specification2_spec__3_~tmp___4~0;havoc __utac_acc__Specification2_spec__3_~floor~0;havoc __utac_acc__Specification2_spec__3_~tmp~0;havoc __utac_acc__Specification2_spec__3_~tmp___0~0;havoc __utac_acc__Specification2_spec__3_~tmp___1~0;havoc __utac_acc__Specification2_spec__3_~tmp___2~0;havoc __utac_acc__Specification2_spec__3_~tmp___3~0;havoc __utac_acc__Specification2_spec__3_~tmp___4~0;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~14;havoc getCurrentFloorID_~retValue_acc~14;getCurrentFloorID_~retValue_acc~14 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~14; 82022#L2118-5 __utac_acc__Specification2_spec__3_#t~ret0 := getCurrentFloorID_#res;__utac_acc__Specification2_spec__3_~tmp~0 := __utac_acc__Specification2_spec__3_#t~ret0;havoc __utac_acc__Specification2_spec__3_#t~ret0;__utac_acc__Specification2_spec__3_~floor~0 := __utac_acc__Specification2_spec__3_~tmp~0; 82023#L104 assume 0 == __utac_acc__Specification2_spec__3_~floor~0; 81431#L105 assume 0 != ~floorButtons_spc2_0~0;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~15;havoc areDoorsOpen_~retValue_acc~15;areDoorsOpen_~retValue_acc~15 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~15; 81433#L2127 __utac_acc__Specification2_spec__3_#t~ret1 := areDoorsOpen_#res;__utac_acc__Specification2_spec__3_~tmp___4~0 := __utac_acc__Specification2_spec__3_#t~ret1;havoc __utac_acc__Specification2_spec__3_#t~ret1; 89869#L109 assume 0 != __utac_acc__Specification2_spec__3_~tmp___4~0;~floorButtons_spc2_0~0 := 0; 89870#L164 cleanup_~i~0 := 0; 90833#L1446-2 [2019-01-14 04:01:52,386 INFO L796 eck$LassoCheckResult]: Loop: 90833#L1446-2 assume !false; 90832#L1447 cleanup_~__cil_tmp4~2 := ~cleanupTimeShifts~0 - 1; 90831#L1450 assume cleanup_~i~0 < cleanup_~__cil_tmp4~2;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~13;havoc isBlocked_~retValue_acc~13;isBlocked_~retValue_acc~13 := 0;isBlocked_#res := isBlocked_~retValue_acc~13; 90830#L1961 cleanup_#t~ret49 := isBlocked_#res;cleanup_~tmp___0~1 := cleanup_#t~ret49;havoc cleanup_#t~ret49; 90829#L1454 assume 1 != cleanup_~tmp___0~1; 90828#L1454-1 havoc isIdle_#res;havoc isIdle_#t~ret69, isIdle_~retValue_acc~20, isIdle_~tmp~18;havoc isIdle_~retValue_acc~20;havoc isIdle_~tmp~18;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret64, anyStopRequested_#t~ret65, anyStopRequested_#t~ret66, anyStopRequested_#t~ret67, anyStopRequested_#t~ret68, anyStopRequested_~retValue_acc~19, anyStopRequested_~tmp~17, anyStopRequested_~tmp___0~5, anyStopRequested_~tmp___1~4, anyStopRequested_~tmp___2~2, anyStopRequested_~tmp___3~1;havoc anyStopRequested_~retValue_acc~19;havoc anyStopRequested_~tmp~17;havoc anyStopRequested_~tmp___0~5;havoc anyStopRequested_~tmp___1~4;havoc anyStopRequested_~tmp___2~2;havoc anyStopRequested_~tmp___3~1;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~2;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~2; 90817#L353-65 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~2 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~2; 90805#L380-65 anyStopRequested_#t~ret64 := isFloorCalling_#res;anyStopRequested_~tmp___3~1 := anyStopRequested_#t~ret64;havoc anyStopRequested_#t~ret64; 90794#L2226 assume 0 != anyStopRequested_~tmp___3~1;anyStopRequested_~retValue_acc~19 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~19; 90789#L2290 isIdle_#t~ret69 := anyStopRequested_#res;isIdle_~tmp~18 := isIdle_#t~ret69;havoc isIdle_#t~ret69;isIdle_~retValue_acc~20 := (if 0 == isIdle_~tmp~18 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~20; 90788#L2303 cleanup_#t~ret50 := isIdle_#res;cleanup_~tmp~10 := cleanup_#t~ret50;havoc cleanup_#t~ret50; 90787#L1466 assume !(0 != cleanup_~tmp~10);havoc timeShift_#t~ret110, timeShift_#t~ret111, timeShift_#t~ret112, timeShift_#t~ret113, timeShift_#t~ret114, timeShift_#t~ret115, timeShift_#t~ret116, timeShift_#t~ret117, timeShift_#t~ret118, timeShift_#t~ret119, timeShift_#t~ret120, timeShift_~tmp~27, timeShift_~tmp___0~12, timeShift_~tmp___1~7, timeShift_~tmp___2~5, timeShift_~tmp___3~4, timeShift_~tmp___4~3, timeShift_~tmp___5~2, timeShift_~tmp___6~2, timeShift_~tmp___7~2, timeShift_~tmp___8~2, timeShift_~tmp___9~2;havoc timeShift_~tmp~27;havoc timeShift_~tmp___0~12;havoc timeShift_~tmp___1~7;havoc timeShift_~tmp___2~5;havoc timeShift_~tmp___3~4;havoc timeShift_~tmp___4~3;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~ret94, stopRequestedAtCurrentFloor_#t~ret95, stopRequestedAtCurrentFloor_#t~ret96, stopRequestedAtCurrentFloor_#t~ret97, stopRequestedAtCurrentFloor_~retValue_acc~27, stopRequestedAtCurrentFloor_~tmp~25, stopRequestedAtCurrentFloor_~tmp___0~10;havoc stopRequestedAtCurrentFloor_~retValue_acc~27;havoc stopRequestedAtCurrentFloor_~tmp~25;havoc stopRequestedAtCurrentFloor_~tmp___0~10;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret168, isExecutiveFloorCalling_~retValue_acc~30;havoc isExecutiveFloorCalling_~retValue_acc~30;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~2;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~2; 90786#L353-70 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~2 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~2; 84230#L380-70 isExecutiveFloorCalling_#t~ret168 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~30 := isExecutiveFloorCalling_#t~ret168;havoc isExecutiveFloorCalling_#t~ret168;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~30; 90785#L3470-3 stopRequestedAtCurrentFloor_#t~ret94 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~25 := stopRequestedAtCurrentFloor_#t~ret94;havoc stopRequestedAtCurrentFloor_#t~ret94; 90783#L2855-1 assume 0 != stopRequestedAtCurrentFloor_~tmp~25;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~14;havoc getCurrentFloorID_~retValue_acc~14;getCurrentFloorID_~retValue_acc~14 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~14; 90782#L2118-6 stopRequestedAtCurrentFloor_#t~ret95 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~10 := stopRequestedAtCurrentFloor_#t~ret95;havoc stopRequestedAtCurrentFloor_#t~ret95; 90781#L2859-1 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~10);stopRequestedAtCurrentFloor_~retValue_acc~27 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~27; 80564#L2872-1 timeShift_#t~ret110 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret110;havoc timeShift_#t~ret110; 92872#L3007-1 assume !(0 != timeShift_~tmp___9~2); 92871#L3098-3 assume !(1 == ~doorState~0); 92870#L3098-5 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret85, stopRequestedInDirection_#t~ret86, stopRequestedInDirection_#t~ret87, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~23, stopRequestedInDirection_~tmp~21, stopRequestedInDirection_~tmp___0~7, stopRequestedInDirection_~__cil_tmp7~5, stopRequestedInDirection_~__cil_tmp8~6;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~23;havoc stopRequestedInDirection_~tmp~21;havoc stopRequestedInDirection_~tmp___0~7;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~6;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret168, isExecutiveFloorCalling_~retValue_acc~30;havoc isExecutiveFloorCalling_~retValue_acc~30;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~2;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~2; 92865#L353-73 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~2 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~2; 92208#L380-73 isExecutiveFloorCalling_#t~ret168 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~30 := isExecutiveFloorCalling_#t~ret168;havoc isExecutiveFloorCalling_#t~ret168;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~30; 92203#L3470-4 stopRequestedInDirection_#t~ret85 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~7 := stopRequestedInDirection_#t~ret85;havoc stopRequestedInDirection_#t~ret85; 91762#L2710-2 assume 0 != stopRequestedInDirection_~tmp___0~7;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~14;havoc getCurrentFloorID_~retValue_acc~14;getCurrentFloorID_~retValue_acc~14 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~14; 91697#L2118-9 stopRequestedInDirection_#t~ret86 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~21 := stopRequestedInDirection_#t~ret86;havoc stopRequestedInDirection_#t~ret86;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~6 := (if stopRequestedInDirection_~tmp~21 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~23 := (if stopRequestedInDirection_~__cil_tmp8~6 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~23; 91688#L2723-2 timeShift_#t~ret117 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret117;havoc timeShift_#t~ret117; 91681#L3106-1 assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret88, continueInDirection_~dir, continueInDirection_~tmp~22;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~22;~currentHeading~0 := continueInDirection_~dir; 91672#L2767-3 assume !(1 == ~currentHeading~0); 91663#L2777-9 assume !(0 == ~currentFloorID~0); 91648#L2777-11 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 91641#L2783-11 havoc __utac_acc__Specification2_spec__3_#t~ret0, __utac_acc__Specification2_spec__3_#t~ret1, __utac_acc__Specification2_spec__3_#t~ret2, __utac_acc__Specification2_spec__3_#t~ret3, __utac_acc__Specification2_spec__3_#t~ret4, __utac_acc__Specification2_spec__3_#t~ret5, __utac_acc__Specification2_spec__3_~floor~0, __utac_acc__Specification2_spec__3_~tmp~0, __utac_acc__Specification2_spec__3_~tmp___0~0, __utac_acc__Specification2_spec__3_~tmp___1~0, __utac_acc__Specification2_spec__3_~tmp___2~0, __utac_acc__Specification2_spec__3_~tmp___3~0, __utac_acc__Specification2_spec__3_~tmp___4~0;havoc __utac_acc__Specification2_spec__3_~floor~0;havoc __utac_acc__Specification2_spec__3_~tmp~0;havoc __utac_acc__Specification2_spec__3_~tmp___0~0;havoc __utac_acc__Specification2_spec__3_~tmp___1~0;havoc __utac_acc__Specification2_spec__3_~tmp___2~0;havoc __utac_acc__Specification2_spec__3_~tmp___3~0;havoc __utac_acc__Specification2_spec__3_~tmp___4~0;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~14;havoc getCurrentFloorID_~retValue_acc~14;getCurrentFloorID_~retValue_acc~14 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~14; 91640#L2118-11 __utac_acc__Specification2_spec__3_#t~ret0 := getCurrentFloorID_#res;__utac_acc__Specification2_spec__3_~tmp~0 := __utac_acc__Specification2_spec__3_#t~ret0;havoc __utac_acc__Specification2_spec__3_#t~ret0;__utac_acc__Specification2_spec__3_~floor~0 := __utac_acc__Specification2_spec__3_~tmp~0; 91638#L104-1 assume 0 == __utac_acc__Specification2_spec__3_~floor~0; 91636#L105-1 assume 0 != ~floorButtons_spc2_0~0;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~15;havoc areDoorsOpen_~retValue_acc~15;areDoorsOpen_~retValue_acc~15 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~15; 91635#L2127-5 __utac_acc__Specification2_spec__3_#t~ret1 := areDoorsOpen_#res;__utac_acc__Specification2_spec__3_~tmp___4~0 := __utac_acc__Specification2_spec__3_#t~ret1;havoc __utac_acc__Specification2_spec__3_#t~ret1; 91629#L109-2 assume 0 != __utac_acc__Specification2_spec__3_~tmp___4~0;~floorButtons_spc2_0~0 := 0; 90834#L164-1 cleanup_~i~0 := 1 + cleanup_~i~0; 90833#L1446-2 [2019-01-14 04:01:52,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:01:52,393 INFO L82 PathProgramCache]: Analyzing trace with hash 722053063, now seen corresponding path program 3 times [2019-01-14 04:01:52,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:01:52,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:01:52,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:01:52,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:01:52,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:01:52,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:01:52,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:01:52,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:01:52,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:01:52,509 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:01:52,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:01:52,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1112771218, now seen corresponding path program 1 times [2019-01-14 04:01:52,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:01:52,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:01:52,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:01:52,510 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:01:52,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:01:52,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:01:52,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:01:53,512 WARN L181 SmtUtils]: Spent 910.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 160 [2019-01-14 04:01:54,697 WARN L181 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 152 DAG size of output: 124 [2019-01-14 04:01:54,709 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:01:54,710 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:01:54,710 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:01:54,710 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:01:54,710 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:01:54,711 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:01:54,711 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:01:54,711 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:01:54,711 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec2_product23_true-unreach-call_true-termination.cil.c_Iteration3_Loop [2019-01-14 04:01:54,711 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:01:54,711 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:01:54,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-14 04:01:54,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:54,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:54,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-14 04:01:54,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:54,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-14 04:01:54,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:54,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:54,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:54,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-14 04:01:54,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-14 04:01:54,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-14 04:01:54,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:54,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:54,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:54,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:54,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:54,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:54,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-14 04:01:54,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:54,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:54,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:54,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:54,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-14 04:01:54,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:54,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:54,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:54,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:54,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-14 04:01:54,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:54,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:54,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:54,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-14 04:01:54,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:54,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:55,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:55,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-14 04:01:55,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-14 04:01:55,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:55,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-14 04:01:55,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-14 04:01:55,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-14 04:01:55,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:55,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:55,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:55,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:55,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:55,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:55,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:55,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:55,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-14 04:01:55,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-14 04:01:55,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-14 04:01:55,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-14 04:01:55,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:55,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:55,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:55,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:55,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-14 04:01:55,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:55,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:55,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:55,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-14 04:01:55,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:55,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-14 04:01:55,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-14 04:01:55,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:55,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:55,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-14 04:01:55,518 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-14 04:01:55,762 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-14 04:01:56,542 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 19 [2019-01-14 04:01:56,777 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-01-14 04:01:56,800 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:01:56,801 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:01:56,813 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:01:56,814 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:01:56,823 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:01:56,823 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-14 04:01:56,844 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:01:56,844 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:01:56,848 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:01:56,848 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_~tmp___1~4=0} Honda state: {ULTIMATE.start_anyStopRequested_~tmp___1~4=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) [2019-01-14 04:01:56,891 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:01:56,891 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:01:56,907 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:01:56,907 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_#t~ret120=0} Honda state: {ULTIMATE.start_timeShift_#t~ret120=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 04:01:56,973 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:01:56,973 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:01:56,989 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:01:56,989 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_~tmp___2~5=0} Honda state: {ULTIMATE.start_timeShift_~tmp___2~5=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-14 04:01:57,275 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:01:57,276 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) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:01:57,324 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:01:57,324 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:01:57,827 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:01:57,829 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:01:57,829 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:01:57,830 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:01:57,830 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:01:57,830 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:01:57,830 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:01:57,830 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:01:57,830 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:01:57,830 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec2_product23_true-unreach-call_true-termination.cil.c_Iteration3_Loop [2019-01-14 04:01:57,830 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:01:57,830 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:01:57,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:57,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:57,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-14 04:01:57,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-14 04:01:57,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:57,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:57,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-14 04:01:57,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-14 04:01:57,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-14 04:01:57,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:57,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:57,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:57,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:57,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:57,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:57,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:57,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:57,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-14 04:01:57,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:57,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:57,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:57,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-14 04:01:58,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:58,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:58,219 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-14 04:01:58,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-14 04:01:58,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-14 04:01:58,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-14 04:01:58,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-14 04:01:58,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-14 04:01:58,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:58,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:58,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-14 04:01:58,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-14 04:01:58,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:58,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:58,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:58,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:58,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:58,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:58,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:58,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:58,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:58,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-14 04:01:58,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:58,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:58,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:58,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:58,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:58,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-14 04:01:58,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-14 04:01:58,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:58,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:58,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-14 04:01:58,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:58,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:58,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:58,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:58,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:58,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-14 04:01:58,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:58,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-14 04:01:58,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-14 04:01:58,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:58,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:58,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:58,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:58,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:58,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:58,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:58,736 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-14 04:01:58,892 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-14 04:01:59,506 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-01-14 04:01:59,646 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 19 [2019-01-14 04:01:59,803 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:01:59,808 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:01:59,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:01:59,812 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:01:59,812 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:01:59,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:01:59,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:01:59,813 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:01:59,815 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:01:59,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:01:59,817 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:01:59,817 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:01:59,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:01:59,818 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:01:59,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:01:59,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:01:59,818 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:01:59,819 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:01:59,819 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:01:59,820 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:01:59,820 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:01:59,821 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:01:59,821 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:01:59,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:01:59,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:01:59,821 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:01:59,822 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:01:59,822 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:01:59,822 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:01:59,823 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:01:59,823 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:01:59,823 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:01:59,823 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:01:59,823 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:01:59,824 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:01:59,824 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:01:59,824 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:01:59,825 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:01:59,825 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:01:59,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:01:59,826 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:01:59,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:01:59,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:01:59,826 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:01:59,826 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:01:59,827 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:01:59,827 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:01:59,827 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:01:59,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:01:59,828 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:01:59,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:01:59,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:01:59,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:01:59,829 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:01:59,829 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:01:59,829 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:01:59,830 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:01:59,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:01:59,830 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:01:59,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:01:59,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:01:59,831 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:01:59,831 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:01:59,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:01:59,834 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:01:59,848 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 04:01:59,848 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:01:59,850 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:01:59,850 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:01:59,852 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:01:59,852 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~cleanupTimeShifts~0, ULTIMATE.start_cleanup_~i~0) = 1*~cleanupTimeShifts~0 - 1*ULTIMATE.start_cleanup_~i~0 Supporting invariants [] [2019-01-14 04:01:59,853 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:02:00,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:02:00,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:02:00,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:02:00,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:02:00,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:02:00,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:02:00,584 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-14 04:02:00,585 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15019 states and 28092 transitions. cyclomatic complexity: 13075 Second operand 5 states. [2019-01-14 04:02:01,317 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15019 states and 28092 transitions. cyclomatic complexity: 13075. Second operand 5 states. Result 22693 states and 42416 transitions. Complement of second has 8 states. [2019-01-14 04:02:01,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 04:02:01,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 04:02:01,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 6698 transitions. [2019-01-14 04:02:01,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6698 transitions. Stem has 41 letters. Loop has 39 letters. [2019-01-14 04:02:01,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:02:01,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6698 transitions. Stem has 80 letters. Loop has 39 letters. [2019-01-14 04:02:01,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:02:01,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6698 transitions. Stem has 41 letters. Loop has 78 letters. [2019-01-14 04:02:01,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:02:01,334 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22693 states and 42416 transitions. [2019-01-14 04:02:01,462 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:02:01,463 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22693 states to 0 states and 0 transitions. [2019-01-14 04:02:01,463 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:02:01,463 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:02:01,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:02:01,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:02:01,463 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:02:01,463 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:02:01,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:02:01,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:02:01,464 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2019-01-14 04:02:01,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:02:01,464 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-14 04:02:01,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 04:02:01,464 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-14 04:02:01,465 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:02:01,465 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 04:02:01,465 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:02:01,465 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:02:01,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:02:01,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:02:01,465 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:02:01,465 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:02:01,465 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:02:01,465 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 04:02:01,466 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 04:02:01,466 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:02:01,466 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 04:02:01,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:02:01 BoogieIcfgContainer [2019-01-14 04:02:01,473 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:02:01,474 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:02:01,474 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:02:01,474 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:02:01,475 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:01:30" (3/4) ... [2019-01-14 04:02:01,478 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 04:02:01,479 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:02:01,480 INFO L168 Benchmark]: Toolchain (without parser) took 46059.92 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 759.2 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -183.5 MB). Peak memory consumption was 575.6 MB. Max. memory is 11.5 GB. [2019-01-14 04:02:01,481 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:02:01,481 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1187.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -147.1 MB). Peak memory consumption was 52.7 MB. Max. memory is 11.5 GB. [2019-01-14 04:02:01,482 INFO L168 Benchmark]: Boogie Procedure Inliner took 331.94 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: 40.6 MB). Peak memory consumption was 40.6 MB. Max. memory is 11.5 GB. [2019-01-14 04:02:01,483 INFO L168 Benchmark]: Boogie Preprocessor took 275.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 40.8 MB). Peak memory consumption was 40.8 MB. Max. memory is 11.5 GB. [2019-01-14 04:02:01,484 INFO L168 Benchmark]: RCFGBuilder took 13082.12 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 184.5 MB). Free memory was 1.0 GB in the beginning and 931.4 MB in the end (delta: 80.3 MB). Peak memory consumption was 383.0 MB. Max. memory is 11.5 GB. [2019-01-14 04:02:01,485 INFO L168 Benchmark]: BuchiAutomizer took 31173.82 ms. Allocated memory was 1.3 GB in the beginning and 1.8 GB in the end (delta: 446.7 MB). Free memory was 931.4 MB in the beginning and 1.1 GB in the end (delta: -198.1 MB). Peak memory consumption was 248.6 MB. Max. memory is 11.5 GB. [2019-01-14 04:02:01,486 INFO L168 Benchmark]: Witness Printer took 4.94 ms. Allocated memory is still 1.8 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:02:01,491 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1187.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -147.1 MB). Peak memory consumption was 52.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 331.94 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: 40.6 MB). Peak memory consumption was 40.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 275.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 40.8 MB). Peak memory consumption was 40.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 13082.12 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 184.5 MB). Free memory was 1.0 GB in the beginning and 931.4 MB in the end (delta: 80.3 MB). Peak memory consumption was 383.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 31173.82 ms. Allocated memory was 1.3 GB in the beginning and 1.8 GB in the end (delta: 446.7 MB). Free memory was 931.4 MB in the beginning and 1.1 GB in the end (delta: -198.1 MB). Peak memory consumption was 248.6 MB. Max. memory is 11.5 GB. * Witness Printer took 4.94 ms. Allocated memory is still 1.8 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function cleanupTimeShifts + -1 * i and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 31.1s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 8.6s. Construction of modules took 13.3s. Büchi inclusion checks took 6.1s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.8s AutomataMinimizationTime, 2 MinimizatonAttempts, 40014 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 1.4s Buchi closure took 0.1s. Biggest automaton had 15019 states and ocurred in iteration 2. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 26264 SDtfs, 127507 SDslu, 77814 SDs, 0 SdLazy, 5720 SolverSat, 1398 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI2 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital181 mio100 ax100 hnf100 lsp15 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq221 hnf87 smp100 dnf203 smp87 tf102 neg97 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.9s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...