./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/elevator_spec2_product03_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_product03_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 7935dea046400afb1f90dcad627786735aa34b76 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 03:59:49,180 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 03:59:49,181 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 03:59:49,197 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 03:59:49,197 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 03:59:49,198 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 03:59:49,200 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 03:59:49,202 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 03:59:49,204 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 03:59:49,205 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 03:59:49,206 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 03:59:49,207 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 03:59:49,208 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 03:59:49,209 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 03:59:49,210 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 03:59:49,211 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 03:59:49,213 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 03:59:49,214 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 03:59:49,217 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 03:59:49,218 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 03:59:49,219 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 03:59:49,221 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 03:59:49,224 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 03:59:49,225 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 03:59:49,225 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 03:59:49,226 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 03:59:49,228 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 03:59:49,229 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 03:59:49,230 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 03:59:49,231 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 03:59:49,232 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 03:59:49,232 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 03:59:49,232 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 03:59:49,233 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 03:59:49,234 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 03:59:49,235 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 03:59:49,235 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 03:59:49,253 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 03:59:49,254 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 03:59:49,255 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 03:59:49,255 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 03:59:49,255 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 03:59:49,255 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 03:59:49,256 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 03:59:49,257 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 03:59:49,257 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 03:59:49,257 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 03:59:49,257 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 03:59:49,257 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 03:59:49,257 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 03:59:49,258 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 03:59:49,258 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 03:59:49,258 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 03:59:49,258 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 03:59:49,258 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 03:59:49,259 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 03:59:49,260 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 03:59:49,260 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 03:59:49,260 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 03:59:49,260 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 03:59:49,261 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 03:59:49,261 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 03:59:49,261 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 03:59:49,261 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 03:59:49,261 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 03:59:49,262 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 03:59:49,263 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 03:59:49,263 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 03:59:49,264 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 03:59:49,264 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 -> 7935dea046400afb1f90dcad627786735aa34b76 [2019-01-14 03:59:49,301 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 03:59:49,313 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 03:59:49,317 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 03:59:49,319 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 03:59:49,319 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 03:59:49,320 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/elevator_spec2_product03_true-unreach-call_true-termination.cil.c [2019-01-14 03:59:49,383 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ede08a637/fdd5ae4482be44fdad781de177fbd50f/FLAG0932f7ae9 [2019-01-14 03:59:50,034 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 03:59:50,037 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/elevator_spec2_product03_true-unreach-call_true-termination.cil.c [2019-01-14 03:59:50,058 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ede08a637/fdd5ae4482be44fdad781de177fbd50f/FLAG0932f7ae9 [2019-01-14 03:59:50,172 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ede08a637/fdd5ae4482be44fdad781de177fbd50f [2019-01-14 03:59:50,176 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 03:59:50,178 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 03:59:50,179 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 03:59:50,179 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 03:59:50,183 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 03:59:50,184 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:59:50" (1/1) ... [2019-01-14 03:59:50,187 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dd00d77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:59:50, skipping insertion in model container [2019-01-14 03:59:50,188 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:59:50" (1/1) ... [2019-01-14 03:59:50,196 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 03:59:50,285 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 03:59:50,946 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 03:59:50,974 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 03:59:51,227 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 03:59:51,296 INFO L195 MainTranslator]: Completed translation [2019-01-14 03:59:51,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:59:51 WrapperNode [2019-01-14 03:59:51,297 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 03:59:51,298 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 03:59:51,299 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 03:59:51,299 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 03:59:51,309 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:59:51" (1/1) ... [2019-01-14 03:59:51,362 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:59:51" (1/1) ... [2019-01-14 03:59:51,573 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 03:59:51,574 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 03:59:51,574 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 03:59:51,574 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 03:59:51,586 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:59:51" (1/1) ... [2019-01-14 03:59:51,587 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:59:51" (1/1) ... [2019-01-14 03:59:51,610 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:59:51" (1/1) ... [2019-01-14 03:59:51,610 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:59:51" (1/1) ... [2019-01-14 03:59:51,688 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:59:51" (1/1) ... [2019-01-14 03:59:51,747 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:59:51" (1/1) ... [2019-01-14 03:59:51,767 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:59:51" (1/1) ... [2019-01-14 03:59:51,792 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 03:59:51,793 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 03:59:51,794 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 03:59:51,794 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 03:59:51,796 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:59:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:59:51,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 03:59:51,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-14 03:59:51,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 03:59:51,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:00:01,154 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:00:01,154 INFO L286 CfgBuilder]: Removed 517 assue(true) statements. [2019-01-14 04:00:01,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:00:01 BoogieIcfgContainer [2019-01-14 04:00:01,159 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:00:01,161 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:00:01,161 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:00:01,167 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:00:01,169 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:00:01,169 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 03:59:50" (1/3) ... [2019-01-14 04:00:01,171 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@12e04fbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:00:01, skipping insertion in model container [2019-01-14 04:00:01,171 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:00:01,171 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:59:51" (2/3) ... [2019-01-14 04:00:01,172 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@12e04fbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:00:01, skipping insertion in model container [2019-01-14 04:00:01,172 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:00:01,173 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:00:01" (3/3) ... [2019-01-14 04:00:01,177 INFO L375 chiAutomizerObserver]: Analyzing ICFG elevator_spec2_product03_true-unreach-call_true-termination.cil.c [2019-01-14 04:00:01,265 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:00:01,266 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:00:01,266 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:00:01,267 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:00:01,268 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:00:01,268 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:00:01,268 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:00:01,268 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:00:01,269 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:00:01,358 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2299 states. [2019-01-14 04:00:01,655 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1139 [2019-01-14 04:00:01,656 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:00:01,656 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:00:01,690 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:00:01,691 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:00:01,691 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:00:01,692 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2299 states. [2019-01-14 04:00:01,741 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1139 [2019-01-14 04:00:01,741 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:00:01,741 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:00:01,747 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:00:01,749 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:00:01,770 INFO L794 eck$LassoCheckResult]: Stem: 400#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[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~string18.base, #t~string18.offset := #Ultimate.allocOnStack(30);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(9);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(21);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(30);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(9);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(21);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(30);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(9);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(25);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(30);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(9);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(25);~cleanupTimeShifts~0 := 12;~executiveFloor~0 := 4;~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~string100.base, #t~string100.offset := #Ultimate.allocOnStack(10);call #t~string102.base, #t~string102.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string102.base, #t~string102.offset, 1);call write~init~int(95, #t~string102.base, 1 + #t~string102.offset, 1);call write~init~int(93, #t~string102.base, 2 + #t~string102.offset, 1);call write~init~int(0, #t~string102.base, 3 + #t~string102.offset, 1);call #t~string104.base, #t~string104.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string104.base, #t~string104.offset, 1);call write~init~int(93, #t~string104.base, 1 + #t~string104.offset, 1);call write~init~int(32, #t~string104.base, 2 + #t~string104.offset, 1);call write~init~int(0, #t~string104.base, 3 + #t~string104.offset, 1);call #t~string106.base, #t~string106.offset := #Ultimate.allocOnStack(5);call write~init~int(32, #t~string106.base, #t~string106.offset, 1);call write~init~int(97, #t~string106.base, 1 + #t~string106.offset, 1);call write~init~int(116, #t~string106.base, 2 + #t~string106.offset, 1);call write~init~int(32, #t~string106.base, 3 + #t~string106.offset, 1);call write~init~int(0, #t~string106.base, 4 + #t~string106.offset, 1);call #t~string108.base, #t~string108.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string108.base, #t~string108.offset, 1);call write~init~int(105, #t~string108.base, 1 + #t~string108.offset, 1);call write~init~int(0, #t~string108.base, 2 + #t~string108.offset, 1);call #t~string110.base, #t~string110.offset := #Ultimate.allocOnStack(10);call #t~string112.base, #t~string112.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string112.base, #t~string112.offset, 1);call write~init~int(112, #t~string112.base, 1 + #t~string112.offset, 1);call write~init~int(0, #t~string112.base, 2 + #t~string112.offset, 1);call #t~string114.base, #t~string114.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string114.base, #t~string114.offset, 1);call write~init~int(111, #t~string114.base, 1 + #t~string114.offset, 1);call write~init~int(119, #t~string114.base, 2 + #t~string114.offset, 1);call write~init~int(110, #t~string114.base, 3 + #t~string114.offset, 1);call write~init~int(0, #t~string114.base, 4 + #t~string114.offset, 1);call #t~string116.base, #t~string116.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string116.base, #t~string116.offset, 1);call write~init~int(73, #t~string116.base, 1 + #t~string116.offset, 1);call write~init~int(76, #t~string116.base, 2 + #t~string116.offset, 1);call write~init~int(95, #t~string116.base, 3 + #t~string116.offset, 1);call write~init~int(112, #t~string116.base, 4 + #t~string116.offset, 1);call write~init~int(58, #t~string116.base, 5 + #t~string116.offset, 1);call write~init~int(0, #t~string116.base, 6 + #t~string116.offset, 1);call #t~string118.base, #t~string118.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string118.base, #t~string118.offset, 1);call write~init~int(37, #t~string118.base, 1 + #t~string118.offset, 1);call write~init~int(105, #t~string118.base, 2 + #t~string118.offset, 1);call write~init~int(0, #t~string118.base, 3 + #t~string118.offset, 1);call #t~string120.base, #t~string120.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string120.base, #t~string120.offset, 1);call write~init~int(37, #t~string120.base, 1 + #t~string120.offset, 1);call write~init~int(105, #t~string120.base, 2 + #t~string120.offset, 1);call write~init~int(0, #t~string120.base, 3 + #t~string120.offset, 1);call #t~string122.base, #t~string122.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string122.base, #t~string122.offset, 1);call write~init~int(37, #t~string122.base, 1 + #t~string122.offset, 1);call write~init~int(105, #t~string122.base, 2 + #t~string122.offset, 1);call write~init~int(0, #t~string122.base, 3 + #t~string122.offset, 1);call #t~string124.base, #t~string124.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string124.base, #t~string124.offset, 1);call write~init~int(37, #t~string124.base, 1 + #t~string124.offset, 1);call write~init~int(105, #t~string124.base, 2 + #t~string124.offset, 1);call write~init~int(0, #t~string124.base, 3 + #t~string124.offset, 1);call #t~string126.base, #t~string126.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string126.base, #t~string126.offset, 1);call write~init~int(37, #t~string126.base, 1 + #t~string126.offset, 1);call write~init~int(105, #t~string126.base, 2 + #t~string126.offset, 1);call write~init~int(0, #t~string126.base, 3 + #t~string126.offset, 1);call #t~string128.base, #t~string128.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string128.base, #t~string128.offset, 1);call write~init~int(70, #t~string128.base, 1 + #t~string128.offset, 1);call write~init~int(95, #t~string128.base, 2 + #t~string128.offset, 1);call write~init~int(112, #t~string128.base, 3 + #t~string128.offset, 1);call write~init~int(58, #t~string128.base, 4 + #t~string128.offset, 1);call write~init~int(0, #t~string128.base, 5 + #t~string128.offset, 1);call #t~string131.base, #t~string131.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string131.base, #t~string131.offset, 1);call write~init~int(37, #t~string131.base, 1 + #t~string131.offset, 1);call write~init~int(105, #t~string131.base, 2 + #t~string131.offset, 1);call write~init~int(0, #t~string131.base, 3 + #t~string131.offset, 1);call #t~string134.base, #t~string134.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string134.base, #t~string134.offset, 1);call write~init~int(37, #t~string134.base, 1 + #t~string134.offset, 1);call write~init~int(105, #t~string134.base, 2 + #t~string134.offset, 1);call write~init~int(0, #t~string134.base, 3 + #t~string134.offset, 1);call #t~string137.base, #t~string137.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string137.base, #t~string137.offset, 1);call write~init~int(37, #t~string137.base, 1 + #t~string137.offset, 1);call write~init~int(105, #t~string137.base, 2 + #t~string137.offset, 1);call write~init~int(0, #t~string137.base, 3 + #t~string137.offset, 1);call #t~string140.base, #t~string140.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string140.base, #t~string140.offset, 1);call write~init~int(37, #t~string140.base, 1 + #t~string140.offset, 1);call write~init~int(105, #t~string140.base, 2 + #t~string140.offset, 1);call write~init~int(0, #t~string140.base, 3 + #t~string140.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(2);call write~init~int(10, #t~string145.base, #t~string145.offset, 1);call write~init~int(0, #t~string145.base, 1 + #t~string145.offset, 1);~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; 1289#L-1true havoc main_#res;havoc main_#t~ret49, main_~retValue_acc~12, main_~tmp~11;havoc main_~retValue_acc~12;havoc main_~tmp~11; 2107#L1242true havoc valid_product_#res;havoc valid_product_~retValue_acc~10;havoc valid_product_~retValue_acc~10;valid_product_~retValue_acc~10 := 1;valid_product_#res := valid_product_~retValue_acc~10; 1740#L1250true main_#t~ret49 := valid_product_#res;main_~tmp~11 := main_#t~ret49;havoc main_#t~ret49; 1993#L1599true assume 0 != main_~tmp~11; 920#L1572true ~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; 2088#L3136true havoc bigMacCall_#t~ret42, bigMacCall_~tmp~8;havoc bigMacCall_~tmp~8;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~4;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~4; 991#L753true assume 0 == getOrigin_~person;getOrigin_~retValue_acc~4 := 4;getOrigin_#res := getOrigin_~retValue_acc~4; 857#L778true bigMacCall_#t~ret42 := getOrigin_#res;bigMacCall_~tmp~8 := bigMacCall_#t~ret42;havoc bigMacCall_#t~ret42;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~8;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 1259#L399true assume 0 == initPersonOnFloor_~floor; 1055#L400true assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 204#L507-1true callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 1713#L191true assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 86#L203-2true havoc cleanup_#t~ret43, cleanup_#t~ret44, cleanup_~i~0, cleanup_~tmp~9, cleanup_~tmp___0~0, cleanup_~__cil_tmp4~2;havoc cleanup_~i~0;havoc cleanup_~tmp~9;havoc cleanup_~tmp___0~0;havoc cleanup_~__cil_tmp4~2;havoc timeShift_#t~ret89, timeShift_#t~ret90, timeShift_#t~ret91, timeShift_#t~ret92, timeShift_#t~ret93, timeShift_#t~ret94, timeShift_#t~ret95, timeShift_#t~ret96, timeShift_#t~ret97, timeShift_#t~ret98, timeShift_#t~ret99, timeShift_~tmp~20, timeShift_~tmp___0~8, timeShift_~tmp___1~4, timeShift_~tmp___2~4, timeShift_~tmp___3~3, timeShift_~tmp___4~2, timeShift_~tmp___5~2, timeShift_~tmp___6~2, timeShift_~tmp___7~2, timeShift_~tmp___8~2, timeShift_~tmp___9~2;havoc timeShift_~tmp~20;havoc timeShift_~tmp___0~8;havoc timeShift_~tmp___1~4;havoc timeShift_~tmp___2~4;havoc timeShift_~tmp___3~3;havoc timeShift_~tmp___4~2;havoc timeShift_~tmp___5~2;havoc timeShift_~tmp___6~2;havoc timeShift_~tmp___7~2;havoc timeShift_~tmp___8~2;havoc timeShift_~tmp___9~2;havoc stopRequestedAtCurrentFloor_#res;havoc stopRequestedAtCurrentFloor_#t~ret73, stopRequestedAtCurrentFloor_#t~ret74, stopRequestedAtCurrentFloor_#t~ret75, stopRequestedAtCurrentFloor_#t~ret76, stopRequestedAtCurrentFloor_~retValue_acc~25, stopRequestedAtCurrentFloor_~tmp~18, stopRequestedAtCurrentFloor_~tmp___0~6;havoc stopRequestedAtCurrentFloor_~retValue_acc~25;havoc stopRequestedAtCurrentFloor_~tmp~18;havoc stopRequestedAtCurrentFloor_~tmp___0~6;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret147, isExecutiveFloorCalling_~retValue_acc~28;havoc isExecutiveFloorCalling_~retValue_acc~28;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~0;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~0; 1530#L128true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~0 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~0; 168#L155true isExecutiveFloorCalling_#t~ret147 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~28 := isExecutiveFloorCalling_#t~ret147;havoc isExecutiveFloorCalling_#t~ret147;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~28; 208#L3108true stopRequestedAtCurrentFloor_#t~ret73 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~18 := stopRequestedAtCurrentFloor_#t~ret73;havoc stopRequestedAtCurrentFloor_#t~ret73; 63#L2492true assume 0 != stopRequestedAtCurrentFloor_~tmp~18;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; 483#L1823true stopRequestedAtCurrentFloor_#t~ret74 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~6 := stopRequestedAtCurrentFloor_#t~ret74;havoc stopRequestedAtCurrentFloor_#t~ret74; 967#L2496true assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~6);stopRequestedAtCurrentFloor_~retValue_acc~25 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~25; 1308#L2509true timeShift_#t~ret89 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret89;havoc timeShift_#t~ret89; 1262#L2645true assume !(0 != timeShift_~tmp___9~2); 1095#L2736true assume !(1 == ~doorState~0); 1079#L2736-2true stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret67, stopRequestedInDirection_#t~ret68, stopRequestedInDirection_#t~ret69, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~22, stopRequestedInDirection_~tmp~15, stopRequestedInDirection_~tmp___0~4, stopRequestedInDirection_~__cil_tmp7~5, stopRequestedInDirection_~__cil_tmp8~5;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~22;havoc stopRequestedInDirection_~tmp~15;havoc stopRequestedInDirection_~tmp___0~4;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret147, isExecutiveFloorCalling_~retValue_acc~28;havoc isExecutiveFloorCalling_~retValue_acc~28;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~0;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~0; 1508#L128-3true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~0 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~0; 185#L155-3true isExecutiveFloorCalling_#t~ret147 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~28 := isExecutiveFloorCalling_#t~ret147;havoc isExecutiveFloorCalling_#t~ret147;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~28; 207#L3108-1true stopRequestedInDirection_#t~ret67 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~4 := stopRequestedInDirection_#t~ret67;havoc stopRequestedInDirection_#t~ret67; 1624#L2375true assume 0 != stopRequestedInDirection_~tmp___0~4;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; 470#L1823-1true stopRequestedInDirection_#t~ret68 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~15 := stopRequestedInDirection_#t~ret68;havoc stopRequestedInDirection_#t~ret68;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~15 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~22 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~22; 2039#L2388true timeShift_#t~ret96 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret96;havoc timeShift_#t~ret96; 1988#L2744true assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret70, continueInDirection_~dir, continueInDirection_~tmp~16;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~16;~currentHeading~0 := continueInDirection_~dir; 2055#L2432true assume !(1 == ~currentHeading~0); 498#L2442true assume 0 == ~currentFloorID~0;~currentHeading~0 := 1; 365#L2442-2true assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 51#L2448-5true havoc __utac_acc__Specification2_spec__3_#t~ret148, __utac_acc__Specification2_spec__3_#t~ret149, __utac_acc__Specification2_spec__3_#t~ret150, __utac_acc__Specification2_spec__3_#t~ret151, __utac_acc__Specification2_spec__3_#t~ret152, __utac_acc__Specification2_spec__3_#t~ret153, __utac_acc__Specification2_spec__3_~floor~0, __utac_acc__Specification2_spec__3_~tmp~22, __utac_acc__Specification2_spec__3_~tmp___0~10, __utac_acc__Specification2_spec__3_~tmp___1~6, __utac_acc__Specification2_spec__3_~tmp___2~6, __utac_acc__Specification2_spec__3_~tmp___3~5, __utac_acc__Specification2_spec__3_~tmp___4~3;havoc __utac_acc__Specification2_spec__3_~floor~0;havoc __utac_acc__Specification2_spec__3_~tmp~22;havoc __utac_acc__Specification2_spec__3_~tmp___0~10;havoc __utac_acc__Specification2_spec__3_~tmp___1~6;havoc __utac_acc__Specification2_spec__3_~tmp___2~6;havoc __utac_acc__Specification2_spec__3_~tmp___3~5;havoc __utac_acc__Specification2_spec__3_~tmp___4~3;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; 476#L1823-3true __utac_acc__Specification2_spec__3_#t~ret148 := getCurrentFloorID_#res;__utac_acc__Specification2_spec__3_~tmp~22 := __utac_acc__Specification2_spec__3_#t~ret148;havoc __utac_acc__Specification2_spec__3_#t~ret148;__utac_acc__Specification2_spec__3_~floor~0 := __utac_acc__Specification2_spec__3_~tmp~22; 2028#L3181true assume 0 == __utac_acc__Specification2_spec__3_~floor~0; 2130#L3182true 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; 17#L1832true __utac_acc__Specification2_spec__3_#t~ret149 := areDoorsOpen_#res;__utac_acc__Specification2_spec__3_~tmp___4~3 := __utac_acc__Specification2_spec__3_#t~ret149;havoc __utac_acc__Specification2_spec__3_#t~ret149; 1674#L3186true assume 0 != __utac_acc__Specification2_spec__3_~tmp___4~3;~floorButtons_spc2_0~0 := 0; 39#L3241true cleanup_~i~0 := 0; 575#L1402-2true [2019-01-14 04:00:01,779 INFO L796 eck$LassoCheckResult]: Loop: 575#L1402-2true assume !false; 645#L1403true cleanup_~__cil_tmp4~2 := ~cleanupTimeShifts~0 - 1; 1621#L1406true 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; 1653#L1689true cleanup_#t~ret43 := isBlocked_#res;cleanup_~tmp___0~0 := cleanup_#t~ret43;havoc cleanup_#t~ret43; 1237#L1410true assume 1 != cleanup_~tmp___0~0; 1238#L1410-1true havoc isIdle_#res;havoc isIdle_#t~ret55, isIdle_~retValue_acc~20, isIdle_~tmp~13;havoc isIdle_~retValue_acc~20;havoc isIdle_~tmp~13;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret50, anyStopRequested_#t~ret51, anyStopRequested_#t~ret52, anyStopRequested_#t~ret53, anyStopRequested_#t~ret54, anyStopRequested_~retValue_acc~19, anyStopRequested_~tmp~12, anyStopRequested_~tmp___0~2, anyStopRequested_~tmp___1~1, anyStopRequested_~tmp___2~1, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~19;havoc anyStopRequested_~tmp~12;havoc anyStopRequested_~tmp___0~2;havoc anyStopRequested_~tmp___1~1;havoc anyStopRequested_~tmp___2~1;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~0;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~0; 1612#L128-25true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~0 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~0; 141#L155-25true anyStopRequested_#t~ret50 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret50;havoc anyStopRequested_#t~ret50; 564#L1931true assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~19 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~19; 2010#L1995true isIdle_#t~ret55 := anyStopRequested_#res;isIdle_~tmp~13 := isIdle_#t~ret55;havoc isIdle_#t~ret55;isIdle_~retValue_acc~20 := (if 0 == isIdle_~tmp~13 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~20; 28#L2008true cleanup_#t~ret44 := isIdle_#res;cleanup_~tmp~9 := cleanup_#t~ret44;havoc cleanup_#t~ret44; 1834#L1422true assume !(0 != cleanup_~tmp~9);havoc timeShift_#t~ret89, timeShift_#t~ret90, timeShift_#t~ret91, timeShift_#t~ret92, timeShift_#t~ret93, timeShift_#t~ret94, timeShift_#t~ret95, timeShift_#t~ret96, timeShift_#t~ret97, timeShift_#t~ret98, timeShift_#t~ret99, timeShift_~tmp~20, timeShift_~tmp___0~8, timeShift_~tmp___1~4, timeShift_~tmp___2~4, timeShift_~tmp___3~3, timeShift_~tmp___4~2, timeShift_~tmp___5~2, timeShift_~tmp___6~2, timeShift_~tmp___7~2, timeShift_~tmp___8~2, timeShift_~tmp___9~2;havoc timeShift_~tmp~20;havoc timeShift_~tmp___0~8;havoc timeShift_~tmp___1~4;havoc timeShift_~tmp___2~4;havoc timeShift_~tmp___3~3;havoc timeShift_~tmp___4~2;havoc timeShift_~tmp___5~2;havoc timeShift_~tmp___6~2;havoc timeShift_~tmp___7~2;havoc timeShift_~tmp___8~2;havoc timeShift_~tmp___9~2;havoc stopRequestedAtCurrentFloor_#res;havoc stopRequestedAtCurrentFloor_#t~ret73, stopRequestedAtCurrentFloor_#t~ret74, stopRequestedAtCurrentFloor_#t~ret75, stopRequestedAtCurrentFloor_#t~ret76, stopRequestedAtCurrentFloor_~retValue_acc~25, stopRequestedAtCurrentFloor_~tmp~18, stopRequestedAtCurrentFloor_~tmp___0~6;havoc stopRequestedAtCurrentFloor_~retValue_acc~25;havoc stopRequestedAtCurrentFloor_~tmp~18;havoc stopRequestedAtCurrentFloor_~tmp___0~6;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret147, isExecutiveFloorCalling_~retValue_acc~28;havoc isExecutiveFloorCalling_~retValue_acc~28;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~0;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~0; 1629#L128-30true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~0 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~0; 285#L155-30true isExecutiveFloorCalling_#t~ret147 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~28 := isExecutiveFloorCalling_#t~ret147;havoc isExecutiveFloorCalling_#t~ret147;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~28; 214#L3108-3true stopRequestedAtCurrentFloor_#t~ret73 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~18 := stopRequestedAtCurrentFloor_#t~ret73;havoc stopRequestedAtCurrentFloor_#t~ret73; 59#L2492-1true assume 0 != stopRequestedAtCurrentFloor_~tmp~18;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; 475#L1823-4true stopRequestedAtCurrentFloor_#t~ret74 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~6 := stopRequestedAtCurrentFloor_#t~ret74;havoc stopRequestedAtCurrentFloor_#t~ret74; 964#L2496-1true assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~6);stopRequestedAtCurrentFloor_~retValue_acc~25 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~25; 1312#L2509-1true timeShift_#t~ret89 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret89;havoc timeShift_#t~ret89; 1257#L2645-1true assume !(0 != timeShift_~tmp___9~2); 1083#L2736-3true assume 1 == ~doorState~0;~doorState~0 := 0; 1085#L2736-5true stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret67, stopRequestedInDirection_#t~ret68, stopRequestedInDirection_#t~ret69, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~22, stopRequestedInDirection_~tmp~15, stopRequestedInDirection_~tmp___0~4, stopRequestedInDirection_~__cil_tmp7~5, stopRequestedInDirection_~__cil_tmp8~5;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~22;havoc stopRequestedInDirection_~tmp~15;havoc stopRequestedInDirection_~tmp___0~4;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret147, isExecutiveFloorCalling_~retValue_acc~28;havoc isExecutiveFloorCalling_~retValue_acc~28;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~0;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~0; 1619#L128-33true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~0 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~0; 277#L155-33true isExecutiveFloorCalling_#t~ret147 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~28 := isExecutiveFloorCalling_#t~ret147;havoc isExecutiveFloorCalling_#t~ret147;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~28; 219#L3108-4true stopRequestedInDirection_#t~ret67 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~4 := stopRequestedInDirection_#t~ret67;havoc stopRequestedInDirection_#t~ret67; 1634#L2375-2true assume 0 != stopRequestedInDirection_~tmp___0~4;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; 478#L1823-5true stopRequestedInDirection_#t~ret68 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~15 := stopRequestedInDirection_#t~ret68;havoc stopRequestedInDirection_#t~ret68;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~15 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~22 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~22; 2041#L2388-2true timeShift_#t~ret96 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret96;havoc timeShift_#t~ret96; 1985#L2744-1true assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret70, continueInDirection_~dir, continueInDirection_~tmp~16;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~16;~currentHeading~0 := continueInDirection_~dir; 2042#L2432-3true assume !(1 == ~currentHeading~0); 350#L2442-9true assume 0 == ~currentFloorID~0;~currentHeading~0 := 1; 353#L2442-11true assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 46#L2448-11true havoc __utac_acc__Specification2_spec__3_#t~ret148, __utac_acc__Specification2_spec__3_#t~ret149, __utac_acc__Specification2_spec__3_#t~ret150, __utac_acc__Specification2_spec__3_#t~ret151, __utac_acc__Specification2_spec__3_#t~ret152, __utac_acc__Specification2_spec__3_#t~ret153, __utac_acc__Specification2_spec__3_~floor~0, __utac_acc__Specification2_spec__3_~tmp~22, __utac_acc__Specification2_spec__3_~tmp___0~10, __utac_acc__Specification2_spec__3_~tmp___1~6, __utac_acc__Specification2_spec__3_~tmp___2~6, __utac_acc__Specification2_spec__3_~tmp___3~5, __utac_acc__Specification2_spec__3_~tmp___4~3;havoc __utac_acc__Specification2_spec__3_~floor~0;havoc __utac_acc__Specification2_spec__3_~tmp~22;havoc __utac_acc__Specification2_spec__3_~tmp___0~10;havoc __utac_acc__Specification2_spec__3_~tmp___1~6;havoc __utac_acc__Specification2_spec__3_~tmp___2~6;havoc __utac_acc__Specification2_spec__3_~tmp___3~5;havoc __utac_acc__Specification2_spec__3_~tmp___4~3;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; 462#L1823-7true __utac_acc__Specification2_spec__3_#t~ret148 := getCurrentFloorID_#res;__utac_acc__Specification2_spec__3_~tmp~22 := __utac_acc__Specification2_spec__3_#t~ret148;havoc __utac_acc__Specification2_spec__3_#t~ret148;__utac_acc__Specification2_spec__3_~floor~0 := __utac_acc__Specification2_spec__3_~tmp~22; 2035#L3181-1true assume 0 == __utac_acc__Specification2_spec__3_~floor~0; 2127#L3182-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; 4#L1832-5true __utac_acc__Specification2_spec__3_#t~ret149 := areDoorsOpen_#res;__utac_acc__Specification2_spec__3_~tmp___4~3 := __utac_acc__Specification2_spec__3_#t~ret149;havoc __utac_acc__Specification2_spec__3_#t~ret149; 1686#L3186-2true assume 0 != __utac_acc__Specification2_spec__3_~tmp___4~3;~floorButtons_spc2_0~0 := 0; 36#L3241-1true cleanup_~i~0 := 1 + cleanup_~i~0; 575#L1402-2true [2019-01-14 04:00:01,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:00:01,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1864003676, now seen corresponding path program 1 times [2019-01-14 04:00:01,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:00:01,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:00:01,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:00:01,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:00:01,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:00:02,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:00:02,364 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:00:02,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:00:02,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:00:02,374 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:00:02,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:00:02,375 INFO L82 PathProgramCache]: Analyzing trace with hash -878560617, now seen corresponding path program 1 times [2019-01-14 04:00:02,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:00:02,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:00:02,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:00:02,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:00:02,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:00:02,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:00:02,727 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:00:02,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:00:02,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 04:00:02,730 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:00:02,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 04:00:02,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-14 04:00:02,752 INFO L87 Difference]: Start difference. First operand 2299 states. Second operand 7 states. [2019-01-14 04:00:11,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:00:11,133 INFO L93 Difference]: Finished difference Result 17411 states and 32748 transitions. [2019-01-14 04:00:11,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-14 04:00:11,136 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17411 states and 32748 transitions. [2019-01-14 04:00:11,380 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8332 [2019-01-14 04:00:11,617 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17411 states to 17271 states and 32592 transitions. [2019-01-14 04:00:11,618 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17271 [2019-01-14 04:00:11,651 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17271 [2019-01-14 04:00:11,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17271 states and 32592 transitions. [2019-01-14 04:00:11,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:00:11,700 INFO L706 BuchiCegarLoop]: Abstraction has 17271 states and 32592 transitions. [2019-01-14 04:00:11,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17271 states and 32592 transitions. [2019-01-14 04:00:11,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17271 to 6553. [2019-01-14 04:00:11,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6553 states. [2019-01-14 04:00:12,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6553 states to 6553 states and 12383 transitions. [2019-01-14 04:00:12,011 INFO L729 BuchiCegarLoop]: Abstraction has 6553 states and 12383 transitions. [2019-01-14 04:00:12,012 INFO L609 BuchiCegarLoop]: Abstraction has 6553 states and 12383 transitions. [2019-01-14 04:00:12,012 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:00:12,012 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6553 states and 12383 transitions. [2019-01-14 04:00:12,060 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3329 [2019-01-14 04:00:12,060 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:00:12,060 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:00:12,065 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:00:12,065 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:00:12,067 INFO L794 eck$LassoCheckResult]: Stem: 20444#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[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~string18.base, #t~string18.offset := #Ultimate.allocOnStack(30);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(9);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(21);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(30);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(9);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(21);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(30);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(9);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(25);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(30);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(9);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(25);~cleanupTimeShifts~0 := 12;~executiveFloor~0 := 4;~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~string100.base, #t~string100.offset := #Ultimate.allocOnStack(10);call #t~string102.base, #t~string102.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string102.base, #t~string102.offset, 1);call write~init~int(95, #t~string102.base, 1 + #t~string102.offset, 1);call write~init~int(93, #t~string102.base, 2 + #t~string102.offset, 1);call write~init~int(0, #t~string102.base, 3 + #t~string102.offset, 1);call #t~string104.base, #t~string104.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string104.base, #t~string104.offset, 1);call write~init~int(93, #t~string104.base, 1 + #t~string104.offset, 1);call write~init~int(32, #t~string104.base, 2 + #t~string104.offset, 1);call write~init~int(0, #t~string104.base, 3 + #t~string104.offset, 1);call #t~string106.base, #t~string106.offset := #Ultimate.allocOnStack(5);call write~init~int(32, #t~string106.base, #t~string106.offset, 1);call write~init~int(97, #t~string106.base, 1 + #t~string106.offset, 1);call write~init~int(116, #t~string106.base, 2 + #t~string106.offset, 1);call write~init~int(32, #t~string106.base, 3 + #t~string106.offset, 1);call write~init~int(0, #t~string106.base, 4 + #t~string106.offset, 1);call #t~string108.base, #t~string108.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string108.base, #t~string108.offset, 1);call write~init~int(105, #t~string108.base, 1 + #t~string108.offset, 1);call write~init~int(0, #t~string108.base, 2 + #t~string108.offset, 1);call #t~string110.base, #t~string110.offset := #Ultimate.allocOnStack(10);call #t~string112.base, #t~string112.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string112.base, #t~string112.offset, 1);call write~init~int(112, #t~string112.base, 1 + #t~string112.offset, 1);call write~init~int(0, #t~string112.base, 2 + #t~string112.offset, 1);call #t~string114.base, #t~string114.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string114.base, #t~string114.offset, 1);call write~init~int(111, #t~string114.base, 1 + #t~string114.offset, 1);call write~init~int(119, #t~string114.base, 2 + #t~string114.offset, 1);call write~init~int(110, #t~string114.base, 3 + #t~string114.offset, 1);call write~init~int(0, #t~string114.base, 4 + #t~string114.offset, 1);call #t~string116.base, #t~string116.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string116.base, #t~string116.offset, 1);call write~init~int(73, #t~string116.base, 1 + #t~string116.offset, 1);call write~init~int(76, #t~string116.base, 2 + #t~string116.offset, 1);call write~init~int(95, #t~string116.base, 3 + #t~string116.offset, 1);call write~init~int(112, #t~string116.base, 4 + #t~string116.offset, 1);call write~init~int(58, #t~string116.base, 5 + #t~string116.offset, 1);call write~init~int(0, #t~string116.base, 6 + #t~string116.offset, 1);call #t~string118.base, #t~string118.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string118.base, #t~string118.offset, 1);call write~init~int(37, #t~string118.base, 1 + #t~string118.offset, 1);call write~init~int(105, #t~string118.base, 2 + #t~string118.offset, 1);call write~init~int(0, #t~string118.base, 3 + #t~string118.offset, 1);call #t~string120.base, #t~string120.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string120.base, #t~string120.offset, 1);call write~init~int(37, #t~string120.base, 1 + #t~string120.offset, 1);call write~init~int(105, #t~string120.base, 2 + #t~string120.offset, 1);call write~init~int(0, #t~string120.base, 3 + #t~string120.offset, 1);call #t~string122.base, #t~string122.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string122.base, #t~string122.offset, 1);call write~init~int(37, #t~string122.base, 1 + #t~string122.offset, 1);call write~init~int(105, #t~string122.base, 2 + #t~string122.offset, 1);call write~init~int(0, #t~string122.base, 3 + #t~string122.offset, 1);call #t~string124.base, #t~string124.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string124.base, #t~string124.offset, 1);call write~init~int(37, #t~string124.base, 1 + #t~string124.offset, 1);call write~init~int(105, #t~string124.base, 2 + #t~string124.offset, 1);call write~init~int(0, #t~string124.base, 3 + #t~string124.offset, 1);call #t~string126.base, #t~string126.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string126.base, #t~string126.offset, 1);call write~init~int(37, #t~string126.base, 1 + #t~string126.offset, 1);call write~init~int(105, #t~string126.base, 2 + #t~string126.offset, 1);call write~init~int(0, #t~string126.base, 3 + #t~string126.offset, 1);call #t~string128.base, #t~string128.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string128.base, #t~string128.offset, 1);call write~init~int(70, #t~string128.base, 1 + #t~string128.offset, 1);call write~init~int(95, #t~string128.base, 2 + #t~string128.offset, 1);call write~init~int(112, #t~string128.base, 3 + #t~string128.offset, 1);call write~init~int(58, #t~string128.base, 4 + #t~string128.offset, 1);call write~init~int(0, #t~string128.base, 5 + #t~string128.offset, 1);call #t~string131.base, #t~string131.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string131.base, #t~string131.offset, 1);call write~init~int(37, #t~string131.base, 1 + #t~string131.offset, 1);call write~init~int(105, #t~string131.base, 2 + #t~string131.offset, 1);call write~init~int(0, #t~string131.base, 3 + #t~string131.offset, 1);call #t~string134.base, #t~string134.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string134.base, #t~string134.offset, 1);call write~init~int(37, #t~string134.base, 1 + #t~string134.offset, 1);call write~init~int(105, #t~string134.base, 2 + #t~string134.offset, 1);call write~init~int(0, #t~string134.base, 3 + #t~string134.offset, 1);call #t~string137.base, #t~string137.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string137.base, #t~string137.offset, 1);call write~init~int(37, #t~string137.base, 1 + #t~string137.offset, 1);call write~init~int(105, #t~string137.base, 2 + #t~string137.offset, 1);call write~init~int(0, #t~string137.base, 3 + #t~string137.offset, 1);call #t~string140.base, #t~string140.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string140.base, #t~string140.offset, 1);call write~init~int(37, #t~string140.base, 1 + #t~string140.offset, 1);call write~init~int(105, #t~string140.base, 2 + #t~string140.offset, 1);call write~init~int(0, #t~string140.base, 3 + #t~string140.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(2);call write~init~int(10, #t~string145.base, #t~string145.offset, 1);call write~init~int(0, #t~string145.base, 1 + #t~string145.offset, 1);~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; 20445#L-1 havoc main_#res;havoc main_#t~ret49, main_~retValue_acc~12, main_~tmp~11;havoc main_~retValue_acc~12;havoc main_~tmp~11; 21561#L1242 havoc valid_product_#res;havoc valid_product_~retValue_acc~10;havoc valid_product_~retValue_acc~10;valid_product_~retValue_acc~10 := 1;valid_product_#res := valid_product_~retValue_acc~10; 21848#L1250 main_#t~ret49 := valid_product_#res;main_~tmp~11 := main_#t~ret49;havoc main_#t~ret49; 21849#L1599 assume 0 != main_~tmp~11; 21036#L1572 ~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; 21037#L3136 havoc bigMacCall_#t~ret42, bigMacCall_~tmp~8;havoc bigMacCall_~tmp~8;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~4;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~4; 21091#L753 assume 0 == getOrigin_~person;getOrigin_~retValue_acc~4 := 4;getOrigin_#res := getOrigin_~retValue_acc~4; 20282#L778 bigMacCall_#t~ret42 := getOrigin_#res;bigMacCall_~tmp~8 := bigMacCall_#t~ret42;havoc bigMacCall_#t~ret42;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~8;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 21005#L399 assume 0 == initPersonOnFloor_~floor; 21214#L400 assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 19779#L507-1 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 20161#L191 assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 19968#L203-2 havoc cleanup_#t~ret43, cleanup_#t~ret44, cleanup_~i~0, cleanup_~tmp~9, cleanup_~tmp___0~0, cleanup_~__cil_tmp4~2;havoc cleanup_~i~0;havoc cleanup_~tmp~9;havoc cleanup_~tmp___0~0;havoc cleanup_~__cil_tmp4~2;havoc timeShift_#t~ret89, timeShift_#t~ret90, timeShift_#t~ret91, timeShift_#t~ret92, timeShift_#t~ret93, timeShift_#t~ret94, timeShift_#t~ret95, timeShift_#t~ret96, timeShift_#t~ret97, timeShift_#t~ret98, timeShift_#t~ret99, timeShift_~tmp~20, timeShift_~tmp___0~8, timeShift_~tmp___1~4, timeShift_~tmp___2~4, timeShift_~tmp___3~3, timeShift_~tmp___4~2, timeShift_~tmp___5~2, timeShift_~tmp___6~2, timeShift_~tmp___7~2, timeShift_~tmp___8~2, timeShift_~tmp___9~2;havoc timeShift_~tmp~20;havoc timeShift_~tmp___0~8;havoc timeShift_~tmp___1~4;havoc timeShift_~tmp___2~4;havoc timeShift_~tmp___3~3;havoc timeShift_~tmp___4~2;havoc timeShift_~tmp___5~2;havoc timeShift_~tmp___6~2;havoc timeShift_~tmp___7~2;havoc timeShift_~tmp___8~2;havoc timeShift_~tmp___9~2;havoc stopRequestedAtCurrentFloor_#res;havoc stopRequestedAtCurrentFloor_#t~ret73, stopRequestedAtCurrentFloor_#t~ret74, stopRequestedAtCurrentFloor_#t~ret75, stopRequestedAtCurrentFloor_#t~ret76, stopRequestedAtCurrentFloor_~retValue_acc~25, stopRequestedAtCurrentFloor_~tmp~18, stopRequestedAtCurrentFloor_~tmp___0~6;havoc stopRequestedAtCurrentFloor_~retValue_acc~25;havoc stopRequestedAtCurrentFloor_~tmp~18;havoc stopRequestedAtCurrentFloor_~tmp___0~6;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret147, isExecutiveFloorCalling_~retValue_acc~28;havoc isExecutiveFloorCalling_~retValue_acc~28;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~0;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~0; 19969#L128 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~0 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~0; 20122#L155 isExecutiveFloorCalling_#t~ret147 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~28 := isExecutiveFloorCalling_#t~ret147;havoc isExecutiveFloorCalling_#t~ret147;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~28; 20123#L3108 stopRequestedAtCurrentFloor_#t~ret73 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~18 := stopRequestedAtCurrentFloor_#t~ret73;havoc stopRequestedAtCurrentFloor_#t~ret73; 19911#L2492 assume 0 != stopRequestedAtCurrentFloor_~tmp~18;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; 19912#L1823 stopRequestedAtCurrentFloor_#t~ret74 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~6 := stopRequestedAtCurrentFloor_#t~ret74;havoc stopRequestedAtCurrentFloor_#t~ret74; 20556#L2496 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~6);stopRequestedAtCurrentFloor_~retValue_acc~25 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~25; 21054#L2509 timeShift_#t~ret89 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret89;havoc timeShift_#t~ret89; 25266#L2645 assume !(0 != timeShift_~tmp___9~2); 25267#L2736 assume !(1 == ~doorState~0); 26141#L2736-2 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret67, stopRequestedInDirection_#t~ret68, stopRequestedInDirection_#t~ret69, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~22, stopRequestedInDirection_~tmp~15, stopRequestedInDirection_~tmp___0~4, stopRequestedInDirection_~__cil_tmp7~5, stopRequestedInDirection_~__cil_tmp8~5;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~22;havoc stopRequestedInDirection_~tmp~15;havoc stopRequestedInDirection_~tmp___0~4;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret147, isExecutiveFloorCalling_~retValue_acc~28;havoc isExecutiveFloorCalling_~retValue_acc~28;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~0;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~0; 26140#L128-3 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~0 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~0; 26139#L155-3 isExecutiveFloorCalling_#t~ret147 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~28 := isExecutiveFloorCalling_#t~ret147;havoc isExecutiveFloorCalling_#t~ret147;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~28; 26138#L3108-1 stopRequestedInDirection_#t~ret67 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~4 := stopRequestedInDirection_#t~ret67;havoc stopRequestedInDirection_#t~ret67; 26136#L2375 assume 0 != stopRequestedInDirection_~tmp___0~4;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; 26137#L1823-1 stopRequestedInDirection_#t~ret68 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~15 := stopRequestedInDirection_#t~ret68;havoc stopRequestedInDirection_#t~ret68;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~15 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~22 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~22; 26145#L2388 timeShift_#t~ret96 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret96;havoc timeShift_#t~ret96; 26143#L2744 assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret70, continueInDirection_~dir, continueInDirection_~tmp~16;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~16;~currentHeading~0 := continueInDirection_~dir; 26142#L2432 assume !(1 == ~currentHeading~0); 20570#L2442 assume !(0 == ~currentFloorID~0); 20408#L2442-2 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 19877#L2448-5 havoc __utac_acc__Specification2_spec__3_#t~ret148, __utac_acc__Specification2_spec__3_#t~ret149, __utac_acc__Specification2_spec__3_#t~ret150, __utac_acc__Specification2_spec__3_#t~ret151, __utac_acc__Specification2_spec__3_#t~ret152, __utac_acc__Specification2_spec__3_#t~ret153, __utac_acc__Specification2_spec__3_~floor~0, __utac_acc__Specification2_spec__3_~tmp~22, __utac_acc__Specification2_spec__3_~tmp___0~10, __utac_acc__Specification2_spec__3_~tmp___1~6, __utac_acc__Specification2_spec__3_~tmp___2~6, __utac_acc__Specification2_spec__3_~tmp___3~5, __utac_acc__Specification2_spec__3_~tmp___4~3;havoc __utac_acc__Specification2_spec__3_~floor~0;havoc __utac_acc__Specification2_spec__3_~tmp~22;havoc __utac_acc__Specification2_spec__3_~tmp___0~10;havoc __utac_acc__Specification2_spec__3_~tmp___1~6;havoc __utac_acc__Specification2_spec__3_~tmp___2~6;havoc __utac_acc__Specification2_spec__3_~tmp___3~5;havoc __utac_acc__Specification2_spec__3_~tmp___4~3;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; 19878#L1823-3 __utac_acc__Specification2_spec__3_#t~ret148 := getCurrentFloorID_#res;__utac_acc__Specification2_spec__3_~tmp~22 := __utac_acc__Specification2_spec__3_#t~ret148;havoc __utac_acc__Specification2_spec__3_#t~ret148;__utac_acc__Specification2_spec__3_~floor~0 := __utac_acc__Specification2_spec__3_~tmp~22; 20547#L3181 assume 0 == __utac_acc__Specification2_spec__3_~floor~0; 22083#L3182 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; 19786#L1832 __utac_acc__Specification2_spec__3_#t~ret149 := areDoorsOpen_#res;__utac_acc__Specification2_spec__3_~tmp___4~3 := __utac_acc__Specification2_spec__3_#t~ret149;havoc __utac_acc__Specification2_spec__3_#t~ret149; 19787#L3186 assume 0 != __utac_acc__Specification2_spec__3_~tmp___4~3;~floorButtons_spc2_0~0 := 0; 20026#L3241 cleanup_~i~0 := 0; 24583#L1402-2 [2019-01-14 04:00:12,068 INFO L796 eck$LassoCheckResult]: Loop: 24583#L1402-2 assume !false; 24582#L1403 cleanup_~__cil_tmp4~2 := ~cleanupTimeShifts~0 - 1; 24581#L1406 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; 24580#L1689 cleanup_#t~ret43 := isBlocked_#res;cleanup_~tmp___0~0 := cleanup_#t~ret43;havoc cleanup_#t~ret43; 24579#L1410 assume 1 != cleanup_~tmp___0~0; 24578#L1410-1 havoc isIdle_#res;havoc isIdle_#t~ret55, isIdle_~retValue_acc~20, isIdle_~tmp~13;havoc isIdle_~retValue_acc~20;havoc isIdle_~tmp~13;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret50, anyStopRequested_#t~ret51, anyStopRequested_#t~ret52, anyStopRequested_#t~ret53, anyStopRequested_#t~ret54, anyStopRequested_~retValue_acc~19, anyStopRequested_~tmp~12, anyStopRequested_~tmp___0~2, anyStopRequested_~tmp___1~1, anyStopRequested_~tmp___2~1, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~19;havoc anyStopRequested_~tmp~12;havoc anyStopRequested_~tmp___0~2;havoc anyStopRequested_~tmp___1~1;havoc anyStopRequested_~tmp___2~1;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~0;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~0; 24577#L128-25 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~0 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~0; 20081#L155-25 anyStopRequested_#t~ret50 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret50;havoc anyStopRequested_#t~ret50; 20082#L1931 assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~19 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~19; 24563#L1995 isIdle_#t~ret55 := anyStopRequested_#res;isIdle_~tmp~13 := isIdle_#t~ret55;havoc isIdle_#t~ret55;isIdle_~retValue_acc~20 := (if 0 == isIdle_~tmp~13 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~20; 19815#L2008 cleanup_#t~ret44 := isIdle_#res;cleanup_~tmp~9 := cleanup_#t~ret44;havoc cleanup_#t~ret44; 19816#L1422 assume !(0 != cleanup_~tmp~9);havoc timeShift_#t~ret89, timeShift_#t~ret90, timeShift_#t~ret91, timeShift_#t~ret92, timeShift_#t~ret93, timeShift_#t~ret94, timeShift_#t~ret95, timeShift_#t~ret96, timeShift_#t~ret97, timeShift_#t~ret98, timeShift_#t~ret99, timeShift_~tmp~20, timeShift_~tmp___0~8, timeShift_~tmp___1~4, timeShift_~tmp___2~4, timeShift_~tmp___3~3, timeShift_~tmp___4~2, timeShift_~tmp___5~2, timeShift_~tmp___6~2, timeShift_~tmp___7~2, timeShift_~tmp___8~2, timeShift_~tmp___9~2;havoc timeShift_~tmp~20;havoc timeShift_~tmp___0~8;havoc timeShift_~tmp___1~4;havoc timeShift_~tmp___2~4;havoc timeShift_~tmp___3~3;havoc timeShift_~tmp___4~2;havoc timeShift_~tmp___5~2;havoc timeShift_~tmp___6~2;havoc timeShift_~tmp___7~2;havoc timeShift_~tmp___8~2;havoc timeShift_~tmp___9~2;havoc stopRequestedAtCurrentFloor_#res;havoc stopRequestedAtCurrentFloor_#t~ret73, stopRequestedAtCurrentFloor_#t~ret74, stopRequestedAtCurrentFloor_#t~ret75, stopRequestedAtCurrentFloor_#t~ret76, stopRequestedAtCurrentFloor_~retValue_acc~25, stopRequestedAtCurrentFloor_~tmp~18, stopRequestedAtCurrentFloor_~tmp___0~6;havoc stopRequestedAtCurrentFloor_~retValue_acc~25;havoc stopRequestedAtCurrentFloor_~tmp~18;havoc stopRequestedAtCurrentFloor_~tmp___0~6;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret147, isExecutiveFloorCalling_~retValue_acc~28;havoc isExecutiveFloorCalling_~retValue_acc~28;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~0;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~0; 21909#L128-30 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~0 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~0; 22185#L155-30 isExecutiveFloorCalling_#t~ret147 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~28 := isExecutiveFloorCalling_#t~ret147;havoc isExecutiveFloorCalling_#t~ret147;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~28; 22286#L3108-3 stopRequestedAtCurrentFloor_#t~ret73 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~18 := stopRequestedAtCurrentFloor_#t~ret73;havoc stopRequestedAtCurrentFloor_#t~ret73; 22280#L2492-1 assume 0 != stopRequestedAtCurrentFloor_~tmp~18;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; 22279#L1823-4 stopRequestedAtCurrentFloor_#t~ret74 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~6 := stopRequestedAtCurrentFloor_#t~ret74;havoc stopRequestedAtCurrentFloor_#t~ret74; 22278#L2496-1 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~6);stopRequestedAtCurrentFloor_~retValue_acc~25 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~25; 21050#L2509-1 timeShift_#t~ret89 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret89;havoc timeShift_#t~ret89; 25881#L2645-1 assume !(0 != timeShift_~tmp___9~2); 25882#L2736-3 assume 1 == ~doorState~0;~doorState~0 := 0; 26183#L2736-5 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret67, stopRequestedInDirection_#t~ret68, stopRequestedInDirection_#t~ret69, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~22, stopRequestedInDirection_~tmp~15, stopRequestedInDirection_~tmp___0~4, stopRequestedInDirection_~__cil_tmp7~5, stopRequestedInDirection_~__cil_tmp8~5;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~22;havoc stopRequestedInDirection_~tmp~15;havoc stopRequestedInDirection_~tmp___0~4;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret147, isExecutiveFloorCalling_~retValue_acc~28;havoc isExecutiveFloorCalling_~retValue_acc~28;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~0;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~0; 26182#L128-33 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~0 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~0; 26181#L155-33 isExecutiveFloorCalling_#t~ret147 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~28 := isExecutiveFloorCalling_#t~ret147;havoc isExecutiveFloorCalling_#t~ret147;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~28; 26180#L3108-4 stopRequestedInDirection_#t~ret67 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~4 := stopRequestedInDirection_#t~ret67;havoc stopRequestedInDirection_#t~ret67; 26178#L2375-2 assume 0 != stopRequestedInDirection_~tmp___0~4;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; 26179#L1823-5 stopRequestedInDirection_#t~ret68 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~15 := stopRequestedInDirection_#t~ret68;havoc stopRequestedInDirection_#t~ret68;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~15 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~22 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~22; 26210#L2388-2 timeShift_#t~ret96 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret96;havoc timeShift_#t~ret96; 26208#L2744-1 assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret70, continueInDirection_~dir, continueInDirection_~tmp~16;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~16;~currentHeading~0 := continueInDirection_~dir; 26209#L2432-3 assume !(1 == ~currentHeading~0); 20390#L2442-9 assume !(0 == ~currentFloorID~0); 20391#L2442-11 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 20360#L2448-11 havoc __utac_acc__Specification2_spec__3_#t~ret148, __utac_acc__Specification2_spec__3_#t~ret149, __utac_acc__Specification2_spec__3_#t~ret150, __utac_acc__Specification2_spec__3_#t~ret151, __utac_acc__Specification2_spec__3_#t~ret152, __utac_acc__Specification2_spec__3_#t~ret153, __utac_acc__Specification2_spec__3_~floor~0, __utac_acc__Specification2_spec__3_~tmp~22, __utac_acc__Specification2_spec__3_~tmp___0~10, __utac_acc__Specification2_spec__3_~tmp___1~6, __utac_acc__Specification2_spec__3_~tmp___2~6, __utac_acc__Specification2_spec__3_~tmp___3~5, __utac_acc__Specification2_spec__3_~tmp___4~3;havoc __utac_acc__Specification2_spec__3_~floor~0;havoc __utac_acc__Specification2_spec__3_~tmp~22;havoc __utac_acc__Specification2_spec__3_~tmp___0~10;havoc __utac_acc__Specification2_spec__3_~tmp___1~6;havoc __utac_acc__Specification2_spec__3_~tmp___2~6;havoc __utac_acc__Specification2_spec__3_~tmp___3~5;havoc __utac_acc__Specification2_spec__3_~tmp___4~3;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; 25361#L1823-7 __utac_acc__Specification2_spec__3_#t~ret148 := getCurrentFloorID_#res;__utac_acc__Specification2_spec__3_~tmp~22 := __utac_acc__Specification2_spec__3_#t~ret148;havoc __utac_acc__Specification2_spec__3_#t~ret148;__utac_acc__Specification2_spec__3_~floor~0 := __utac_acc__Specification2_spec__3_~tmp~22; 25360#L3181-1 assume 0 == __utac_acc__Specification2_spec__3_~floor~0; 25357#L3182-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; 25352#L1832-5 __utac_acc__Specification2_spec__3_#t~ret149 := areDoorsOpen_#res;__utac_acc__Specification2_spec__3_~tmp___4~3 := __utac_acc__Specification2_spec__3_#t~ret149;havoc __utac_acc__Specification2_spec__3_#t~ret149; 25341#L3186-2 assume 0 != __utac_acc__Specification2_spec__3_~tmp___4~3;~floorButtons_spc2_0~0 := 0; 24584#L3241-1 cleanup_~i~0 := 1 + cleanup_~i~0; 24583#L1402-2 [2019-01-14 04:00:12,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:00:12,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1750905250, now seen corresponding path program 1 times [2019-01-14 04:00:12,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:00:12,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:00:12,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:00:12,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:00:12,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:00:12,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:00:12,224 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:00:12,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:00:12,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:00:12,225 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:00:12,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:00:12,226 INFO L82 PathProgramCache]: Analyzing trace with hash -198502247, now seen corresponding path program 1 times [2019-01-14 04:00:12,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:00:12,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:00:12,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:00:12,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:00:12,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:00:12,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:00:12,319 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:00:12,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:00:12,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:00:12,320 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:00:12,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 04:00:12,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 04:00:12,321 INFO L87 Difference]: Start difference. First operand 6553 states and 12383 transitions. cyclomatic complexity: 5832 Second operand 5 states. [2019-01-14 04:00:13,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:00:13,356 INFO L93 Difference]: Finished difference Result 20260 states and 37981 transitions. [2019-01-14 04:00:13,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 04:00:13,358 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20260 states and 37981 transitions. [2019-01-14 04:00:13,689 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16068 [2019-01-14 04:00:13,809 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20260 states to 20260 states and 37981 transitions. [2019-01-14 04:00:13,810 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20260 [2019-01-14 04:00:13,839 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20260 [2019-01-14 04:00:13,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20260 states and 37981 transitions. [2019-01-14 04:00:13,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:00:13,870 INFO L706 BuchiCegarLoop]: Abstraction has 20260 states and 37981 transitions. [2019-01-14 04:00:13,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20260 states and 37981 transitions. [2019-01-14 04:00:14,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20260 to 8466. [2019-01-14 04:00:14,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8466 states. [2019-01-14 04:00:14,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8466 states to 8466 states and 15850 transitions. [2019-01-14 04:00:14,136 INFO L729 BuchiCegarLoop]: Abstraction has 8466 states and 15850 transitions. [2019-01-14 04:00:14,136 INFO L609 BuchiCegarLoop]: Abstraction has 8466 states and 15850 transitions. [2019-01-14 04:00:14,136 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:00:14,136 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8466 states and 15850 transitions. [2019-01-14 04:00:14,172 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4373 [2019-01-14 04:00:14,172 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:00:14,172 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:00:14,176 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:00:14,176 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:00:14,176 INFO L794 eck$LassoCheckResult]: Stem: 47281#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[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~string18.base, #t~string18.offset := #Ultimate.allocOnStack(30);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(9);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(21);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(30);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(9);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(21);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(30);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(9);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(25);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(30);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(9);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(25);~cleanupTimeShifts~0 := 12;~executiveFloor~0 := 4;~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~string100.base, #t~string100.offset := #Ultimate.allocOnStack(10);call #t~string102.base, #t~string102.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string102.base, #t~string102.offset, 1);call write~init~int(95, #t~string102.base, 1 + #t~string102.offset, 1);call write~init~int(93, #t~string102.base, 2 + #t~string102.offset, 1);call write~init~int(0, #t~string102.base, 3 + #t~string102.offset, 1);call #t~string104.base, #t~string104.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string104.base, #t~string104.offset, 1);call write~init~int(93, #t~string104.base, 1 + #t~string104.offset, 1);call write~init~int(32, #t~string104.base, 2 + #t~string104.offset, 1);call write~init~int(0, #t~string104.base, 3 + #t~string104.offset, 1);call #t~string106.base, #t~string106.offset := #Ultimate.allocOnStack(5);call write~init~int(32, #t~string106.base, #t~string106.offset, 1);call write~init~int(97, #t~string106.base, 1 + #t~string106.offset, 1);call write~init~int(116, #t~string106.base, 2 + #t~string106.offset, 1);call write~init~int(32, #t~string106.base, 3 + #t~string106.offset, 1);call write~init~int(0, #t~string106.base, 4 + #t~string106.offset, 1);call #t~string108.base, #t~string108.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string108.base, #t~string108.offset, 1);call write~init~int(105, #t~string108.base, 1 + #t~string108.offset, 1);call write~init~int(0, #t~string108.base, 2 + #t~string108.offset, 1);call #t~string110.base, #t~string110.offset := #Ultimate.allocOnStack(10);call #t~string112.base, #t~string112.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string112.base, #t~string112.offset, 1);call write~init~int(112, #t~string112.base, 1 + #t~string112.offset, 1);call write~init~int(0, #t~string112.base, 2 + #t~string112.offset, 1);call #t~string114.base, #t~string114.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string114.base, #t~string114.offset, 1);call write~init~int(111, #t~string114.base, 1 + #t~string114.offset, 1);call write~init~int(119, #t~string114.base, 2 + #t~string114.offset, 1);call write~init~int(110, #t~string114.base, 3 + #t~string114.offset, 1);call write~init~int(0, #t~string114.base, 4 + #t~string114.offset, 1);call #t~string116.base, #t~string116.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string116.base, #t~string116.offset, 1);call write~init~int(73, #t~string116.base, 1 + #t~string116.offset, 1);call write~init~int(76, #t~string116.base, 2 + #t~string116.offset, 1);call write~init~int(95, #t~string116.base, 3 + #t~string116.offset, 1);call write~init~int(112, #t~string116.base, 4 + #t~string116.offset, 1);call write~init~int(58, #t~string116.base, 5 + #t~string116.offset, 1);call write~init~int(0, #t~string116.base, 6 + #t~string116.offset, 1);call #t~string118.base, #t~string118.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string118.base, #t~string118.offset, 1);call write~init~int(37, #t~string118.base, 1 + #t~string118.offset, 1);call write~init~int(105, #t~string118.base, 2 + #t~string118.offset, 1);call write~init~int(0, #t~string118.base, 3 + #t~string118.offset, 1);call #t~string120.base, #t~string120.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string120.base, #t~string120.offset, 1);call write~init~int(37, #t~string120.base, 1 + #t~string120.offset, 1);call write~init~int(105, #t~string120.base, 2 + #t~string120.offset, 1);call write~init~int(0, #t~string120.base, 3 + #t~string120.offset, 1);call #t~string122.base, #t~string122.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string122.base, #t~string122.offset, 1);call write~init~int(37, #t~string122.base, 1 + #t~string122.offset, 1);call write~init~int(105, #t~string122.base, 2 + #t~string122.offset, 1);call write~init~int(0, #t~string122.base, 3 + #t~string122.offset, 1);call #t~string124.base, #t~string124.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string124.base, #t~string124.offset, 1);call write~init~int(37, #t~string124.base, 1 + #t~string124.offset, 1);call write~init~int(105, #t~string124.base, 2 + #t~string124.offset, 1);call write~init~int(0, #t~string124.base, 3 + #t~string124.offset, 1);call #t~string126.base, #t~string126.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string126.base, #t~string126.offset, 1);call write~init~int(37, #t~string126.base, 1 + #t~string126.offset, 1);call write~init~int(105, #t~string126.base, 2 + #t~string126.offset, 1);call write~init~int(0, #t~string126.base, 3 + #t~string126.offset, 1);call #t~string128.base, #t~string128.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string128.base, #t~string128.offset, 1);call write~init~int(70, #t~string128.base, 1 + #t~string128.offset, 1);call write~init~int(95, #t~string128.base, 2 + #t~string128.offset, 1);call write~init~int(112, #t~string128.base, 3 + #t~string128.offset, 1);call write~init~int(58, #t~string128.base, 4 + #t~string128.offset, 1);call write~init~int(0, #t~string128.base, 5 + #t~string128.offset, 1);call #t~string131.base, #t~string131.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string131.base, #t~string131.offset, 1);call write~init~int(37, #t~string131.base, 1 + #t~string131.offset, 1);call write~init~int(105, #t~string131.base, 2 + #t~string131.offset, 1);call write~init~int(0, #t~string131.base, 3 + #t~string131.offset, 1);call #t~string134.base, #t~string134.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string134.base, #t~string134.offset, 1);call write~init~int(37, #t~string134.base, 1 + #t~string134.offset, 1);call write~init~int(105, #t~string134.base, 2 + #t~string134.offset, 1);call write~init~int(0, #t~string134.base, 3 + #t~string134.offset, 1);call #t~string137.base, #t~string137.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string137.base, #t~string137.offset, 1);call write~init~int(37, #t~string137.base, 1 + #t~string137.offset, 1);call write~init~int(105, #t~string137.base, 2 + #t~string137.offset, 1);call write~init~int(0, #t~string137.base, 3 + #t~string137.offset, 1);call #t~string140.base, #t~string140.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string140.base, #t~string140.offset, 1);call write~init~int(37, #t~string140.base, 1 + #t~string140.offset, 1);call write~init~int(105, #t~string140.base, 2 + #t~string140.offset, 1);call write~init~int(0, #t~string140.base, 3 + #t~string140.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(2);call write~init~int(10, #t~string145.base, #t~string145.offset, 1);call write~init~int(0, #t~string145.base, 1 + #t~string145.offset, 1);~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; 47282#L-1 havoc main_#res;havoc main_#t~ret49, main_~retValue_acc~12, main_~tmp~11;havoc main_~retValue_acc~12;havoc main_~tmp~11; 48472#L1242 havoc valid_product_#res;havoc valid_product_~retValue_acc~10;havoc valid_product_~retValue_acc~10;valid_product_~retValue_acc~10 := 1;valid_product_#res := valid_product_~retValue_acc~10; 48773#L1250 main_#t~ret49 := valid_product_#res;main_~tmp~11 := main_#t~ret49;havoc main_#t~ret49; 48774#L1599 assume 0 != main_~tmp~11; 47915#L1572 ~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; 47916#L3136 havoc bigMacCall_#t~ret42, bigMacCall_~tmp~8;havoc bigMacCall_~tmp~8;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~4;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~4; 47977#L753 assume 0 == getOrigin_~person;getOrigin_~retValue_acc~4 := 4;getOrigin_#res := getOrigin_~retValue_acc~4; 47119#L778 bigMacCall_#t~ret42 := getOrigin_#res;bigMacCall_~tmp~8 := bigMacCall_#t~ret42;havoc bigMacCall_#t~ret42;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~8;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 47878#L399 assume 0 == initPersonOnFloor_~floor; 48101#L400 assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 46611#L507-1 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 46998#L191 assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 46802#L203-2 havoc cleanup_#t~ret43, cleanup_#t~ret44, cleanup_~i~0, cleanup_~tmp~9, cleanup_~tmp___0~0, cleanup_~__cil_tmp4~2;havoc cleanup_~i~0;havoc cleanup_~tmp~9;havoc cleanup_~tmp___0~0;havoc cleanup_~__cil_tmp4~2;havoc timeShift_#t~ret89, timeShift_#t~ret90, timeShift_#t~ret91, timeShift_#t~ret92, timeShift_#t~ret93, timeShift_#t~ret94, timeShift_#t~ret95, timeShift_#t~ret96, timeShift_#t~ret97, timeShift_#t~ret98, timeShift_#t~ret99, timeShift_~tmp~20, timeShift_~tmp___0~8, timeShift_~tmp___1~4, timeShift_~tmp___2~4, timeShift_~tmp___3~3, timeShift_~tmp___4~2, timeShift_~tmp___5~2, timeShift_~tmp___6~2, timeShift_~tmp___7~2, timeShift_~tmp___8~2, timeShift_~tmp___9~2;havoc timeShift_~tmp~20;havoc timeShift_~tmp___0~8;havoc timeShift_~tmp___1~4;havoc timeShift_~tmp___2~4;havoc timeShift_~tmp___3~3;havoc timeShift_~tmp___4~2;havoc timeShift_~tmp___5~2;havoc timeShift_~tmp___6~2;havoc timeShift_~tmp___7~2;havoc timeShift_~tmp___8~2;havoc timeShift_~tmp___9~2;havoc stopRequestedAtCurrentFloor_#res;havoc stopRequestedAtCurrentFloor_#t~ret73, stopRequestedAtCurrentFloor_#t~ret74, stopRequestedAtCurrentFloor_#t~ret75, stopRequestedAtCurrentFloor_#t~ret76, stopRequestedAtCurrentFloor_~retValue_acc~25, stopRequestedAtCurrentFloor_~tmp~18, stopRequestedAtCurrentFloor_~tmp___0~6;havoc stopRequestedAtCurrentFloor_~retValue_acc~25;havoc stopRequestedAtCurrentFloor_~tmp~18;havoc stopRequestedAtCurrentFloor_~tmp___0~6;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret147, isExecutiveFloorCalling_~retValue_acc~28;havoc isExecutiveFloorCalling_~retValue_acc~28;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~0;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~0; 46803#L128 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~0 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~0; 46959#L155 isExecutiveFloorCalling_#t~ret147 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~28 := isExecutiveFloorCalling_#t~ret147;havoc isExecutiveFloorCalling_#t~ret147;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~28; 46960#L3108 stopRequestedAtCurrentFloor_#t~ret73 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~18 := stopRequestedAtCurrentFloor_#t~ret73;havoc stopRequestedAtCurrentFloor_#t~ret73; 46745#L2492 assume 0 != stopRequestedAtCurrentFloor_~tmp~18;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; 46746#L1823 stopRequestedAtCurrentFloor_#t~ret74 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~6 := stopRequestedAtCurrentFloor_#t~ret74;havoc stopRequestedAtCurrentFloor_#t~ret74; 47398#L2496 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~6);stopRequestedAtCurrentFloor_~retValue_acc~25 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~25; 47936#L2509 timeShift_#t~ret89 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret89;havoc timeShift_#t~ret89; 48433#L2645 assume !(0 != timeShift_~tmp___9~2); 48434#L2736 assume !(1 == ~doorState~0); 49519#L2736-2 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret67, stopRequestedInDirection_#t~ret68, stopRequestedInDirection_#t~ret69, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~22, stopRequestedInDirection_~tmp~15, stopRequestedInDirection_~tmp___0~4, stopRequestedInDirection_~__cil_tmp7~5, stopRequestedInDirection_~__cil_tmp8~5;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~22;havoc stopRequestedInDirection_~tmp~15;havoc stopRequestedInDirection_~tmp___0~4;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret147, isExecutiveFloorCalling_~retValue_acc~28;havoc isExecutiveFloorCalling_~retValue_acc~28;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~0;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~0; 48614#L128-3 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~0 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~0; 46978#L155-3 isExecutiveFloorCalling_#t~ret147 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~28 := isExecutiveFloorCalling_#t~ret147;havoc isExecutiveFloorCalling_#t~ret147;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~28; 46979#L3108-1 stopRequestedInDirection_#t~ret67 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~4 := stopRequestedInDirection_#t~ret67;havoc stopRequestedInDirection_#t~ret67; 47001#L2375 assume 0 != stopRequestedInDirection_~tmp___0~4;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; 48674#L1823-1 stopRequestedInDirection_#t~ret68 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~15 := stopRequestedInDirection_#t~ret68;havoc stopRequestedInDirection_#t~ret68;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~15 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~22 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~22; 52740#L2388 timeShift_#t~ret96 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret96;havoc timeShift_#t~ret96; 48991#L2744 assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret70, continueInDirection_~dir, continueInDirection_~tmp~16;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~16;~currentHeading~0 := continueInDirection_~dir; 48993#L2432 assume !(1 == ~currentHeading~0); 49039#L2442 assume !(0 == ~currentFloorID~0); 47244#L2442-2 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 47223#L2448-5 havoc __utac_acc__Specification2_spec__3_#t~ret148, __utac_acc__Specification2_spec__3_#t~ret149, __utac_acc__Specification2_spec__3_#t~ret150, __utac_acc__Specification2_spec__3_#t~ret151, __utac_acc__Specification2_spec__3_#t~ret152, __utac_acc__Specification2_spec__3_#t~ret153, __utac_acc__Specification2_spec__3_~floor~0, __utac_acc__Specification2_spec__3_~tmp~22, __utac_acc__Specification2_spec__3_~tmp___0~10, __utac_acc__Specification2_spec__3_~tmp___1~6, __utac_acc__Specification2_spec__3_~tmp___2~6, __utac_acc__Specification2_spec__3_~tmp___3~5, __utac_acc__Specification2_spec__3_~tmp___4~3;havoc __utac_acc__Specification2_spec__3_~floor~0;havoc __utac_acc__Specification2_spec__3_~tmp~22;havoc __utac_acc__Specification2_spec__3_~tmp___0~10;havoc __utac_acc__Specification2_spec__3_~tmp___1~6;havoc __utac_acc__Specification2_spec__3_~tmp___2~6;havoc __utac_acc__Specification2_spec__3_~tmp___3~5;havoc __utac_acc__Specification2_spec__3_~tmp___4~3;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; 47388#L1823-3 __utac_acc__Specification2_spec__3_#t~ret148 := getCurrentFloorID_#res;__utac_acc__Specification2_spec__3_~tmp~22 := __utac_acc__Specification2_spec__3_#t~ret148;havoc __utac_acc__Specification2_spec__3_#t~ret148;__utac_acc__Specification2_spec__3_~floor~0 := __utac_acc__Specification2_spec__3_~tmp~22; 47389#L3181 assume 0 == __utac_acc__Specification2_spec__3_~floor~0; 49070#L3182 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; 49071#L1832 __utac_acc__Specification2_spec__3_#t~ret149 := areDoorsOpen_#res;__utac_acc__Specification2_spec__3_~tmp___4~3 := __utac_acc__Specification2_spec__3_#t~ret149;havoc __utac_acc__Specification2_spec__3_#t~ret149; 52700#L3186 assume 0 != __utac_acc__Specification2_spec__3_~tmp___4~3;~floorButtons_spc2_0~0 := 0; 52701#L3241 cleanup_~i~0 := 0; 54149#L1402-2 [2019-01-14 04:00:14,177 INFO L796 eck$LassoCheckResult]: Loop: 54149#L1402-2 assume !false; 54148#L1403 cleanup_~__cil_tmp4~2 := ~cleanupTimeShifts~0 - 1; 54147#L1406 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; 54146#L1689 cleanup_#t~ret43 := isBlocked_#res;cleanup_~tmp___0~0 := cleanup_#t~ret43;havoc cleanup_#t~ret43; 54145#L1410 assume 1 != cleanup_~tmp___0~0; 54144#L1410-1 havoc isIdle_#res;havoc isIdle_#t~ret55, isIdle_~retValue_acc~20, isIdle_~tmp~13;havoc isIdle_~retValue_acc~20;havoc isIdle_~tmp~13;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret50, anyStopRequested_#t~ret51, anyStopRequested_#t~ret52, anyStopRequested_#t~ret53, anyStopRequested_#t~ret54, anyStopRequested_~retValue_acc~19, anyStopRequested_~tmp~12, anyStopRequested_~tmp___0~2, anyStopRequested_~tmp___1~1, anyStopRequested_~tmp___2~1, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~19;havoc anyStopRequested_~tmp~12;havoc anyStopRequested_~tmp___0~2;havoc anyStopRequested_~tmp___1~1;havoc anyStopRequested_~tmp___2~1;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~0;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~0; 54143#L128-25 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~0 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~0; 52670#L155-25 anyStopRequested_#t~ret50 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret50;havoc anyStopRequested_#t~ret50; 52671#L1931 assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~19 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~19; 54124#L1995 isIdle_#t~ret55 := anyStopRequested_#res;isIdle_~tmp~13 := isIdle_#t~ret55;havoc isIdle_#t~ret55;isIdle_~retValue_acc~20 := (if 0 == isIdle_~tmp~13 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~20; 54123#L2008 cleanup_#t~ret44 := isIdle_#res;cleanup_~tmp~9 := cleanup_#t~ret44;havoc cleanup_#t~ret44; 54122#L1422 assume !(0 != cleanup_~tmp~9);havoc timeShift_#t~ret89, timeShift_#t~ret90, timeShift_#t~ret91, timeShift_#t~ret92, timeShift_#t~ret93, timeShift_#t~ret94, timeShift_#t~ret95, timeShift_#t~ret96, timeShift_#t~ret97, timeShift_#t~ret98, timeShift_#t~ret99, timeShift_~tmp~20, timeShift_~tmp___0~8, timeShift_~tmp___1~4, timeShift_~tmp___2~4, timeShift_~tmp___3~3, timeShift_~tmp___4~2, timeShift_~tmp___5~2, timeShift_~tmp___6~2, timeShift_~tmp___7~2, timeShift_~tmp___8~2, timeShift_~tmp___9~2;havoc timeShift_~tmp~20;havoc timeShift_~tmp___0~8;havoc timeShift_~tmp___1~4;havoc timeShift_~tmp___2~4;havoc timeShift_~tmp___3~3;havoc timeShift_~tmp___4~2;havoc timeShift_~tmp___5~2;havoc timeShift_~tmp___6~2;havoc timeShift_~tmp___7~2;havoc timeShift_~tmp___8~2;havoc timeShift_~tmp___9~2;havoc stopRequestedAtCurrentFloor_#res;havoc stopRequestedAtCurrentFloor_#t~ret73, stopRequestedAtCurrentFloor_#t~ret74, stopRequestedAtCurrentFloor_#t~ret75, stopRequestedAtCurrentFloor_#t~ret76, stopRequestedAtCurrentFloor_~retValue_acc~25, stopRequestedAtCurrentFloor_~tmp~18, stopRequestedAtCurrentFloor_~tmp___0~6;havoc stopRequestedAtCurrentFloor_~retValue_acc~25;havoc stopRequestedAtCurrentFloor_~tmp~18;havoc stopRequestedAtCurrentFloor_~tmp___0~6;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret147, isExecutiveFloorCalling_~retValue_acc~28;havoc isExecutiveFloorCalling_~retValue_acc~28;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~0;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~0; 54121#L128-30 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~0 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~0; 49573#L155-30 isExecutiveFloorCalling_#t~ret147 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~28 := isExecutiveFloorCalling_#t~ret147;havoc isExecutiveFloorCalling_#t~ret147;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~28; 54120#L3108-3 stopRequestedAtCurrentFloor_#t~ret73 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~18 := stopRequestedAtCurrentFloor_#t~ret73;havoc stopRequestedAtCurrentFloor_#t~ret73; 54119#L2492-1 assume 0 != stopRequestedAtCurrentFloor_~tmp~18;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; 54118#L1823-4 stopRequestedAtCurrentFloor_#t~ret74 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~6 := stopRequestedAtCurrentFloor_#t~ret74;havoc stopRequestedAtCurrentFloor_#t~ret74; 54117#L2496-1 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~6);stopRequestedAtCurrentFloor_~retValue_acc~25 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~25; 47932#L2509-1 timeShift_#t~ret89 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret89;havoc timeShift_#t~ret89; 48426#L2645-1 assume !(0 != timeShift_~tmp___9~2); 48427#L2736-3 assume !(1 == ~doorState~0); 54700#L2736-5 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret67, stopRequestedInDirection_#t~ret68, stopRequestedInDirection_#t~ret69, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~22, stopRequestedInDirection_~tmp~15, stopRequestedInDirection_~tmp___0~4, stopRequestedInDirection_~__cil_tmp7~5, stopRequestedInDirection_~__cil_tmp8~5;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~22;havoc stopRequestedInDirection_~tmp~15;havoc stopRequestedInDirection_~tmp___0~4;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret147, isExecutiveFloorCalling_~retValue_acc~28;havoc isExecutiveFloorCalling_~retValue_acc~28;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~0;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~0; 48672#L128-33 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~0 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~0; 47123#L155-33 isExecutiveFloorCalling_#t~ret147 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~28 := isExecutiveFloorCalling_#t~ret147;havoc isExecutiveFloorCalling_#t~ret147;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~28; 47021#L3108-4 stopRequestedInDirection_#t~ret67 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~4 := stopRequestedInDirection_#t~ret67;havoc stopRequestedInDirection_#t~ret67; 47022#L2375-2 assume 0 != stopRequestedInDirection_~tmp___0~4;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; 47392#L1823-5 stopRequestedInDirection_#t~ret68 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~15 := stopRequestedInDirection_#t~ret68;havoc stopRequestedInDirection_#t~ret68;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~15 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~22 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~22; 47393#L2388-2 timeShift_#t~ret96 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret96;havoc timeShift_#t~ret96; 48986#L2744-1 assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret70, continueInDirection_~dir, continueInDirection_~tmp~16;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~16;~currentHeading~0 := continueInDirection_~dir; 48988#L2432-3 assume !(1 == ~currentHeading~0); 47226#L2442-9 assume !(0 == ~currentFloorID~0); 47227#L2442-11 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 46694#L2448-11 havoc __utac_acc__Specification2_spec__3_#t~ret148, __utac_acc__Specification2_spec__3_#t~ret149, __utac_acc__Specification2_spec__3_#t~ret150, __utac_acc__Specification2_spec__3_#t~ret151, __utac_acc__Specification2_spec__3_#t~ret152, __utac_acc__Specification2_spec__3_#t~ret153, __utac_acc__Specification2_spec__3_~floor~0, __utac_acc__Specification2_spec__3_~tmp~22, __utac_acc__Specification2_spec__3_~tmp___0~10, __utac_acc__Specification2_spec__3_~tmp___1~6, __utac_acc__Specification2_spec__3_~tmp___2~6, __utac_acc__Specification2_spec__3_~tmp___3~5, __utac_acc__Specification2_spec__3_~tmp___4~3;havoc __utac_acc__Specification2_spec__3_~floor~0;havoc __utac_acc__Specification2_spec__3_~tmp~22;havoc __utac_acc__Specification2_spec__3_~tmp___0~10;havoc __utac_acc__Specification2_spec__3_~tmp___1~6;havoc __utac_acc__Specification2_spec__3_~tmp___2~6;havoc __utac_acc__Specification2_spec__3_~tmp___3~5;havoc __utac_acc__Specification2_spec__3_~tmp___4~3;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; 46695#L1823-7 __utac_acc__Specification2_spec__3_#t~ret148 := getCurrentFloorID_#res;__utac_acc__Specification2_spec__3_~tmp~22 := __utac_acc__Specification2_spec__3_#t~ret148;havoc __utac_acc__Specification2_spec__3_#t~ret148;__utac_acc__Specification2_spec__3_~floor~0 := __utac_acc__Specification2_spec__3_~tmp~22; 49029#L3181-1 assume 0 == __utac_acc__Specification2_spec__3_~floor~0; 49030#L3182-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; 46585#L1832-5 __utac_acc__Specification2_spec__3_#t~ret149 := areDoorsOpen_#res;__utac_acc__Specification2_spec__3_~tmp___4~3 := __utac_acc__Specification2_spec__3_#t~ret149;havoc __utac_acc__Specification2_spec__3_#t~ret149; 46586#L3186-2 assume 0 != __utac_acc__Specification2_spec__3_~tmp___4~3;~floorButtons_spc2_0~0 := 0; 46809#L3241-1 cleanup_~i~0 := 1 + cleanup_~i~0; 54149#L1402-2 [2019-01-14 04:00:14,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:00:14,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1750905250, now seen corresponding path program 2 times [2019-01-14 04:00:14,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:00:14,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:00:14,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:00:14,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:00:14,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:00:14,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:00:14,292 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:00:14,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:00:14,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:00:14,293 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:00:14,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:00:14,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1887445989, now seen corresponding path program 1 times [2019-01-14 04:00:14,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:00:14,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:00:14,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:00:14,295 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:00:14,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:00:14,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:00:14,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:00:15,079 WARN L181 SmtUtils]: Spent 685.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 160 [2019-01-14 04:00:15,996 WARN L181 SmtUtils]: Spent 873.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 124 [2019-01-14 04:00:16,015 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:00:16,016 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:00:16,016 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:00:16,016 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:00:16,017 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:00:16,017 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:00:16,017 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:00:16,017 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:00:16,017 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec2_product03_true-unreach-call_true-termination.cil.c_Iteration3_Loop [2019-01-14 04:00:16,017 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:00:16,018 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:00:16,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:00:16,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:00:16,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:16,071 INFO 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:00:16,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:16,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:00:16,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:00:16,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:16,111 INFO 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:00:16,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:16,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:16,125 INFO 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:00:16,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:16,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:16,130 INFO 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:00:16,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:16,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:16,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:16,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:00:16,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:16,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:16,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:16,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:16,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:16,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:00:16,234 INFO 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:00:16,238 INFO 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:00:16,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:16,240 INFO 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:00:16,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:00:16,243 INFO 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:00:16,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:00:16,259 INFO 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:00:16,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:00:16,261 INFO 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:00:16,279 INFO 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:00:16,302 INFO 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:00:16,305 INFO 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:00:16,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:16,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:16,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:16,312 INFO 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:00:16,313 INFO 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:00:16,317 INFO 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:00:16,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:16,320 INFO 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:00:16,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:16,322 INFO 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:00:16,324 INFO 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:00:16,325 INFO 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:00:16,327 INFO 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:00:16,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:00:16,330 INFO 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:00:16,337 INFO 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:00:16,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:16,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:16,347 INFO 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:00:16,357 INFO 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:00:16,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:16,367 INFO 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:00:16,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:00:16,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:00:16,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:00:16,377 INFO 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:00:16,383 INFO 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:00:16,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:16,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:16,444 INFO 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:00:16,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:00:16,904 WARN L181 SmtUtils]: Spent 298.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-14 04:00:17,685 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-14 04:00:17,807 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-01-14 04:00:18,457 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:00:18,459 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:00:18,472 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:00:18,473 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:00:18,490 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:00:18,491 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) [2019-01-14 04:00:18,524 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:00:18,525 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:00:18,540 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:00:18,540 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification2_spec__3_~tmp___1~6=0} Honda state: {ULTIMATE.start___utac_acc__Specification2_spec__3_~tmp___1~6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:00:18,572 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:00:18,572 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:00:18,582 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:00:18,583 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_isIdle_#t~ret55=0} Honda state: {ULTIMATE.start_isIdle_#t~ret55=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:00:18,605 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:00:18,605 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:00:18,608 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:00:18,608 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_continueInDirection_#t~ret70=0} Honda state: {ULTIMATE.start_continueInDirection_#t~ret70=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 04:00:18,652 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:00:18,653 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:00:18,668 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:00:18,668 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stopRequestedInDirection_#t~ret68=0} Honda state: {ULTIMATE.start_stopRequestedInDirection_#t~ret68=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 04:00:18,716 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:00:18,716 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:00:18,736 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:00:18,736 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_areDoorsOpen_#res=-8, ~doorState~0=-8, ULTIMATE.start_areDoorsOpen_~retValue_acc~15=-8, ULTIMATE.start___utac_acc__Specification2_spec__3_~tmp___4~3=-8} Honda state: {ULTIMATE.start_areDoorsOpen_#res=-8, ~doorState~0=-8, ULTIMATE.start_areDoorsOpen_~retValue_acc~15=-8, ULTIMATE.start___utac_acc__Specification2_spec__3_~tmp___4~3=-8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:00:18,778 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:00:18,778 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:00:18,786 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:00:18,786 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_isExecutiveFloorCalling_#t~ret147=0} Honda state: {ULTIMATE.start_isExecutiveFloorCalling_#t~ret147=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:00:18,829 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:00:18,829 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:00:18,841 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:00:18,842 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification2_spec__3_#t~ret149=0} Honda state: {ULTIMATE.start___utac_acc__Specification2_spec__3_#t~ret149=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 04:00:18,879 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:00:18,880 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:00:18,908 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:00:18,909 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:00:19,425 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:00:19,429 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:00:19,429 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:00:19,429 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:00:19,429 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:00:19,429 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:00:19,429 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:00:19,430 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:00:19,432 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:00:19,432 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec2_product03_true-unreach-call_true-termination.cil.c_Iteration3_Loop [2019-01-14 04:00:19,432 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:00:19,432 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:00:19,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:19,555 INFO 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:00:19,582 INFO 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:00:19,609 INFO 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:00:19,690 INFO 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:00:19,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:19,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:19,772 INFO 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:00:19,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:19,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:19,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:19,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:00:19,977 INFO 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:00:20,136 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-14 04:00:20,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:20,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:20,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:00:20,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:20,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:20,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:20,289 INFO 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:00:20,361 INFO 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:00:20,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:00:20,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:20,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:00:20,372 INFO 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:00:20,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:00:20,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:00:20,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:20,380 INFO 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:00:20,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:00:20,383 INFO 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:00:20,384 INFO 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:00:20,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:20,386 INFO 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:00:20,387 INFO 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:00:20,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:00:20,428 INFO 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:00:20,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:20,499 INFO 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:00:20,526 INFO 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:00:20,558 INFO 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:00:20,587 INFO 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:00:20,610 INFO 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:00:20,635 INFO 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:00:20,668 INFO 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:00:20,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:20,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:20,746 INFO 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:00:20,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:20,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:20,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:20,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:20,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:00:20,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:00:20,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:20,973 INFO 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:00:20,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:20,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:20,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:20,994 INFO 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:00:21,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:21,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:21,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:21,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:21,036 INFO 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:00:21,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:21,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:21,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:21,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:21,286 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-14 04:00:21,475 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-14 04:00:22,223 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:00:22,231 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:00:22,234 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:00:22,238 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:00:22,238 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:00:22,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:00:22,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:00:22,239 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:00:22,244 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:00:22,245 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:00:22,250 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:00:22,251 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:00:22,251 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:00:22,251 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:00:22,251 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:00:22,251 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:00:22,252 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:00:22,252 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:00:22,252 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:00:22,258 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:00:22,258 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:00:22,262 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:00:22,262 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:00:22,262 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:00:22,263 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:00:22,263 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:00:22,263 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:00:22,263 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:00:22,264 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:00:22,268 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:00:22,268 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:00:22,269 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:00:22,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:00:22,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:00:22,272 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:00:22,273 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:00:22,273 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:00:22,276 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:00:22,277 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:00:22,278 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:00:22,278 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:00:22,278 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:00:22,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:00:22,279 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:00:22,282 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:00:22,282 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:00:22,283 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:00:22,284 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:00:22,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:00:22,284 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:00:22,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:00:22,285 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:00:22,288 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:00:22,288 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:00:22,288 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:00:22,289 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:00:22,292 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:00:22,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:00:22,293 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:00:22,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:00:22,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:00:22,293 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:00:22,294 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:00:22,294 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:00:22,294 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:00:22,298 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:00:22,299 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:00:22,299 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:00:22,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:00:22,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:00:22,299 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:00:22,300 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:00:22,300 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:00:22,300 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:00:22,303 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:00:22,304 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:00:22,304 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:00:22,304 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:00:22,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:00:22,304 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:00:22,305 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:00:22,305 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:00:22,315 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:00:22,327 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 04:00:22,327 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:00:22,333 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:00:22,333 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:00:22,333 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:00:22,336 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:00:22,337 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:00:22,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:00:22,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:00:22,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:00:22,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:00:22,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:00:22,687 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:00:22,693 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:00:22,695 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8466 states and 15850 transitions. cyclomatic complexity: 7386 Second operand 5 states. [2019-01-14 04:00:23,193 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-14 04:00:23,456 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8466 states and 15850 transitions. cyclomatic complexity: 7386. Second operand 5 states. Result 12839 states and 24011 transitions. Complement of second has 8 states. [2019-01-14 04:00:23,458 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:00:23,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 04:00:23,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 4334 transitions. [2019-01-14 04:00:23,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 4334 transitions. Stem has 41 letters. Loop has 39 letters. [2019-01-14 04:00:23,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:00:23,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 4334 transitions. Stem has 80 letters. Loop has 39 letters. [2019-01-14 04:00:23,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:00:23,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 4334 transitions. Stem has 41 letters. Loop has 78 letters. [2019-01-14 04:00:23,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:00:23,478 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12839 states and 24011 transitions. [2019-01-14 04:00:23,571 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:00:23,571 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12839 states to 0 states and 0 transitions. [2019-01-14 04:00:23,572 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:00:23,572 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:00:23,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:00:23,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:00:23,572 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:00:23,572 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:00:23,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:00:23,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:00:23,577 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2019-01-14 04:00:23,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:00:23,577 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-14 04:00:23,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 04:00:23,577 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-14 04:00:23,578 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:00:23,581 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 04:00:23,581 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:00:23,581 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:00:23,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:00:23,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:00:23,581 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:00:23,582 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:00:23,582 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:00:23,582 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 04:00:23,582 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 04:00:23,582 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:00:23,582 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 04:00:23,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:00:23 BoogieIcfgContainer [2019-01-14 04:00:23,595 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:00:23,596 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:00:23,596 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:00:23,596 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:00:23,599 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:00:01" (3/4) ... [2019-01-14 04:00:23,604 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 04:00:23,605 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:00:23,606 INFO L168 Benchmark]: Toolchain (without parser) took 33429.49 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 497.0 MB). Free memory was 948.6 MB in the beginning and 821.8 MB in the end (delta: 126.8 MB). Peak memory consumption was 623.8 MB. Max. memory is 11.5 GB. [2019-01-14 04:00:23,608 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:00:23,608 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1118.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 948.6 MB in the beginning and 1.1 GB in the end (delta: -166.0 MB). Peak memory consumption was 57.9 MB. Max. memory is 11.5 GB. [2019-01-14 04:00:23,610 INFO L168 Benchmark]: Boogie Procedure Inliner took 275.27 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: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. [2019-01-14 04:00:23,611 INFO L168 Benchmark]: Boogie Preprocessor took 218.43 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: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2019-01-14 04:00:23,613 INFO L168 Benchmark]: RCFGBuilder took 9365.94 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 108.0 MB). Free memory was 1.1 GB in the beginning and 817.3 MB in the end (delta: 250.4 MB). Peak memory consumption was 358.4 MB. Max. memory is 11.5 GB. [2019-01-14 04:00:23,614 INFO L168 Benchmark]: BuchiAutomizer took 22434.77 ms. Allocated memory was 1.3 GB in the beginning and 1.5 GB in the end (delta: 240.1 MB). Free memory was 817.3 MB in the beginning and 821.8 MB in the end (delta: -4.5 MB). Peak memory consumption was 235.6 MB. Max. memory is 11.5 GB. [2019-01-14 04:00:23,616 INFO L168 Benchmark]: Witness Printer took 9.01 ms. Allocated memory is still 1.5 GB. Free memory is still 821.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:00:23,623 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 1118.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 948.6 MB in the beginning and 1.1 GB in the end (delta: -166.0 MB). Peak memory consumption was 57.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 275.27 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: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 218.43 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: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 9365.94 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 108.0 MB). Free memory was 1.1 GB in the beginning and 817.3 MB in the end (delta: 250.4 MB). Peak memory consumption was 358.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 22434.77 ms. Allocated memory was 1.3 GB in the beginning and 1.5 GB in the end (delta: 240.1 MB). Free memory was 817.3 MB in the beginning and 821.8 MB in the end (delta: -4.5 MB). Peak memory consumption was 235.6 MB. Max. memory is 11.5 GB. * Witness Printer took 9.01 ms. Allocated memory is still 1.5 GB. Free memory is still 821.8 MB. 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 22.3s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 9.4s. Construction of modules took 7.3s. Büchi inclusion checks took 3.2s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.5s AutomataMinimizationTime, 2 MinimizatonAttempts, 22512 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 1.0s Buchi closure took 0.0s. Biggest automaton had 8466 states and ocurred in iteration 2. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 17160 SDtfs, 74459 SDslu, 50728 SDs, 0 SdLazy, 2577 SolverSat, 699 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.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: 17ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 8 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.7s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...