./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/product-lines/elevator_spec9_product11_true-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9d21fcf5-a9e3-43c5-81c8-46221854755b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9d21fcf5-a9e3-43c5-81c8-46221854755b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9d21fcf5-a9e3-43c5-81c8-46221854755b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9d21fcf5-a9e3-43c5-81c8-46221854755b/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/product-lines/elevator_spec9_product11_true-unreach-call_true-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_9d21fcf5-a9e3-43c5-81c8-46221854755b/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9d21fcf5-a9e3-43c5-81c8-46221854755b/bin-2019/uautomizer --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 477f7f73ea52dc44f7739298d6b0f23f439f3cf1 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 06:07:22,886 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 06:07:22,888 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 06:07:22,896 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 06:07:22,896 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 06:07:22,897 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 06:07:22,898 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 06:07:22,899 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 06:07:22,900 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 06:07:22,900 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 06:07:22,901 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 06:07:22,901 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 06:07:22,902 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 06:07:22,902 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 06:07:22,903 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 06:07:22,903 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 06:07:22,904 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 06:07:22,905 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 06:07:22,906 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 06:07:22,907 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 06:07:22,908 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 06:07:22,909 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 06:07:22,910 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 06:07:22,910 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 06:07:22,910 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 06:07:22,911 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 06:07:22,911 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 06:07:22,912 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 06:07:22,912 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 06:07:22,913 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 06:07:22,913 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 06:07:22,914 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 06:07:22,914 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 06:07:22,914 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 06:07:22,914 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 06:07:22,915 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 06:07:22,915 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9d21fcf5-a9e3-43c5-81c8-46221854755b/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-23 06:07:22,925 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 06:07:22,925 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 06:07:22,926 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 06:07:22,926 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 06:07:22,926 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 06:07:22,926 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 06:07:22,926 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 06:07:22,926 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 06:07:22,927 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 06:07:22,927 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 06:07:22,927 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 06:07:22,927 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 06:07:22,927 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 06:07:22,927 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 06:07:22,927 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 06:07:22,927 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 06:07:22,928 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 06:07:22,928 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 06:07:22,928 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 06:07:22,928 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 06:07:22,928 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 06:07:22,928 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 06:07:22,928 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 06:07:22,928 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 06:07:22,929 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 06:07:22,929 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 06:07:22,929 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 06:07:22,929 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 06:07:22,929 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 06:07:22,929 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 06:07:22,929 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 06:07:22,930 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 06:07:22,930 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_9d21fcf5-a9e3-43c5-81c8-46221854755b/bin-2019/uautomizer 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 -> 477f7f73ea52dc44f7739298d6b0f23f439f3cf1 [2018-11-23 06:07:22,951 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 06:07:22,959 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 06:07:22,962 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 06:07:22,963 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 06:07:22,963 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 06:07:22,963 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9d21fcf5-a9e3-43c5-81c8-46221854755b/bin-2019/uautomizer/../../sv-benchmarks/c/product-lines/elevator_spec9_product11_true-unreach-call_true-termination.cil.c [2018-11-23 06:07:23,003 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9d21fcf5-a9e3-43c5-81c8-46221854755b/bin-2019/uautomizer/data/dc75a2ab3/d5e3c902a04b49668c59450a178484f3/FLAGdcccbfa08 [2018-11-23 06:07:23,484 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 06:07:23,485 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9d21fcf5-a9e3-43c5-81c8-46221854755b/sv-benchmarks/c/product-lines/elevator_spec9_product11_true-unreach-call_true-termination.cil.c [2018-11-23 06:07:23,496 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9d21fcf5-a9e3-43c5-81c8-46221854755b/bin-2019/uautomizer/data/dc75a2ab3/d5e3c902a04b49668c59450a178484f3/FLAGdcccbfa08 [2018-11-23 06:07:23,981 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9d21fcf5-a9e3-43c5-81c8-46221854755b/bin-2019/uautomizer/data/dc75a2ab3/d5e3c902a04b49668c59450a178484f3 [2018-11-23 06:07:23,983 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 06:07:23,984 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 06:07:23,985 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 06:07:23,985 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 06:07:23,988 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 06:07:23,989 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:07:23" (1/1) ... [2018-11-23 06:07:23,991 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@190dcc22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:07:23, skipping insertion in model container [2018-11-23 06:07:23,991 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:07:23" (1/1) ... [2018-11-23 06:07:23,999 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 06:07:24,050 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 06:07:24,441 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:07:24,450 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 06:07:24,533 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:07:24,573 INFO L195 MainTranslator]: Completed translation [2018-11-23 06:07:24,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:07:24 WrapperNode [2018-11-23 06:07:24,573 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 06:07:24,574 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 06:07:24,574 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 06:07:24,574 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 06:07:24,581 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:07:24" (1/1) ... [2018-11-23 06:07:24,602 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:07:24" (1/1) ... [2018-11-23 06:07:24,700 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 06:07:24,700 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 06:07:24,700 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 06:07:24,700 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 06:07:24,708 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:07:24" (1/1) ... [2018-11-23 06:07:24,709 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:07:24" (1/1) ... [2018-11-23 06:07:24,722 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:07:24" (1/1) ... [2018-11-23 06:07:24,722 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:07:24" (1/1) ... [2018-11-23 06:07:24,751 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:07:24" (1/1) ... [2018-11-23 06:07:24,785 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:07:24" (1/1) ... [2018-11-23 06:07:24,796 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:07:24" (1/1) ... [2018-11-23 06:07:24,810 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 06:07:24,810 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 06:07:24,810 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 06:07:24,811 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 06:07:24,811 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:07:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9d21fcf5-a9e3-43c5-81c8-46221854755b/bin-2019/uautomizer/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 [2018-11-23 06:07:24,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 06:07:24,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-11-23 06:07:24,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 06:07:24,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 06:07:28,233 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 06:07:28,234 INFO L280 CfgBuilder]: Removed 553 assue(true) statements. [2018-11-23 06:07:28,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:07:28 BoogieIcfgContainer [2018-11-23 06:07:28,234 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 06:07:28,235 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 06:07:28,235 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 06:07:28,237 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 06:07:28,238 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 06:07:28,238 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 06:07:23" (1/3) ... [2018-11-23 06:07:28,239 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@47ecf283 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 06:07:28, skipping insertion in model container [2018-11-23 06:07:28,239 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 06:07:28,239 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:07:24" (2/3) ... [2018-11-23 06:07:28,240 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@47ecf283 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 06:07:28, skipping insertion in model container [2018-11-23 06:07:28,240 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 06:07:28,240 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:07:28" (3/3) ... [2018-11-23 06:07:28,241 INFO L375 chiAutomizerObserver]: Analyzing ICFG elevator_spec9_product11_true-unreach-call_true-termination.cil.c [2018-11-23 06:07:28,285 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 06:07:28,285 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 06:07:28,285 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 06:07:28,286 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 06:07:28,286 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 06:07:28,286 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 06:07:28,286 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 06:07:28,286 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 06:07:28,286 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 06:07:28,326 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2407 states. [2018-11-23 06:07:28,385 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1193 [2018-11-23 06:07:28,386 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:07:28,386 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:07:28,398 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:07:28,398 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:07:28,398 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 06:07:28,399 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2407 states. [2018-11-23 06:07:28,419 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1193 [2018-11-23 06:07:28,419 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:07:28,419 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:07:28,422 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:07:28,422 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:07:28,428 INFO L794 eck$LassoCheckResult]: Stem: 284#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call #t~string38.base, #t~string38.offset := #Ultimate.alloc(30);call #t~string39.base, #t~string39.offset := #Ultimate.alloc(9);call #t~string40.base, #t~string40.offset := #Ultimate.alloc(21);call #t~string41.base, #t~string41.offset := #Ultimate.alloc(30);call #t~string42.base, #t~string42.offset := #Ultimate.alloc(9);call #t~string43.base, #t~string43.offset := #Ultimate.alloc(21);call #t~string47.base, #t~string47.offset := #Ultimate.alloc(30);call #t~string48.base, #t~string48.offset := #Ultimate.alloc(9);call #t~string49.base, #t~string49.offset := #Ultimate.alloc(25);call #t~string50.base, #t~string50.offset := #Ultimate.alloc(30);call #t~string51.base, #t~string51.offset := #Ultimate.alloc(9);call #t~string52.base, #t~string52.offset := #Ultimate.alloc(25);call #t~string110.base, #t~string110.offset := #Ultimate.alloc(10);call #t~string112.base, #t~string112.offset := #Ultimate.alloc(4);call write~init~int(91, #t~string112.base, #t~string112.offset, 1);call write~init~int(95, #t~string112.base, 1 + #t~string112.offset, 1);call write~init~int(93, #t~string112.base, 2 + #t~string112.offset, 1);call write~init~int(0, #t~string112.base, 3 + #t~string112.offset, 1);call #t~string114.base, #t~string114.offset := #Ultimate.alloc(4);call write~init~int(91, #t~string114.base, #t~string114.offset, 1);call write~init~int(93, #t~string114.base, 1 + #t~string114.offset, 1);call write~init~int(32, #t~string114.base, 2 + #t~string114.offset, 1);call write~init~int(0, #t~string114.base, 3 + #t~string114.offset, 1);call #t~string116.base, #t~string116.offset := #Ultimate.alloc(5);call write~init~int(32, #t~string116.base, #t~string116.offset, 1);call write~init~int(97, #t~string116.base, 1 + #t~string116.offset, 1);call write~init~int(116, #t~string116.base, 2 + #t~string116.offset, 1);call write~init~int(32, #t~string116.base, 3 + #t~string116.offset, 1);call write~init~int(0, #t~string116.base, 4 + #t~string116.offset, 1);call #t~string118.base, #t~string118.offset := #Ultimate.alloc(3);call write~init~int(37, #t~string118.base, #t~string118.offset, 1);call write~init~int(105, #t~string118.base, 1 + #t~string118.offset, 1);call write~init~int(0, #t~string118.base, 2 + #t~string118.offset, 1);call #t~string120.base, #t~string120.offset := #Ultimate.alloc(10);call #t~string122.base, #t~string122.offset := #Ultimate.alloc(3);call write~init~int(117, #t~string122.base, #t~string122.offset, 1);call write~init~int(112, #t~string122.base, 1 + #t~string122.offset, 1);call write~init~int(0, #t~string122.base, 2 + #t~string122.offset, 1);call #t~string124.base, #t~string124.offset := #Ultimate.alloc(5);call write~init~int(100, #t~string124.base, #t~string124.offset, 1);call write~init~int(111, #t~string124.base, 1 + #t~string124.offset, 1);call write~init~int(119, #t~string124.base, 2 + #t~string124.offset, 1);call write~init~int(110, #t~string124.base, 3 + #t~string124.offset, 1);call write~init~int(0, #t~string124.base, 4 + #t~string124.offset, 1);call #t~string126.base, #t~string126.offset := #Ultimate.alloc(7);call write~init~int(32, #t~string126.base, #t~string126.offset, 1);call write~init~int(73, #t~string126.base, 1 + #t~string126.offset, 1);call write~init~int(76, #t~string126.base, 2 + #t~string126.offset, 1);call write~init~int(95, #t~string126.base, 3 + #t~string126.offset, 1);call write~init~int(112, #t~string126.base, 4 + #t~string126.offset, 1);call write~init~int(58, #t~string126.base, 5 + #t~string126.offset, 1);call write~init~int(0, #t~string126.base, 6 + #t~string126.offset, 1);call #t~string128.base, #t~string128.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string128.base, #t~string128.offset, 1);call write~init~int(37, #t~string128.base, 1 + #t~string128.offset, 1);call write~init~int(105, #t~string128.base, 2 + #t~string128.offset, 1);call write~init~int(0, #t~string128.base, 3 + #t~string128.offset, 1);call #t~string130.base, #t~string130.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string130.base, #t~string130.offset, 1);call write~init~int(37, #t~string130.base, 1 + #t~string130.offset, 1);call write~init~int(105, #t~string130.base, 2 + #t~string130.offset, 1);call write~init~int(0, #t~string130.base, 3 + #t~string130.offset, 1);call #t~string132.base, #t~string132.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string132.base, #t~string132.offset, 1);call write~init~int(37, #t~string132.base, 1 + #t~string132.offset, 1);call write~init~int(105, #t~string132.base, 2 + #t~string132.offset, 1);call write~init~int(0, #t~string132.base, 3 + #t~string132.offset, 1);call #t~string134.base, #t~string134.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string134.base, #t~string134.offset, 1);call write~init~int(37, #t~string134.base, 1 + #t~string134.offset, 1);call write~init~int(105, #t~string134.base, 2 + #t~string134.offset, 1);call write~init~int(0, #t~string134.base, 3 + #t~string134.offset, 1);call #t~string136.base, #t~string136.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string136.base, #t~string136.offset, 1);call write~init~int(37, #t~string136.base, 1 + #t~string136.offset, 1);call write~init~int(105, #t~string136.base, 2 + #t~string136.offset, 1);call write~init~int(0, #t~string136.base, 3 + #t~string136.offset, 1);call #t~string138.base, #t~string138.offset := #Ultimate.alloc(6);call write~init~int(32, #t~string138.base, #t~string138.offset, 1);call write~init~int(70, #t~string138.base, 1 + #t~string138.offset, 1);call write~init~int(95, #t~string138.base, 2 + #t~string138.offset, 1);call write~init~int(112, #t~string138.base, 3 + #t~string138.offset, 1);call write~init~int(58, #t~string138.base, 4 + #t~string138.offset, 1);call write~init~int(0, #t~string138.base, 5 + #t~string138.offset, 1);call #t~string141.base, #t~string141.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string141.base, #t~string141.offset, 1);call write~init~int(37, #t~string141.base, 1 + #t~string141.offset, 1);call write~init~int(105, #t~string141.base, 2 + #t~string141.offset, 1);call write~init~int(0, #t~string141.base, 3 + #t~string141.offset, 1);call #t~string144.base, #t~string144.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string144.base, #t~string144.offset, 1);call write~init~int(37, #t~string144.base, 1 + #t~string144.offset, 1);call write~init~int(105, #t~string144.base, 2 + #t~string144.offset, 1);call write~init~int(0, #t~string144.base, 3 + #t~string144.offset, 1);call #t~string147.base, #t~string147.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string147.base, #t~string147.offset, 1);call write~init~int(37, #t~string147.base, 1 + #t~string147.offset, 1);call write~init~int(105, #t~string147.base, 2 + #t~string147.offset, 1);call write~init~int(0, #t~string147.base, 3 + #t~string147.offset, 1);call #t~string150.base, #t~string150.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string150.base, #t~string150.offset, 1);call write~init~int(37, #t~string150.base, 1 + #t~string150.offset, 1);call write~init~int(105, #t~string150.base, 2 + #t~string150.offset, 1);call write~init~int(0, #t~string150.base, 3 + #t~string150.offset, 1);call #t~string153.base, #t~string153.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string153.base, #t~string153.offset, 1);call write~init~int(37, #t~string153.base, 1 + #t~string153.offset, 1);call write~init~int(105, #t~string153.base, 2 + #t~string153.offset, 1);call write~init~int(0, #t~string153.base, 3 + #t~string153.offset, 1);call #t~string155.base, #t~string155.offset := #Ultimate.alloc(2);call write~init~int(10, #t~string155.base, #t~string155.offset, 1);call write~init~int(0, #t~string155.base, 1 + #t~string155.offset, 1);~executiveFloor~0 := 4;~cleanupTimeShifts~0 := 12;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0;~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; 1387#L-1true havoc main_#res;havoc main_#t~ret19, main_~retValue_acc~1, main_~tmp~10;havoc main_~retValue_acc~1;havoc main_~tmp~10; 609#L1047true havoc valid_product_#res;havoc valid_product_~retValue_acc~6;havoc valid_product_~retValue_acc~6;valid_product_~retValue_acc~6 := 1;valid_product_#res := valid_product_~retValue_acc~6; 1419#L1055true main_#t~ret19 := valid_product_#res;main_~tmp~10 := main_#t~ret19;havoc main_#t~ret19; 1666#L482true assume 0 != main_~tmp~10; 2178#L451true ~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 1552#L880true havoc bigMacCall_#t~ret12, bigMacCall_~tmp~7;havoc bigMacCall_~tmp~7;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~8;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~8; 1109#L1105true assume 0 == getOrigin_~person;getOrigin_~retValue_acc~8 := 4;getOrigin_#res := getOrigin_~retValue_acc~8; 978#L1130true bigMacCall_#t~ret12 := getOrigin_#res;bigMacCall_~tmp~7 := bigMacCall_#t~ret12;havoc bigMacCall_#t~ret12;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~7;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 610#L3073true assume 0 == initPersonOnFloor_~floor; 716#L3074true assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 2037#L3181-1true callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 1353#L2865true assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 1832#L2877-2true havoc cleanup_#t~ret13, cleanup_#t~ret14, cleanup_~i~2, cleanup_~tmp~8, cleanup_~tmp___0~2, cleanup_~__cil_tmp4~0;havoc cleanup_~i~2;havoc cleanup_~tmp~8;havoc cleanup_~tmp___0~2;havoc cleanup_~__cil_tmp4~0;havoc timeShift_#t~ret99, timeShift_#t~ret100, timeShift_#t~ret101, timeShift_#t~ret102, timeShift_#t~ret103, timeShift_#t~ret104, timeShift_#t~ret105, timeShift_#t~ret106, timeShift_#t~ret107, timeShift_#t~ret108, timeShift_#t~ret109, timeShift_~tmp~24, timeShift_~tmp___0~11, timeShift_~tmp___1~7, 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~24;havoc timeShift_~tmp___0~11;havoc timeShift_~tmp___1~7;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~ret83, stopRequestedAtCurrentFloor_#t~ret84, stopRequestedAtCurrentFloor_#t~ret85, stopRequestedAtCurrentFloor_#t~ret86, stopRequestedAtCurrentFloor_~retValue_acc~22, stopRequestedAtCurrentFloor_~tmp~22, stopRequestedAtCurrentFloor_~tmp___0~9;havoc stopRequestedAtCurrentFloor_~retValue_acc~22;havoc stopRequestedAtCurrentFloor_~tmp~22;havoc stopRequestedAtCurrentFloor_~tmp___0~9;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret157, isExecutiveFloorCalling_~retValue_acc~25;havoc isExecutiveFloorCalling_~retValue_acc~25;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~27;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~27; 96#L2802true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~27 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~27; 2207#L2829true isExecutiveFloorCalling_#t~ret157 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~25 := isExecutiveFloorCalling_#t~ret157;havoc isExecutiveFloorCalling_#t~ret157;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~25; 375#L2706true stopRequestedAtCurrentFloor_#t~ret83 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~22 := stopRequestedAtCurrentFloor_#t~ret83;havoc stopRequestedAtCurrentFloor_#t~ret83; 227#L2091true assume 0 != stopRequestedAtCurrentFloor_~tmp~22;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~11;havoc getCurrentFloorID_~retValue_acc~11;getCurrentFloorID_~retValue_acc~11 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~11; 1887#L1422true stopRequestedAtCurrentFloor_#t~ret84 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~9 := stopRequestedAtCurrentFloor_#t~ret84;havoc stopRequestedAtCurrentFloor_#t~ret84; 151#L2095true assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~9);stopRequestedAtCurrentFloor_~retValue_acc~22 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~22; 584#L2108true timeShift_#t~ret99 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret99;havoc timeShift_#t~ret99; 1699#L2243true assume !(0 != timeShift_~tmp___9~2); 1471#L2334true assume !(1 == ~doorState~0); 1479#L2334-2true stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret77, stopRequestedInDirection_#t~ret78, stopRequestedInDirection_#t~ret79, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~19, stopRequestedInDirection_~tmp~19, stopRequestedInDirection_~tmp___0~7, 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~19;havoc stopRequestedInDirection_~tmp~19;havoc stopRequestedInDirection_~tmp___0~7;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret157, isExecutiveFloorCalling_~retValue_acc~25;havoc isExecutiveFloorCalling_~retValue_acc~25;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~27;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~27; 99#L2802-3true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~27 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~27; 2215#L2829-3true isExecutiveFloorCalling_#t~ret157 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~25 := isExecutiveFloorCalling_#t~ret157;havoc isExecutiveFloorCalling_#t~ret157;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~25; 382#L2706-1true stopRequestedInDirection_#t~ret77 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~7 := stopRequestedInDirection_#t~ret77;havoc stopRequestedInDirection_#t~ret77; 628#L1974true assume 0 != stopRequestedInDirection_~tmp___0~7;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~11;havoc getCurrentFloorID_~retValue_acc~11;getCurrentFloorID_~retValue_acc~11 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~11; 1888#L1422-1true stopRequestedInDirection_#t~ret78 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~19 := stopRequestedInDirection_#t~ret78;havoc stopRequestedInDirection_#t~ret78;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~19 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~19 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~19; 1201#L1987true timeShift_#t~ret106 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret106;havoc timeShift_#t~ret106; 2377#L2342true assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret80, continueInDirection_~dir, continueInDirection_~tmp~20;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~20;~currentHeading~0 := continueInDirection_~dir; 1217#L2031true assume !(1 == ~currentHeading~0); 1797#L2041true assume 0 == ~currentFloorID~0;~currentHeading~0 := 1; 1798#L2041-2true assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 320#L2047-5true havoc __utac_acc__Specification9_spec__3_#t~ret55, __utac_acc__Specification9_spec__3_#t~ret56, __utac_acc__Specification9_spec__3_#t~ret57, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~14, __utac_acc__Specification9_spec__3_~tmp___0~4, __utac_acc__Specification9_spec__3_~tmp___1~3;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~14;havoc __utac_acc__Specification9_spec__3_~tmp___0~4;havoc __utac_acc__Specification9_spec__3_~tmp___1~3;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~11;havoc getCurrentFloorID_~retValue_acc~11;getCurrentFloorID_~retValue_acc~11 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~11; 1892#L1422-3true __utac_acc__Specification9_spec__3_#t~ret55 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~14 := __utac_acc__Specification9_spec__3_#t~ret55;havoc __utac_acc__Specification9_spec__3_#t~ret55;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~14;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~15;havoc isEmpty_~retValue_acc~15; 956#L1482-6true assume 1 == ~persons_0~0;isEmpty_~retValue_acc~15 := 0;isEmpty_#res := isEmpty_~retValue_acc~15; 1839#L1514-6true __utac_acc__Specification9_spec__3_#t~ret56 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~3 := __utac_acc__Specification9_spec__3_#t~ret56;havoc __utac_acc__Specification9_spec__3_#t~ret56; 1415#L923true assume 0 != __utac_acc__Specification9_spec__3_~tmp___1~3;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 2349#L933-1true cleanup_~i~2 := 0; 447#L283-2true [2018-11-23 06:07:28,429 INFO L796 eck$LassoCheckResult]: Loop: 447#L283-2true assume !false; 257#L284true cleanup_~__cil_tmp4~0 := ~cleanupTimeShifts~0 - 1; 135#L287true assume cleanup_~i~2 < cleanup_~__cil_tmp4~0;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~10;havoc isBlocked_~retValue_acc~10;isBlocked_~retValue_acc~10 := 0;isBlocked_#res := isBlocked_~retValue_acc~10; 659#L1269true cleanup_#t~ret13 := isBlocked_#res;cleanup_~tmp___0~2 := cleanup_#t~ret13;havoc cleanup_#t~ret13; 108#L291true assume 1 != cleanup_~tmp___0~2; 107#L291-1true havoc isIdle_#res;havoc isIdle_#t~ret65, isIdle_~retValue_acc~17, isIdle_~tmp~17;havoc isIdle_~retValue_acc~17;havoc isIdle_~tmp~17;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret60, anyStopRequested_#t~ret61, anyStopRequested_#t~ret62, anyStopRequested_#t~ret63, anyStopRequested_#t~ret64, anyStopRequested_~retValue_acc~16, anyStopRequested_~tmp~16, anyStopRequested_~tmp___0~5, anyStopRequested_~tmp___1~4, anyStopRequested_~tmp___2~1, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~16;havoc anyStopRequested_~tmp~16;havoc anyStopRequested_~tmp___0~5;havoc anyStopRequested_~tmp___1~4;havoc anyStopRequested_~tmp___2~1;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~27;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~27; 1015#L2802-25true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~27 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~27; 2145#L2829-25true anyStopRequested_#t~ret60 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret60;havoc anyStopRequested_#t~ret60; 890#L1530true assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~16 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~16; 2348#L1594true isIdle_#t~ret65 := anyStopRequested_#res;isIdle_~tmp~17 := isIdle_#t~ret65;havoc isIdle_#t~ret65;isIdle_~retValue_acc~17 := (if 0 == isIdle_~tmp~17 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~17; 302#L1607true cleanup_#t~ret14 := isIdle_#res;cleanup_~tmp~8 := cleanup_#t~ret14;havoc cleanup_#t~ret14; 560#L303true assume !(0 != cleanup_~tmp~8);havoc timeShift_#t~ret99, timeShift_#t~ret100, timeShift_#t~ret101, timeShift_#t~ret102, timeShift_#t~ret103, timeShift_#t~ret104, timeShift_#t~ret105, timeShift_#t~ret106, timeShift_#t~ret107, timeShift_#t~ret108, timeShift_#t~ret109, timeShift_~tmp~24, timeShift_~tmp___0~11, timeShift_~tmp___1~7, 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~24;havoc timeShift_~tmp___0~11;havoc timeShift_~tmp___1~7;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~ret83, stopRequestedAtCurrentFloor_#t~ret84, stopRequestedAtCurrentFloor_#t~ret85, stopRequestedAtCurrentFloor_#t~ret86, stopRequestedAtCurrentFloor_~retValue_acc~22, stopRequestedAtCurrentFloor_~tmp~22, stopRequestedAtCurrentFloor_~tmp___0~9;havoc stopRequestedAtCurrentFloor_~retValue_acc~22;havoc stopRequestedAtCurrentFloor_~tmp~22;havoc stopRequestedAtCurrentFloor_~tmp___0~9;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret157, isExecutiveFloorCalling_~retValue_acc~25;havoc isExecutiveFloorCalling_~retValue_acc~25;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~27;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~27; 1006#L2802-30true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~27 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~27; 2152#L2829-30true isExecutiveFloorCalling_#t~ret157 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~25 := isExecutiveFloorCalling_#t~ret157;havoc isExecutiveFloorCalling_#t~ret157;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~25; 385#L2706-3true stopRequestedAtCurrentFloor_#t~ret83 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~22 := stopRequestedAtCurrentFloor_#t~ret83;havoc stopRequestedAtCurrentFloor_#t~ret83; 228#L2091-1true assume 0 != stopRequestedAtCurrentFloor_~tmp~22;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~11;havoc getCurrentFloorID_~retValue_acc~11;getCurrentFloorID_~retValue_acc~11 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~11; 1895#L1422-4true stopRequestedAtCurrentFloor_#t~ret84 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~9 := stopRequestedAtCurrentFloor_#t~ret84;havoc stopRequestedAtCurrentFloor_#t~ret84; 140#L2095-1true assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~9);stopRequestedAtCurrentFloor_~retValue_acc~22 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~22; 583#L2108-1true timeShift_#t~ret99 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret99;havoc timeShift_#t~ret99; 1703#L2243-1true assume !(0 != timeShift_~tmp___9~2); 1478#L2334-3true assume 1 == ~doorState~0;~doorState~0 := 0; 1458#L2334-5true stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret77, stopRequestedInDirection_#t~ret78, stopRequestedInDirection_#t~ret79, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~19, stopRequestedInDirection_~tmp~19, stopRequestedInDirection_~tmp___0~7, 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~19;havoc stopRequestedInDirection_~tmp~19;havoc stopRequestedInDirection_~tmp___0~7;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret157, isExecutiveFloorCalling_~retValue_acc~25;havoc isExecutiveFloorCalling_~retValue_acc~25;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~27;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~27; 1009#L2802-33true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~27 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~27; 2139#L2829-33true isExecutiveFloorCalling_#t~ret157 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~25 := isExecutiveFloorCalling_#t~ret157;havoc isExecutiveFloorCalling_#t~ret157;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~25; 359#L2706-4true stopRequestedInDirection_#t~ret77 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~7 := stopRequestedInDirection_#t~ret77;havoc stopRequestedInDirection_#t~ret77; 549#L1974-2true assume 0 != stopRequestedInDirection_~tmp___0~7;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~11;havoc getCurrentFloorID_~retValue_acc~11;getCurrentFloorID_~retValue_acc~11 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~11; 2020#L1422-5true stopRequestedInDirection_#t~ret78 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~19 := stopRequestedInDirection_#t~ret78;havoc stopRequestedInDirection_#t~ret78;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~19 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~19 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~19; 1206#L1987-2true timeShift_#t~ret106 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret106;havoc timeShift_#t~ret106; 2378#L2342-1true assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret80, continueInDirection_~dir, continueInDirection_~tmp~20;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~20;~currentHeading~0 := continueInDirection_~dir; 1205#L2031-3true assume !(1 == ~currentHeading~0); 1790#L2041-9true assume !(0 == ~currentFloorID~0); 1764#L2041-11true assume 1 == ~currentHeading~0;~currentFloorID~0 := 1 + ~currentFloorID~0; 295#L2047-11true havoc __utac_acc__Specification9_spec__3_#t~ret55, __utac_acc__Specification9_spec__3_#t~ret56, __utac_acc__Specification9_spec__3_#t~ret57, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~14, __utac_acc__Specification9_spec__3_~tmp___0~4, __utac_acc__Specification9_spec__3_~tmp___1~3;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~14;havoc __utac_acc__Specification9_spec__3_~tmp___0~4;havoc __utac_acc__Specification9_spec__3_~tmp___1~3;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~11;havoc getCurrentFloorID_~retValue_acc~11;getCurrentFloorID_~retValue_acc~11 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~11; 2026#L1422-7true __utac_acc__Specification9_spec__3_#t~ret55 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~14 := __utac_acc__Specification9_spec__3_#t~ret55;havoc __utac_acc__Specification9_spec__3_#t~ret55;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~14;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~15;havoc isEmpty_~retValue_acc~15; 945#L1482-13true assume 1 == ~persons_0~0;isEmpty_~retValue_acc~15 := 0;isEmpty_#res := isEmpty_~retValue_acc~15; 356#L1514-13true __utac_acc__Specification9_spec__3_#t~ret56 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~3 := __utac_acc__Specification9_spec__3_#t~ret56;havoc __utac_acc__Specification9_spec__3_#t~ret56; 1398#L923-2true assume 0 != __utac_acc__Specification9_spec__3_~tmp___1~3;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 2355#L933-3true cleanup_~i~2 := 1 + cleanup_~i~2; 447#L283-2true [2018-11-23 06:07:28,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:07:28,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1824965595, now seen corresponding path program 1 times [2018-11-23 06:07:28,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:07:28,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:07:28,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:07:28,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:07:28,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:07:28,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:07:28,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:07:28,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:07:28,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 06:07:28,642 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 06:07:28,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:07:28,642 INFO L82 PathProgramCache]: Analyzing trace with hash 2075697809, now seen corresponding path program 1 times [2018-11-23 06:07:28,642 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:07:28,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:07:28,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:07:28,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:07:28,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:07:28,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:07:28,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:07:28,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:07:28,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 06:07:28,676 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 06:07:28,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 06:07:28,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 06:07:28,691 INFO L87 Difference]: Start difference. First operand 2407 states. Second operand 3 states. [2018-11-23 06:07:28,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:07:28,881 INFO L93 Difference]: Finished difference Result 3630 states and 6844 transitions. [2018-11-23 06:07:28,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 06:07:28,883 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3630 states and 6844 transitions. [2018-11-23 06:07:28,943 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2376 [2018-11-23 06:07:28,960 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3630 states to 3602 states and 6811 transitions. [2018-11-23 06:07:28,960 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3602 [2018-11-23 06:07:28,964 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3602 [2018-11-23 06:07:28,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3602 states and 6811 transitions. [2018-11-23 06:07:28,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:07:28,972 INFO L705 BuchiCegarLoop]: Abstraction has 3602 states and 6811 transitions. [2018-11-23 06:07:28,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3602 states and 6811 transitions. [2018-11-23 06:07:29,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3602 to 3600. [2018-11-23 06:07:29,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3600 states. [2018-11-23 06:07:29,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3600 states to 3600 states and 6808 transitions. [2018-11-23 06:07:29,046 INFO L728 BuchiCegarLoop]: Abstraction has 3600 states and 6808 transitions. [2018-11-23 06:07:29,046 INFO L608 BuchiCegarLoop]: Abstraction has 3600 states and 6808 transitions. [2018-11-23 06:07:29,046 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 06:07:29,046 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3600 states and 6808 transitions. [2018-11-23 06:07:29,056 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2374 [2018-11-23 06:07:29,056 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:07:29,056 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:07:29,058 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:07:29,059 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:07:29,059 INFO L794 eck$LassoCheckResult]: Stem: 6555#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call #t~string38.base, #t~string38.offset := #Ultimate.alloc(30);call #t~string39.base, #t~string39.offset := #Ultimate.alloc(9);call #t~string40.base, #t~string40.offset := #Ultimate.alloc(21);call #t~string41.base, #t~string41.offset := #Ultimate.alloc(30);call #t~string42.base, #t~string42.offset := #Ultimate.alloc(9);call #t~string43.base, #t~string43.offset := #Ultimate.alloc(21);call #t~string47.base, #t~string47.offset := #Ultimate.alloc(30);call #t~string48.base, #t~string48.offset := #Ultimate.alloc(9);call #t~string49.base, #t~string49.offset := #Ultimate.alloc(25);call #t~string50.base, #t~string50.offset := #Ultimate.alloc(30);call #t~string51.base, #t~string51.offset := #Ultimate.alloc(9);call #t~string52.base, #t~string52.offset := #Ultimate.alloc(25);call #t~string110.base, #t~string110.offset := #Ultimate.alloc(10);call #t~string112.base, #t~string112.offset := #Ultimate.alloc(4);call write~init~int(91, #t~string112.base, #t~string112.offset, 1);call write~init~int(95, #t~string112.base, 1 + #t~string112.offset, 1);call write~init~int(93, #t~string112.base, 2 + #t~string112.offset, 1);call write~init~int(0, #t~string112.base, 3 + #t~string112.offset, 1);call #t~string114.base, #t~string114.offset := #Ultimate.alloc(4);call write~init~int(91, #t~string114.base, #t~string114.offset, 1);call write~init~int(93, #t~string114.base, 1 + #t~string114.offset, 1);call write~init~int(32, #t~string114.base, 2 + #t~string114.offset, 1);call write~init~int(0, #t~string114.base, 3 + #t~string114.offset, 1);call #t~string116.base, #t~string116.offset := #Ultimate.alloc(5);call write~init~int(32, #t~string116.base, #t~string116.offset, 1);call write~init~int(97, #t~string116.base, 1 + #t~string116.offset, 1);call write~init~int(116, #t~string116.base, 2 + #t~string116.offset, 1);call write~init~int(32, #t~string116.base, 3 + #t~string116.offset, 1);call write~init~int(0, #t~string116.base, 4 + #t~string116.offset, 1);call #t~string118.base, #t~string118.offset := #Ultimate.alloc(3);call write~init~int(37, #t~string118.base, #t~string118.offset, 1);call write~init~int(105, #t~string118.base, 1 + #t~string118.offset, 1);call write~init~int(0, #t~string118.base, 2 + #t~string118.offset, 1);call #t~string120.base, #t~string120.offset := #Ultimate.alloc(10);call #t~string122.base, #t~string122.offset := #Ultimate.alloc(3);call write~init~int(117, #t~string122.base, #t~string122.offset, 1);call write~init~int(112, #t~string122.base, 1 + #t~string122.offset, 1);call write~init~int(0, #t~string122.base, 2 + #t~string122.offset, 1);call #t~string124.base, #t~string124.offset := #Ultimate.alloc(5);call write~init~int(100, #t~string124.base, #t~string124.offset, 1);call write~init~int(111, #t~string124.base, 1 + #t~string124.offset, 1);call write~init~int(119, #t~string124.base, 2 + #t~string124.offset, 1);call write~init~int(110, #t~string124.base, 3 + #t~string124.offset, 1);call write~init~int(0, #t~string124.base, 4 + #t~string124.offset, 1);call #t~string126.base, #t~string126.offset := #Ultimate.alloc(7);call write~init~int(32, #t~string126.base, #t~string126.offset, 1);call write~init~int(73, #t~string126.base, 1 + #t~string126.offset, 1);call write~init~int(76, #t~string126.base, 2 + #t~string126.offset, 1);call write~init~int(95, #t~string126.base, 3 + #t~string126.offset, 1);call write~init~int(112, #t~string126.base, 4 + #t~string126.offset, 1);call write~init~int(58, #t~string126.base, 5 + #t~string126.offset, 1);call write~init~int(0, #t~string126.base, 6 + #t~string126.offset, 1);call #t~string128.base, #t~string128.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string128.base, #t~string128.offset, 1);call write~init~int(37, #t~string128.base, 1 + #t~string128.offset, 1);call write~init~int(105, #t~string128.base, 2 + #t~string128.offset, 1);call write~init~int(0, #t~string128.base, 3 + #t~string128.offset, 1);call #t~string130.base, #t~string130.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string130.base, #t~string130.offset, 1);call write~init~int(37, #t~string130.base, 1 + #t~string130.offset, 1);call write~init~int(105, #t~string130.base, 2 + #t~string130.offset, 1);call write~init~int(0, #t~string130.base, 3 + #t~string130.offset, 1);call #t~string132.base, #t~string132.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string132.base, #t~string132.offset, 1);call write~init~int(37, #t~string132.base, 1 + #t~string132.offset, 1);call write~init~int(105, #t~string132.base, 2 + #t~string132.offset, 1);call write~init~int(0, #t~string132.base, 3 + #t~string132.offset, 1);call #t~string134.base, #t~string134.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string134.base, #t~string134.offset, 1);call write~init~int(37, #t~string134.base, 1 + #t~string134.offset, 1);call write~init~int(105, #t~string134.base, 2 + #t~string134.offset, 1);call write~init~int(0, #t~string134.base, 3 + #t~string134.offset, 1);call #t~string136.base, #t~string136.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string136.base, #t~string136.offset, 1);call write~init~int(37, #t~string136.base, 1 + #t~string136.offset, 1);call write~init~int(105, #t~string136.base, 2 + #t~string136.offset, 1);call write~init~int(0, #t~string136.base, 3 + #t~string136.offset, 1);call #t~string138.base, #t~string138.offset := #Ultimate.alloc(6);call write~init~int(32, #t~string138.base, #t~string138.offset, 1);call write~init~int(70, #t~string138.base, 1 + #t~string138.offset, 1);call write~init~int(95, #t~string138.base, 2 + #t~string138.offset, 1);call write~init~int(112, #t~string138.base, 3 + #t~string138.offset, 1);call write~init~int(58, #t~string138.base, 4 + #t~string138.offset, 1);call write~init~int(0, #t~string138.base, 5 + #t~string138.offset, 1);call #t~string141.base, #t~string141.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string141.base, #t~string141.offset, 1);call write~init~int(37, #t~string141.base, 1 + #t~string141.offset, 1);call write~init~int(105, #t~string141.base, 2 + #t~string141.offset, 1);call write~init~int(0, #t~string141.base, 3 + #t~string141.offset, 1);call #t~string144.base, #t~string144.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string144.base, #t~string144.offset, 1);call write~init~int(37, #t~string144.base, 1 + #t~string144.offset, 1);call write~init~int(105, #t~string144.base, 2 + #t~string144.offset, 1);call write~init~int(0, #t~string144.base, 3 + #t~string144.offset, 1);call #t~string147.base, #t~string147.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string147.base, #t~string147.offset, 1);call write~init~int(37, #t~string147.base, 1 + #t~string147.offset, 1);call write~init~int(105, #t~string147.base, 2 + #t~string147.offset, 1);call write~init~int(0, #t~string147.base, 3 + #t~string147.offset, 1);call #t~string150.base, #t~string150.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string150.base, #t~string150.offset, 1);call write~init~int(37, #t~string150.base, 1 + #t~string150.offset, 1);call write~init~int(105, #t~string150.base, 2 + #t~string150.offset, 1);call write~init~int(0, #t~string150.base, 3 + #t~string150.offset, 1);call #t~string153.base, #t~string153.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string153.base, #t~string153.offset, 1);call write~init~int(37, #t~string153.base, 1 + #t~string153.offset, 1);call write~init~int(105, #t~string153.base, 2 + #t~string153.offset, 1);call write~init~int(0, #t~string153.base, 3 + #t~string153.offset, 1);call #t~string155.base, #t~string155.offset := #Ultimate.alloc(2);call write~init~int(10, #t~string155.base, #t~string155.offset, 1);call write~init~int(0, #t~string155.base, 1 + #t~string155.offset, 1);~executiveFloor~0 := 4;~cleanupTimeShifts~0 := 12;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0;~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; 6556#L-1 havoc main_#res;havoc main_#t~ret19, main_~retValue_acc~1, main_~tmp~10;havoc main_~retValue_acc~1;havoc main_~tmp~10; 7115#L1047 havoc valid_product_#res;havoc valid_product_~retValue_acc~6;havoc valid_product_~retValue_acc~6;valid_product_~retValue_acc~6 := 1;valid_product_#res := valid_product_~retValue_acc~6; 7116#L1055 main_#t~ret19 := valid_product_#res;main_~tmp~10 := main_#t~ret19;havoc main_#t~ret19; 7971#L482 assume 0 != main_~tmp~10; 8113#L451 ~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 8090#L880 havoc bigMacCall_#t~ret12, bigMacCall_~tmp~7;havoc bigMacCall_~tmp~7;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~8;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~8; 7565#L1105 assume 0 == getOrigin_~person;getOrigin_~retValue_acc~8 := 4;getOrigin_#res := getOrigin_~retValue_acc~8; 6486#L1130 bigMacCall_#t~ret12 := getOrigin_#res;bigMacCall_~tmp~7 := bigMacCall_#t~ret12;havoc bigMacCall_#t~ret12;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~7;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 7117#L3073 assume 0 == initPersonOnFloor_~floor; 7118#L3074 assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 6114#L3181-1 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 7910#L2865 assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 7711#L2877-2 havoc cleanup_#t~ret13, cleanup_#t~ret14, cleanup_~i~2, cleanup_~tmp~8, cleanup_~tmp___0~2, cleanup_~__cil_tmp4~0;havoc cleanup_~i~2;havoc cleanup_~tmp~8;havoc cleanup_~tmp___0~2;havoc cleanup_~__cil_tmp4~0;havoc timeShift_#t~ret99, timeShift_#t~ret100, timeShift_#t~ret101, timeShift_#t~ret102, timeShift_#t~ret103, timeShift_#t~ret104, timeShift_#t~ret105, timeShift_#t~ret106, timeShift_#t~ret107, timeShift_#t~ret108, timeShift_#t~ret109, timeShift_~tmp~24, timeShift_~tmp___0~11, timeShift_~tmp___1~7, 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~24;havoc timeShift_~tmp___0~11;havoc timeShift_~tmp___1~7;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~ret83, stopRequestedAtCurrentFloor_#t~ret84, stopRequestedAtCurrentFloor_#t~ret85, stopRequestedAtCurrentFloor_#t~ret86, stopRequestedAtCurrentFloor_~retValue_acc~22, stopRequestedAtCurrentFloor_~tmp~22, stopRequestedAtCurrentFloor_~tmp___0~9;havoc stopRequestedAtCurrentFloor_~retValue_acc~22;havoc stopRequestedAtCurrentFloor_~tmp~22;havoc stopRequestedAtCurrentFloor_~tmp___0~9;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret157, isExecutiveFloorCalling_~retValue_acc~25;havoc isExecutiveFloorCalling_~retValue_acc~25;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~27;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~27; 6269#L2802 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~27 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~27; 6270#L2829 isExecutiveFloorCalling_#t~ret157 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~25 := isExecutiveFloorCalling_#t~ret157;havoc isExecutiveFloorCalling_#t~ret157;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~25; 6670#L2706 stopRequestedAtCurrentFloor_#t~ret83 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~22 := stopRequestedAtCurrentFloor_#t~ret83;havoc stopRequestedAtCurrentFloor_#t~ret83; 6491#L2091 assume 0 != stopRequestedAtCurrentFloor_~tmp~22;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~11;havoc getCurrentFloorID_~retValue_acc~11;getCurrentFloorID_~retValue_acc~11 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~11; 6492#L1422 stopRequestedAtCurrentFloor_#t~ret84 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~9 := stopRequestedAtCurrentFloor_#t~ret84;havoc stopRequestedAtCurrentFloor_#t~ret84; 6365#L2095 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~9);stopRequestedAtCurrentFloor_~retValue_acc~22 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~22; 6366#L2108 timeShift_#t~ret99 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret99;havoc timeShift_#t~ret99; 7077#L2243 assume !(0 != timeShift_~tmp___9~2); 8021#L2334 assume !(1 == ~doorState~0); 8022#L2334-2 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret77, stopRequestedInDirection_#t~ret78, stopRequestedInDirection_#t~ret79, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~19, stopRequestedInDirection_~tmp~19, stopRequestedInDirection_~tmp___0~7, 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~19;havoc stopRequestedInDirection_~tmp~19;havoc stopRequestedInDirection_~tmp___0~7;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret157, isExecutiveFloorCalling_~retValue_acc~25;havoc isExecutiveFloorCalling_~retValue_acc~25;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~27;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~27; 6278#L2802-3 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~27 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~27; 6279#L2829-3 isExecutiveFloorCalling_#t~ret157 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~25 := isExecutiveFloorCalling_#t~ret157;havoc isExecutiveFloorCalling_#t~ret157;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~25; 6678#L2706-1 stopRequestedInDirection_#t~ret77 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~7 := stopRequestedInDirection_#t~ret77;havoc stopRequestedInDirection_#t~ret77; 6679#L1974 assume 0 != stopRequestedInDirection_~tmp___0~7;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~11;havoc getCurrentFloorID_~retValue_acc~11;getCurrentFloorID_~retValue_acc~11 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~11; 7144#L1422-1 stopRequestedInDirection_#t~ret78 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~19 := stopRequestedInDirection_#t~ret78;havoc stopRequestedInDirection_#t~ret78;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~19 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~19 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~19; 7724#L1987 timeShift_#t~ret106 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret106;havoc timeShift_#t~ret106; 7725#L2342 assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret80, continueInDirection_~dir, continueInDirection_~tmp~20;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~20;~currentHeading~0 := continueInDirection_~dir; 7752#L2031 assume !(1 == ~currentHeading~0); 7753#L2041 assume !(0 == ~currentFloorID~0); 8162#L2041-2 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 6597#L2047-5 havoc __utac_acc__Specification9_spec__3_#t~ret55, __utac_acc__Specification9_spec__3_#t~ret56, __utac_acc__Specification9_spec__3_#t~ret57, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~14, __utac_acc__Specification9_spec__3_~tmp___0~4, __utac_acc__Specification9_spec__3_~tmp___1~3;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~14;havoc __utac_acc__Specification9_spec__3_~tmp___0~4;havoc __utac_acc__Specification9_spec__3_~tmp___1~3;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~11;havoc getCurrentFloorID_~retValue_acc~11;getCurrentFloorID_~retValue_acc~11 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~11; 6598#L1422-3 __utac_acc__Specification9_spec__3_#t~ret55 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~14 := __utac_acc__Specification9_spec__3_#t~ret55;havoc __utac_acc__Specification9_spec__3_#t~ret55;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~14;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~15;havoc isEmpty_~retValue_acc~15; 7485#L1482-6 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~15 := 0;isEmpty_#res := isEmpty_~retValue_acc~15; 6904#L1514-6 __utac_acc__Specification9_spec__3_#t~ret56 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~3 := __utac_acc__Specification9_spec__3_#t~ret56;havoc __utac_acc__Specification9_spec__3_#t~ret56; 7968#L923 assume 0 != __utac_acc__Specification9_spec__3_~tmp___1~3;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 6101#L933-1 cleanup_~i~2 := 0; 6774#L283-2 [2018-11-23 06:07:29,059 INFO L796 eck$LassoCheckResult]: Loop: 6774#L283-2 assume !false; 6527#L284 cleanup_~__cil_tmp4~0 := ~cleanupTimeShifts~0 - 1; 6340#L287 assume cleanup_~i~2 < cleanup_~__cil_tmp4~0;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~10;havoc isBlocked_~retValue_acc~10;isBlocked_~retValue_acc~10 := 0;isBlocked_#res := isBlocked_~retValue_acc~10; 6341#L1269 cleanup_#t~ret13 := isBlocked_#res;cleanup_~tmp___0~2 := cleanup_#t~ret13;havoc cleanup_#t~ret13; 6300#L291 assume 1 != cleanup_~tmp___0~2; 6298#L291-1 havoc isIdle_#res;havoc isIdle_#t~ret65, isIdle_~retValue_acc~17, isIdle_~tmp~17;havoc isIdle_~retValue_acc~17;havoc isIdle_~tmp~17;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret60, anyStopRequested_#t~ret61, anyStopRequested_#t~ret62, anyStopRequested_#t~ret63, anyStopRequested_#t~ret64, anyStopRequested_~retValue_acc~16, anyStopRequested_~tmp~16, anyStopRequested_~tmp___0~5, anyStopRequested_~tmp___1~4, anyStopRequested_~tmp___2~1, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~16;havoc anyStopRequested_~tmp~16;havoc anyStopRequested_~tmp___0~5;havoc anyStopRequested_~tmp___1~4;havoc anyStopRequested_~tmp___2~1;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~27;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~27; 6299#L2802-25 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~27 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~27; 7147#L2829-25 anyStopRequested_#t~ret60 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret60;havoc anyStopRequested_#t~ret60; 7431#L1530 assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~16 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~16; 6163#L1594 isIdle_#t~ret65 := anyStopRequested_#res;isIdle_~tmp~17 := isIdle_#t~ret65;havoc isIdle_#t~ret65;isIdle_~retValue_acc~17 := (if 0 == isIdle_~tmp~17 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~17; 6577#L1607 cleanup_#t~ret14 := isIdle_#res;cleanup_~tmp~8 := cleanup_#t~ret14;havoc cleanup_#t~ret14; 6578#L303 assume !(0 != cleanup_~tmp~8);havoc timeShift_#t~ret99, timeShift_#t~ret100, timeShift_#t~ret101, timeShift_#t~ret102, timeShift_#t~ret103, timeShift_#t~ret104, timeShift_#t~ret105, timeShift_#t~ret106, timeShift_#t~ret107, timeShift_#t~ret108, timeShift_#t~ret109, timeShift_~tmp~24, timeShift_~tmp___0~11, timeShift_~tmp___1~7, 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~24;havoc timeShift_~tmp___0~11;havoc timeShift_~tmp___1~7;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~ret83, stopRequestedAtCurrentFloor_#t~ret84, stopRequestedAtCurrentFloor_#t~ret85, stopRequestedAtCurrentFloor_#t~ret86, stopRequestedAtCurrentFloor_~retValue_acc~22, stopRequestedAtCurrentFloor_~tmp~22, stopRequestedAtCurrentFloor_~tmp___0~9;havoc stopRequestedAtCurrentFloor_~retValue_acc~22;havoc stopRequestedAtCurrentFloor_~tmp~22;havoc stopRequestedAtCurrentFloor_~tmp___0~9;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret157, isExecutiveFloorCalling_~retValue_acc~25;havoc isExecutiveFloorCalling_~retValue_acc~25;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~27;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~27; 7032#L2802-30 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~27 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~27; 7024#L2829-30 isExecutiveFloorCalling_#t~ret157 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~25 := isExecutiveFloorCalling_#t~ret157;havoc isExecutiveFloorCalling_#t~ret157;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~25; 6682#L2706-3 stopRequestedAtCurrentFloor_#t~ret83 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~22 := stopRequestedAtCurrentFloor_#t~ret83;havoc stopRequestedAtCurrentFloor_#t~ret83; 6493#L2091-1 assume 0 != stopRequestedAtCurrentFloor_~tmp~22;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~11;havoc getCurrentFloorID_~retValue_acc~11;getCurrentFloorID_~retValue_acc~11 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~11; 6494#L1422-4 stopRequestedAtCurrentFloor_#t~ret84 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~9 := stopRequestedAtCurrentFloor_#t~ret84;havoc stopRequestedAtCurrentFloor_#t~ret84; 8236#L2095-1 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~9);stopRequestedAtCurrentFloor_~retValue_acc~22 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~22; 7075#L2108-1 timeShift_#t~ret99 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret99;havoc timeShift_#t~ret99; 7076#L2243-1 assume !(0 != timeShift_~tmp___9~2); 8029#L2334-3 assume 1 == ~doorState~0;~doorState~0 := 0; 8010#L2334-5 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret77, stopRequestedInDirection_#t~ret78, stopRequestedInDirection_#t~ret79, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~19, stopRequestedInDirection_~tmp~19, stopRequestedInDirection_~tmp___0~7, 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~19;havoc stopRequestedInDirection_~tmp~19;havoc stopRequestedInDirection_~tmp___0~7;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret157, isExecutiveFloorCalling_~retValue_acc~25;havoc isExecutiveFloorCalling_~retValue_acc~25;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~27;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~27; 7525#L2802-33 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~27 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~27; 6955#L2829-33 isExecutiveFloorCalling_#t~ret157 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~25 := isExecutiveFloorCalling_#t~ret157;havoc isExecutiveFloorCalling_#t~ret157;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~25; 6649#L2706-4 stopRequestedInDirection_#t~ret77 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~7 := stopRequestedInDirection_#t~ret77;havoc stopRequestedInDirection_#t~ret77; 6650#L1974-2 assume 0 != stopRequestedInDirection_~tmp___0~7;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~11;havoc getCurrentFloorID_~retValue_acc~11;getCurrentFloorID_~retValue_acc~11 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~11; 7007#L1422-5 stopRequestedInDirection_#t~ret78 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~19 := stopRequestedInDirection_#t~ret78;havoc stopRequestedInDirection_#t~ret78;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~19 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~19 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~19; 7734#L1987-2 timeShift_#t~ret106 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret106;havoc timeShift_#t~ret106; 7735#L2342-1 assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret80, continueInDirection_~dir, continueInDirection_~tmp~20;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~20;~currentHeading~0 := continueInDirection_~dir; 7732#L2031-3 assume !(1 == ~currentHeading~0); 7733#L2041-9 assume !(0 == ~currentFloorID~0); 8128#L2041-11 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 6240#L2047-11 havoc __utac_acc__Specification9_spec__3_#t~ret55, __utac_acc__Specification9_spec__3_#t~ret56, __utac_acc__Specification9_spec__3_#t~ret57, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~14, __utac_acc__Specification9_spec__3_~tmp___0~4, __utac_acc__Specification9_spec__3_~tmp___1~3;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~14;havoc __utac_acc__Specification9_spec__3_~tmp___0~4;havoc __utac_acc__Specification9_spec__3_~tmp___1~3;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~11;havoc getCurrentFloorID_~retValue_acc~11;getCurrentFloorID_~retValue_acc~11 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~11; 6569#L1422-7 __utac_acc__Specification9_spec__3_#t~ret55 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~14 := __utac_acc__Specification9_spec__3_#t~ret55;havoc __utac_acc__Specification9_spec__3_#t~ret55;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~14;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~15;havoc isEmpty_~retValue_acc~15; 8336#L1482-13 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~15 := 0;isEmpty_#res := isEmpty_~retValue_acc~15; 8871#L1514-13 __utac_acc__Specification9_spec__3_#t~ret56 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~3 := __utac_acc__Specification9_spec__3_#t~ret56;havoc __utac_acc__Specification9_spec__3_#t~ret56; 7947#L923-2 assume 0 != __utac_acc__Specification9_spec__3_~tmp___1~3;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 6106#L933-3 cleanup_~i~2 := 1 + cleanup_~i~2; 6774#L283-2 [2018-11-23 06:07:29,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:07:29,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1660655075, now seen corresponding path program 1 times [2018-11-23 06:07:29,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:07:29,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:07:29,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:07:29,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:07:29,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:07:29,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:07:29,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:07:29,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:07:29,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 06:07:29,110 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 06:07:29,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:07:29,110 INFO L82 PathProgramCache]: Analyzing trace with hash -444262125, now seen corresponding path program 1 times [2018-11-23 06:07:29,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:07:29,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:07:29,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:07:29,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:07:29,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:07:29,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:07:29,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:07:29,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:07:29,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 06:07:29,146 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 06:07:29,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 06:07:29,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 06:07:29,146 INFO L87 Difference]: Start difference. First operand 3600 states and 6808 transitions. cyclomatic complexity: 3209 Second operand 4 states. [2018-11-23 06:07:29,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:07:29,381 INFO L93 Difference]: Finished difference Result 10460 states and 19820 transitions. [2018-11-23 06:07:29,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 06:07:29,383 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10460 states and 19820 transitions. [2018-11-23 06:07:29,417 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8466 [2018-11-23 06:07:29,448 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10460 states to 10460 states and 19820 transitions. [2018-11-23 06:07:29,448 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10460 [2018-11-23 06:07:29,457 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10460 [2018-11-23 06:07:29,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10460 states and 19820 transitions. [2018-11-23 06:07:29,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:07:29,466 INFO L705 BuchiCegarLoop]: Abstraction has 10460 states and 19820 transitions. [2018-11-23 06:07:29,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10460 states and 19820 transitions. [2018-11-23 06:07:29,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10460 to 3608. [2018-11-23 06:07:29,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3608 states. [2018-11-23 06:07:29,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3608 states to 3608 states and 6816 transitions. [2018-11-23 06:07:29,522 INFO L728 BuchiCegarLoop]: Abstraction has 3608 states and 6816 transitions. [2018-11-23 06:07:29,522 INFO L608 BuchiCegarLoop]: Abstraction has 3608 states and 6816 transitions. [2018-11-23 06:07:29,523 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 06:07:29,523 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3608 states and 6816 transitions. [2018-11-23 06:07:29,530 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2378 [2018-11-23 06:07:29,530 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:07:29,530 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:07:29,532 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:07:29,532 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:07:29,532 INFO L794 eck$LassoCheckResult]: Stem: 20626#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call #t~string38.base, #t~string38.offset := #Ultimate.alloc(30);call #t~string39.base, #t~string39.offset := #Ultimate.alloc(9);call #t~string40.base, #t~string40.offset := #Ultimate.alloc(21);call #t~string41.base, #t~string41.offset := #Ultimate.alloc(30);call #t~string42.base, #t~string42.offset := #Ultimate.alloc(9);call #t~string43.base, #t~string43.offset := #Ultimate.alloc(21);call #t~string47.base, #t~string47.offset := #Ultimate.alloc(30);call #t~string48.base, #t~string48.offset := #Ultimate.alloc(9);call #t~string49.base, #t~string49.offset := #Ultimate.alloc(25);call #t~string50.base, #t~string50.offset := #Ultimate.alloc(30);call #t~string51.base, #t~string51.offset := #Ultimate.alloc(9);call #t~string52.base, #t~string52.offset := #Ultimate.alloc(25);call #t~string110.base, #t~string110.offset := #Ultimate.alloc(10);call #t~string112.base, #t~string112.offset := #Ultimate.alloc(4);call write~init~int(91, #t~string112.base, #t~string112.offset, 1);call write~init~int(95, #t~string112.base, 1 + #t~string112.offset, 1);call write~init~int(93, #t~string112.base, 2 + #t~string112.offset, 1);call write~init~int(0, #t~string112.base, 3 + #t~string112.offset, 1);call #t~string114.base, #t~string114.offset := #Ultimate.alloc(4);call write~init~int(91, #t~string114.base, #t~string114.offset, 1);call write~init~int(93, #t~string114.base, 1 + #t~string114.offset, 1);call write~init~int(32, #t~string114.base, 2 + #t~string114.offset, 1);call write~init~int(0, #t~string114.base, 3 + #t~string114.offset, 1);call #t~string116.base, #t~string116.offset := #Ultimate.alloc(5);call write~init~int(32, #t~string116.base, #t~string116.offset, 1);call write~init~int(97, #t~string116.base, 1 + #t~string116.offset, 1);call write~init~int(116, #t~string116.base, 2 + #t~string116.offset, 1);call write~init~int(32, #t~string116.base, 3 + #t~string116.offset, 1);call write~init~int(0, #t~string116.base, 4 + #t~string116.offset, 1);call #t~string118.base, #t~string118.offset := #Ultimate.alloc(3);call write~init~int(37, #t~string118.base, #t~string118.offset, 1);call write~init~int(105, #t~string118.base, 1 + #t~string118.offset, 1);call write~init~int(0, #t~string118.base, 2 + #t~string118.offset, 1);call #t~string120.base, #t~string120.offset := #Ultimate.alloc(10);call #t~string122.base, #t~string122.offset := #Ultimate.alloc(3);call write~init~int(117, #t~string122.base, #t~string122.offset, 1);call write~init~int(112, #t~string122.base, 1 + #t~string122.offset, 1);call write~init~int(0, #t~string122.base, 2 + #t~string122.offset, 1);call #t~string124.base, #t~string124.offset := #Ultimate.alloc(5);call write~init~int(100, #t~string124.base, #t~string124.offset, 1);call write~init~int(111, #t~string124.base, 1 + #t~string124.offset, 1);call write~init~int(119, #t~string124.base, 2 + #t~string124.offset, 1);call write~init~int(110, #t~string124.base, 3 + #t~string124.offset, 1);call write~init~int(0, #t~string124.base, 4 + #t~string124.offset, 1);call #t~string126.base, #t~string126.offset := #Ultimate.alloc(7);call write~init~int(32, #t~string126.base, #t~string126.offset, 1);call write~init~int(73, #t~string126.base, 1 + #t~string126.offset, 1);call write~init~int(76, #t~string126.base, 2 + #t~string126.offset, 1);call write~init~int(95, #t~string126.base, 3 + #t~string126.offset, 1);call write~init~int(112, #t~string126.base, 4 + #t~string126.offset, 1);call write~init~int(58, #t~string126.base, 5 + #t~string126.offset, 1);call write~init~int(0, #t~string126.base, 6 + #t~string126.offset, 1);call #t~string128.base, #t~string128.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string128.base, #t~string128.offset, 1);call write~init~int(37, #t~string128.base, 1 + #t~string128.offset, 1);call write~init~int(105, #t~string128.base, 2 + #t~string128.offset, 1);call write~init~int(0, #t~string128.base, 3 + #t~string128.offset, 1);call #t~string130.base, #t~string130.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string130.base, #t~string130.offset, 1);call write~init~int(37, #t~string130.base, 1 + #t~string130.offset, 1);call write~init~int(105, #t~string130.base, 2 + #t~string130.offset, 1);call write~init~int(0, #t~string130.base, 3 + #t~string130.offset, 1);call #t~string132.base, #t~string132.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string132.base, #t~string132.offset, 1);call write~init~int(37, #t~string132.base, 1 + #t~string132.offset, 1);call write~init~int(105, #t~string132.base, 2 + #t~string132.offset, 1);call write~init~int(0, #t~string132.base, 3 + #t~string132.offset, 1);call #t~string134.base, #t~string134.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string134.base, #t~string134.offset, 1);call write~init~int(37, #t~string134.base, 1 + #t~string134.offset, 1);call write~init~int(105, #t~string134.base, 2 + #t~string134.offset, 1);call write~init~int(0, #t~string134.base, 3 + #t~string134.offset, 1);call #t~string136.base, #t~string136.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string136.base, #t~string136.offset, 1);call write~init~int(37, #t~string136.base, 1 + #t~string136.offset, 1);call write~init~int(105, #t~string136.base, 2 + #t~string136.offset, 1);call write~init~int(0, #t~string136.base, 3 + #t~string136.offset, 1);call #t~string138.base, #t~string138.offset := #Ultimate.alloc(6);call write~init~int(32, #t~string138.base, #t~string138.offset, 1);call write~init~int(70, #t~string138.base, 1 + #t~string138.offset, 1);call write~init~int(95, #t~string138.base, 2 + #t~string138.offset, 1);call write~init~int(112, #t~string138.base, 3 + #t~string138.offset, 1);call write~init~int(58, #t~string138.base, 4 + #t~string138.offset, 1);call write~init~int(0, #t~string138.base, 5 + #t~string138.offset, 1);call #t~string141.base, #t~string141.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string141.base, #t~string141.offset, 1);call write~init~int(37, #t~string141.base, 1 + #t~string141.offset, 1);call write~init~int(105, #t~string141.base, 2 + #t~string141.offset, 1);call write~init~int(0, #t~string141.base, 3 + #t~string141.offset, 1);call #t~string144.base, #t~string144.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string144.base, #t~string144.offset, 1);call write~init~int(37, #t~string144.base, 1 + #t~string144.offset, 1);call write~init~int(105, #t~string144.base, 2 + #t~string144.offset, 1);call write~init~int(0, #t~string144.base, 3 + #t~string144.offset, 1);call #t~string147.base, #t~string147.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string147.base, #t~string147.offset, 1);call write~init~int(37, #t~string147.base, 1 + #t~string147.offset, 1);call write~init~int(105, #t~string147.base, 2 + #t~string147.offset, 1);call write~init~int(0, #t~string147.base, 3 + #t~string147.offset, 1);call #t~string150.base, #t~string150.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string150.base, #t~string150.offset, 1);call write~init~int(37, #t~string150.base, 1 + #t~string150.offset, 1);call write~init~int(105, #t~string150.base, 2 + #t~string150.offset, 1);call write~init~int(0, #t~string150.base, 3 + #t~string150.offset, 1);call #t~string153.base, #t~string153.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string153.base, #t~string153.offset, 1);call write~init~int(37, #t~string153.base, 1 + #t~string153.offset, 1);call write~init~int(105, #t~string153.base, 2 + #t~string153.offset, 1);call write~init~int(0, #t~string153.base, 3 + #t~string153.offset, 1);call #t~string155.base, #t~string155.offset := #Ultimate.alloc(2);call write~init~int(10, #t~string155.base, #t~string155.offset, 1);call write~init~int(0, #t~string155.base, 1 + #t~string155.offset, 1);~executiveFloor~0 := 4;~cleanupTimeShifts~0 := 12;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0;~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; 20627#L-1 havoc main_#res;havoc main_#t~ret19, main_~retValue_acc~1, main_~tmp~10;havoc main_~retValue_acc~1;havoc main_~tmp~10; 21186#L1047 havoc valid_product_#res;havoc valid_product_~retValue_acc~6;havoc valid_product_~retValue_acc~6;valid_product_~retValue_acc~6 := 1;valid_product_#res := valid_product_~retValue_acc~6; 21187#L1055 main_#t~ret19 := valid_product_#res;main_~tmp~10 := main_#t~ret19;havoc main_#t~ret19; 22064#L482 assume 0 != main_~tmp~10; 22205#L451 ~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 22182#L880 havoc bigMacCall_#t~ret12, bigMacCall_~tmp~7;havoc bigMacCall_~tmp~7;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~8;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~8; 21649#L1105 assume 0 == getOrigin_~person;getOrigin_~retValue_acc~8 := 4;getOrigin_#res := getOrigin_~retValue_acc~8; 20556#L1130 bigMacCall_#t~ret12 := getOrigin_#res;bigMacCall_~tmp~7 := bigMacCall_#t~ret12;havoc bigMacCall_#t~ret12;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~7;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 21188#L3073 assume 0 == initPersonOnFloor_~floor; 21189#L3074 assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 20185#L3181-1 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 22004#L2865 assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 21801#L2877-2 havoc cleanup_#t~ret13, cleanup_#t~ret14, cleanup_~i~2, cleanup_~tmp~8, cleanup_~tmp___0~2, cleanup_~__cil_tmp4~0;havoc cleanup_~i~2;havoc cleanup_~tmp~8;havoc cleanup_~tmp___0~2;havoc cleanup_~__cil_tmp4~0;havoc timeShift_#t~ret99, timeShift_#t~ret100, timeShift_#t~ret101, timeShift_#t~ret102, timeShift_#t~ret103, timeShift_#t~ret104, timeShift_#t~ret105, timeShift_#t~ret106, timeShift_#t~ret107, timeShift_#t~ret108, timeShift_#t~ret109, timeShift_~tmp~24, timeShift_~tmp___0~11, timeShift_~tmp___1~7, 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~24;havoc timeShift_~tmp___0~11;havoc timeShift_~tmp___1~7;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~ret83, stopRequestedAtCurrentFloor_#t~ret84, stopRequestedAtCurrentFloor_#t~ret85, stopRequestedAtCurrentFloor_#t~ret86, stopRequestedAtCurrentFloor_~retValue_acc~22, stopRequestedAtCurrentFloor_~tmp~22, stopRequestedAtCurrentFloor_~tmp___0~9;havoc stopRequestedAtCurrentFloor_~retValue_acc~22;havoc stopRequestedAtCurrentFloor_~tmp~22;havoc stopRequestedAtCurrentFloor_~tmp___0~9;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret157, isExecutiveFloorCalling_~retValue_acc~25;havoc isExecutiveFloorCalling_~retValue_acc~25;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~27;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~27; 20339#L2802 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~27 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~27; 20340#L2829 isExecutiveFloorCalling_#t~ret157 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~25 := isExecutiveFloorCalling_#t~ret157;havoc isExecutiveFloorCalling_#t~ret157;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~25; 20741#L2706 stopRequestedAtCurrentFloor_#t~ret83 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~22 := stopRequestedAtCurrentFloor_#t~ret83;havoc stopRequestedAtCurrentFloor_#t~ret83; 20561#L2091 assume 0 != stopRequestedAtCurrentFloor_~tmp~22;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~11;havoc getCurrentFloorID_~retValue_acc~11;getCurrentFloorID_~retValue_acc~11 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~11; 20562#L1422 stopRequestedAtCurrentFloor_#t~ret84 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~9 := stopRequestedAtCurrentFloor_#t~ret84;havoc stopRequestedAtCurrentFloor_#t~ret84; 20435#L2095 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~9);stopRequestedAtCurrentFloor_~retValue_acc~22 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~22; 20436#L2108 timeShift_#t~ret99 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret99;havoc timeShift_#t~ret99; 21148#L2243 assume !(0 != timeShift_~tmp___9~2); 22114#L2334 assume !(1 == ~doorState~0); 22115#L2334-2 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret77, stopRequestedInDirection_#t~ret78, stopRequestedInDirection_#t~ret79, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~19, stopRequestedInDirection_~tmp~19, stopRequestedInDirection_~tmp___0~7, 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~19;havoc stopRequestedInDirection_~tmp~19;havoc stopRequestedInDirection_~tmp___0~7;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret157, isExecutiveFloorCalling_~retValue_acc~25;havoc isExecutiveFloorCalling_~retValue_acc~25;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~27;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~27; 20348#L2802-3 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~27 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~27; 20349#L2829-3 isExecutiveFloorCalling_#t~ret157 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~25 := isExecutiveFloorCalling_#t~ret157;havoc isExecutiveFloorCalling_#t~ret157;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~25; 20749#L2706-1 stopRequestedInDirection_#t~ret77 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~7 := stopRequestedInDirection_#t~ret77;havoc stopRequestedInDirection_#t~ret77; 20750#L1974 assume 0 != stopRequestedInDirection_~tmp___0~7;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~11;havoc getCurrentFloorID_~retValue_acc~11;getCurrentFloorID_~retValue_acc~11 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~11; 21215#L1422-1 stopRequestedInDirection_#t~ret78 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~19 := stopRequestedInDirection_#t~ret78;havoc stopRequestedInDirection_#t~ret78;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~19 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~19 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~19; 21814#L1987 timeShift_#t~ret106 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret106;havoc timeShift_#t~ret106; 21815#L2342 assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret80, continueInDirection_~dir, continueInDirection_~tmp~20;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~20;~currentHeading~0 := continueInDirection_~dir; 21842#L2031 assume !(1 == ~currentHeading~0); 21843#L2041 assume !(0 == ~currentFloorID~0); 22260#L2041-2 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 22244#L2047-5 havoc __utac_acc__Specification9_spec__3_#t~ret55, __utac_acc__Specification9_spec__3_#t~ret56, __utac_acc__Specification9_spec__3_#t~ret57, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~14, __utac_acc__Specification9_spec__3_~tmp___0~4, __utac_acc__Specification9_spec__3_~tmp___1~3;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~14;havoc __utac_acc__Specification9_spec__3_~tmp___0~4;havoc __utac_acc__Specification9_spec__3_~tmp___1~3;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~11;havoc getCurrentFloorID_~retValue_acc~11;getCurrentFloorID_~retValue_acc~11 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~11; 22333#L1422-3 __utac_acc__Specification9_spec__3_#t~ret55 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~14 := __utac_acc__Specification9_spec__3_#t~ret55;havoc __utac_acc__Specification9_spec__3_#t~ret55;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~14;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~15;havoc isEmpty_~retValue_acc~15; 22334#L1482-6 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~15 := 0;isEmpty_#res := isEmpty_~retValue_acc~15; 21475#L1514-6 __utac_acc__Specification9_spec__3_#t~ret56 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~3 := __utac_acc__Specification9_spec__3_#t~ret56;havoc __utac_acc__Specification9_spec__3_#t~ret56; 22061#L923 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~3);havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~12;havoc areDoorsOpen_~retValue_acc~12;areDoorsOpen_~retValue_acc~12 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~12; 20632#L1431 __utac_acc__Specification9_spec__3_#t~ret57 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~4 := __utac_acc__Specification9_spec__3_#t~ret57;havoc __utac_acc__Specification9_spec__3_#t~ret57; 20633#L933 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___0~4); 20172#L933-1 cleanup_~i~2 := 0; 20845#L283-2 [2018-11-23 06:07:29,533 INFO L796 eck$LassoCheckResult]: Loop: 20845#L283-2 assume !false; 20599#L284 cleanup_~__cil_tmp4~0 := ~cleanupTimeShifts~0 - 1; 20410#L287 assume cleanup_~i~2 < cleanup_~__cil_tmp4~0;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~10;havoc isBlocked_~retValue_acc~10;isBlocked_~retValue_acc~10 := 0;isBlocked_#res := isBlocked_~retValue_acc~10; 20411#L1269 cleanup_#t~ret13 := isBlocked_#res;cleanup_~tmp___0~2 := cleanup_#t~ret13;havoc cleanup_#t~ret13; 20370#L291 assume 1 != cleanup_~tmp___0~2; 20368#L291-1 havoc isIdle_#res;havoc isIdle_#t~ret65, isIdle_~retValue_acc~17, isIdle_~tmp~17;havoc isIdle_~retValue_acc~17;havoc isIdle_~tmp~17;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret60, anyStopRequested_#t~ret61, anyStopRequested_#t~ret62, anyStopRequested_#t~ret63, anyStopRequested_#t~ret64, anyStopRequested_~retValue_acc~16, anyStopRequested_~tmp~16, anyStopRequested_~tmp___0~5, anyStopRequested_~tmp___1~4, anyStopRequested_~tmp___2~1, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~16;havoc anyStopRequested_~tmp~16;havoc anyStopRequested_~tmp___0~5;havoc anyStopRequested_~tmp___1~4;havoc anyStopRequested_~tmp___2~1;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~27;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~27; 20369#L2802-25 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~27 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~27; 21219#L2829-25 anyStopRequested_#t~ret60 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret60;havoc anyStopRequested_#t~ret60; 21510#L1530 assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~16 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~16; 20237#L1594 isIdle_#t~ret65 := anyStopRequested_#res;isIdle_~tmp~17 := isIdle_#t~ret65;havoc isIdle_#t~ret65;isIdle_~retValue_acc~17 := (if 0 == isIdle_~tmp~17 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~17; 20648#L1607 cleanup_#t~ret14 := isIdle_#res;cleanup_~tmp~8 := cleanup_#t~ret14;havoc cleanup_#t~ret14; 20649#L303 assume !(0 != cleanup_~tmp~8);havoc timeShift_#t~ret99, timeShift_#t~ret100, timeShift_#t~ret101, timeShift_#t~ret102, timeShift_#t~ret103, timeShift_#t~ret104, timeShift_#t~ret105, timeShift_#t~ret106, timeShift_#t~ret107, timeShift_#t~ret108, timeShift_#t~ret109, timeShift_~tmp~24, timeShift_~tmp___0~11, timeShift_~tmp___1~7, 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~24;havoc timeShift_~tmp___0~11;havoc timeShift_~tmp___1~7;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~ret83, stopRequestedAtCurrentFloor_#t~ret84, stopRequestedAtCurrentFloor_#t~ret85, stopRequestedAtCurrentFloor_#t~ret86, stopRequestedAtCurrentFloor_~retValue_acc~22, stopRequestedAtCurrentFloor_~tmp~22, stopRequestedAtCurrentFloor_~tmp___0~9;havoc stopRequestedAtCurrentFloor_~retValue_acc~22;havoc stopRequestedAtCurrentFloor_~tmp~22;havoc stopRequestedAtCurrentFloor_~tmp___0~9;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret157, isExecutiveFloorCalling_~retValue_acc~25;havoc isExecutiveFloorCalling_~retValue_acc~25;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~27;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~27; 21104#L2802-30 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~27 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~27; 21096#L2829-30 isExecutiveFloorCalling_#t~ret157 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~25 := isExecutiveFloorCalling_#t~ret157;havoc isExecutiveFloorCalling_#t~ret157;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~25; 20753#L2706-3 stopRequestedAtCurrentFloor_#t~ret83 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~22 := stopRequestedAtCurrentFloor_#t~ret83;havoc stopRequestedAtCurrentFloor_#t~ret83; 20563#L2091-1 assume 0 != stopRequestedAtCurrentFloor_~tmp~22;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~11;havoc getCurrentFloorID_~retValue_acc~11;getCurrentFloorID_~retValue_acc~11 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~11; 20564#L1422-4 stopRequestedAtCurrentFloor_#t~ret84 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~9 := stopRequestedAtCurrentFloor_#t~ret84;havoc stopRequestedAtCurrentFloor_#t~ret84; 20419#L2095-1 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~9);stopRequestedAtCurrentFloor_~retValue_acc~22 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~22; 20421#L2108-1 timeShift_#t~ret99 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret99;havoc timeShift_#t~ret99; 21147#L2243-1 assume !(0 != timeShift_~tmp___9~2); 22122#L2334-3 assume 1 == ~doorState~0;~doorState~0 := 0; 22103#L2334-5 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret77, stopRequestedInDirection_#t~ret78, stopRequestedInDirection_#t~ret79, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~19, stopRequestedInDirection_~tmp~19, stopRequestedInDirection_~tmp___0~7, 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~19;havoc stopRequestedInDirection_~tmp~19;havoc stopRequestedInDirection_~tmp___0~7;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret157, isExecutiveFloorCalling_~retValue_acc~25;havoc isExecutiveFloorCalling_~retValue_acc~25;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~27;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~27; 21608#L2802-33 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~27 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~27; 21026#L2829-33 isExecutiveFloorCalling_#t~ret157 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~25 := isExecutiveFloorCalling_#t~ret157;havoc isExecutiveFloorCalling_#t~ret157;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~25; 20720#L2706-4 stopRequestedInDirection_#t~ret77 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~7 := stopRequestedInDirection_#t~ret77;havoc stopRequestedInDirection_#t~ret77; 20721#L1974-2 assume 0 != stopRequestedInDirection_~tmp___0~7;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~11;havoc getCurrentFloorID_~retValue_acc~11;getCurrentFloorID_~retValue_acc~11 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~11; 21079#L1422-5 stopRequestedInDirection_#t~ret78 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~19 := stopRequestedInDirection_#t~ret78;havoc stopRequestedInDirection_#t~ret78;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~19 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~19 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~19; 21824#L1987-2 timeShift_#t~ret106 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret106;havoc timeShift_#t~ret106; 21825#L2342-1 assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret80, continueInDirection_~dir, continueInDirection_~tmp~20;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~20;~currentHeading~0 := continueInDirection_~dir; 21822#L2031-3 assume !(1 == ~currentHeading~0); 21823#L2041-9 assume !(0 == ~currentFloorID~0); 22225#L2041-11 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 20307#L2047-11 havoc __utac_acc__Specification9_spec__3_#t~ret55, __utac_acc__Specification9_spec__3_#t~ret56, __utac_acc__Specification9_spec__3_#t~ret57, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~14, __utac_acc__Specification9_spec__3_~tmp___0~4, __utac_acc__Specification9_spec__3_~tmp___1~3;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~14;havoc __utac_acc__Specification9_spec__3_~tmp___0~4;havoc __utac_acc__Specification9_spec__3_~tmp___1~3;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~11;havoc getCurrentFloorID_~retValue_acc~11;getCurrentFloorID_~retValue_acc~11 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~11; 20639#L1422-7 __utac_acc__Specification9_spec__3_#t~ret55 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~14 := __utac_acc__Specification9_spec__3_#t~ret55;havoc __utac_acc__Specification9_spec__3_#t~ret55;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~14;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~15;havoc isEmpty_~retValue_acc~15; 22438#L1482-13 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~15 := 0;isEmpty_#res := isEmpty_~retValue_acc~15; 21465#L1514-13 __utac_acc__Specification9_spec__3_#t~ret56 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~3 := __utac_acc__Specification9_spec__3_#t~ret56;havoc __utac_acc__Specification9_spec__3_#t~ret56; 22040#L923-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~3);havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~12;havoc areDoorsOpen_~retValue_acc~12;areDoorsOpen_~retValue_acc~12 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~12; 20635#L1431-1 __utac_acc__Specification9_spec__3_#t~ret57 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~4 := __utac_acc__Specification9_spec__3_#t~ret57;havoc __utac_acc__Specification9_spec__3_#t~ret57; 20636#L933-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___0~4); 20177#L933-3 cleanup_~i~2 := 1 + cleanup_~i~2; 20845#L283-2 [2018-11-23 06:07:29,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:07:29,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1838128352, now seen corresponding path program 1 times [2018-11-23 06:07:29,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:07:29,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:07:29,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:07:29,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:07:29,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:07:29,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:07:29,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:07:29,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:07:29,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 06:07:29,570 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 06:07:29,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:07:29,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1733776816, now seen corresponding path program 1 times [2018-11-23 06:07:29,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:07:29,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:07:29,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:07:29,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:07:29,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:07:29,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:07:29,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:07:30,066 WARN L180 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 163 [2018-11-23 06:07:30,493 WARN L180 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 129 [2018-11-23 06:07:30,500 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:07:30,501 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:07:30,501 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:07:30,501 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:07:30,501 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 06:07:30,501 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:07:30,502 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:07:30,502 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:07:30,502 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec9_product11_true-unreach-call_true-termination.cil.c_Iteration3_Loop [2018-11-23 06:07:30,502 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:07:30,502 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:07:30,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:30,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:30,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:30,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:30,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:30,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:30,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:30,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:30,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:30,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:30,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:30,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:30,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:30,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:30,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:30,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:30,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:30,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:30,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:30,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:30,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:30,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:30,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:30,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:30,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:30,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:30,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:30,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:30,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:30,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:30,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:30,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:30,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:30,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:30,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:30,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:30,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:30,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:30,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:30,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:30,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:30,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:30,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:30,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:30,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:30,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:30,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:30,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:30,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:30,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:30,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:30,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:30,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:30,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:30,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:30,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:30,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:30,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:30,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:30,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:30,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:31,054 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:07:31,055 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9d21fcf5-a9e3-43c5-81c8-46221854755b/bin-2019/uautomizer/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 [2018-11-23 06:07:31,066 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:07:31,066 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:07:31,075 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 06:07:31,075 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_~tmp___1~4=0} Honda state: {ULTIMATE.start_anyStopRequested_~tmp___1~4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9d21fcf5-a9e3-43c5-81c8-46221854755b/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:07:31,105 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:07:31,105 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:07:31,113 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 06:07:31,113 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_~tmp___9~2=0, ULTIMATE.start_stopRequestedAtCurrentFloor_~retValue_acc~22=0, ULTIMATE.start_stopRequestedAtCurrentFloor_#res=0} Honda state: {ULTIMATE.start_timeShift_~tmp___9~2=0, ULTIMATE.start_stopRequestedAtCurrentFloor_~retValue_acc~22=0, ULTIMATE.start_stopRequestedAtCurrentFloor_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9d21fcf5-a9e3-43c5-81c8-46221854755b/bin-2019/uautomizer/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 [2018-11-23 06:07:31,146 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:07:31,146 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:07:31,161 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 06:07:31,161 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_#t~ret101=0} Honda state: {ULTIMATE.start_timeShift_#t~ret101=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9d21fcf5-a9e3-43c5-81c8-46221854755b/bin-2019/uautomizer/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 [2018-11-23 06:07:31,255 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:07:31,255 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:07:31,273 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 06:07:31,274 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_#t~ret103=0} Honda state: {ULTIMATE.start_timeShift_#t~ret103=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9d21fcf5-a9e3-43c5-81c8-46221854755b/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:07:31,302 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:07:31,302 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:07:31,321 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 06:07:31,321 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_continueInDirection_#t~ret80=0} Honda state: {ULTIMATE.start_continueInDirection_#t~ret80=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9d21fcf5-a9e3-43c5-81c8-46221854755b/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:07:31,340 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:07:31,340 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9d21fcf5-a9e3-43c5-81c8-46221854755b/bin-2019/uautomizer/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 [2018-11-23 06:07:31,364 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 06:07:31,364 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:07:31,401 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 06:07:31,402 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:07:31,403 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:07:31,403 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:07:31,403 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:07:31,403 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 06:07:31,403 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:07:31,403 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:07:31,403 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:07:31,403 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec9_product11_true-unreach-call_true-termination.cil.c_Iteration3_Loop [2018-11-23 06:07:31,403 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:07:31,403 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:07:31,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:31,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:31,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:31,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:31,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:31,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:31,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:31,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:31,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:31,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:31,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:31,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:31,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:31,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:31,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:31,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:31,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:31,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:31,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:31,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:31,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:31,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:31,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:31,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:31,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:31,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:31,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:31,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:31,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:31,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:31,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:31,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:31,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:31,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:31,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:31,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:31,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:31,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:31,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:31,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:31,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:31,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:31,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:31,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:31,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:31,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:31,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:31,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:31,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:31,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:31,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:31,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:31,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:31,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:31,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:31,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:31,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:31,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:31,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:31,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:31,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:31,942 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:07:31,947 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 06:07:31,949 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 [2018-11-23 06:07:31,952 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:07:31,953 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:07:31,953 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:07:31,953 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:07:31,953 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:07:31,955 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:07:31,955 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:07:31,959 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:07:31,959 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 [2018-11-23 06:07:31,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:07:31,962 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:07:31,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:07:31,962 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:07:31,962 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:07:31,962 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:07:31,963 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:07:31,963 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:07:31,963 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 [2018-11-23 06:07:31,964 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:07:31,964 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:07:31,964 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:07:31,964 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:07:31,964 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:07:31,964 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:07:31,965 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:07:31,965 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:07:31,965 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 [2018-11-23 06:07:31,966 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:07:31,966 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:07:31,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:07:31,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:07:31,966 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:07:31,967 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:07:31,967 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:07:31,967 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:07:31,967 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 [2018-11-23 06:07:31,968 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:07:31,968 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:07:31,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:07:31,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:07:31,968 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:07:31,968 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:07:31,968 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:07:31,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:07:31,969 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 [2018-11-23 06:07:31,970 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:07:31,970 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:07:31,970 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:07:31,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:07:31,970 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:07:31,970 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:07:31,971 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:07:31,971 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:07:31,971 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 [2018-11-23 06:07:31,972 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:07:31,972 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:07:31,972 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:07:31,972 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:07:31,972 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:07:31,972 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:07:31,973 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:07:31,973 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:07:31,973 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 [2018-11-23 06:07:31,974 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:07:31,974 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:07:31,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:07:31,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:07:31,974 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:07:31,974 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:07:31,974 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:07:31,975 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:07:31,975 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 [2018-11-23 06:07:31,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:07:31,975 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:07:31,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:07:31,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:07:31,976 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:07:31,976 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:07:31,976 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:07:31,977 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:07:31,977 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 [2018-11-23 06:07:31,977 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:07:31,977 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:07:31,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:07:31,978 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:07:31,978 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:07:31,978 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:07:31,978 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:07:31,979 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:07:31,979 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 [2018-11-23 06:07:31,979 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:07:31,979 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:07:31,979 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:07:31,980 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:07:31,980 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:07:31,980 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:07:31,980 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:07:31,981 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:07:31,981 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 [2018-11-23 06:07:31,981 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:07:31,981 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:07:31,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:07:31,981 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:07:31,982 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:07:31,982 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:07:31,982 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:07:31,982 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:07:31,983 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 [2018-11-23 06:07:31,983 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:07:31,983 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:07:31,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:07:31,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:07:31,983 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:07:31,984 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:07:31,984 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:07:31,984 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:07:31,985 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:07:31,985 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:07:31,985 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:07:31,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:07:31,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:07:31,985 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:07:31,986 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:07:31,986 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:07:31,986 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:07:31,987 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 [2018-11-23 06:07:31,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:07:31,987 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:07:31,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:07:31,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:07:31,987 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:07:31,988 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:07:31,988 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:07:31,988 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:07:31,989 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 [2018-11-23 06:07:31,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:07:31,989 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:07:31,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:07:31,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:07:31,989 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:07:31,990 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:07:31,990 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:07:31,992 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:07:31,992 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 [2018-11-23 06:07:31,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:07:31,992 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:07:31,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:07:31,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:07:31,993 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:07:31,993 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:07:31,993 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:07:31,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:07:31,994 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 [2018-11-23 06:07:31,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:07:31,994 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:07:31,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:07:31,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:07:31,994 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:07:31,995 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:07:31,995 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:07:31,995 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:07:31,996 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 [2018-11-23 06:07:31,996 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:07:31,996 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:07:31,996 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:07:31,996 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:07:31,996 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:07:31,997 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:07:31,997 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:07:32,002 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 06:07:32,004 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 06:07:32,004 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 06:07:32,006 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 06:07:32,006 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 06:07:32,006 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 06:07:32,006 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~doorState~0) = 1*~doorState~0 Supporting invariants [] [2018-11-23 06:07:32,007 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 06:07:32,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:07:32,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:07:32,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:07:32,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:07:32,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:07:32,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:07:32,210 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 06:07:32,211 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3608 states and 6816 transitions. cyclomatic complexity: 3209 Second operand 4 states. [2018-11-23 06:07:32,409 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3608 states and 6816 transitions. cyclomatic complexity: 3209. Second operand 4 states. Result 5228 states and 9772 transitions. Complement of second has 5 states. [2018-11-23 06:07:32,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 06:07:32,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 06:07:32,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3023 transitions. [2018-11-23 06:07:32,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3023 transitions. Stem has 42 letters. Loop has 40 letters. [2018-11-23 06:07:32,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:07:32,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3023 transitions. Stem has 82 letters. Loop has 40 letters. [2018-11-23 06:07:32,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:07:32,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3023 transitions. Stem has 42 letters. Loop has 80 letters. [2018-11-23 06:07:32,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:07:32,418 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5228 states and 9772 transitions. [2018-11-23 06:07:32,442 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3184 [2018-11-23 06:07:32,466 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5228 states to 5228 states and 9772 transitions. [2018-11-23 06:07:32,466 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4416 [2018-11-23 06:07:32,470 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4420 [2018-11-23 06:07:32,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5228 states and 9772 transitions. [2018-11-23 06:07:32,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:07:32,470 INFO L705 BuchiCegarLoop]: Abstraction has 5228 states and 9772 transitions. [2018-11-23 06:07:32,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5228 states and 9772 transitions. [2018-11-23 06:07:32,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5228 to 5224. [2018-11-23 06:07:32,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5224 states. [2018-11-23 06:07:32,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5224 states to 5224 states and 9766 transitions. [2018-11-23 06:07:32,547 INFO L728 BuchiCegarLoop]: Abstraction has 5224 states and 9766 transitions. [2018-11-23 06:07:32,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 06:07:32,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 06:07:32,548 INFO L87 Difference]: Start difference. First operand 5224 states and 9766 transitions. Second operand 3 states. [2018-11-23 06:07:32,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:07:32,626 INFO L93 Difference]: Finished difference Result 5224 states and 9760 transitions. [2018-11-23 06:07:32,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 06:07:32,627 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5224 states and 9760 transitions. [2018-11-23 06:07:32,647 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3184 [2018-11-23 06:07:32,668 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5224 states to 5224 states and 9760 transitions. [2018-11-23 06:07:32,668 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4416 [2018-11-23 06:07:32,673 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4416 [2018-11-23 06:07:32,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5224 states and 9760 transitions. [2018-11-23 06:07:32,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:07:32,674 INFO L705 BuchiCegarLoop]: Abstraction has 5224 states and 9760 transitions. [2018-11-23 06:07:32,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5224 states and 9760 transitions. [2018-11-23 06:07:32,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5224 to 5224. [2018-11-23 06:07:32,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5224 states. [2018-11-23 06:07:32,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5224 states to 5224 states and 9760 transitions. [2018-11-23 06:07:32,840 INFO L728 BuchiCegarLoop]: Abstraction has 5224 states and 9760 transitions. [2018-11-23 06:07:32,840 INFO L608 BuchiCegarLoop]: Abstraction has 5224 states and 9760 transitions. [2018-11-23 06:07:32,840 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 06:07:32,840 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5224 states and 9760 transitions. [2018-11-23 06:07:32,849 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3184 [2018-11-23 06:07:32,850 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:07:32,850 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:07:32,851 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:07:32,851 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:07:32,852 INFO L794 eck$LassoCheckResult]: Stem: 40241#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call #t~string38.base, #t~string38.offset := #Ultimate.alloc(30);call #t~string39.base, #t~string39.offset := #Ultimate.alloc(9);call #t~string40.base, #t~string40.offset := #Ultimate.alloc(21);call #t~string41.base, #t~string41.offset := #Ultimate.alloc(30);call #t~string42.base, #t~string42.offset := #Ultimate.alloc(9);call #t~string43.base, #t~string43.offset := #Ultimate.alloc(21);call #t~string47.base, #t~string47.offset := #Ultimate.alloc(30);call #t~string48.base, #t~string48.offset := #Ultimate.alloc(9);call #t~string49.base, #t~string49.offset := #Ultimate.alloc(25);call #t~string50.base, #t~string50.offset := #Ultimate.alloc(30);call #t~string51.base, #t~string51.offset := #Ultimate.alloc(9);call #t~string52.base, #t~string52.offset := #Ultimate.alloc(25);call #t~string110.base, #t~string110.offset := #Ultimate.alloc(10);call #t~string112.base, #t~string112.offset := #Ultimate.alloc(4);call write~init~int(91, #t~string112.base, #t~string112.offset, 1);call write~init~int(95, #t~string112.base, 1 + #t~string112.offset, 1);call write~init~int(93, #t~string112.base, 2 + #t~string112.offset, 1);call write~init~int(0, #t~string112.base, 3 + #t~string112.offset, 1);call #t~string114.base, #t~string114.offset := #Ultimate.alloc(4);call write~init~int(91, #t~string114.base, #t~string114.offset, 1);call write~init~int(93, #t~string114.base, 1 + #t~string114.offset, 1);call write~init~int(32, #t~string114.base, 2 + #t~string114.offset, 1);call write~init~int(0, #t~string114.base, 3 + #t~string114.offset, 1);call #t~string116.base, #t~string116.offset := #Ultimate.alloc(5);call write~init~int(32, #t~string116.base, #t~string116.offset, 1);call write~init~int(97, #t~string116.base, 1 + #t~string116.offset, 1);call write~init~int(116, #t~string116.base, 2 + #t~string116.offset, 1);call write~init~int(32, #t~string116.base, 3 + #t~string116.offset, 1);call write~init~int(0, #t~string116.base, 4 + #t~string116.offset, 1);call #t~string118.base, #t~string118.offset := #Ultimate.alloc(3);call write~init~int(37, #t~string118.base, #t~string118.offset, 1);call write~init~int(105, #t~string118.base, 1 + #t~string118.offset, 1);call write~init~int(0, #t~string118.base, 2 + #t~string118.offset, 1);call #t~string120.base, #t~string120.offset := #Ultimate.alloc(10);call #t~string122.base, #t~string122.offset := #Ultimate.alloc(3);call write~init~int(117, #t~string122.base, #t~string122.offset, 1);call write~init~int(112, #t~string122.base, 1 + #t~string122.offset, 1);call write~init~int(0, #t~string122.base, 2 + #t~string122.offset, 1);call #t~string124.base, #t~string124.offset := #Ultimate.alloc(5);call write~init~int(100, #t~string124.base, #t~string124.offset, 1);call write~init~int(111, #t~string124.base, 1 + #t~string124.offset, 1);call write~init~int(119, #t~string124.base, 2 + #t~string124.offset, 1);call write~init~int(110, #t~string124.base, 3 + #t~string124.offset, 1);call write~init~int(0, #t~string124.base, 4 + #t~string124.offset, 1);call #t~string126.base, #t~string126.offset := #Ultimate.alloc(7);call write~init~int(32, #t~string126.base, #t~string126.offset, 1);call write~init~int(73, #t~string126.base, 1 + #t~string126.offset, 1);call write~init~int(76, #t~string126.base, 2 + #t~string126.offset, 1);call write~init~int(95, #t~string126.base, 3 + #t~string126.offset, 1);call write~init~int(112, #t~string126.base, 4 + #t~string126.offset, 1);call write~init~int(58, #t~string126.base, 5 + #t~string126.offset, 1);call write~init~int(0, #t~string126.base, 6 + #t~string126.offset, 1);call #t~string128.base, #t~string128.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string128.base, #t~string128.offset, 1);call write~init~int(37, #t~string128.base, 1 + #t~string128.offset, 1);call write~init~int(105, #t~string128.base, 2 + #t~string128.offset, 1);call write~init~int(0, #t~string128.base, 3 + #t~string128.offset, 1);call #t~string130.base, #t~string130.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string130.base, #t~string130.offset, 1);call write~init~int(37, #t~string130.base, 1 + #t~string130.offset, 1);call write~init~int(105, #t~string130.base, 2 + #t~string130.offset, 1);call write~init~int(0, #t~string130.base, 3 + #t~string130.offset, 1);call #t~string132.base, #t~string132.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string132.base, #t~string132.offset, 1);call write~init~int(37, #t~string132.base, 1 + #t~string132.offset, 1);call write~init~int(105, #t~string132.base, 2 + #t~string132.offset, 1);call write~init~int(0, #t~string132.base, 3 + #t~string132.offset, 1);call #t~string134.base, #t~string134.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string134.base, #t~string134.offset, 1);call write~init~int(37, #t~string134.base, 1 + #t~string134.offset, 1);call write~init~int(105, #t~string134.base, 2 + #t~string134.offset, 1);call write~init~int(0, #t~string134.base, 3 + #t~string134.offset, 1);call #t~string136.base, #t~string136.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string136.base, #t~string136.offset, 1);call write~init~int(37, #t~string136.base, 1 + #t~string136.offset, 1);call write~init~int(105, #t~string136.base, 2 + #t~string136.offset, 1);call write~init~int(0, #t~string136.base, 3 + #t~string136.offset, 1);call #t~string138.base, #t~string138.offset := #Ultimate.alloc(6);call write~init~int(32, #t~string138.base, #t~string138.offset, 1);call write~init~int(70, #t~string138.base, 1 + #t~string138.offset, 1);call write~init~int(95, #t~string138.base, 2 + #t~string138.offset, 1);call write~init~int(112, #t~string138.base, 3 + #t~string138.offset, 1);call write~init~int(58, #t~string138.base, 4 + #t~string138.offset, 1);call write~init~int(0, #t~string138.base, 5 + #t~string138.offset, 1);call #t~string141.base, #t~string141.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string141.base, #t~string141.offset, 1);call write~init~int(37, #t~string141.base, 1 + #t~string141.offset, 1);call write~init~int(105, #t~string141.base, 2 + #t~string141.offset, 1);call write~init~int(0, #t~string141.base, 3 + #t~string141.offset, 1);call #t~string144.base, #t~string144.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string144.base, #t~string144.offset, 1);call write~init~int(37, #t~string144.base, 1 + #t~string144.offset, 1);call write~init~int(105, #t~string144.base, 2 + #t~string144.offset, 1);call write~init~int(0, #t~string144.base, 3 + #t~string144.offset, 1);call #t~string147.base, #t~string147.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string147.base, #t~string147.offset, 1);call write~init~int(37, #t~string147.base, 1 + #t~string147.offset, 1);call write~init~int(105, #t~string147.base, 2 + #t~string147.offset, 1);call write~init~int(0, #t~string147.base, 3 + #t~string147.offset, 1);call #t~string150.base, #t~string150.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string150.base, #t~string150.offset, 1);call write~init~int(37, #t~string150.base, 1 + #t~string150.offset, 1);call write~init~int(105, #t~string150.base, 2 + #t~string150.offset, 1);call write~init~int(0, #t~string150.base, 3 + #t~string150.offset, 1);call #t~string153.base, #t~string153.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string153.base, #t~string153.offset, 1);call write~init~int(37, #t~string153.base, 1 + #t~string153.offset, 1);call write~init~int(105, #t~string153.base, 2 + #t~string153.offset, 1);call write~init~int(0, #t~string153.base, 3 + #t~string153.offset, 1);call #t~string155.base, #t~string155.offset := #Ultimate.alloc(2);call write~init~int(10, #t~string155.base, #t~string155.offset, 1);call write~init~int(0, #t~string155.base, 1 + #t~string155.offset, 1);~executiveFloor~0 := 4;~cleanupTimeShifts~0 := 12;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0;~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; 40242#L-1 havoc main_#res;havoc main_#t~ret19, main_~retValue_acc~1, main_~tmp~10;havoc main_~retValue_acc~1;havoc main_~tmp~10; 40949#L1047 havoc valid_product_#res;havoc valid_product_~retValue_acc~6;havoc valid_product_~retValue_acc~6;valid_product_~retValue_acc~6 := 1;valid_product_#res := valid_product_~retValue_acc~6; 40950#L1055 main_#t~ret19 := valid_product_#res;main_~tmp~10 := main_#t~ret19;havoc main_#t~ret19; 41949#L482 assume 0 != main_~tmp~10; 42119#L451 ~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 42088#L880 havoc bigMacCall_#t~ret12, bigMacCall_~tmp~7;havoc bigMacCall_~tmp~7;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~8;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~8; 41488#L1105 assume !(0 == getOrigin_~person); 41489#L1109 assume !(1 == getOrigin_~person); 42301#L1113 assume !(2 == getOrigin_~person); 42234#L1117 assume !(3 == getOrigin_~person); 40213#L1121 assume !(4 == getOrigin_~person); 40161#L1125 assume 5 == getOrigin_~person;getOrigin_~retValue_acc~8 := 1;getOrigin_#res := getOrigin_~retValue_acc~8; 40162#L1130 bigMacCall_#t~ret12 := getOrigin_#res;bigMacCall_~tmp~7 := bigMacCall_#t~ret12;havoc bigMacCall_#t~ret12;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~7;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 40951#L3073 assume 0 == initPersonOnFloor_~floor; 40952#L3074 assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 39744#L3181-1 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 41882#L2865 assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 41637#L2877-2 havoc cleanup_#t~ret13, cleanup_#t~ret14, cleanup_~i~2, cleanup_~tmp~8, cleanup_~tmp___0~2, cleanup_~__cil_tmp4~0;havoc cleanup_~i~2;havoc cleanup_~tmp~8;havoc cleanup_~tmp___0~2;havoc cleanup_~__cil_tmp4~0;havoc timeShift_#t~ret99, timeShift_#t~ret100, timeShift_#t~ret101, timeShift_#t~ret102, timeShift_#t~ret103, timeShift_#t~ret104, timeShift_#t~ret105, timeShift_#t~ret106, timeShift_#t~ret107, timeShift_#t~ret108, timeShift_#t~ret109, timeShift_~tmp~24, timeShift_~tmp___0~11, timeShift_~tmp___1~7, 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~24;havoc timeShift_~tmp___0~11;havoc timeShift_~tmp___1~7;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~ret83, stopRequestedAtCurrentFloor_#t~ret84, stopRequestedAtCurrentFloor_#t~ret85, stopRequestedAtCurrentFloor_#t~ret86, stopRequestedAtCurrentFloor_~retValue_acc~22, stopRequestedAtCurrentFloor_~tmp~22, stopRequestedAtCurrentFloor_~tmp___0~9;havoc stopRequestedAtCurrentFloor_~retValue_acc~22;havoc stopRequestedAtCurrentFloor_~tmp~22;havoc stopRequestedAtCurrentFloor_~tmp___0~9;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret157, isExecutiveFloorCalling_~retValue_acc~25;havoc isExecutiveFloorCalling_~retValue_acc~25;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~27;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~27; 39913#L2802 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~27 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~27; 39914#L2829 isExecutiveFloorCalling_#t~ret157 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~25 := isExecutiveFloorCalling_#t~ret157;havoc isExecutiveFloorCalling_#t~ret157;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~25; 40376#L2706 stopRequestedAtCurrentFloor_#t~ret83 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~22 := stopRequestedAtCurrentFloor_#t~ret83;havoc stopRequestedAtCurrentFloor_#t~ret83; 40167#L2091 assume 0 != stopRequestedAtCurrentFloor_~tmp~22;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~11;havoc getCurrentFloorID_~retValue_acc~11;getCurrentFloorID_~retValue_acc~11 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~11; 40168#L1422 stopRequestedAtCurrentFloor_#t~ret84 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~9 := stopRequestedAtCurrentFloor_#t~ret84;havoc stopRequestedAtCurrentFloor_#t~ret84; 40032#L2095 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~9);stopRequestedAtCurrentFloor_~retValue_acc~22 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~22; 40033#L2108 timeShift_#t~ret99 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret99;havoc timeShift_#t~ret99; 40903#L2243 assume !(0 != timeShift_~tmp___9~2); 42014#L2334 assume !(1 == ~doorState~0); 42015#L2334-2 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret77, stopRequestedInDirection_#t~ret78, stopRequestedInDirection_#t~ret79, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~19, stopRequestedInDirection_~tmp~19, stopRequestedInDirection_~tmp___0~7, 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~19;havoc stopRequestedInDirection_~tmp~19;havoc stopRequestedInDirection_~tmp___0~7;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret157, isExecutiveFloorCalling_~retValue_acc~25;havoc isExecutiveFloorCalling_~retValue_acc~25;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~27;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~27; 39922#L2802-3 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~27 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~27; 39923#L2829-3 isExecutiveFloorCalling_#t~ret157 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~25 := isExecutiveFloorCalling_#t~ret157;havoc isExecutiveFloorCalling_#t~ret157;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~25; 40384#L2706-1 stopRequestedInDirection_#t~ret77 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~7 := stopRequestedInDirection_#t~ret77;havoc stopRequestedInDirection_#t~ret77; 40385#L1974 assume 0 != stopRequestedInDirection_~tmp___0~7;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~11;havoc getCurrentFloorID_~retValue_acc~11;getCurrentFloorID_~retValue_acc~11 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~11; 40982#L1422-1 stopRequestedInDirection_#t~ret78 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~19 := stopRequestedInDirection_#t~ret78;havoc stopRequestedInDirection_#t~ret78;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~19 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~19 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~19; 41651#L1987 timeShift_#t~ret106 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret106;havoc timeShift_#t~ret106; 41652#L2342 assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret80, continueInDirection_~dir, continueInDirection_~tmp~20;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~20;~currentHeading~0 := continueInDirection_~dir; 41692#L2031 assume !(1 == ~currentHeading~0); 41693#L2041 assume !(0 == ~currentFloorID~0); 42178#L2041-2 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 40296#L2047-5 havoc __utac_acc__Specification9_spec__3_#t~ret55, __utac_acc__Specification9_spec__3_#t~ret56, __utac_acc__Specification9_spec__3_#t~ret57, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~14, __utac_acc__Specification9_spec__3_~tmp___0~4, __utac_acc__Specification9_spec__3_~tmp___1~3;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~14;havoc __utac_acc__Specification9_spec__3_~tmp___0~4;havoc __utac_acc__Specification9_spec__3_~tmp___1~3;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~11;havoc getCurrentFloorID_~retValue_acc~11;getCurrentFloorID_~retValue_acc~11 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~11; 40297#L1422-3 __utac_acc__Specification9_spec__3_#t~ret55 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~14 := __utac_acc__Specification9_spec__3_#t~ret55;havoc __utac_acc__Specification9_spec__3_#t~ret55;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~14;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~15;havoc isEmpty_~retValue_acc~15; 43003#L1482-6 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~15 := 0;isEmpty_#res := isEmpty_~retValue_acc~15; 41696#L1514-6 __utac_acc__Specification9_spec__3_#t~ret56 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~3 := __utac_acc__Specification9_spec__3_#t~ret56;havoc __utac_acc__Specification9_spec__3_#t~ret56; 43000#L923 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~3);havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~12;havoc areDoorsOpen_~retValue_acc~12;areDoorsOpen_~retValue_acc~12 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~12; 42805#L1431 __utac_acc__Specification9_spec__3_#t~ret57 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~4 := __utac_acc__Specification9_spec__3_#t~ret57;havoc __utac_acc__Specification9_spec__3_#t~ret57; 42527#L933 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___0~4); 39728#L933-1 cleanup_~i~2 := 0; 42523#L283-2 assume !false; 43535#L284 [2018-11-23 06:07:32,852 INFO L796 eck$LassoCheckResult]: Loop: 43535#L284 cleanup_~__cil_tmp4~0 := ~cleanupTimeShifts~0 - 1; 43530#L287 assume cleanup_~i~2 < cleanup_~__cil_tmp4~0;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~10;havoc isBlocked_~retValue_acc~10;isBlocked_~retValue_acc~10 := 0;isBlocked_#res := isBlocked_~retValue_acc~10; 43528#L1269 cleanup_#t~ret13 := isBlocked_#res;cleanup_~tmp___0~2 := cleanup_#t~ret13;havoc cleanup_#t~ret13; 43527#L291 assume 1 != cleanup_~tmp___0~2; 43526#L291-1 havoc isIdle_#res;havoc isIdle_#t~ret65, isIdle_~retValue_acc~17, isIdle_~tmp~17;havoc isIdle_~retValue_acc~17;havoc isIdle_~tmp~17;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret60, anyStopRequested_#t~ret61, anyStopRequested_#t~ret62, anyStopRequested_#t~ret63, anyStopRequested_#t~ret64, anyStopRequested_~retValue_acc~16, anyStopRequested_~tmp~16, anyStopRequested_~tmp___0~5, anyStopRequested_~tmp___1~4, anyStopRequested_~tmp___2~1, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~16;havoc anyStopRequested_~tmp~16;havoc anyStopRequested_~tmp___0~5;havoc anyStopRequested_~tmp___1~4;havoc anyStopRequested_~tmp___2~1;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~27;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~27; 43514#L2802-25 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~27 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~27; 43510#L2829-25 anyStopRequested_#t~ret60 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret60;havoc anyStopRequested_#t~ret60; 43509#L1530 assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~16 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~16; 43495#L1594 isIdle_#t~ret65 := anyStopRequested_#res;isIdle_~tmp~17 := isIdle_#t~ret65;havoc isIdle_#t~ret65;isIdle_~retValue_acc~17 := (if 0 == isIdle_~tmp~17 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~17; 43494#L1607 cleanup_#t~ret14 := isIdle_#res;cleanup_~tmp~8 := cleanup_#t~ret14;havoc cleanup_#t~ret14; 43493#L303 assume !(0 != cleanup_~tmp~8);havoc timeShift_#t~ret99, timeShift_#t~ret100, timeShift_#t~ret101, timeShift_#t~ret102, timeShift_#t~ret103, timeShift_#t~ret104, timeShift_#t~ret105, timeShift_#t~ret106, timeShift_#t~ret107, timeShift_#t~ret108, timeShift_#t~ret109, timeShift_~tmp~24, timeShift_~tmp___0~11, timeShift_~tmp___1~7, 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~24;havoc timeShift_~tmp___0~11;havoc timeShift_~tmp___1~7;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~ret83, stopRequestedAtCurrentFloor_#t~ret84, stopRequestedAtCurrentFloor_#t~ret85, stopRequestedAtCurrentFloor_#t~ret86, stopRequestedAtCurrentFloor_~retValue_acc~22, stopRequestedAtCurrentFloor_~tmp~22, stopRequestedAtCurrentFloor_~tmp___0~9;havoc stopRequestedAtCurrentFloor_~retValue_acc~22;havoc stopRequestedAtCurrentFloor_~tmp~22;havoc stopRequestedAtCurrentFloor_~tmp___0~9;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret157, isExecutiveFloorCalling_~retValue_acc~25;havoc isExecutiveFloorCalling_~retValue_acc~25;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~27;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~27; 43490#L2802-30 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~27 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~27; 43483#L2829-30 isExecutiveFloorCalling_#t~ret157 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~25 := isExecutiveFloorCalling_#t~ret157;havoc isExecutiveFloorCalling_#t~ret157;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~25; 43481#L2706-3 stopRequestedAtCurrentFloor_#t~ret83 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~22 := stopRequestedAtCurrentFloor_#t~ret83;havoc stopRequestedAtCurrentFloor_#t~ret83; 43479#L2091-1 assume 0 != stopRequestedAtCurrentFloor_~tmp~22;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~11;havoc getCurrentFloorID_~retValue_acc~11;getCurrentFloorID_~retValue_acc~11 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~11; 43480#L1422-4 stopRequestedAtCurrentFloor_#t~ret84 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~9 := stopRequestedAtCurrentFloor_#t~ret84;havoc stopRequestedAtCurrentFloor_#t~ret84; 43422#L2095-1 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~9);stopRequestedAtCurrentFloor_~retValue_acc~22 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~22; 43419#L2108-1 timeShift_#t~ret99 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret99;havoc timeShift_#t~ret99; 43415#L2243-1 assume !(0 != timeShift_~tmp___9~2); 43410#L2334-3 assume !(1 == ~doorState~0); 43403#L2334-5 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret77, stopRequestedInDirection_#t~ret78, stopRequestedInDirection_#t~ret79, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~19, stopRequestedInDirection_~tmp~19, stopRequestedInDirection_~tmp___0~7, 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~19;havoc stopRequestedInDirection_~tmp~19;havoc stopRequestedInDirection_~tmp___0~7;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret157, isExecutiveFloorCalling_~retValue_acc~25;havoc isExecutiveFloorCalling_~retValue_acc~25;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~27;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~27; 43394#L2802-33 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~27 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~27; 43389#L2829-33 isExecutiveFloorCalling_#t~ret157 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~25 := isExecutiveFloorCalling_#t~ret157;havoc isExecutiveFloorCalling_#t~ret157;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~25; 43112#L2706-4 stopRequestedInDirection_#t~ret77 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~7 := stopRequestedInDirection_#t~ret77;havoc stopRequestedInDirection_#t~ret77; 43105#L1974-2 assume 0 != stopRequestedInDirection_~tmp___0~7;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~11;havoc getCurrentFloorID_~retValue_acc~11;getCurrentFloorID_~retValue_acc~11 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~11; 43055#L1422-5 stopRequestedInDirection_#t~ret78 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~19 := stopRequestedInDirection_#t~ret78;havoc stopRequestedInDirection_#t~ret78;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~19 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~19 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~19; 43053#L1987-2 timeShift_#t~ret106 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret106;havoc timeShift_#t~ret106; 43051#L2342-1 assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret80, continueInDirection_~dir, continueInDirection_~tmp~20;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~20;~currentHeading~0 := continueInDirection_~dir; 43050#L2031-3 assume !(1 == ~currentHeading~0); 43047#L2041-9 assume 0 == ~currentFloorID~0;~currentHeading~0 := 1; 43040#L2041-11 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 43039#L2047-11 havoc __utac_acc__Specification9_spec__3_#t~ret55, __utac_acc__Specification9_spec__3_#t~ret56, __utac_acc__Specification9_spec__3_#t~ret57, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~14, __utac_acc__Specification9_spec__3_~tmp___0~4, __utac_acc__Specification9_spec__3_~tmp___1~3;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~14;havoc __utac_acc__Specification9_spec__3_~tmp___0~4;havoc __utac_acc__Specification9_spec__3_~tmp___1~3;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~11;havoc getCurrentFloorID_~retValue_acc~11;getCurrentFloorID_~retValue_acc~11 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~11; 43811#L1422-7 __utac_acc__Specification9_spec__3_#t~ret55 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~14 := __utac_acc__Specification9_spec__3_#t~ret55;havoc __utac_acc__Specification9_spec__3_#t~ret55;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~14;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~15;havoc isEmpty_~retValue_acc~15; 43810#L1482-13 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~15 := 0;isEmpty_#res := isEmpty_~retValue_acc~15; 43794#L1514-13 __utac_acc__Specification9_spec__3_#t~ret56 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~3 := __utac_acc__Specification9_spec__3_#t~ret56;havoc __utac_acc__Specification9_spec__3_#t~ret56; 43809#L923-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~3);havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~12;havoc areDoorsOpen_~retValue_acc~12;areDoorsOpen_~retValue_acc~12 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~12; 43789#L1431-1 __utac_acc__Specification9_spec__3_#t~ret57 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~4 := __utac_acc__Specification9_spec__3_#t~ret57;havoc __utac_acc__Specification9_spec__3_#t~ret57; 43779#L933-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___0~4); 43770#L933-3 cleanup_~i~2 := 1 + cleanup_~i~2; 43536#L283-2 assume !false; 43535#L284 [2018-11-23 06:07:32,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:07:32,852 INFO L82 PathProgramCache]: Analyzing trace with hash 2037368773, now seen corresponding path program 1 times [2018-11-23 06:07:32,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:07:32,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:07:32,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:07:32,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:07:32,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:07:32,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:07:32,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:07:32,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:07:32,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 06:07:32,911 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 06:07:32,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:07:32,911 INFO L82 PathProgramCache]: Analyzing trace with hash 199276050, now seen corresponding path program 1 times [2018-11-23 06:07:32,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:07:32,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:07:32,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:07:32,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:07:32,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:07:32,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:07:32,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:07:32,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:07:32,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 06:07:32,968 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 06:07:32,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 06:07:32,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 06:07:32,968 INFO L87 Difference]: Start difference. First operand 5224 states and 9760 transitions. cyclomatic complexity: 4539 Second operand 7 states. [2018-11-23 06:07:34,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:07:34,928 INFO L93 Difference]: Finished difference Result 40261 states and 74678 transitions. [2018-11-23 06:07:34,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 06:07:34,928 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40261 states and 74678 transitions. [2018-11-23 06:07:35,053 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21582 [2018-11-23 06:07:35,177 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40261 states to 40261 states and 74678 transitions. [2018-11-23 06:07:35,177 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34680 [2018-11-23 06:07:35,210 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34680 [2018-11-23 06:07:35,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40261 states and 74678 transitions. [2018-11-23 06:07:35,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:07:35,213 INFO L705 BuchiCegarLoop]: Abstraction has 40261 states and 74678 transitions. [2018-11-23 06:07:35,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40261 states and 74678 transitions. [2018-11-23 06:07:35,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40261 to 14667. [2018-11-23 06:07:35,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14667 states. [2018-11-23 06:07:35,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14667 states to 14667 states and 27253 transitions. [2018-11-23 06:07:35,549 INFO L728 BuchiCegarLoop]: Abstraction has 14667 states and 27253 transitions. [2018-11-23 06:07:35,549 INFO L608 BuchiCegarLoop]: Abstraction has 14667 states and 27253 transitions. [2018-11-23 06:07:35,549 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 06:07:35,549 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14667 states and 27253 transitions. [2018-11-23 06:07:35,582 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 9018 [2018-11-23 06:07:35,583 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:07:35,583 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:07:35,584 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:07:35,585 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:07:35,585 INFO L794 eck$LassoCheckResult]: Stem: 85794#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call #t~string38.base, #t~string38.offset := #Ultimate.alloc(30);call #t~string39.base, #t~string39.offset := #Ultimate.alloc(9);call #t~string40.base, #t~string40.offset := #Ultimate.alloc(21);call #t~string41.base, #t~string41.offset := #Ultimate.alloc(30);call #t~string42.base, #t~string42.offset := #Ultimate.alloc(9);call #t~string43.base, #t~string43.offset := #Ultimate.alloc(21);call #t~string47.base, #t~string47.offset := #Ultimate.alloc(30);call #t~string48.base, #t~string48.offset := #Ultimate.alloc(9);call #t~string49.base, #t~string49.offset := #Ultimate.alloc(25);call #t~string50.base, #t~string50.offset := #Ultimate.alloc(30);call #t~string51.base, #t~string51.offset := #Ultimate.alloc(9);call #t~string52.base, #t~string52.offset := #Ultimate.alloc(25);call #t~string110.base, #t~string110.offset := #Ultimate.alloc(10);call #t~string112.base, #t~string112.offset := #Ultimate.alloc(4);call write~init~int(91, #t~string112.base, #t~string112.offset, 1);call write~init~int(95, #t~string112.base, 1 + #t~string112.offset, 1);call write~init~int(93, #t~string112.base, 2 + #t~string112.offset, 1);call write~init~int(0, #t~string112.base, 3 + #t~string112.offset, 1);call #t~string114.base, #t~string114.offset := #Ultimate.alloc(4);call write~init~int(91, #t~string114.base, #t~string114.offset, 1);call write~init~int(93, #t~string114.base, 1 + #t~string114.offset, 1);call write~init~int(32, #t~string114.base, 2 + #t~string114.offset, 1);call write~init~int(0, #t~string114.base, 3 + #t~string114.offset, 1);call #t~string116.base, #t~string116.offset := #Ultimate.alloc(5);call write~init~int(32, #t~string116.base, #t~string116.offset, 1);call write~init~int(97, #t~string116.base, 1 + #t~string116.offset, 1);call write~init~int(116, #t~string116.base, 2 + #t~string116.offset, 1);call write~init~int(32, #t~string116.base, 3 + #t~string116.offset, 1);call write~init~int(0, #t~string116.base, 4 + #t~string116.offset, 1);call #t~string118.base, #t~string118.offset := #Ultimate.alloc(3);call write~init~int(37, #t~string118.base, #t~string118.offset, 1);call write~init~int(105, #t~string118.base, 1 + #t~string118.offset, 1);call write~init~int(0, #t~string118.base, 2 + #t~string118.offset, 1);call #t~string120.base, #t~string120.offset := #Ultimate.alloc(10);call #t~string122.base, #t~string122.offset := #Ultimate.alloc(3);call write~init~int(117, #t~string122.base, #t~string122.offset, 1);call write~init~int(112, #t~string122.base, 1 + #t~string122.offset, 1);call write~init~int(0, #t~string122.base, 2 + #t~string122.offset, 1);call #t~string124.base, #t~string124.offset := #Ultimate.alloc(5);call write~init~int(100, #t~string124.base, #t~string124.offset, 1);call write~init~int(111, #t~string124.base, 1 + #t~string124.offset, 1);call write~init~int(119, #t~string124.base, 2 + #t~string124.offset, 1);call write~init~int(110, #t~string124.base, 3 + #t~string124.offset, 1);call write~init~int(0, #t~string124.base, 4 + #t~string124.offset, 1);call #t~string126.base, #t~string126.offset := #Ultimate.alloc(7);call write~init~int(32, #t~string126.base, #t~string126.offset, 1);call write~init~int(73, #t~string126.base, 1 + #t~string126.offset, 1);call write~init~int(76, #t~string126.base, 2 + #t~string126.offset, 1);call write~init~int(95, #t~string126.base, 3 + #t~string126.offset, 1);call write~init~int(112, #t~string126.base, 4 + #t~string126.offset, 1);call write~init~int(58, #t~string126.base, 5 + #t~string126.offset, 1);call write~init~int(0, #t~string126.base, 6 + #t~string126.offset, 1);call #t~string128.base, #t~string128.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string128.base, #t~string128.offset, 1);call write~init~int(37, #t~string128.base, 1 + #t~string128.offset, 1);call write~init~int(105, #t~string128.base, 2 + #t~string128.offset, 1);call write~init~int(0, #t~string128.base, 3 + #t~string128.offset, 1);call #t~string130.base, #t~string130.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string130.base, #t~string130.offset, 1);call write~init~int(37, #t~string130.base, 1 + #t~string130.offset, 1);call write~init~int(105, #t~string130.base, 2 + #t~string130.offset, 1);call write~init~int(0, #t~string130.base, 3 + #t~string130.offset, 1);call #t~string132.base, #t~string132.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string132.base, #t~string132.offset, 1);call write~init~int(37, #t~string132.base, 1 + #t~string132.offset, 1);call write~init~int(105, #t~string132.base, 2 + #t~string132.offset, 1);call write~init~int(0, #t~string132.base, 3 + #t~string132.offset, 1);call #t~string134.base, #t~string134.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string134.base, #t~string134.offset, 1);call write~init~int(37, #t~string134.base, 1 + #t~string134.offset, 1);call write~init~int(105, #t~string134.base, 2 + #t~string134.offset, 1);call write~init~int(0, #t~string134.base, 3 + #t~string134.offset, 1);call #t~string136.base, #t~string136.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string136.base, #t~string136.offset, 1);call write~init~int(37, #t~string136.base, 1 + #t~string136.offset, 1);call write~init~int(105, #t~string136.base, 2 + #t~string136.offset, 1);call write~init~int(0, #t~string136.base, 3 + #t~string136.offset, 1);call #t~string138.base, #t~string138.offset := #Ultimate.alloc(6);call write~init~int(32, #t~string138.base, #t~string138.offset, 1);call write~init~int(70, #t~string138.base, 1 + #t~string138.offset, 1);call write~init~int(95, #t~string138.base, 2 + #t~string138.offset, 1);call write~init~int(112, #t~string138.base, 3 + #t~string138.offset, 1);call write~init~int(58, #t~string138.base, 4 + #t~string138.offset, 1);call write~init~int(0, #t~string138.base, 5 + #t~string138.offset, 1);call #t~string141.base, #t~string141.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string141.base, #t~string141.offset, 1);call write~init~int(37, #t~string141.base, 1 + #t~string141.offset, 1);call write~init~int(105, #t~string141.base, 2 + #t~string141.offset, 1);call write~init~int(0, #t~string141.base, 3 + #t~string141.offset, 1);call #t~string144.base, #t~string144.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string144.base, #t~string144.offset, 1);call write~init~int(37, #t~string144.base, 1 + #t~string144.offset, 1);call write~init~int(105, #t~string144.base, 2 + #t~string144.offset, 1);call write~init~int(0, #t~string144.base, 3 + #t~string144.offset, 1);call #t~string147.base, #t~string147.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string147.base, #t~string147.offset, 1);call write~init~int(37, #t~string147.base, 1 + #t~string147.offset, 1);call write~init~int(105, #t~string147.base, 2 + #t~string147.offset, 1);call write~init~int(0, #t~string147.base, 3 + #t~string147.offset, 1);call #t~string150.base, #t~string150.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string150.base, #t~string150.offset, 1);call write~init~int(37, #t~string150.base, 1 + #t~string150.offset, 1);call write~init~int(105, #t~string150.base, 2 + #t~string150.offset, 1);call write~init~int(0, #t~string150.base, 3 + #t~string150.offset, 1);call #t~string153.base, #t~string153.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string153.base, #t~string153.offset, 1);call write~init~int(37, #t~string153.base, 1 + #t~string153.offset, 1);call write~init~int(105, #t~string153.base, 2 + #t~string153.offset, 1);call write~init~int(0, #t~string153.base, 3 + #t~string153.offset, 1);call #t~string155.base, #t~string155.offset := #Ultimate.alloc(2);call write~init~int(10, #t~string155.base, #t~string155.offset, 1);call write~init~int(0, #t~string155.base, 1 + #t~string155.offset, 1);~executiveFloor~0 := 4;~cleanupTimeShifts~0 := 12;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0;~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; 85795#L-1 havoc main_#res;havoc main_#t~ret19, main_~retValue_acc~1, main_~tmp~10;havoc main_~retValue_acc~1;havoc main_~tmp~10; 86541#L1047 havoc valid_product_#res;havoc valid_product_~retValue_acc~6;havoc valid_product_~retValue_acc~6;valid_product_~retValue_acc~6 := 1;valid_product_#res := valid_product_~retValue_acc~6; 86542#L1055 main_#t~ret19 := valid_product_#res;main_~tmp~10 := main_#t~ret19;havoc main_#t~ret19; 87633#L482 assume 0 != main_~tmp~10; 87827#L451 ~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 87783#L880 havoc bigMacCall_#t~ret12, bigMacCall_~tmp~7;havoc bigMacCall_~tmp~7;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~8;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~8; 87162#L1105 assume !(0 == getOrigin_~person); 87163#L1109 assume !(1 == getOrigin_~person); 88059#L1113 assume !(2 == getOrigin_~person); 87985#L1117 assume !(3 == getOrigin_~person); 85762#L1121 assume !(4 == getOrigin_~person); 85704#L1125 assume 5 == getOrigin_~person;getOrigin_~retValue_acc~8 := 1;getOrigin_#res := getOrigin_~retValue_acc~8; 85705#L1130 bigMacCall_#t~ret12 := getOrigin_#res;bigMacCall_~tmp~7 := bigMacCall_#t~ret12;havoc bigMacCall_#t~ret12;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~7;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 86543#L3073 assume 0 == initPersonOnFloor_~floor; 86544#L3074 assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 85272#L3181-1 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 87568#L2865 assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 87314#L2877-2 havoc cleanup_#t~ret13, cleanup_#t~ret14, cleanup_~i~2, cleanup_~tmp~8, cleanup_~tmp___0~2, cleanup_~__cil_tmp4~0;havoc cleanup_~i~2;havoc cleanup_~tmp~8;havoc cleanup_~tmp___0~2;havoc cleanup_~__cil_tmp4~0;havoc timeShift_#t~ret99, timeShift_#t~ret100, timeShift_#t~ret101, timeShift_#t~ret102, timeShift_#t~ret103, timeShift_#t~ret104, timeShift_#t~ret105, timeShift_#t~ret106, timeShift_#t~ret107, timeShift_#t~ret108, timeShift_#t~ret109, timeShift_~tmp~24, timeShift_~tmp___0~11, timeShift_~tmp___1~7, 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~24;havoc timeShift_~tmp___0~11;havoc timeShift_~tmp___1~7;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~ret83, stopRequestedAtCurrentFloor_#t~ret84, stopRequestedAtCurrentFloor_#t~ret85, stopRequestedAtCurrentFloor_#t~ret86, stopRequestedAtCurrentFloor_~retValue_acc~22, stopRequestedAtCurrentFloor_~tmp~22, stopRequestedAtCurrentFloor_~tmp___0~9;havoc stopRequestedAtCurrentFloor_~retValue_acc~22;havoc stopRequestedAtCurrentFloor_~tmp~22;havoc stopRequestedAtCurrentFloor_~tmp___0~9;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret157, isExecutiveFloorCalling_~retValue_acc~25;havoc isExecutiveFloorCalling_~retValue_acc~25;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~27;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~27; 85444#L2802 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~27 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~27; 85445#L2829 isExecutiveFloorCalling_#t~ret157 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~25 := isExecutiveFloorCalling_#t~ret157;havoc isExecutiveFloorCalling_#t~ret157;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~25; 85942#L2706 stopRequestedAtCurrentFloor_#t~ret83 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~22 := stopRequestedAtCurrentFloor_#t~ret83;havoc stopRequestedAtCurrentFloor_#t~ret83; 85710#L2091 assume 0 != stopRequestedAtCurrentFloor_~tmp~22;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~11;havoc getCurrentFloorID_~retValue_acc~11;getCurrentFloorID_~retValue_acc~11 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~11; 85711#L1422 stopRequestedAtCurrentFloor_#t~ret84 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~9 := stopRequestedAtCurrentFloor_#t~ret84;havoc stopRequestedAtCurrentFloor_#t~ret84; 85562#L2095 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~9);stopRequestedAtCurrentFloor_~retValue_acc~22 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~22; 85563#L2108 timeShift_#t~ret99 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret99;havoc timeShift_#t~ret99; 89311#L2243 assume !(0 != timeShift_~tmp___9~2); 89312#L2334 assume !(1 == ~doorState~0); 91737#L2334-2 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret77, stopRequestedInDirection_#t~ret78, stopRequestedInDirection_#t~ret79, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~19, stopRequestedInDirection_~tmp~19, stopRequestedInDirection_~tmp___0~7, 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~19;havoc stopRequestedInDirection_~tmp~19;havoc stopRequestedInDirection_~tmp___0~7;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret157, isExecutiveFloorCalling_~retValue_acc~25;havoc isExecutiveFloorCalling_~retValue_acc~25;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~27;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~27; 91736#L2802-3 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~27 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~27; 91735#L2829-3 isExecutiveFloorCalling_#t~ret157 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~25 := isExecutiveFloorCalling_#t~ret157;havoc isExecutiveFloorCalling_#t~ret157;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~25; 91734#L2706-1 stopRequestedInDirection_#t~ret77 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~7 := stopRequestedInDirection_#t~ret77;havoc stopRequestedInDirection_#t~ret77; 91732#L1974 assume 0 != stopRequestedInDirection_~tmp___0~7;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~11;havoc getCurrentFloorID_~retValue_acc~11;getCurrentFloorID_~retValue_acc~11 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~11; 91733#L1422-1 stopRequestedInDirection_#t~ret78 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~19 := stopRequestedInDirection_#t~ret78;havoc stopRequestedInDirection_#t~ret78;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~19 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~19 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~19; 95278#L1987 timeShift_#t~ret106 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret106;havoc timeShift_#t~ret106; 95276#L2342 assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret80, continueInDirection_~dir, continueInDirection_~tmp~20;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~20;~currentHeading~0 := continueInDirection_~dir; 87371#L2031 assume !(1 == ~currentHeading~0); 87372#L2041 assume !(0 == ~currentFloorID~0); 87909#L2041-2 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 87892#L2047-5 havoc __utac_acc__Specification9_spec__3_#t~ret55, __utac_acc__Specification9_spec__3_#t~ret56, __utac_acc__Specification9_spec__3_#t~ret57, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~14, __utac_acc__Specification9_spec__3_~tmp___0~4, __utac_acc__Specification9_spec__3_~tmp___1~3;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~14;havoc __utac_acc__Specification9_spec__3_~tmp___0~4;havoc __utac_acc__Specification9_spec__3_~tmp___1~3;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~11;havoc getCurrentFloorID_~retValue_acc~11;getCurrentFloorID_~retValue_acc~11 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~11; 96631#L1422-3 __utac_acc__Specification9_spec__3_#t~ret55 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~14 := __utac_acc__Specification9_spec__3_#t~ret55;havoc __utac_acc__Specification9_spec__3_#t~ret55;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~14;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~15;havoc isEmpty_~retValue_acc~15; 96630#L1482-6 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~15 := 0;isEmpty_#res := isEmpty_~retValue_acc~15; 96625#L1514-6 __utac_acc__Specification9_spec__3_#t~ret56 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~3 := __utac_acc__Specification9_spec__3_#t~ret56;havoc __utac_acc__Specification9_spec__3_#t~ret56; 96623#L923 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~3);havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~12;havoc areDoorsOpen_~retValue_acc~12;areDoorsOpen_~retValue_acc~12 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~12; 96611#L1431 __utac_acc__Specification9_spec__3_#t~ret57 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~4 := __utac_acc__Specification9_spec__3_#t~ret57;havoc __utac_acc__Specification9_spec__3_#t~ret57; 96601#L933 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___0~4); 96599#L933-1 cleanup_~i~2 := 0; 96597#L283-2 assume !false; 96598#L284 [2018-11-23 06:07:35,585 INFO L796 eck$LassoCheckResult]: Loop: 96598#L284 cleanup_~__cil_tmp4~0 := ~cleanupTimeShifts~0 - 1; 97387#L287 assume cleanup_~i~2 < cleanup_~__cil_tmp4~0;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~10;havoc isBlocked_~retValue_acc~10;isBlocked_~retValue_acc~10 := 0;isBlocked_#res := isBlocked_~retValue_acc~10; 97386#L1269 cleanup_#t~ret13 := isBlocked_#res;cleanup_~tmp___0~2 := cleanup_#t~ret13;havoc cleanup_#t~ret13; 97385#L291 assume 1 != cleanup_~tmp___0~2; 97384#L291-1 havoc isIdle_#res;havoc isIdle_#t~ret65, isIdle_~retValue_acc~17, isIdle_~tmp~17;havoc isIdle_~retValue_acc~17;havoc isIdle_~tmp~17;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret60, anyStopRequested_#t~ret61, anyStopRequested_#t~ret62, anyStopRequested_#t~ret63, anyStopRequested_#t~ret64, anyStopRequested_~retValue_acc~16, anyStopRequested_~tmp~16, anyStopRequested_~tmp___0~5, anyStopRequested_~tmp___1~4, anyStopRequested_~tmp___2~1, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~16;havoc anyStopRequested_~tmp~16;havoc anyStopRequested_~tmp___0~5;havoc anyStopRequested_~tmp___1~4;havoc anyStopRequested_~tmp___2~1;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~27;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~27; 97383#L2802-25 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~27 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~27; 97382#L2829-25 anyStopRequested_#t~ret60 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret60;havoc anyStopRequested_#t~ret60; 97381#L1530 assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~16 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~16; 97367#L1594 isIdle_#t~ret65 := anyStopRequested_#res;isIdle_~tmp~17 := isIdle_#t~ret65;havoc isIdle_#t~ret65;isIdle_~retValue_acc~17 := (if 0 == isIdle_~tmp~17 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~17; 97366#L1607 cleanup_#t~ret14 := isIdle_#res;cleanup_~tmp~8 := cleanup_#t~ret14;havoc cleanup_#t~ret14; 97054#L303 assume !(0 != cleanup_~tmp~8);havoc timeShift_#t~ret99, timeShift_#t~ret100, timeShift_#t~ret101, timeShift_#t~ret102, timeShift_#t~ret103, timeShift_#t~ret104, timeShift_#t~ret105, timeShift_#t~ret106, timeShift_#t~ret107, timeShift_#t~ret108, timeShift_#t~ret109, timeShift_~tmp~24, timeShift_~tmp___0~11, timeShift_~tmp___1~7, 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~24;havoc timeShift_~tmp___0~11;havoc timeShift_~tmp___1~7;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~ret83, stopRequestedAtCurrentFloor_#t~ret84, stopRequestedAtCurrentFloor_#t~ret85, stopRequestedAtCurrentFloor_#t~ret86, stopRequestedAtCurrentFloor_~retValue_acc~22, stopRequestedAtCurrentFloor_~tmp~22, stopRequestedAtCurrentFloor_~tmp___0~9;havoc stopRequestedAtCurrentFloor_~retValue_acc~22;havoc stopRequestedAtCurrentFloor_~tmp~22;havoc stopRequestedAtCurrentFloor_~tmp___0~9;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret157, isExecutiveFloorCalling_~retValue_acc~25;havoc isExecutiveFloorCalling_~retValue_acc~25;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~27;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~27; 97055#L2802-30 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~27 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~27; 88313#L2829-30 isExecutiveFloorCalling_#t~ret157 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~25 := isExecutiveFloorCalling_#t~ret157;havoc isExecutiveFloorCalling_#t~ret157;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~25; 88314#L2706-3 stopRequestedAtCurrentFloor_#t~ret83 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~22 := stopRequestedAtCurrentFloor_#t~ret83;havoc stopRequestedAtCurrentFloor_#t~ret83; 96997#L2091-1 assume 0 != stopRequestedAtCurrentFloor_~tmp~22;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~11;havoc getCurrentFloorID_~retValue_acc~11;getCurrentFloorID_~retValue_acc~11 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~11; 96998#L1422-4 stopRequestedAtCurrentFloor_#t~ret84 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~9 := stopRequestedAtCurrentFloor_#t~ret84;havoc stopRequestedAtCurrentFloor_#t~ret84; 96979#L2095-1 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~9);stopRequestedAtCurrentFloor_~retValue_acc~22 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~22; 96981#L2108-1 timeShift_#t~ret99 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret99;havoc timeShift_#t~ret99; 97554#L2243-1 assume !(0 != timeShift_~tmp___9~2); 97553#L2334-3 assume !(1 == ~doorState~0); 97552#L2334-5 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret77, stopRequestedInDirection_#t~ret78, stopRequestedInDirection_#t~ret79, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~19, stopRequestedInDirection_~tmp~19, stopRequestedInDirection_~tmp___0~7, 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~19;havoc stopRequestedInDirection_~tmp~19;havoc stopRequestedInDirection_~tmp___0~7;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret157, isExecutiveFloorCalling_~retValue_acc~25;havoc isExecutiveFloorCalling_~retValue_acc~25;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~27;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~27; 96889#L2802-33 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~27 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~27; 97551#L2829-33 isExecutiveFloorCalling_#t~ret157 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~25 := isExecutiveFloorCalling_#t~ret157;havoc isExecutiveFloorCalling_#t~ret157;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~25; 97550#L2706-4 stopRequestedInDirection_#t~ret77 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~7 := stopRequestedInDirection_#t~ret77;havoc stopRequestedInDirection_#t~ret77; 97548#L1974-2 assume 0 != stopRequestedInDirection_~tmp___0~7;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~11;havoc getCurrentFloorID_~retValue_acc~11;getCurrentFloorID_~retValue_acc~11 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~11; 97546#L1422-5 stopRequestedInDirection_#t~ret78 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~19 := stopRequestedInDirection_#t~ret78;havoc stopRequestedInDirection_#t~ret78;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~19 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~19 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~19; 97515#L1987-2 timeShift_#t~ret106 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret106;havoc timeShift_#t~ret106; 97514#L2342-1 assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret80, continueInDirection_~dir, continueInDirection_~tmp~20;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~20;~currentHeading~0 := continueInDirection_~dir; 87340#L2031-3 assume !(1 == ~currentHeading~0); 87341#L2041-9 assume !(0 == ~currentFloorID~0); 87901#L2041-11 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 97108#L2047-11 havoc __utac_acc__Specification9_spec__3_#t~ret55, __utac_acc__Specification9_spec__3_#t~ret56, __utac_acc__Specification9_spec__3_#t~ret57, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~14, __utac_acc__Specification9_spec__3_~tmp___0~4, __utac_acc__Specification9_spec__3_~tmp___1~3;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~14;havoc __utac_acc__Specification9_spec__3_~tmp___0~4;havoc __utac_acc__Specification9_spec__3_~tmp___1~3;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~11;havoc getCurrentFloorID_~retValue_acc~11;getCurrentFloorID_~retValue_acc~11 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~11; 97107#L1422-7 __utac_acc__Specification9_spec__3_#t~ret55 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~14 := __utac_acc__Specification9_spec__3_#t~ret55;havoc __utac_acc__Specification9_spec__3_#t~ret55;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~14;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~15;havoc isEmpty_~retValue_acc~15; 97106#L1482-13 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~15 := 0;isEmpty_#res := isEmpty_~retValue_acc~15; 97100#L1514-13 __utac_acc__Specification9_spec__3_#t~ret56 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~3 := __utac_acc__Specification9_spec__3_#t~ret56;havoc __utac_acc__Specification9_spec__3_#t~ret56; 97428#L923-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~3);havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~12;havoc areDoorsOpen_~retValue_acc~12;areDoorsOpen_~retValue_acc~12 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~12; 97092#L1431-1 __utac_acc__Specification9_spec__3_#t~ret57 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~4 := __utac_acc__Specification9_spec__3_#t~ret57;havoc __utac_acc__Specification9_spec__3_#t~ret57; 97081#L933-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___0~4); 97082#L933-3 cleanup_~i~2 := 1 + cleanup_~i~2; 97404#L283-2 assume !false; 96598#L284 [2018-11-23 06:07:35,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:07:35,585 INFO L82 PathProgramCache]: Analyzing trace with hash 2037368773, now seen corresponding path program 2 times [2018-11-23 06:07:35,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:07:35,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:07:35,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:07:35,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:07:35,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:07:35,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:07:35,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:07:35,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:07:35,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 06:07:35,651 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 06:07:35,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:07:35,651 INFO L82 PathProgramCache]: Analyzing trace with hash 900340628, now seen corresponding path program 1 times [2018-11-23 06:07:35,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:07:35,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:07:35,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:07:35,652 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:07:35,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:07:35,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:07:35,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:07:36,041 WARN L180 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 163 [2018-11-23 06:07:36,512 WARN L180 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 127 [2018-11-23 06:07:36,513 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:07:36,513 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:07:36,513 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:07:36,513 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:07:36,513 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 06:07:36,513 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:07:36,513 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:07:36,513 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:07:36,514 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec9_product11_true-unreach-call_true-termination.cil.c_Iteration5_Loop [2018-11-23 06:07:36,514 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:07:36,514 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:07:36,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:36,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:36,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:36,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:36,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:36,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:36,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:36,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:36,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:36,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:36,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:36,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:36,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:36,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:36,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:36,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:36,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:36,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:36,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:36,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:36,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:36,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:36,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:36,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:36,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:36,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:36,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:36,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:36,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:36,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:36,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:36,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:36,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:36,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:36,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:36,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:36,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:36,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:36,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:36,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:36,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:36,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:36,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:36,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:36,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:36,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:36,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:36,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:36,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:36,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:36,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:36,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:36,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:36,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:36,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:36,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:36,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:36,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:36,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:36,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:36,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:36,967 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:07:36,967 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9d21fcf5-a9e3-43c5-81c8-46221854755b/bin-2019/uautomizer/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 [2018-11-23 06:07:36,985 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:07:36,985 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:07:36,993 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 06:07:36,993 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stopRequestedInDirection_#t~ret78=0} Honda state: {ULTIMATE.start_stopRequestedInDirection_#t~ret78=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9d21fcf5-a9e3-43c5-81c8-46221854755b/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:07:37,009 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:07:37,009 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:07:37,011 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 06:07:37,012 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_#t~ret107=0} Honda state: {ULTIMATE.start_timeShift_#t~ret107=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9d21fcf5-a9e3-43c5-81c8-46221854755b/bin-2019/uautomizer/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 [2018-11-23 06:07:37,029 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:07:37,029 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9d21fcf5-a9e3-43c5-81c8-46221854755b/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:07:37,050 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 06:07:37,050 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:07:37,569 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 06:07:37,570 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:07:37,570 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:07:37,570 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:07:37,570 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:07:37,570 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 06:07:37,570 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:07:37,570 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:07:37,571 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:07:37,571 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec9_product11_true-unreach-call_true-termination.cil.c_Iteration5_Loop [2018-11-23 06:07:37,571 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:07:37,571 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:07:37,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:37,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:37,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:37,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:37,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:37,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:37,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:37,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:37,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:37,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:37,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:37,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:37,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:37,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:37,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:37,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:37,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:37,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:37,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:37,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:37,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:37,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:37,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:37,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:37,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:37,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:37,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:37,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:37,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:37,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:37,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:37,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:37,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:37,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:37,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:37,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:37,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:37,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:37,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:37,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:37,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:37,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:37,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:37,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:37,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:37,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:37,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:37,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:37,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:37,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:37,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:37,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:37,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:37,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:37,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:37,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:37,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:37,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:37,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:37,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:37,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:07:38,026 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:07:38,027 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 06:07:38,027 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 [2018-11-23 06:07:38,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:07:38,027 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:07:38,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:07:38,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:07:38,028 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:07:38,029 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:07:38,029 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:07:38,041 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 06:07:38,047 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 06:07:38,047 INFO L444 ModelExtractionUtils]: 8 out of 12 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 06:07:38,048 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 06:07:38,048 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 06:07:38,048 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 06:07:38,048 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~currentFloorID~0) = 1*~currentFloorID~0 Supporting invariants [] [2018-11-23 06:07:38,048 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 06:07:38,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:07:38,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:07:38,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:07:38,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:07:38,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:07:38,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:07:38,381 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 13 loop predicates [2018-11-23 06:07:38,382 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14667 states and 27253 transitions. cyclomatic complexity: 12592 Second operand 15 states. [2018-11-23 06:07:41,836 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 32 [2018-11-23 06:07:46,147 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14667 states and 27253 transitions. cyclomatic complexity: 12592. Second operand 15 states. Result 223999 states and 411069 transitions. Complement of second has 168 states. [2018-11-23 06:07:46,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 85 states 1 stem states 82 non-accepting loop states 1 accepting loop states [2018-11-23 06:07:46,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 06:07:46,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 33108 transitions. [2018-11-23 06:07:46,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 33108 transitions. Stem has 48 letters. Loop has 40 letters. [2018-11-23 06:07:46,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:07:46,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 33108 transitions. Stem has 88 letters. Loop has 40 letters. [2018-11-23 06:07:46,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:07:46,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 33108 transitions. Stem has 48 letters. Loop has 80 letters. [2018-11-23 06:07:46,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:07:46,165 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 223999 states and 411069 transitions. [2018-11-23 06:07:46,908 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 53798 [2018-11-23 06:07:47,356 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 223999 states to 212183 states and 388833 transitions. [2018-11-23 06:07:47,357 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 89989 [2018-11-23 06:07:47,398 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 89998 [2018-11-23 06:07:47,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 212183 states and 388833 transitions. [2018-11-23 06:07:47,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:07:47,400 INFO L705 BuchiCegarLoop]: Abstraction has 212183 states and 388833 transitions. [2018-11-23 06:07:47,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212183 states and 388833 transitions. [2018-11-23 06:07:48,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212183 to 47767. [2018-11-23 06:07:48,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47767 states. [2018-11-23 06:07:48,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47767 states to 47767 states and 88029 transitions. [2018-11-23 06:07:48,332 INFO L728 BuchiCegarLoop]: Abstraction has 47767 states and 88029 transitions. [2018-11-23 06:07:48,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 06:07:48,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 06:07:48,332 INFO L87 Difference]: Start difference. First operand 47767 states and 88029 transitions. Second operand 6 states. [2018-11-23 06:07:48,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:07:48,484 INFO L93 Difference]: Finished difference Result 47761 states and 88016 transitions. [2018-11-23 06:07:48,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 06:07:48,485 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47761 states and 88016 transitions. [2018-11-23 06:07:48,583 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 17812 [2018-11-23 06:07:48,671 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47761 states to 47761 states and 88016 transitions. [2018-11-23 06:07:48,671 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25711 [2018-11-23 06:07:48,684 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25711 [2018-11-23 06:07:48,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47761 states and 88016 transitions. [2018-11-23 06:07:48,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:07:48,693 INFO L705 BuchiCegarLoop]: Abstraction has 47761 states and 88016 transitions. [2018-11-23 06:07:48,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47761 states and 88016 transitions. [2018-11-23 06:07:49,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47761 to 47761. [2018-11-23 06:07:49,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47761 states. [2018-11-23 06:07:49,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47761 states to 47761 states and 88016 transitions. [2018-11-23 06:07:49,506 INFO L728 BuchiCegarLoop]: Abstraction has 47761 states and 88016 transitions. [2018-11-23 06:07:49,506 INFO L608 BuchiCegarLoop]: Abstraction has 47761 states and 88016 transitions. [2018-11-23 06:07:49,506 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 06:07:49,506 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47761 states and 88016 transitions. [2018-11-23 06:07:49,575 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 17812 [2018-11-23 06:07:49,575 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:07:49,575 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:07:49,576 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:07:49,576 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:07:49,576 INFO L794 eck$LassoCheckResult]: Stem: 420795#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call #t~string38.base, #t~string38.offset := #Ultimate.alloc(30);call #t~string39.base, #t~string39.offset := #Ultimate.alloc(9);call #t~string40.base, #t~string40.offset := #Ultimate.alloc(21);call #t~string41.base, #t~string41.offset := #Ultimate.alloc(30);call #t~string42.base, #t~string42.offset := #Ultimate.alloc(9);call #t~string43.base, #t~string43.offset := #Ultimate.alloc(21);call #t~string47.base, #t~string47.offset := #Ultimate.alloc(30);call #t~string48.base, #t~string48.offset := #Ultimate.alloc(9);call #t~string49.base, #t~string49.offset := #Ultimate.alloc(25);call #t~string50.base, #t~string50.offset := #Ultimate.alloc(30);call #t~string51.base, #t~string51.offset := #Ultimate.alloc(9);call #t~string52.base, #t~string52.offset := #Ultimate.alloc(25);call #t~string110.base, #t~string110.offset := #Ultimate.alloc(10);call #t~string112.base, #t~string112.offset := #Ultimate.alloc(4);call write~init~int(91, #t~string112.base, #t~string112.offset, 1);call write~init~int(95, #t~string112.base, 1 + #t~string112.offset, 1);call write~init~int(93, #t~string112.base, 2 + #t~string112.offset, 1);call write~init~int(0, #t~string112.base, 3 + #t~string112.offset, 1);call #t~string114.base, #t~string114.offset := #Ultimate.alloc(4);call write~init~int(91, #t~string114.base, #t~string114.offset, 1);call write~init~int(93, #t~string114.base, 1 + #t~string114.offset, 1);call write~init~int(32, #t~string114.base, 2 + #t~string114.offset, 1);call write~init~int(0, #t~string114.base, 3 + #t~string114.offset, 1);call #t~string116.base, #t~string116.offset := #Ultimate.alloc(5);call write~init~int(32, #t~string116.base, #t~string116.offset, 1);call write~init~int(97, #t~string116.base, 1 + #t~string116.offset, 1);call write~init~int(116, #t~string116.base, 2 + #t~string116.offset, 1);call write~init~int(32, #t~string116.base, 3 + #t~string116.offset, 1);call write~init~int(0, #t~string116.base, 4 + #t~string116.offset, 1);call #t~string118.base, #t~string118.offset := #Ultimate.alloc(3);call write~init~int(37, #t~string118.base, #t~string118.offset, 1);call write~init~int(105, #t~string118.base, 1 + #t~string118.offset, 1);call write~init~int(0, #t~string118.base, 2 + #t~string118.offset, 1);call #t~string120.base, #t~string120.offset := #Ultimate.alloc(10);call #t~string122.base, #t~string122.offset := #Ultimate.alloc(3);call write~init~int(117, #t~string122.base, #t~string122.offset, 1);call write~init~int(112, #t~string122.base, 1 + #t~string122.offset, 1);call write~init~int(0, #t~string122.base, 2 + #t~string122.offset, 1);call #t~string124.base, #t~string124.offset := #Ultimate.alloc(5);call write~init~int(100, #t~string124.base, #t~string124.offset, 1);call write~init~int(111, #t~string124.base, 1 + #t~string124.offset, 1);call write~init~int(119, #t~string124.base, 2 + #t~string124.offset, 1);call write~init~int(110, #t~string124.base, 3 + #t~string124.offset, 1);call write~init~int(0, #t~string124.base, 4 + #t~string124.offset, 1);call #t~string126.base, #t~string126.offset := #Ultimate.alloc(7);call write~init~int(32, #t~string126.base, #t~string126.offset, 1);call write~init~int(73, #t~string126.base, 1 + #t~string126.offset, 1);call write~init~int(76, #t~string126.base, 2 + #t~string126.offset, 1);call write~init~int(95, #t~string126.base, 3 + #t~string126.offset, 1);call write~init~int(112, #t~string126.base, 4 + #t~string126.offset, 1);call write~init~int(58, #t~string126.base, 5 + #t~string126.offset, 1);call write~init~int(0, #t~string126.base, 6 + #t~string126.offset, 1);call #t~string128.base, #t~string128.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string128.base, #t~string128.offset, 1);call write~init~int(37, #t~string128.base, 1 + #t~string128.offset, 1);call write~init~int(105, #t~string128.base, 2 + #t~string128.offset, 1);call write~init~int(0, #t~string128.base, 3 + #t~string128.offset, 1);call #t~string130.base, #t~string130.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string130.base, #t~string130.offset, 1);call write~init~int(37, #t~string130.base, 1 + #t~string130.offset, 1);call write~init~int(105, #t~string130.base, 2 + #t~string130.offset, 1);call write~init~int(0, #t~string130.base, 3 + #t~string130.offset, 1);call #t~string132.base, #t~string132.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string132.base, #t~string132.offset, 1);call write~init~int(37, #t~string132.base, 1 + #t~string132.offset, 1);call write~init~int(105, #t~string132.base, 2 + #t~string132.offset, 1);call write~init~int(0, #t~string132.base, 3 + #t~string132.offset, 1);call #t~string134.base, #t~string134.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string134.base, #t~string134.offset, 1);call write~init~int(37, #t~string134.base, 1 + #t~string134.offset, 1);call write~init~int(105, #t~string134.base, 2 + #t~string134.offset, 1);call write~init~int(0, #t~string134.base, 3 + #t~string134.offset, 1);call #t~string136.base, #t~string136.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string136.base, #t~string136.offset, 1);call write~init~int(37, #t~string136.base, 1 + #t~string136.offset, 1);call write~init~int(105, #t~string136.base, 2 + #t~string136.offset, 1);call write~init~int(0, #t~string136.base, 3 + #t~string136.offset, 1);call #t~string138.base, #t~string138.offset := #Ultimate.alloc(6);call write~init~int(32, #t~string138.base, #t~string138.offset, 1);call write~init~int(70, #t~string138.base, 1 + #t~string138.offset, 1);call write~init~int(95, #t~string138.base, 2 + #t~string138.offset, 1);call write~init~int(112, #t~string138.base, 3 + #t~string138.offset, 1);call write~init~int(58, #t~string138.base, 4 + #t~string138.offset, 1);call write~init~int(0, #t~string138.base, 5 + #t~string138.offset, 1);call #t~string141.base, #t~string141.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string141.base, #t~string141.offset, 1);call write~init~int(37, #t~string141.base, 1 + #t~string141.offset, 1);call write~init~int(105, #t~string141.base, 2 + #t~string141.offset, 1);call write~init~int(0, #t~string141.base, 3 + #t~string141.offset, 1);call #t~string144.base, #t~string144.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string144.base, #t~string144.offset, 1);call write~init~int(37, #t~string144.base, 1 + #t~string144.offset, 1);call write~init~int(105, #t~string144.base, 2 + #t~string144.offset, 1);call write~init~int(0, #t~string144.base, 3 + #t~string144.offset, 1);call #t~string147.base, #t~string147.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string147.base, #t~string147.offset, 1);call write~init~int(37, #t~string147.base, 1 + #t~string147.offset, 1);call write~init~int(105, #t~string147.base, 2 + #t~string147.offset, 1);call write~init~int(0, #t~string147.base, 3 + #t~string147.offset, 1);call #t~string150.base, #t~string150.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string150.base, #t~string150.offset, 1);call write~init~int(37, #t~string150.base, 1 + #t~string150.offset, 1);call write~init~int(105, #t~string150.base, 2 + #t~string150.offset, 1);call write~init~int(0, #t~string150.base, 3 + #t~string150.offset, 1);call #t~string153.base, #t~string153.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string153.base, #t~string153.offset, 1);call write~init~int(37, #t~string153.base, 1 + #t~string153.offset, 1);call write~init~int(105, #t~string153.base, 2 + #t~string153.offset, 1);call write~init~int(0, #t~string153.base, 3 + #t~string153.offset, 1);call #t~string155.base, #t~string155.offset := #Ultimate.alloc(2);call write~init~int(10, #t~string155.base, #t~string155.offset, 1);call write~init~int(0, #t~string155.base, 1 + #t~string155.offset, 1);~executiveFloor~0 := 4;~cleanupTimeShifts~0 := 12;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0;~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; 420796#L-1 havoc main_#res;havoc main_#t~ret19, main_~retValue_acc~1, main_~tmp~10;havoc main_~retValue_acc~1;havoc main_~tmp~10; 421733#L1047 havoc valid_product_#res;havoc valid_product_~retValue_acc~6;havoc valid_product_~retValue_acc~6;valid_product_~retValue_acc~6 := 1;valid_product_#res := valid_product_~retValue_acc~6; 421734#L1055 main_#t~ret19 := valid_product_#res;main_~tmp~10 := main_#t~ret19;havoc main_#t~ret19; 423166#L482 assume 0 != main_~tmp~10; 423418#L451 ~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 423359#L880 havoc bigMacCall_#t~ret12, bigMacCall_~tmp~7;havoc bigMacCall_~tmp~7;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~8;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~8; 422509#L1105 assume !(0 == getOrigin_~person); 422510#L1109 assume !(1 == getOrigin_~person); 423736#L1113 assume !(2 == getOrigin_~person); 423616#L1117 assume !(3 == getOrigin_~person); 420744#L1121 assume !(4 == getOrigin_~person); 420673#L1125 assume 5 == getOrigin_~person;getOrigin_~retValue_acc~8 := 1;getOrigin_#res := getOrigin_~retValue_acc~8; 420674#L1130 bigMacCall_#t~ret12 := getOrigin_#res;bigMacCall_~tmp~7 := bigMacCall_#t~ret12;havoc bigMacCall_#t~ret12;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~7;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 421735#L3073 assume !(0 == initPersonOnFloor_~floor); 420934#L3100 assume 1 == initPersonOnFloor_~floor; 420900#L3101 assume 0 == initPersonOnFloor_~person;~personOnFloor_0_1~0 := 1; 420124#L3181-1 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 423063#L2865 assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 422763#L2877-2 havoc cleanup_#t~ret13, cleanup_#t~ret14, cleanup_~i~2, cleanup_~tmp~8, cleanup_~tmp___0~2, cleanup_~__cil_tmp4~0;havoc cleanup_~i~2;havoc cleanup_~tmp~8;havoc cleanup_~tmp___0~2;havoc cleanup_~__cil_tmp4~0;havoc timeShift_#t~ret99, timeShift_#t~ret100, timeShift_#t~ret101, timeShift_#t~ret102, timeShift_#t~ret103, timeShift_#t~ret104, timeShift_#t~ret105, timeShift_#t~ret106, timeShift_#t~ret107, timeShift_#t~ret108, timeShift_#t~ret109, timeShift_~tmp~24, timeShift_~tmp___0~11, timeShift_~tmp___1~7, 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~24;havoc timeShift_~tmp___0~11;havoc timeShift_~tmp___1~7;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~ret83, stopRequestedAtCurrentFloor_#t~ret84, stopRequestedAtCurrentFloor_#t~ret85, stopRequestedAtCurrentFloor_#t~ret86, stopRequestedAtCurrentFloor_~retValue_acc~22, stopRequestedAtCurrentFloor_~tmp~22, stopRequestedAtCurrentFloor_~tmp___0~9;havoc stopRequestedAtCurrentFloor_~retValue_acc~22;havoc stopRequestedAtCurrentFloor_~tmp~22;havoc stopRequestedAtCurrentFloor_~tmp___0~9;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret157, isExecutiveFloorCalling_~retValue_acc~25;havoc isExecutiveFloorCalling_~retValue_acc~25;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~27;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~27; 420338#L2802 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~27 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~27; 420339#L2829 isExecutiveFloorCalling_#t~ret157 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~25 := isExecutiveFloorCalling_#t~ret157;havoc isExecutiveFloorCalling_#t~ret157;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~25; 424275#L2706 stopRequestedAtCurrentFloor_#t~ret83 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~22 := stopRequestedAtCurrentFloor_#t~ret83;havoc stopRequestedAtCurrentFloor_#t~ret83; 424269#L2091 assume 0 != stopRequestedAtCurrentFloor_~tmp~22;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~11;havoc getCurrentFloorID_~retValue_acc~11;getCurrentFloorID_~retValue_acc~11 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~11; 424263#L1422 stopRequestedAtCurrentFloor_#t~ret84 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~9 := stopRequestedAtCurrentFloor_#t~ret84;havoc stopRequestedAtCurrentFloor_#t~ret84; 420479#L2095 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~9);stopRequestedAtCurrentFloor_~retValue_acc~22 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~22; 420480#L2108 timeShift_#t~ret99 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret99;havoc timeShift_#t~ret99; 421685#L2243 assume !(0 != timeShift_~tmp___9~2); 423252#L2334 assume !(1 == ~doorState~0); 423253#L2334-2 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret77, stopRequestedInDirection_#t~ret78, stopRequestedInDirection_#t~ret79, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~19, stopRequestedInDirection_~tmp~19, stopRequestedInDirection_~tmp___0~7, 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~19;havoc stopRequestedInDirection_~tmp~19;havoc stopRequestedInDirection_~tmp___0~7;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret157, isExecutiveFloorCalling_~retValue_acc~25;havoc isExecutiveFloorCalling_~retValue_acc~25;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~27;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~27; 420346#L2802-3 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~27 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~27; 420347#L2829-3 isExecutiveFloorCalling_#t~ret157 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~25 := isExecutiveFloorCalling_#t~ret157;havoc isExecutiveFloorCalling_#t~ret157;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~25; 421001#L2706-1 stopRequestedInDirection_#t~ret77 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~7 := stopRequestedInDirection_#t~ret77;havoc stopRequestedInDirection_#t~ret77; 421002#L1974 assume 0 != stopRequestedInDirection_~tmp___0~7;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~11;havoc getCurrentFloorID_~retValue_acc~11;getCurrentFloorID_~retValue_acc~11 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~11; 421770#L1422-1 stopRequestedInDirection_#t~ret78 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~19 := stopRequestedInDirection_#t~ret78;havoc stopRequestedInDirection_#t~ret78;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~19 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~19 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~19; 424423#L1987 timeShift_#t~ret106 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret106;havoc timeShift_#t~ret106; 424233#L2342 assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret80, continueInDirection_~dir, continueInDirection_~tmp~20;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~20;~currentHeading~0 := continueInDirection_~dir; 424234#L2031 assume !(1 == ~currentHeading~0); 424802#L2041 assume !(0 == ~currentFloorID~0); 423529#L2041-2 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 423504#L2047-5 havoc __utac_acc__Specification9_spec__3_#t~ret55, __utac_acc__Specification9_spec__3_#t~ret56, __utac_acc__Specification9_spec__3_#t~ret57, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~14, __utac_acc__Specification9_spec__3_~tmp___0~4, __utac_acc__Specification9_spec__3_~tmp___1~3;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~14;havoc __utac_acc__Specification9_spec__3_~tmp___0~4;havoc __utac_acc__Specification9_spec__3_~tmp___1~3;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~11;havoc getCurrentFloorID_~retValue_acc~11;getCurrentFloorID_~retValue_acc~11 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~11; 423657#L1422-3 __utac_acc__Specification9_spec__3_#t~ret55 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~14 := __utac_acc__Specification9_spec__3_#t~ret55;havoc __utac_acc__Specification9_spec__3_#t~ret55;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~14;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~15;havoc isEmpty_~retValue_acc~15; 422333#L1482-6 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~15 := 0;isEmpty_#res := isEmpty_~retValue_acc~15; 421370#L1514-6 __utac_acc__Specification9_spec__3_#t~ret56 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~3 := __utac_acc__Specification9_spec__3_#t~ret56;havoc __utac_acc__Specification9_spec__3_#t~ret56; 423162#L923 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~3);havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~12;havoc areDoorsOpen_~retValue_acc~12;areDoorsOpen_~retValue_acc~12 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~12; 423163#L1431 __utac_acc__Specification9_spec__3_#t~ret57 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~4 := __utac_acc__Specification9_spec__3_#t~ret57;havoc __utac_acc__Specification9_spec__3_#t~ret57; 424221#L933 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___0~4); 420108#L933-1 cleanup_~i~2 := 0; 439232#L283-2 assume !false; 439233#L284 cleanup_~__cil_tmp4~0 := ~cleanupTimeShifts~0 - 1; 420436#L287 [2018-11-23 06:07:49,577 INFO L796 eck$LassoCheckResult]: Loop: 420436#L287 assume cleanup_~i~2 < cleanup_~__cil_tmp4~0;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~10;havoc isBlocked_~retValue_acc~10;isBlocked_~retValue_acc~10 := 0;isBlocked_#res := isBlocked_~retValue_acc~10; 420437#L1269 cleanup_#t~ret13 := isBlocked_#res;cleanup_~tmp___0~2 := cleanup_#t~ret13;havoc cleanup_#t~ret13; 420374#L291 assume 1 != cleanup_~tmp___0~2; 420370#L291-1 havoc isIdle_#res;havoc isIdle_#t~ret65, isIdle_~retValue_acc~17, isIdle_~tmp~17;havoc isIdle_~retValue_acc~17;havoc isIdle_~tmp~17;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret60, anyStopRequested_#t~ret61, anyStopRequested_#t~ret62, anyStopRequested_#t~ret63, anyStopRequested_#t~ret64, anyStopRequested_~retValue_acc~16, anyStopRequested_~tmp~16, anyStopRequested_~tmp___0~5, anyStopRequested_~tmp___1~4, anyStopRequested_~tmp___2~1, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~16;havoc anyStopRequested_~tmp~16;havoc anyStopRequested_~tmp___0~5;havoc anyStopRequested_~tmp___1~4;havoc anyStopRequested_~tmp___2~1;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~27;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~27; 420371#L2802-25 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~27 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~27; 422425#L2829-25 anyStopRequested_#t~ret60 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret60;havoc anyStopRequested_#t~ret60; 422241#L1530 assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~16 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~16; 420206#L1594 isIdle_#t~ret65 := anyStopRequested_#res;isIdle_~tmp~17 := isIdle_#t~ret65;havoc isIdle_#t~ret65;isIdle_~retValue_acc~17 := (if 0 == isIdle_~tmp~17 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~17; 420834#L1607 cleanup_#t~ret14 := isIdle_#res;cleanup_~tmp~8 := cleanup_#t~ret14;havoc cleanup_#t~ret14; 420835#L303 assume !(0 != cleanup_~tmp~8);havoc timeShift_#t~ret99, timeShift_#t~ret100, timeShift_#t~ret101, timeShift_#t~ret102, timeShift_#t~ret103, timeShift_#t~ret104, timeShift_#t~ret105, timeShift_#t~ret106, timeShift_#t~ret107, timeShift_#t~ret108, timeShift_#t~ret109, timeShift_~tmp~24, timeShift_~tmp___0~11, timeShift_~tmp___1~7, 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~24;havoc timeShift_~tmp___0~11;havoc timeShift_~tmp___1~7;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~ret83, stopRequestedAtCurrentFloor_#t~ret84, stopRequestedAtCurrentFloor_#t~ret85, stopRequestedAtCurrentFloor_#t~ret86, stopRequestedAtCurrentFloor_~retValue_acc~22, stopRequestedAtCurrentFloor_~tmp~22, stopRequestedAtCurrentFloor_~tmp___0~9;havoc stopRequestedAtCurrentFloor_~retValue_acc~22;havoc stopRequestedAtCurrentFloor_~tmp~22;havoc stopRequestedAtCurrentFloor_~tmp___0~9;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret157, isExecutiveFloorCalling_~retValue_acc~25;havoc isExecutiveFloorCalling_~retValue_acc~25;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~27;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~27; 421600#L2802-30 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~27 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~27; 422413#L2829-30 isExecutiveFloorCalling_#t~ret157 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~25 := isExecutiveFloorCalling_#t~ret157;havoc isExecutiveFloorCalling_#t~ret157;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~25; 421003#L2706-3 stopRequestedAtCurrentFloor_#t~ret83 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~22 := stopRequestedAtCurrentFloor_#t~ret83;havoc stopRequestedAtCurrentFloor_#t~ret83; 420681#L2091-1 assume 0 != stopRequestedAtCurrentFloor_~tmp~22;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~11;havoc getCurrentFloorID_~retValue_acc~11;getCurrentFloorID_~retValue_acc~11 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~11; 420682#L1422-4 stopRequestedAtCurrentFloor_#t~ret84 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~9 := stopRequestedAtCurrentFloor_#t~ret84;havoc stopRequestedAtCurrentFloor_#t~ret84; 420450#L2095-1 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~9);stopRequestedAtCurrentFloor_~retValue_acc~22 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~22; 420452#L2108-1 timeShift_#t~ret99 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret99;havoc timeShift_#t~ret99; 467364#L2243-1 assume !(0 != timeShift_~tmp___9~2); 467363#L2334-3 assume !(1 == ~doorState~0); 467362#L2334-5 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret77, stopRequestedInDirection_#t~ret78, stopRequestedInDirection_#t~ret79, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~19, stopRequestedInDirection_~tmp~19, stopRequestedInDirection_~tmp___0~7, 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~19;havoc stopRequestedInDirection_~tmp~19;havoc stopRequestedInDirection_~tmp___0~7;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret157, isExecutiveFloorCalling_~retValue_acc~25;havoc isExecutiveFloorCalling_~retValue_acc~25;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~27;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~27; 467361#L2802-33 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~27 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~27; 467360#L2829-33 isExecutiveFloorCalling_#t~ret157 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~25 := isExecutiveFloorCalling_#t~ret157;havoc isExecutiveFloorCalling_#t~ret157;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~25; 467359#L2706-4 stopRequestedInDirection_#t~ret77 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~7 := stopRequestedInDirection_#t~ret77;havoc stopRequestedInDirection_#t~ret77; 467354#L1974-2 assume !(0 != stopRequestedInDirection_~tmp___0~7);stopRequestedInDirection__wrappee__empty_#in~dir, stopRequestedInDirection__wrappee__empty_#in~respectFloorCalls, stopRequestedInDirection__wrappee__empty_#in~respectInLiftCalls := stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls;havoc stopRequestedInDirection__wrappee__empty_#res;havoc stopRequestedInDirection__wrappee__empty_#t~ret66, stopRequestedInDirection__wrappee__empty_#t~ret67, stopRequestedInDirection__wrappee__empty_#t~ret68, stopRequestedInDirection__wrappee__empty_#t~ret69, stopRequestedInDirection__wrappee__empty_#t~ret70, stopRequestedInDirection__wrappee__empty_#t~ret71, stopRequestedInDirection__wrappee__empty_#t~ret72, stopRequestedInDirection__wrappee__empty_#t~ret73, stopRequestedInDirection__wrappee__empty_#t~ret74, stopRequestedInDirection__wrappee__empty_#t~ret75, stopRequestedInDirection__wrappee__empty_#t~ret76, stopRequestedInDirection__wrappee__empty_~dir, stopRequestedInDirection__wrappee__empty_~respectFloorCalls, stopRequestedInDirection__wrappee__empty_~respectInLiftCalls, stopRequestedInDirection__wrappee__empty_~retValue_acc~18, stopRequestedInDirection__wrappee__empty_~tmp~18, stopRequestedInDirection__wrappee__empty_~tmp___0~6, stopRequestedInDirection__wrappee__empty_~tmp___1~5, stopRequestedInDirection__wrappee__empty_~tmp___2~2, stopRequestedInDirection__wrappee__empty_~tmp___3~1, stopRequestedInDirection__wrappee__empty_~tmp___4~0, stopRequestedInDirection__wrappee__empty_~tmp___5~0, stopRequestedInDirection__wrappee__empty_~tmp___6~0, stopRequestedInDirection__wrappee__empty_~tmp___7~0, stopRequestedInDirection__wrappee__empty_~tmp___8~0, stopRequestedInDirection__wrappee__empty_~tmp___9~0;stopRequestedInDirection__wrappee__empty_~dir := stopRequestedInDirection__wrappee__empty_#in~dir;stopRequestedInDirection__wrappee__empty_~respectFloorCalls := stopRequestedInDirection__wrappee__empty_#in~respectFloorCalls;stopRequestedInDirection__wrappee__empty_~respectInLiftCalls := stopRequestedInDirection__wrappee__empty_#in~respectInLiftCalls;havoc stopRequestedInDirection__wrappee__empty_~retValue_acc~18;havoc stopRequestedInDirection__wrappee__empty_~tmp~18;havoc stopRequestedInDirection__wrappee__empty_~tmp___0~6;havoc stopRequestedInDirection__wrappee__empty_~tmp___1~5;havoc stopRequestedInDirection__wrappee__empty_~tmp___2~2;havoc stopRequestedInDirection__wrappee__empty_~tmp___3~1;havoc stopRequestedInDirection__wrappee__empty_~tmp___4~0;havoc stopRequestedInDirection__wrappee__empty_~tmp___5~0;havoc stopRequestedInDirection__wrappee__empty_~tmp___6~0;havoc stopRequestedInDirection__wrappee__empty_~tmp___7~0;havoc stopRequestedInDirection__wrappee__empty_~tmp___8~0;havoc stopRequestedInDirection__wrappee__empty_~tmp___9~0; 467351#L1626-2 assume 1 == stopRequestedInDirection__wrappee__empty_~dir;isTopFloor_#in~floorID := ~currentFloorID~0;havoc isTopFloor_#res;havoc isTopFloor_~floorID, isTopFloor_~retValue_acc~29;isTopFloor_~floorID := isTopFloor_#in~floorID;havoc isTopFloor_~retValue_acc~29;isTopFloor_~retValue_acc~29 := (if 4 == isTopFloor_~floorID then 1 else 0);isTopFloor_#res := isTopFloor_~retValue_acc~29; 467352#L3376-5 stopRequestedInDirection__wrappee__empty_#t~ret66 := isTopFloor_#res;stopRequestedInDirection__wrappee__empty_~tmp~18 := stopRequestedInDirection__wrappee__empty_#t~ret66;havoc stopRequestedInDirection__wrappee__empty_#t~ret66; 467379#L1630-2 assume 0 != stopRequestedInDirection__wrappee__empty_~tmp~18;stopRequestedInDirection__wrappee__empty_~retValue_acc~18 := 0;stopRequestedInDirection__wrappee__empty_#res := stopRequestedInDirection__wrappee__empty_~retValue_acc~18; 421611#L1948-2 stopRequestedInDirection_#t~ret79 := stopRequestedInDirection__wrappee__empty_#res;stopRequestedInDirection_~retValue_acc~19 := stopRequestedInDirection_#t~ret79;havoc stopRequestedInDirection_#t~ret79;stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~19; 424155#L1987-2 timeShift_#t~ret106 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret106;havoc timeShift_#t~ret106; 467778#L2342-1 assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret80, continueInDirection_~dir, continueInDirection_~tmp~20;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~20;~currentHeading~0 := continueInDirection_~dir; 466721#L2031-3 assume !(1 == ~currentHeading~0); 423517#L2041-9 assume !(0 == ~currentFloorID~0); 423470#L2041-11 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 420814#L2047-11 havoc __utac_acc__Specification9_spec__3_#t~ret55, __utac_acc__Specification9_spec__3_#t~ret56, __utac_acc__Specification9_spec__3_#t~ret57, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~14, __utac_acc__Specification9_spec__3_~tmp___0~4, __utac_acc__Specification9_spec__3_~tmp___1~3;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~14;havoc __utac_acc__Specification9_spec__3_~tmp___0~4;havoc __utac_acc__Specification9_spec__3_~tmp___1~3;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~11;havoc getCurrentFloorID_~retValue_acc~11;getCurrentFloorID_~retValue_acc~11 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~11; 420815#L1422-7 __utac_acc__Specification9_spec__3_#t~ret55 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~14 := __utac_acc__Specification9_spec__3_#t~ret55;havoc __utac_acc__Specification9_spec__3_#t~ret55;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~14;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~15;havoc isEmpty_~retValue_acc~15; 422316#L1482-13 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~15 := 0;isEmpty_#res := isEmpty_~retValue_acc~15; 420929#L1514-13 __utac_acc__Specification9_spec__3_#t~ret56 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~3 := __utac_acc__Specification9_spec__3_#t~ret56;havoc __utac_acc__Specification9_spec__3_#t~ret56; 420930#L923-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~3);havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~12;havoc areDoorsOpen_~retValue_acc~12;areDoorsOpen_~retValue_acc~12 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~12; 420805#L1431-1 __utac_acc__Specification9_spec__3_#t~ret57 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~4 := __utac_acc__Specification9_spec__3_#t~ret57;havoc __utac_acc__Specification9_spec__3_#t~ret57; 420806#L933-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___0~4); 420113#L933-3 cleanup_~i~2 := 1 + cleanup_~i~2; 421155#L283-2 assume !false; 420741#L284 cleanup_~__cil_tmp4~0 := ~cleanupTimeShifts~0 - 1; 420436#L287 [2018-11-23 06:07:49,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:07:49,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1589466542, now seen corresponding path program 1 times [2018-11-23 06:07:49,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:07:49,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:07:49,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:07:49,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:07:49,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:07:49,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:07:49,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:07:49,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:07:49,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 06:07:49,635 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 06:07:49,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:07:49,636 INFO L82 PathProgramCache]: Analyzing trace with hash -831273065, now seen corresponding path program 1 times [2018-11-23 06:07:49,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:07:49,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:07:49,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:07:49,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:07:49,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:07:49,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:07:49,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:07:49,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:07:49,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 06:07:49,665 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 06:07:49,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 06:07:49,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 06:07:49,665 INFO L87 Difference]: Start difference. First operand 47761 states and 88016 transitions. cyclomatic complexity: 40284 Second operand 8 states. [2018-11-23 06:07:54,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:07:54,339 INFO L93 Difference]: Finished difference Result 480091 states and 890565 transitions. [2018-11-23 06:07:54,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-23 06:07:54,340 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 480091 states and 890565 transitions. [2018-11-23 06:07:55,567 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 200092 [2018-11-23 06:07:57,034 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 480091 states to 480091 states and 890565 transitions. [2018-11-23 06:07:57,035 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 276445 [2018-11-23 06:07:57,156 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 276445 [2018-11-23 06:07:57,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 480091 states and 890565 transitions. [2018-11-23 06:07:57,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:07:57,159 INFO L705 BuchiCegarLoop]: Abstraction has 480091 states and 890565 transitions. [2018-11-23 06:07:57,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480091 states and 890565 transitions. [2018-11-23 06:07:58,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480091 to 86359. [2018-11-23 06:07:58,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86359 states. [2018-11-23 06:07:58,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86359 states to 86359 states and 158777 transitions. [2018-11-23 06:07:58,844 INFO L728 BuchiCegarLoop]: Abstraction has 86359 states and 158777 transitions. [2018-11-23 06:07:58,844 INFO L608 BuchiCegarLoop]: Abstraction has 86359 states and 158777 transitions. [2018-11-23 06:07:58,844 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 06:07:58,844 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86359 states and 158777 transitions. [2018-11-23 06:07:58,973 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 33599 [2018-11-23 06:07:58,974 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:07:58,974 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:07:58,974 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:07:58,975 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:07:58,975 INFO L794 eck$LassoCheckResult]: Stem: 948745#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call #t~string38.base, #t~string38.offset := #Ultimate.alloc(30);call #t~string39.base, #t~string39.offset := #Ultimate.alloc(9);call #t~string40.base, #t~string40.offset := #Ultimate.alloc(21);call #t~string41.base, #t~string41.offset := #Ultimate.alloc(30);call #t~string42.base, #t~string42.offset := #Ultimate.alloc(9);call #t~string43.base, #t~string43.offset := #Ultimate.alloc(21);call #t~string47.base, #t~string47.offset := #Ultimate.alloc(30);call #t~string48.base, #t~string48.offset := #Ultimate.alloc(9);call #t~string49.base, #t~string49.offset := #Ultimate.alloc(25);call #t~string50.base, #t~string50.offset := #Ultimate.alloc(30);call #t~string51.base, #t~string51.offset := #Ultimate.alloc(9);call #t~string52.base, #t~string52.offset := #Ultimate.alloc(25);call #t~string110.base, #t~string110.offset := #Ultimate.alloc(10);call #t~string112.base, #t~string112.offset := #Ultimate.alloc(4);call write~init~int(91, #t~string112.base, #t~string112.offset, 1);call write~init~int(95, #t~string112.base, 1 + #t~string112.offset, 1);call write~init~int(93, #t~string112.base, 2 + #t~string112.offset, 1);call write~init~int(0, #t~string112.base, 3 + #t~string112.offset, 1);call #t~string114.base, #t~string114.offset := #Ultimate.alloc(4);call write~init~int(91, #t~string114.base, #t~string114.offset, 1);call write~init~int(93, #t~string114.base, 1 + #t~string114.offset, 1);call write~init~int(32, #t~string114.base, 2 + #t~string114.offset, 1);call write~init~int(0, #t~string114.base, 3 + #t~string114.offset, 1);call #t~string116.base, #t~string116.offset := #Ultimate.alloc(5);call write~init~int(32, #t~string116.base, #t~string116.offset, 1);call write~init~int(97, #t~string116.base, 1 + #t~string116.offset, 1);call write~init~int(116, #t~string116.base, 2 + #t~string116.offset, 1);call write~init~int(32, #t~string116.base, 3 + #t~string116.offset, 1);call write~init~int(0, #t~string116.base, 4 + #t~string116.offset, 1);call #t~string118.base, #t~string118.offset := #Ultimate.alloc(3);call write~init~int(37, #t~string118.base, #t~string118.offset, 1);call write~init~int(105, #t~string118.base, 1 + #t~string118.offset, 1);call write~init~int(0, #t~string118.base, 2 + #t~string118.offset, 1);call #t~string120.base, #t~string120.offset := #Ultimate.alloc(10);call #t~string122.base, #t~string122.offset := #Ultimate.alloc(3);call write~init~int(117, #t~string122.base, #t~string122.offset, 1);call write~init~int(112, #t~string122.base, 1 + #t~string122.offset, 1);call write~init~int(0, #t~string122.base, 2 + #t~string122.offset, 1);call #t~string124.base, #t~string124.offset := #Ultimate.alloc(5);call write~init~int(100, #t~string124.base, #t~string124.offset, 1);call write~init~int(111, #t~string124.base, 1 + #t~string124.offset, 1);call write~init~int(119, #t~string124.base, 2 + #t~string124.offset, 1);call write~init~int(110, #t~string124.base, 3 + #t~string124.offset, 1);call write~init~int(0, #t~string124.base, 4 + #t~string124.offset, 1);call #t~string126.base, #t~string126.offset := #Ultimate.alloc(7);call write~init~int(32, #t~string126.base, #t~string126.offset, 1);call write~init~int(73, #t~string126.base, 1 + #t~string126.offset, 1);call write~init~int(76, #t~string126.base, 2 + #t~string126.offset, 1);call write~init~int(95, #t~string126.base, 3 + #t~string126.offset, 1);call write~init~int(112, #t~string126.base, 4 + #t~string126.offset, 1);call write~init~int(58, #t~string126.base, 5 + #t~string126.offset, 1);call write~init~int(0, #t~string126.base, 6 + #t~string126.offset, 1);call #t~string128.base, #t~string128.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string128.base, #t~string128.offset, 1);call write~init~int(37, #t~string128.base, 1 + #t~string128.offset, 1);call write~init~int(105, #t~string128.base, 2 + #t~string128.offset, 1);call write~init~int(0, #t~string128.base, 3 + #t~string128.offset, 1);call #t~string130.base, #t~string130.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string130.base, #t~string130.offset, 1);call write~init~int(37, #t~string130.base, 1 + #t~string130.offset, 1);call write~init~int(105, #t~string130.base, 2 + #t~string130.offset, 1);call write~init~int(0, #t~string130.base, 3 + #t~string130.offset, 1);call #t~string132.base, #t~string132.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string132.base, #t~string132.offset, 1);call write~init~int(37, #t~string132.base, 1 + #t~string132.offset, 1);call write~init~int(105, #t~string132.base, 2 + #t~string132.offset, 1);call write~init~int(0, #t~string132.base, 3 + #t~string132.offset, 1);call #t~string134.base, #t~string134.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string134.base, #t~string134.offset, 1);call write~init~int(37, #t~string134.base, 1 + #t~string134.offset, 1);call write~init~int(105, #t~string134.base, 2 + #t~string134.offset, 1);call write~init~int(0, #t~string134.base, 3 + #t~string134.offset, 1);call #t~string136.base, #t~string136.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string136.base, #t~string136.offset, 1);call write~init~int(37, #t~string136.base, 1 + #t~string136.offset, 1);call write~init~int(105, #t~string136.base, 2 + #t~string136.offset, 1);call write~init~int(0, #t~string136.base, 3 + #t~string136.offset, 1);call #t~string138.base, #t~string138.offset := #Ultimate.alloc(6);call write~init~int(32, #t~string138.base, #t~string138.offset, 1);call write~init~int(70, #t~string138.base, 1 + #t~string138.offset, 1);call write~init~int(95, #t~string138.base, 2 + #t~string138.offset, 1);call write~init~int(112, #t~string138.base, 3 + #t~string138.offset, 1);call write~init~int(58, #t~string138.base, 4 + #t~string138.offset, 1);call write~init~int(0, #t~string138.base, 5 + #t~string138.offset, 1);call #t~string141.base, #t~string141.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string141.base, #t~string141.offset, 1);call write~init~int(37, #t~string141.base, 1 + #t~string141.offset, 1);call write~init~int(105, #t~string141.base, 2 + #t~string141.offset, 1);call write~init~int(0, #t~string141.base, 3 + #t~string141.offset, 1);call #t~string144.base, #t~string144.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string144.base, #t~string144.offset, 1);call write~init~int(37, #t~string144.base, 1 + #t~string144.offset, 1);call write~init~int(105, #t~string144.base, 2 + #t~string144.offset, 1);call write~init~int(0, #t~string144.base, 3 + #t~string144.offset, 1);call #t~string147.base, #t~string147.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string147.base, #t~string147.offset, 1);call write~init~int(37, #t~string147.base, 1 + #t~string147.offset, 1);call write~init~int(105, #t~string147.base, 2 + #t~string147.offset, 1);call write~init~int(0, #t~string147.base, 3 + #t~string147.offset, 1);call #t~string150.base, #t~string150.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string150.base, #t~string150.offset, 1);call write~init~int(37, #t~string150.base, 1 + #t~string150.offset, 1);call write~init~int(105, #t~string150.base, 2 + #t~string150.offset, 1);call write~init~int(0, #t~string150.base, 3 + #t~string150.offset, 1);call #t~string153.base, #t~string153.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string153.base, #t~string153.offset, 1);call write~init~int(37, #t~string153.base, 1 + #t~string153.offset, 1);call write~init~int(105, #t~string153.base, 2 + #t~string153.offset, 1);call write~init~int(0, #t~string153.base, 3 + #t~string153.offset, 1);call #t~string155.base, #t~string155.offset := #Ultimate.alloc(2);call write~init~int(10, #t~string155.base, #t~string155.offset, 1);call write~init~int(0, #t~string155.base, 1 + #t~string155.offset, 1);~executiveFloor~0 := 4;~cleanupTimeShifts~0 := 12;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0;~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; 948746#L-1 havoc main_#res;havoc main_#t~ret19, main_~retValue_acc~1, main_~tmp~10;havoc main_~retValue_acc~1;havoc main_~tmp~10; 949680#L1047 havoc valid_product_#res;havoc valid_product_~retValue_acc~6;havoc valid_product_~retValue_acc~6;valid_product_~retValue_acc~6 := 1;valid_product_#res := valid_product_~retValue_acc~6; 949681#L1055 main_#t~ret19 := valid_product_#res;main_~tmp~10 := main_#t~ret19;havoc main_#t~ret19; 951096#L482 assume 0 != main_~tmp~10; 951347#L451 ~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 951281#L880 havoc bigMacCall_#t~ret12, bigMacCall_~tmp~7;havoc bigMacCall_~tmp~7;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~8;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~8; 950450#L1105 assume !(0 == getOrigin_~person); 950451#L1109 assume !(1 == getOrigin_~person); 951668#L1113 assume !(2 == getOrigin_~person); 951549#L1117 assume !(3 == getOrigin_~person); 948693#L1121 assume !(4 == getOrigin_~person); 948621#L1125 assume 5 == getOrigin_~person;getOrigin_~retValue_acc~8 := 1;getOrigin_#res := getOrigin_~retValue_acc~8; 948622#L1130 bigMacCall_#t~ret12 := getOrigin_#res;bigMacCall_~tmp~7 := bigMacCall_#t~ret12;havoc bigMacCall_#t~ret12;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~7;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 949682#L3073 assume !(0 == initPersonOnFloor_~floor); 948882#L3100 assume 1 == initPersonOnFloor_~floor; 948849#L3101 assume 0 == initPersonOnFloor_~person;~personOnFloor_0_1~0 := 1; 948070#L3181-1 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 950997#L2865 assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 950998#L2877-2 havoc cleanup_#t~ret13, cleanup_#t~ret14, cleanup_~i~2, cleanup_~tmp~8, cleanup_~tmp___0~2, cleanup_~__cil_tmp4~0;havoc cleanup_~i~2;havoc cleanup_~tmp~8;havoc cleanup_~tmp___0~2;havoc cleanup_~__cil_tmp4~0;havoc timeShift_#t~ret99, timeShift_#t~ret100, timeShift_#t~ret101, timeShift_#t~ret102, timeShift_#t~ret103, timeShift_#t~ret104, timeShift_#t~ret105, timeShift_#t~ret106, timeShift_#t~ret107, timeShift_#t~ret108, timeShift_#t~ret109, timeShift_~tmp~24, timeShift_~tmp___0~11, timeShift_~tmp___1~7, 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~24;havoc timeShift_~tmp___0~11;havoc timeShift_~tmp___1~7;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~ret83, stopRequestedAtCurrentFloor_#t~ret84, stopRequestedAtCurrentFloor_#t~ret85, stopRequestedAtCurrentFloor_#t~ret86, stopRequestedAtCurrentFloor_~retValue_acc~22, stopRequestedAtCurrentFloor_~tmp~22, stopRequestedAtCurrentFloor_~tmp___0~9;havoc stopRequestedAtCurrentFloor_~retValue_acc~22;havoc stopRequestedAtCurrentFloor_~tmp~22;havoc stopRequestedAtCurrentFloor_~tmp___0~9;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret157, isExecutiveFloorCalling_~retValue_acc~25;havoc isExecutiveFloorCalling_~retValue_acc~25;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~27;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~27; 948281#L2802 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~27 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~27; 948282#L2829 isExecutiveFloorCalling_#t~ret157 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~25 := isExecutiveFloorCalling_#t~ret157;havoc isExecutiveFloorCalling_#t~ret157;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~25; 952219#L2706 stopRequestedAtCurrentFloor_#t~ret83 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~22 := stopRequestedAtCurrentFloor_#t~ret83;havoc stopRequestedAtCurrentFloor_#t~ret83; 952220#L2091 assume 0 != stopRequestedAtCurrentFloor_~tmp~22;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~11;havoc getCurrentFloorID_~retValue_acc~11;getCurrentFloorID_~retValue_acc~11 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~11; 952200#L1422 stopRequestedAtCurrentFloor_#t~ret84 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~9 := stopRequestedAtCurrentFloor_#t~ret84;havoc stopRequestedAtCurrentFloor_#t~ret84; 952201#L2095 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~9);stopRequestedAtCurrentFloor_~retValue_acc~22 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~22; 952332#L2108 timeShift_#t~ret99 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret99;havoc timeShift_#t~ret99; 952734#L2243 assume !(0 != timeShift_~tmp___9~2); 952733#L2334 assume !(1 == ~doorState~0); 952732#L2334-2 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret77, stopRequestedInDirection_#t~ret78, stopRequestedInDirection_#t~ret79, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~19, stopRequestedInDirection_~tmp~19, stopRequestedInDirection_~tmp___0~7, 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~19;havoc stopRequestedInDirection_~tmp~19;havoc stopRequestedInDirection_~tmp___0~7;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret157, isExecutiveFloorCalling_~retValue_acc~25;havoc isExecutiveFloorCalling_~retValue_acc~25;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~27;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~27; 948289#L2802-3 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~27 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~27; 948290#L2829-3 isExecutiveFloorCalling_#t~ret157 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~25 := isExecutiveFloorCalling_#t~ret157;havoc isExecutiveFloorCalling_#t~ret157;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~25; 948942#L2706-1 stopRequestedInDirection_#t~ret77 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~7 := stopRequestedInDirection_#t~ret77;havoc stopRequestedInDirection_#t~ret77; 948943#L1974 assume 0 != stopRequestedInDirection_~tmp___0~7;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~11;havoc getCurrentFloorID_~retValue_acc~11;getCurrentFloorID_~retValue_acc~11 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~11; 952329#L1422-1 stopRequestedInDirection_#t~ret78 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~19 := stopRequestedInDirection_#t~ret78;havoc stopRequestedInDirection_#t~ret78;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~19 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~19 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~19; 952330#L1987 timeShift_#t~ret106 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret106;havoc timeShift_#t~ret106; 952324#L2342 assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret80, continueInDirection_~dir, continueInDirection_~tmp~20;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~20;~currentHeading~0 := continueInDirection_~dir; 952326#L2031 assume !(1 == ~currentHeading~0); 966863#L2041 assume !(0 == ~currentFloorID~0); 966853#L2041-2 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 966845#L2047-5 havoc __utac_acc__Specification9_spec__3_#t~ret55, __utac_acc__Specification9_spec__3_#t~ret56, __utac_acc__Specification9_spec__3_#t~ret57, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~14, __utac_acc__Specification9_spec__3_~tmp___0~4, __utac_acc__Specification9_spec__3_~tmp___1~3;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~14;havoc __utac_acc__Specification9_spec__3_~tmp___0~4;havoc __utac_acc__Specification9_spec__3_~tmp___1~3;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~11;havoc getCurrentFloorID_~retValue_acc~11;getCurrentFloorID_~retValue_acc~11 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~11; 976628#L1422-3 __utac_acc__Specification9_spec__3_#t~ret55 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~14 := __utac_acc__Specification9_spec__3_#t~ret55;havoc __utac_acc__Specification9_spec__3_#t~ret55;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~14;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~15;havoc isEmpty_~retValue_acc~15; 976627#L1482-6 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~15 := 0;isEmpty_#res := isEmpty_~retValue_acc~15; 976622#L1514-6 __utac_acc__Specification9_spec__3_#t~ret56 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~3 := __utac_acc__Specification9_spec__3_#t~ret56;havoc __utac_acc__Specification9_spec__3_#t~ret56; 976620#L923 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~3);havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~12;havoc areDoorsOpen_~retValue_acc~12;areDoorsOpen_~retValue_acc~12 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~12; 976616#L1431 __utac_acc__Specification9_spec__3_#t~ret57 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~4 := __utac_acc__Specification9_spec__3_#t~ret57;havoc __utac_acc__Specification9_spec__3_#t~ret57; 976606#L933 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___0~4); 976605#L933-1 cleanup_~i~2 := 0; 976601#L283-2 assume !false; 976603#L284 cleanup_~__cil_tmp4~0 := ~cleanupTimeShifts~0 - 1; 977330#L287 [2018-11-23 06:07:58,975 INFO L796 eck$LassoCheckResult]: Loop: 977330#L287 assume cleanup_~i~2 < cleanup_~__cil_tmp4~0;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~10;havoc isBlocked_~retValue_acc~10;isBlocked_~retValue_acc~10 := 0;isBlocked_#res := isBlocked_~retValue_acc~10; 1020713#L1269 cleanup_#t~ret13 := isBlocked_#res;cleanup_~tmp___0~2 := cleanup_#t~ret13;havoc cleanup_#t~ret13; 1020712#L291 assume 1 != cleanup_~tmp___0~2; 1020711#L291-1 havoc isIdle_#res;havoc isIdle_#t~ret65, isIdle_~retValue_acc~17, isIdle_~tmp~17;havoc isIdle_~retValue_acc~17;havoc isIdle_~tmp~17;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret60, anyStopRequested_#t~ret61, anyStopRequested_#t~ret62, anyStopRequested_#t~ret63, anyStopRequested_#t~ret64, anyStopRequested_~retValue_acc~16, anyStopRequested_~tmp~16, anyStopRequested_~tmp___0~5, anyStopRequested_~tmp___1~4, anyStopRequested_~tmp___2~1, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~16;havoc anyStopRequested_~tmp~16;havoc anyStopRequested_~tmp___0~5;havoc anyStopRequested_~tmp___1~4;havoc anyStopRequested_~tmp___2~1;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~27;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~27; 1020710#L2802-25 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~27 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~27; 1020709#L2829-25 anyStopRequested_#t~ret60 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret60;havoc anyStopRequested_#t~ret60; 1020708#L1530 assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~16 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~16; 994348#L1594 isIdle_#t~ret65 := anyStopRequested_#res;isIdle_~tmp~17 := isIdle_#t~ret65;havoc isIdle_#t~ret65;isIdle_~retValue_acc~17 := (if 0 == isIdle_~tmp~17 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~17; 1020707#L1607 cleanup_#t~ret14 := isIdle_#res;cleanup_~tmp~8 := cleanup_#t~ret14;havoc cleanup_#t~ret14; 1020706#L303 assume !(0 != cleanup_~tmp~8);havoc timeShift_#t~ret99, timeShift_#t~ret100, timeShift_#t~ret101, timeShift_#t~ret102, timeShift_#t~ret103, timeShift_#t~ret104, timeShift_#t~ret105, timeShift_#t~ret106, timeShift_#t~ret107, timeShift_#t~ret108, timeShift_#t~ret109, timeShift_~tmp~24, timeShift_~tmp___0~11, timeShift_~tmp___1~7, 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~24;havoc timeShift_~tmp___0~11;havoc timeShift_~tmp___1~7;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~ret83, stopRequestedAtCurrentFloor_#t~ret84, stopRequestedAtCurrentFloor_#t~ret85, stopRequestedAtCurrentFloor_#t~ret86, stopRequestedAtCurrentFloor_~retValue_acc~22, stopRequestedAtCurrentFloor_~tmp~22, stopRequestedAtCurrentFloor_~tmp___0~9;havoc stopRequestedAtCurrentFloor_~retValue_acc~22;havoc stopRequestedAtCurrentFloor_~tmp~22;havoc stopRequestedAtCurrentFloor_~tmp___0~9;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret157, isExecutiveFloorCalling_~retValue_acc~25;havoc isExecutiveFloorCalling_~retValue_acc~25;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~27;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~27; 1020705#L2802-30 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~27 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~27; 1003811#L2829-30 isExecutiveFloorCalling_#t~ret157 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~25 := isExecutiveFloorCalling_#t~ret157;havoc isExecutiveFloorCalling_#t~ret157;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~25; 1020704#L2706-3 stopRequestedAtCurrentFloor_#t~ret83 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~22 := stopRequestedAtCurrentFloor_#t~ret83;havoc stopRequestedAtCurrentFloor_#t~ret83; 1020702#L2091-1 assume 0 != stopRequestedAtCurrentFloor_~tmp~22;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~11;havoc getCurrentFloorID_~retValue_acc~11;getCurrentFloorID_~retValue_acc~11 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~11; 1020701#L1422-4 stopRequestedAtCurrentFloor_#t~ret84 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~9 := stopRequestedAtCurrentFloor_#t~ret84;havoc stopRequestedAtCurrentFloor_#t~ret84; 1020699#L2095-1 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~9);stopRequestedAtCurrentFloor_~retValue_acc~22 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~22; 1020698#L2108-1 timeShift_#t~ret99 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret99;havoc timeShift_#t~ret99; 1020695#L2243-1 assume !(0 != timeShift_~tmp___9~2); 1020697#L2334-3 assume !(1 == ~doorState~0); 1020818#L2334-5 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret77, stopRequestedInDirection_#t~ret78, stopRequestedInDirection_#t~ret79, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~19, stopRequestedInDirection_~tmp~19, stopRequestedInDirection_~tmp___0~7, 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~19;havoc stopRequestedInDirection_~tmp~19;havoc stopRequestedInDirection_~tmp___0~7;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret157, isExecutiveFloorCalling_~retValue_acc~25;havoc isExecutiveFloorCalling_~retValue_acc~25;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~27;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~27; 976580#L2802-33 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~27 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~27; 1020815#L2829-33 isExecutiveFloorCalling_#t~ret157 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~25 := isExecutiveFloorCalling_#t~ret157;havoc isExecutiveFloorCalling_#t~ret157;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~25; 1020816#L2706-4 stopRequestedInDirection_#t~ret77 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~7 := stopRequestedInDirection_#t~ret77;havoc stopRequestedInDirection_#t~ret77; 1020811#L1974-2 assume 0 != stopRequestedInDirection_~tmp___0~7;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~11;havoc getCurrentFloorID_~retValue_acc~11;getCurrentFloorID_~retValue_acc~11 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~11; 1020812#L1422-5 stopRequestedInDirection_#t~ret78 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~19 := stopRequestedInDirection_#t~ret78;havoc stopRequestedInDirection_#t~ret78;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~19 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~19 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~19; 1020807#L1987-2 timeShift_#t~ret106 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret106;havoc timeShift_#t~ret106; 1020808#L2342-1 assume !(0 != timeShift_~tmp___8~2);getReverseHeading_#in~ofHeading := ~currentHeading~0;havoc getReverseHeading_#res;havoc getReverseHeading_~ofHeading, getReverseHeading_~retValue_acc~23;getReverseHeading_~ofHeading := getReverseHeading_#in~ofHeading;havoc getReverseHeading_~retValue_acc~23; 1020803#L2117-2 assume 0 == getReverseHeading_~ofHeading;getReverseHeading_~retValue_acc~23 := 1;getReverseHeading_#res := getReverseHeading_~retValue_acc~23; 1020804#L2122-2 timeShift_#t~ret107 := getReverseHeading_#res;timeShift_~tmp___6~2 := timeShift_#t~ret107;havoc timeShift_#t~ret107;stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := timeShift_~tmp___6~2, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret77, stopRequestedInDirection_#t~ret78, stopRequestedInDirection_#t~ret79, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~19, stopRequestedInDirection_~tmp~19, stopRequestedInDirection_~tmp___0~7, 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~19;havoc stopRequestedInDirection_~tmp~19;havoc stopRequestedInDirection_~tmp___0~7;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret157, isExecutiveFloorCalling_~retValue_acc~25;havoc isExecutiveFloorCalling_~retValue_acc~25;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~27;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~27; 1020796#L2802-44 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~27 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~27; 1005233#L2829-44 isExecutiveFloorCalling_#t~ret157 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~25 := isExecutiveFloorCalling_#t~ret157;havoc isExecutiveFloorCalling_#t~ret157;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~25; 1020789#L2706-5 stopRequestedInDirection_#t~ret77 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~7 := stopRequestedInDirection_#t~ret77;havoc stopRequestedInDirection_#t~ret77; 1020790#L1974-3 assume 0 != stopRequestedInDirection_~tmp___0~7;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~11;havoc getCurrentFloorID_~retValue_acc~11;getCurrentFloorID_~retValue_acc~11 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~11; 1020777#L1422-6 stopRequestedInDirection_#t~ret78 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~19 := stopRequestedInDirection_#t~ret78;havoc stopRequestedInDirection_#t~ret78;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~19 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~19 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~19; 1020778#L1987-3 timeShift_#t~ret108 := stopRequestedInDirection_#res;timeShift_~tmp___7~2 := timeShift_#t~ret108;havoc timeShift_#t~ret108; 1020763#L2351-1 assume !(0 != timeShift_~tmp___7~2);continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret80, continueInDirection_~dir, continueInDirection_~tmp~20;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~20;~currentHeading~0 := continueInDirection_~dir; 1020764#L2031-5 assume !(1 == ~currentHeading~0); 1019642#L2041-15 assume !(0 == ~currentFloorID~0); 1019640#L2041-17 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 1020739#L2047-11 havoc __utac_acc__Specification9_spec__3_#t~ret55, __utac_acc__Specification9_spec__3_#t~ret56, __utac_acc__Specification9_spec__3_#t~ret57, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~14, __utac_acc__Specification9_spec__3_~tmp___0~4, __utac_acc__Specification9_spec__3_~tmp___1~3;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~14;havoc __utac_acc__Specification9_spec__3_~tmp___0~4;havoc __utac_acc__Specification9_spec__3_~tmp___1~3;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~11;havoc getCurrentFloorID_~retValue_acc~11;getCurrentFloorID_~retValue_acc~11 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~11; 1019568#L1422-7 __utac_acc__Specification9_spec__3_#t~ret55 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~14 := __utac_acc__Specification9_spec__3_#t~ret55;havoc __utac_acc__Specification9_spec__3_#t~ret55;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~14;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~15;havoc isEmpty_~retValue_acc~15; 1020738#L1482-13 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~15 := 0;isEmpty_#res := isEmpty_~retValue_acc~15; 1020733#L1514-13 __utac_acc__Specification9_spec__3_#t~ret56 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~3 := __utac_acc__Specification9_spec__3_#t~ret56;havoc __utac_acc__Specification9_spec__3_#t~ret56; 1020731#L923-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~3);havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~12;havoc areDoorsOpen_~retValue_acc~12;areDoorsOpen_~retValue_acc~12 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~12; 1020727#L1431-1 __utac_acc__Specification9_spec__3_#t~ret57 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~4 := __utac_acc__Specification9_spec__3_#t~ret57;havoc __utac_acc__Specification9_spec__3_#t~ret57; 1020717#L933-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___0~4); 1020716#L933-3 cleanup_~i~2 := 1 + cleanup_~i~2; 1020715#L283-2 assume !false; 1020714#L284 cleanup_~__cil_tmp4~0 := ~cleanupTimeShifts~0 - 1; 977330#L287 [2018-11-23 06:07:58,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:07:58,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1589466542, now seen corresponding path program 2 times [2018-11-23 06:07:58,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:07:58,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:07:58,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:07:58,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:07:58,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:07:58,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:07:59,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:07:59,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:07:59,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 06:07:59,029 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 06:07:59,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:07:59,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1995353646, now seen corresponding path program 1 times [2018-11-23 06:07:59,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:07:59,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:07:59,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:07:59,030 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:07:59,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:07:59,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:07:59,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:07:59,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:07:59,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-23 06:07:59,135 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 06:07:59,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 06:07:59,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-11-23 06:07:59,136 INFO L87 Difference]: Start difference. First operand 86359 states and 158777 transitions. cyclomatic complexity: 72461 Second operand 14 states. [2018-11-23 06:08:04,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:08:04,709 INFO L93 Difference]: Finished difference Result 603092 states and 1105870 transitions. [2018-11-23 06:08:04,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-11-23 06:08:04,710 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 603092 states and 1105870 transitions. [2018-11-23 06:08:09,903 INFO L131 ngComponentsAnalysis]: Automaton has 49 accepting balls. 278950 [2018-11-23 06:08:11,068 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 603092 states to 603014 states and 1105564 transitions. [2018-11-23 06:08:11,068 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 325573 [2018-11-23 06:08:11,219 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 325573 [2018-11-23 06:08:11,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 603014 states and 1105564 transitions. [2018-11-23 06:08:11,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:08:11,219 INFO L705 BuchiCegarLoop]: Abstraction has 603014 states and 1105564 transitions. [2018-11-23 06:08:11,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603014 states and 1105564 transitions. [2018-11-23 06:08:13,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603014 to 130843. [2018-11-23 06:08:13,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130843 states. [2018-11-23 06:08:14,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130843 states to 130843 states and 240112 transitions. [2018-11-23 06:08:14,003 INFO L728 BuchiCegarLoop]: Abstraction has 130843 states and 240112 transitions. [2018-11-23 06:08:14,003 INFO L608 BuchiCegarLoop]: Abstraction has 130843 states and 240112 transitions. [2018-11-23 06:08:14,003 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-23 06:08:14,003 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 130843 states and 240112 transitions. [2018-11-23 06:08:14,199 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 53081 [2018-11-23 06:08:14,199 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:08:14,199 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:08:14,200 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:08:14,200 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:08:14,200 INFO L794 eck$LassoCheckResult]: Stem: 1638470#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call #t~string38.base, #t~string38.offset := #Ultimate.alloc(30);call #t~string39.base, #t~string39.offset := #Ultimate.alloc(9);call #t~string40.base, #t~string40.offset := #Ultimate.alloc(21);call #t~string41.base, #t~string41.offset := #Ultimate.alloc(30);call #t~string42.base, #t~string42.offset := #Ultimate.alloc(9);call #t~string43.base, #t~string43.offset := #Ultimate.alloc(21);call #t~string47.base, #t~string47.offset := #Ultimate.alloc(30);call #t~string48.base, #t~string48.offset := #Ultimate.alloc(9);call #t~string49.base, #t~string49.offset := #Ultimate.alloc(25);call #t~string50.base, #t~string50.offset := #Ultimate.alloc(30);call #t~string51.base, #t~string51.offset := #Ultimate.alloc(9);call #t~string52.base, #t~string52.offset := #Ultimate.alloc(25);call #t~string110.base, #t~string110.offset := #Ultimate.alloc(10);call #t~string112.base, #t~string112.offset := #Ultimate.alloc(4);call write~init~int(91, #t~string112.base, #t~string112.offset, 1);call write~init~int(95, #t~string112.base, 1 + #t~string112.offset, 1);call write~init~int(93, #t~string112.base, 2 + #t~string112.offset, 1);call write~init~int(0, #t~string112.base, 3 + #t~string112.offset, 1);call #t~string114.base, #t~string114.offset := #Ultimate.alloc(4);call write~init~int(91, #t~string114.base, #t~string114.offset, 1);call write~init~int(93, #t~string114.base, 1 + #t~string114.offset, 1);call write~init~int(32, #t~string114.base, 2 + #t~string114.offset, 1);call write~init~int(0, #t~string114.base, 3 + #t~string114.offset, 1);call #t~string116.base, #t~string116.offset := #Ultimate.alloc(5);call write~init~int(32, #t~string116.base, #t~string116.offset, 1);call write~init~int(97, #t~string116.base, 1 + #t~string116.offset, 1);call write~init~int(116, #t~string116.base, 2 + #t~string116.offset, 1);call write~init~int(32, #t~string116.base, 3 + #t~string116.offset, 1);call write~init~int(0, #t~string116.base, 4 + #t~string116.offset, 1);call #t~string118.base, #t~string118.offset := #Ultimate.alloc(3);call write~init~int(37, #t~string118.base, #t~string118.offset, 1);call write~init~int(105, #t~string118.base, 1 + #t~string118.offset, 1);call write~init~int(0, #t~string118.base, 2 + #t~string118.offset, 1);call #t~string120.base, #t~string120.offset := #Ultimate.alloc(10);call #t~string122.base, #t~string122.offset := #Ultimate.alloc(3);call write~init~int(117, #t~string122.base, #t~string122.offset, 1);call write~init~int(112, #t~string122.base, 1 + #t~string122.offset, 1);call write~init~int(0, #t~string122.base, 2 + #t~string122.offset, 1);call #t~string124.base, #t~string124.offset := #Ultimate.alloc(5);call write~init~int(100, #t~string124.base, #t~string124.offset, 1);call write~init~int(111, #t~string124.base, 1 + #t~string124.offset, 1);call write~init~int(119, #t~string124.base, 2 + #t~string124.offset, 1);call write~init~int(110, #t~string124.base, 3 + #t~string124.offset, 1);call write~init~int(0, #t~string124.base, 4 + #t~string124.offset, 1);call #t~string126.base, #t~string126.offset := #Ultimate.alloc(7);call write~init~int(32, #t~string126.base, #t~string126.offset, 1);call write~init~int(73, #t~string126.base, 1 + #t~string126.offset, 1);call write~init~int(76, #t~string126.base, 2 + #t~string126.offset, 1);call write~init~int(95, #t~string126.base, 3 + #t~string126.offset, 1);call write~init~int(112, #t~string126.base, 4 + #t~string126.offset, 1);call write~init~int(58, #t~string126.base, 5 + #t~string126.offset, 1);call write~init~int(0, #t~string126.base, 6 + #t~string126.offset, 1);call #t~string128.base, #t~string128.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string128.base, #t~string128.offset, 1);call write~init~int(37, #t~string128.base, 1 + #t~string128.offset, 1);call write~init~int(105, #t~string128.base, 2 + #t~string128.offset, 1);call write~init~int(0, #t~string128.base, 3 + #t~string128.offset, 1);call #t~string130.base, #t~string130.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string130.base, #t~string130.offset, 1);call write~init~int(37, #t~string130.base, 1 + #t~string130.offset, 1);call write~init~int(105, #t~string130.base, 2 + #t~string130.offset, 1);call write~init~int(0, #t~string130.base, 3 + #t~string130.offset, 1);call #t~string132.base, #t~string132.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string132.base, #t~string132.offset, 1);call write~init~int(37, #t~string132.base, 1 + #t~string132.offset, 1);call write~init~int(105, #t~string132.base, 2 + #t~string132.offset, 1);call write~init~int(0, #t~string132.base, 3 + #t~string132.offset, 1);call #t~string134.base, #t~string134.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string134.base, #t~string134.offset, 1);call write~init~int(37, #t~string134.base, 1 + #t~string134.offset, 1);call write~init~int(105, #t~string134.base, 2 + #t~string134.offset, 1);call write~init~int(0, #t~string134.base, 3 + #t~string134.offset, 1);call #t~string136.base, #t~string136.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string136.base, #t~string136.offset, 1);call write~init~int(37, #t~string136.base, 1 + #t~string136.offset, 1);call write~init~int(105, #t~string136.base, 2 + #t~string136.offset, 1);call write~init~int(0, #t~string136.base, 3 + #t~string136.offset, 1);call #t~string138.base, #t~string138.offset := #Ultimate.alloc(6);call write~init~int(32, #t~string138.base, #t~string138.offset, 1);call write~init~int(70, #t~string138.base, 1 + #t~string138.offset, 1);call write~init~int(95, #t~string138.base, 2 + #t~string138.offset, 1);call write~init~int(112, #t~string138.base, 3 + #t~string138.offset, 1);call write~init~int(58, #t~string138.base, 4 + #t~string138.offset, 1);call write~init~int(0, #t~string138.base, 5 + #t~string138.offset, 1);call #t~string141.base, #t~string141.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string141.base, #t~string141.offset, 1);call write~init~int(37, #t~string141.base, 1 + #t~string141.offset, 1);call write~init~int(105, #t~string141.base, 2 + #t~string141.offset, 1);call write~init~int(0, #t~string141.base, 3 + #t~string141.offset, 1);call #t~string144.base, #t~string144.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string144.base, #t~string144.offset, 1);call write~init~int(37, #t~string144.base, 1 + #t~string144.offset, 1);call write~init~int(105, #t~string144.base, 2 + #t~string144.offset, 1);call write~init~int(0, #t~string144.base, 3 + #t~string144.offset, 1);call #t~string147.base, #t~string147.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string147.base, #t~string147.offset, 1);call write~init~int(37, #t~string147.base, 1 + #t~string147.offset, 1);call write~init~int(105, #t~string147.base, 2 + #t~string147.offset, 1);call write~init~int(0, #t~string147.base, 3 + #t~string147.offset, 1);call #t~string150.base, #t~string150.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string150.base, #t~string150.offset, 1);call write~init~int(37, #t~string150.base, 1 + #t~string150.offset, 1);call write~init~int(105, #t~string150.base, 2 + #t~string150.offset, 1);call write~init~int(0, #t~string150.base, 3 + #t~string150.offset, 1);call #t~string153.base, #t~string153.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string153.base, #t~string153.offset, 1);call write~init~int(37, #t~string153.base, 1 + #t~string153.offset, 1);call write~init~int(105, #t~string153.base, 2 + #t~string153.offset, 1);call write~init~int(0, #t~string153.base, 3 + #t~string153.offset, 1);call #t~string155.base, #t~string155.offset := #Ultimate.alloc(2);call write~init~int(10, #t~string155.base, #t~string155.offset, 1);call write~init~int(0, #t~string155.base, 1 + #t~string155.offset, 1);~executiveFloor~0 := 4;~cleanupTimeShifts~0 := 12;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0;~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; 1638471#L-1 havoc main_#res;havoc main_#t~ret19, main_~retValue_acc~1, main_~tmp~10;havoc main_~retValue_acc~1;havoc main_~tmp~10; 1639438#L1047 havoc valid_product_#res;havoc valid_product_~retValue_acc~6;havoc valid_product_~retValue_acc~6;valid_product_~retValue_acc~6 := 1;valid_product_#res := valid_product_~retValue_acc~6; 1639439#L1055 main_#t~ret19 := valid_product_#res;main_~tmp~10 := main_#t~ret19;havoc main_#t~ret19; 1640896#L482 assume 0 != main_~tmp~10; 1641144#L451 ~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 1641084#L880 havoc bigMacCall_#t~ret12, bigMacCall_~tmp~7;havoc bigMacCall_~tmp~7;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~8;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~8; 1640231#L1105 assume !(0 == getOrigin_~person); 1640232#L1109 assume !(1 == getOrigin_~person); 1641477#L1113 assume !(2 == getOrigin_~person); 1641356#L1117 assume !(3 == getOrigin_~person); 1638418#L1121 assume !(4 == getOrigin_~person); 1638344#L1125 assume 5 == getOrigin_~person;getOrigin_~retValue_acc~8 := 1;getOrigin_#res := getOrigin_~retValue_acc~8; 1638345#L1130 bigMacCall_#t~ret12 := getOrigin_#res;bigMacCall_~tmp~7 := bigMacCall_#t~ret12;havoc bigMacCall_#t~ret12;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~7;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 1639440#L3073 assume !(0 == initPersonOnFloor_~floor); 1638609#L3100 assume 1 == initPersonOnFloor_~floor; 1638575#L3101 assume 0 == initPersonOnFloor_~person;~personOnFloor_0_1~0 := 1; 1637792#L3181-1 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 1640790#L2865 assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 1640791#L2877-2 havoc cleanup_#t~ret13, cleanup_#t~ret14, cleanup_~i~2, cleanup_~tmp~8, cleanup_~tmp___0~2, cleanup_~__cil_tmp4~0;havoc cleanup_~i~2;havoc cleanup_~tmp~8;havoc cleanup_~tmp___0~2;havoc cleanup_~__cil_tmp4~0;havoc timeShift_#t~ret99, timeShift_#t~ret100, timeShift_#t~ret101, timeShift_#t~ret102, timeShift_#t~ret103, timeShift_#t~ret104, timeShift_#t~ret105, timeShift_#t~ret106, timeShift_#t~ret107, timeShift_#t~ret108, timeShift_#t~ret109, timeShift_~tmp~24, timeShift_~tmp___0~11, timeShift_~tmp___1~7, 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~24;havoc timeShift_~tmp___0~11;havoc timeShift_~tmp___1~7;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~ret83, stopRequestedAtCurrentFloor_#t~ret84, stopRequestedAtCurrentFloor_#t~ret85, stopRequestedAtCurrentFloor_#t~ret86, stopRequestedAtCurrentFloor_~retValue_acc~22, stopRequestedAtCurrentFloor_~tmp~22, stopRequestedAtCurrentFloor_~tmp___0~9;havoc stopRequestedAtCurrentFloor_~retValue_acc~22;havoc stopRequestedAtCurrentFloor_~tmp~22;havoc stopRequestedAtCurrentFloor_~tmp___0~9;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret157, isExecutiveFloorCalling_~retValue_acc~25;havoc isExecutiveFloorCalling_~retValue_acc~25;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~27;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~27; 1641306#L2802 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~27 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~27; 1641879#L2829 isExecutiveFloorCalling_#t~ret157 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~25 := isExecutiveFloorCalling_#t~ret157;havoc isExecutiveFloorCalling_#t~ret157;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~25; 1638655#L2706 stopRequestedAtCurrentFloor_#t~ret83 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~22 := stopRequestedAtCurrentFloor_#t~ret83;havoc stopRequestedAtCurrentFloor_#t~ret83; 1638656#L2091 assume 0 != stopRequestedAtCurrentFloor_~tmp~22;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~11;havoc getCurrentFloorID_~retValue_acc~11;getCurrentFloorID_~retValue_acc~11 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~11; 1641390#L1422 stopRequestedAtCurrentFloor_#t~ret84 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~9 := stopRequestedAtCurrentFloor_#t~ret84;havoc stopRequestedAtCurrentFloor_#t~ret84; 1641391#L2095 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~9);stopRequestedAtCurrentFloor_~retValue_acc~22 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~22; 1642141#L2108 timeShift_#t~ret99 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret99;havoc timeShift_#t~ret99; 1642475#L2243 assume !(0 != timeShift_~tmp___9~2); 1642474#L2334 assume !(1 == ~doorState~0); 1642473#L2334-2 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret77, stopRequestedInDirection_#t~ret78, stopRequestedInDirection_#t~ret79, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~19, stopRequestedInDirection_~tmp~19, stopRequestedInDirection_~tmp___0~7, 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~19;havoc stopRequestedInDirection_~tmp~19;havoc stopRequestedInDirection_~tmp___0~7;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret157, isExecutiveFloorCalling_~retValue_acc~25;havoc isExecutiveFloorCalling_~retValue_acc~25;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~27;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~27; 1642472#L2802-3 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~27 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~27; 1642471#L2829-3 isExecutiveFloorCalling_#t~ret157 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~25 := isExecutiveFloorCalling_#t~ret157;havoc isExecutiveFloorCalling_#t~ret157;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~25; 1642470#L2706-1 stopRequestedInDirection_#t~ret77 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~7 := stopRequestedInDirection_#t~ret77;havoc stopRequestedInDirection_#t~ret77; 1639477#L1974 assume 0 != stopRequestedInDirection_~tmp___0~7;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~11;havoc getCurrentFloorID_~retValue_acc~11;getCurrentFloorID_~retValue_acc~11 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~11; 1639478#L1422-1 stopRequestedInDirection_#t~ret78 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~19 := stopRequestedInDirection_#t~ret78;havoc stopRequestedInDirection_#t~ret78;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~19 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~19 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~19; 1640500#L1987 timeShift_#t~ret106 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret106;havoc timeShift_#t~ret106; 1640501#L2342 assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret80, continueInDirection_~dir, continueInDirection_~tmp~20;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~20;~currentHeading~0 := continueInDirection_~dir; 1642448#L2031 assume !(1 == ~currentHeading~0); 1642450#L2041 assume !(0 == ~currentFloorID~0); 1661963#L2041-2 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 1661956#L2047-5 havoc __utac_acc__Specification9_spec__3_#t~ret55, __utac_acc__Specification9_spec__3_#t~ret56, __utac_acc__Specification9_spec__3_#t~ret57, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~14, __utac_acc__Specification9_spec__3_~tmp___0~4, __utac_acc__Specification9_spec__3_~tmp___1~3;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~14;havoc __utac_acc__Specification9_spec__3_~tmp___0~4;havoc __utac_acc__Specification9_spec__3_~tmp___1~3;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~11;havoc getCurrentFloorID_~retValue_acc~11;getCurrentFloorID_~retValue_acc~11 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~11; 1661955#L1422-3 __utac_acc__Specification9_spec__3_#t~ret55 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~14 := __utac_acc__Specification9_spec__3_#t~ret55;havoc __utac_acc__Specification9_spec__3_#t~ret55;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~14;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~15;havoc isEmpty_~retValue_acc~15; 1661954#L1482-6 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~15 := 0;isEmpty_#res := isEmpty_~retValue_acc~15; 1661949#L1514-6 __utac_acc__Specification9_spec__3_#t~ret56 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~3 := __utac_acc__Specification9_spec__3_#t~ret56;havoc __utac_acc__Specification9_spec__3_#t~ret56; 1661947#L923 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~3);havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~12;havoc areDoorsOpen_~retValue_acc~12;areDoorsOpen_~retValue_acc~12 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~12; 1661943#L1431 __utac_acc__Specification9_spec__3_#t~ret57 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~4 := __utac_acc__Specification9_spec__3_#t~ret57;havoc __utac_acc__Specification9_spec__3_#t~ret57; 1661933#L933 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___0~4); 1641976#L933-1 cleanup_~i~2 := 0; 1641977#L283-2 assume !false; 1694371#L284 cleanup_~__cil_tmp4~0 := ~cleanupTimeShifts~0 - 1; 1694372#L287 [2018-11-23 06:08:14,201 INFO L796 eck$LassoCheckResult]: Loop: 1694372#L287 assume cleanup_~i~2 < cleanup_~__cil_tmp4~0;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~10;havoc isBlocked_~retValue_acc~10;isBlocked_~retValue_acc~10 := 0;isBlocked_#res := isBlocked_~retValue_acc~10; 1767337#L1269 cleanup_#t~ret13 := isBlocked_#res;cleanup_~tmp___0~2 := cleanup_#t~ret13;havoc cleanup_#t~ret13; 1767336#L291 assume 1 != cleanup_~tmp___0~2; 1767335#L291-1 havoc isIdle_#res;havoc isIdle_#t~ret65, isIdle_~retValue_acc~17, isIdle_~tmp~17;havoc isIdle_~retValue_acc~17;havoc isIdle_~tmp~17;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret60, anyStopRequested_#t~ret61, anyStopRequested_#t~ret62, anyStopRequested_#t~ret63, anyStopRequested_#t~ret64, anyStopRequested_~retValue_acc~16, anyStopRequested_~tmp~16, anyStopRequested_~tmp___0~5, anyStopRequested_~tmp___1~4, anyStopRequested_~tmp___2~1, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~16;havoc anyStopRequested_~tmp~16;havoc anyStopRequested_~tmp___0~5;havoc anyStopRequested_~tmp___1~4;havoc anyStopRequested_~tmp___2~1;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~27;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~27; 1767334#L2802-25 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~27 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~27; 1767333#L2829-25 anyStopRequested_#t~ret60 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret60;havoc anyStopRequested_#t~ret60; 1767332#L1530 assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~16 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~16; 1712721#L1594 isIdle_#t~ret65 := anyStopRequested_#res;isIdle_~tmp~17 := isIdle_#t~ret65;havoc isIdle_#t~ret65;isIdle_~retValue_acc~17 := (if 0 == isIdle_~tmp~17 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~17; 1767256#L1607 cleanup_#t~ret14 := isIdle_#res;cleanup_~tmp~8 := cleanup_#t~ret14;havoc cleanup_#t~ret14; 1766941#L303 assume !(0 != cleanup_~tmp~8);havoc timeShift_#t~ret99, timeShift_#t~ret100, timeShift_#t~ret101, timeShift_#t~ret102, timeShift_#t~ret103, timeShift_#t~ret104, timeShift_#t~ret105, timeShift_#t~ret106, timeShift_#t~ret107, timeShift_#t~ret108, timeShift_#t~ret109, timeShift_~tmp~24, timeShift_~tmp___0~11, timeShift_~tmp___1~7, 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~24;havoc timeShift_~tmp___0~11;havoc timeShift_~tmp___1~7;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~ret83, stopRequestedAtCurrentFloor_#t~ret84, stopRequestedAtCurrentFloor_#t~ret85, stopRequestedAtCurrentFloor_#t~ret86, stopRequestedAtCurrentFloor_~retValue_acc~22, stopRequestedAtCurrentFloor_~tmp~22, stopRequestedAtCurrentFloor_~tmp___0~9;havoc stopRequestedAtCurrentFloor_~retValue_acc~22;havoc stopRequestedAtCurrentFloor_~tmp~22;havoc stopRequestedAtCurrentFloor_~tmp___0~9;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret157, isExecutiveFloorCalling_~retValue_acc~25;havoc isExecutiveFloorCalling_~retValue_acc~25;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~27;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~27; 1741054#L2802-30 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~27 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~27; 1697832#L2829-30 isExecutiveFloorCalling_#t~ret157 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~25 := isExecutiveFloorCalling_#t~ret157;havoc isExecutiveFloorCalling_#t~ret157;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~25; 1741049#L2706-3 stopRequestedAtCurrentFloor_#t~ret83 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~22 := stopRequestedAtCurrentFloor_#t~ret83;havoc stopRequestedAtCurrentFloor_#t~ret83; 1741050#L2091-1 assume 0 != stopRequestedAtCurrentFloor_~tmp~22;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~11;havoc getCurrentFloorID_~retValue_acc~11;getCurrentFloorID_~retValue_acc~11 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~11; 1741051#L1422-4 stopRequestedAtCurrentFloor_#t~ret84 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~9 := stopRequestedAtCurrentFloor_#t~ret84;havoc stopRequestedAtCurrentFloor_#t~ret84; 1741052#L2095-1 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~9);stopRequestedAtCurrentFloor_~retValue_acc~22 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~22; 1712777#L2108-1 timeShift_#t~ret99 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret99;havoc timeShift_#t~ret99; 1712778#L2243-1 assume !(0 != timeShift_~tmp___9~2); 1766901#L2334-3 assume !(1 == ~doorState~0); 1766552#L2334-5 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret77, stopRequestedInDirection_#t~ret78, stopRequestedInDirection_#t~ret79, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~19, stopRequestedInDirection_~tmp~19, stopRequestedInDirection_~tmp___0~7, 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~19;havoc stopRequestedInDirection_~tmp~19;havoc stopRequestedInDirection_~tmp___0~7;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret157, isExecutiveFloorCalling_~retValue_acc~25;havoc isExecutiveFloorCalling_~retValue_acc~25;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~27;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~27; 1697696#L2802-33 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~27 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~27; 1766551#L2829-33 isExecutiveFloorCalling_#t~ret157 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~25 := isExecutiveFloorCalling_#t~ret157;havoc isExecutiveFloorCalling_#t~ret157;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~25; 1766549#L2706-4 stopRequestedInDirection_#t~ret77 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~7 := stopRequestedInDirection_#t~ret77;havoc stopRequestedInDirection_#t~ret77; 1766545#L1974-2 assume 0 != stopRequestedInDirection_~tmp___0~7;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~11;havoc getCurrentFloorID_~retValue_acc~11;getCurrentFloorID_~retValue_acc~11 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~11; 1766544#L1422-5 stopRequestedInDirection_#t~ret78 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~19 := stopRequestedInDirection_#t~ret78;havoc stopRequestedInDirection_#t~ret78;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~19 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~19 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~19; 1766542#L1987-2 timeShift_#t~ret106 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret106;havoc timeShift_#t~ret106; 1766530#L2342-1 assume !(0 != timeShift_~tmp___8~2);getReverseHeading_#in~ofHeading := ~currentHeading~0;havoc getReverseHeading_#res;havoc getReverseHeading_~ofHeading, getReverseHeading_~retValue_acc~23;getReverseHeading_~ofHeading := getReverseHeading_#in~ofHeading;havoc getReverseHeading_~retValue_acc~23; 1738286#L2117-2 assume !(0 == getReverseHeading_~ofHeading);getReverseHeading_~retValue_acc~23 := 0;getReverseHeading_#res := getReverseHeading_~retValue_acc~23; 1738288#L2122-2 timeShift_#t~ret107 := getReverseHeading_#res;timeShift_~tmp___6~2 := timeShift_#t~ret107;havoc timeShift_#t~ret107;stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := timeShift_~tmp___6~2, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret77, stopRequestedInDirection_#t~ret78, stopRequestedInDirection_#t~ret79, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~19, stopRequestedInDirection_~tmp~19, stopRequestedInDirection_~tmp___0~7, 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~19;havoc stopRequestedInDirection_~tmp~19;havoc stopRequestedInDirection_~tmp___0~7;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret157, isExecutiveFloorCalling_~retValue_acc~25;havoc isExecutiveFloorCalling_~retValue_acc~25;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~27;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~27; 1767331#L2802-44 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~27 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~27; 1709980#L2829-44 isExecutiveFloorCalling_#t~ret157 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~25 := isExecutiveFloorCalling_#t~ret157;havoc isExecutiveFloorCalling_#t~ret157;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~25; 1767520#L2706-5 stopRequestedInDirection_#t~ret77 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~7 := stopRequestedInDirection_#t~ret77;havoc stopRequestedInDirection_#t~ret77; 1767489#L1974-3 assume 0 != stopRequestedInDirection_~tmp___0~7;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~11;havoc getCurrentFloorID_~retValue_acc~11;getCurrentFloorID_~retValue_acc~11 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~11; 1767459#L1422-6 stopRequestedInDirection_#t~ret78 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~19 := stopRequestedInDirection_#t~ret78;havoc stopRequestedInDirection_#t~ret78;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~19 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~19 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~19; 1767458#L1987-3 timeShift_#t~ret108 := stopRequestedInDirection_#res;timeShift_~tmp___7~2 := timeShift_#t~ret108;havoc timeShift_#t~ret108; 1767455#L2351-1 assume !(0 != timeShift_~tmp___7~2);continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret80, continueInDirection_~dir, continueInDirection_~tmp~20;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~20;~currentHeading~0 := continueInDirection_~dir; 1767456#L2031-5 assume !(1 == ~currentHeading~0); 1767303#L2041-15 assume !(0 == ~currentFloorID~0); 1767295#L2041-17 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 1767707#L2047-11 havoc __utac_acc__Specification9_spec__3_#t~ret55, __utac_acc__Specification9_spec__3_#t~ret56, __utac_acc__Specification9_spec__3_#t~ret57, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~14, __utac_acc__Specification9_spec__3_~tmp___0~4, __utac_acc__Specification9_spec__3_~tmp___1~3;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~14;havoc __utac_acc__Specification9_spec__3_~tmp___0~4;havoc __utac_acc__Specification9_spec__3_~tmp___1~3;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~11;havoc getCurrentFloorID_~retValue_acc~11;getCurrentFloorID_~retValue_acc~11 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~11; 1767706#L1422-7 __utac_acc__Specification9_spec__3_#t~ret55 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~14 := __utac_acc__Specification9_spec__3_#t~ret55;havoc __utac_acc__Specification9_spec__3_#t~ret55;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~14;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~15;havoc isEmpty_~retValue_acc~15; 1767705#L1482-13 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~15 := 0;isEmpty_#res := isEmpty_~retValue_acc~15; 1767699#L1514-13 __utac_acc__Specification9_spec__3_#t~ret56 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~3 := __utac_acc__Specification9_spec__3_#t~ret56;havoc __utac_acc__Specification9_spec__3_#t~ret56; 1767702#L923-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~3);havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~12;havoc areDoorsOpen_~retValue_acc~12;areDoorsOpen_~retValue_acc~12 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~12; 1767694#L1431-1 __utac_acc__Specification9_spec__3_#t~ret57 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~4 := __utac_acc__Specification9_spec__3_#t~ret57;havoc __utac_acc__Specification9_spec__3_#t~ret57; 1767684#L933-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___0~4); 1767683#L933-3 cleanup_~i~2 := 1 + cleanup_~i~2; 1767682#L283-2 assume !false; 1767681#L284 cleanup_~__cil_tmp4~0 := ~cleanupTimeShifts~0 - 1; 1694372#L287 [2018-11-23 06:08:14,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:08:14,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1589466542, now seen corresponding path program 3 times [2018-11-23 06:08:14,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:08:14,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:08:14,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:08:14,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:08:14,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:08:14,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:08:14,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:08:14,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:08:14,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 06:08:14,260 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 06:08:14,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:08:14,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1776498928, now seen corresponding path program 1 times [2018-11-23 06:08:14,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:08:14,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:08:14,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:08:14,261 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:08:14,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:08:14,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:08:14,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:08:14,842 WARN L180 SmtUtils]: Spent 556.00 ms on a formula simplification. DAG size of input: 242 DAG size of output: 221 [2018-11-23 06:08:14,843 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-11-23 06:08:15,740 WARN L180 SmtUtils]: Spent 723.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 139 [2018-11-23 06:08:15,741 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:08:15,741 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:08:15,741 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:08:15,741 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:08:15,741 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 06:08:15,741 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:08:15,742 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:08:15,742 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:08:15,742 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec9_product11_true-unreach-call_true-termination.cil.c_Iteration8_Loop [2018-11-23 06:08:15,742 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:08:15,742 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:08:15,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:15,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:15,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:15,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:15,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:15,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:15,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:15,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:15,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:15,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:15,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:15,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:15,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:15,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:15,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:15,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:15,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:15,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:15,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:15,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:15,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:15,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:15,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:15,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:15,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:15,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:15,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:15,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:15,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:15,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:15,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:15,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:15,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:15,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:15,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:15,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:15,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:15,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:15,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:15,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:15,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:15,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:15,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:15,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:15,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:15,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:15,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:15,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:15,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:15,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:15,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:15,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:15,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:15,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:15,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:15,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:15,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:15,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:15,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:15,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:15,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:15,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:16,197 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:08:16,198 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9d21fcf5-a9e3-43c5-81c8-46221854755b/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:08:16,201 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:08:16,202 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:08:16,205 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 06:08:16,205 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stopRequestedInDirection_#in~dir=0, ULTIMATE.start_stopRequestedInDirection_~dir=0, ULTIMATE.start_getReverseHeading_~retValue_acc~23=0, ULTIMATE.start_timeShift_~tmp___6~2=0, ULTIMATE.start_getReverseHeading_#res=0} Honda state: {ULTIMATE.start_stopRequestedInDirection_#in~dir=0, ULTIMATE.start_stopRequestedInDirection_~dir=0, ULTIMATE.start_getReverseHeading_~retValue_acc~23=0, ULTIMATE.start_timeShift_~tmp___6~2=0, ULTIMATE.start_getReverseHeading_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9d21fcf5-a9e3-43c5-81c8-46221854755b/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:08:16,221 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:08:16,221 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:08:16,223 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 06:08:16,223 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_#t~ret107=0} Honda state: {ULTIMATE.start_timeShift_#t~ret107=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9d21fcf5-a9e3-43c5-81c8-46221854755b/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:08:16,238 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:08:16,238 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:08:16,240 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 06:08:16,240 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_isIdle_#t~ret65=0} Honda state: {ULTIMATE.start_isIdle_#t~ret65=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9d21fcf5-a9e3-43c5-81c8-46221854755b/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:08:16,257 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:08:16,257 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:08:16,259 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 06:08:16,259 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_~tmp~16=0} Honda state: {ULTIMATE.start_anyStopRequested_~tmp~16=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9d21fcf5-a9e3-43c5-81c8-46221854755b/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:08:16,275 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:08:16,275 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:08:16,276 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 06:08:16,277 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_#t~ret103=0} Honda state: {ULTIMATE.start_timeShift_#t~ret103=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9d21fcf5-a9e3-43c5-81c8-46221854755b/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:08:16,293 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:08:16,293 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:08:16,295 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 06:08:16,296 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_~tmp___0~11=0} Honda state: {ULTIMATE.start_timeShift_~tmp___0~11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9d21fcf5-a9e3-43c5-81c8-46221854755b/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:08:16,765 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:08:16,765 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:08:16,767 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 06:08:16,767 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stopRequestedAtCurrentFloor_#t~ret83=0} Honda state: {ULTIMATE.start_stopRequestedAtCurrentFloor_#t~ret83=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9d21fcf5-a9e3-43c5-81c8-46221854755b/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:08:16,782 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:08:16,782 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:08:16,785 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 06:08:16,785 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_#t~ret99=0} Honda state: {ULTIMATE.start_timeShift_#t~ret99=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9d21fcf5-a9e3-43c5-81c8-46221854755b/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:08:16,801 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:08:16,801 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:08:16,804 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 06:08:16,804 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stopRequestedInDirection_~respectInLiftCalls=1, ULTIMATE.start_stopRequestedInDirection_#in~respectInLiftCalls=1} Honda state: {ULTIMATE.start_stopRequestedInDirection_~respectInLiftCalls=1, ULTIMATE.start_stopRequestedInDirection_#in~respectInLiftCalls=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9d21fcf5-a9e3-43c5-81c8-46221854755b/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:08:16,820 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:08:16,820 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:08:16,826 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 06:08:16,826 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_continueInDirection_#in~dir=-8, ULTIMATE.start_continueInDirection_~dir=-8, ULTIMATE.start_getReverseHeading_~ofHeading=-8, ~currentHeading~0=-8, ULTIMATE.start_getReverseHeading_#in~ofHeading=-8} Honda state: {ULTIMATE.start_continueInDirection_#in~dir=-8, ULTIMATE.start_continueInDirection_~dir=-8, ULTIMATE.start_getReverseHeading_~ofHeading=-8, ~currentHeading~0=-8, ULTIMATE.start_getReverseHeading_#in~ofHeading=-8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9d21fcf5-a9e3-43c5-81c8-46221854755b/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:08:16,846 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:08:16,846 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:08:16,861 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 06:08:16,861 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_isExecutiveFloorCalling_#t~ret157=0} Honda state: {ULTIMATE.start_isExecutiveFloorCalling_#t~ret157=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9d21fcf5-a9e3-43c5-81c8-46221854755b/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:08:16,885 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:08:16,886 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:08:16,889 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 06:08:16,889 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_continueInDirection_#t~ret80=0} Honda state: {ULTIMATE.start_continueInDirection_#t~ret80=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9d21fcf5-a9e3-43c5-81c8-46221854755b/bin-2019/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:08:16,913 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:08:16,914 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:08:16,916 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 06:08:16,916 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification9_spec__3_#t~ret55=0} Honda state: {ULTIMATE.start___utac_acc__Specification9_spec__3_#t~ret55=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9d21fcf5-a9e3-43c5-81c8-46221854755b/bin-2019/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:08:16,934 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:08:16,934 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9d21fcf5-a9e3-43c5-81c8-46221854755b/bin-2019/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:08:16,952 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 06:08:16,952 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:08:19,313 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 06:08:19,314 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:08:19,314 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:08:19,314 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:08:19,314 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:08:19,315 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 06:08:19,315 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:08:19,315 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:08:19,315 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:08:19,315 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec9_product11_true-unreach-call_true-termination.cil.c_Iteration8_Loop [2018-11-23 06:08:19,315 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:08:19,315 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:08:19,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:19,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:19,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:19,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:19,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:19,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:19,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:19,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:19,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:19,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:19,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:19,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:19,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:19,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:19,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:19,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:19,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:19,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:19,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:19,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:19,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:19,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:19,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:19,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:19,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:19,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:19,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:19,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:19,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:19,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:19,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:19,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:19,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:19,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:19,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:19,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:19,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:19,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:19,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:19,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:19,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:19,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:19,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:19,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:19,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:19,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:19,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:19,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:19,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:19,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:19,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:19,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:19,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:19,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:19,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:19,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:19,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:19,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:19,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:19,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:19,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:19,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:08:19,756 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:08:19,756 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 06:08:19,756 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 [2018-11-23 06:08:19,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,757 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:19,757 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:19,757 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:19,757 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,758 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 [2018-11-23 06:08:19,758 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,758 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:19,759 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:19,759 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:19,759 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,759 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,760 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 [2018-11-23 06:08:19,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,760 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:19,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:19,760 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:19,760 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,761 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,761 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 [2018-11-23 06:08:19,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:19,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:19,762 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:19,762 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,762 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,763 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 [2018-11-23 06:08:19,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,763 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:19,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:19,763 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:19,763 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,764 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:08:19,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,765 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:19,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:19,765 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:19,765 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,766 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 [2018-11-23 06:08:19,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,766 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:19,766 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:19,767 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:19,767 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,768 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,768 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 [2018-11-23 06:08:19,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,768 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:19,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:19,769 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:19,769 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,769 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,770 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 [2018-11-23 06:08:19,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,770 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:19,770 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:19,770 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:19,770 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,771 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,771 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 [2018-11-23 06:08:19,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,771 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:19,772 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:19,772 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:19,772 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,772 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,773 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 [2018-11-23 06:08:19,773 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,773 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:19,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:19,773 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:19,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,774 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,774 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 [2018-11-23 06:08:19,774 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,774 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:19,775 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:19,775 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:19,775 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,777 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,777 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 [2018-11-23 06:08:19,777 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,777 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:19,778 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:19,778 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:19,778 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,779 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 [2018-11-23 06:08:19,779 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,780 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:19,780 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:19,780 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:19,780 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,781 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,784 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:08:19,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,785 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:19,785 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:19,785 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:19,786 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,786 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,786 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 [2018-11-23 06:08:19,787 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,787 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:19,787 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:19,787 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:19,787 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,788 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,788 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:08:19,788 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,788 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,788 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:19,788 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:19,789 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:19,789 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,789 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,789 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 [2018-11-23 06:08:19,790 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,790 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:19,790 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:19,790 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:19,790 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,791 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,792 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 [2018-11-23 06:08:19,792 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,792 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:19,792 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:19,793 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:19,793 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,793 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,793 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 [2018-11-23 06:08:19,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,794 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,794 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:19,794 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:19,794 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:19,794 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,795 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,795 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:08:19,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,796 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:19,796 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:19,796 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:19,796 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,797 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,798 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 [2018-11-23 06:08:19,798 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,798 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:19,798 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:19,798 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:19,798 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,799 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,799 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 [2018-11-23 06:08:19,799 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,800 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:19,800 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:19,800 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:19,800 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,801 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,801 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 [2018-11-23 06:08:19,801 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,801 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,801 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:19,802 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:19,802 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:19,802 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,806 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,806 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:08:19,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,806 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:19,807 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:19,807 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:19,807 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,808 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,808 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:08:19,808 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,808 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,808 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:19,809 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:19,809 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:19,809 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,809 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:08:19,810 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,810 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:19,810 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:19,810 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:19,810 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,811 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,811 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 [2018-11-23 06:08:19,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,812 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:19,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:19,812 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:19,812 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,812 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,813 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 [2018-11-23 06:08:19,813 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,813 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:19,813 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:19,814 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:19,814 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,814 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,814 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:08:19,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,815 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:19,815 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:19,815 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:19,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,816 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 [2018-11-23 06:08:19,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,816 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:19,816 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:19,817 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:19,817 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,818 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,818 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 [2018-11-23 06:08:19,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,819 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:19,819 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:19,819 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:19,819 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,820 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,820 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:08:19,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,820 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,820 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:19,820 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:19,821 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:19,821 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,821 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,822 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 [2018-11-23 06:08:19,822 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,822 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:19,822 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:19,822 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:19,822 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,823 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:08:19,823 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,823 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,824 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:08:19,824 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:19,825 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:08:19,825 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,829 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,829 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:08:19,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,830 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:19,830 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:19,830 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:19,830 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,831 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,831 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 [2018-11-23 06:08:19,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,831 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:19,832 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:19,832 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:19,832 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,832 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,833 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:08:19,833 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,833 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:19,833 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:19,834 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:19,834 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,834 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,834 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 [2018-11-23 06:08:19,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,835 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:19,835 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:19,835 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:19,835 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,836 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,836 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 [2018-11-23 06:08:19,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,837 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:19,837 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:19,837 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:19,837 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,838 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,838 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 [2018-11-23 06:08:19,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,838 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:19,839 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:19,839 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:19,839 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,840 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,840 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:08:19,840 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,840 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:19,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:19,841 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:19,841 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,842 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,842 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 [2018-11-23 06:08:19,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,842 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:19,842 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:19,843 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:19,843 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,844 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,844 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 [2018-11-23 06:08:19,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,844 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:19,845 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:19,845 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:19,845 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,846 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,846 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 [2018-11-23 06:08:19,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,846 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:19,846 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:19,847 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:19,847 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,848 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,848 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 [2018-11-23 06:08:19,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,848 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,849 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:08:19,849 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:19,849 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:08:19,849 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,854 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:08:19,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:19,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:19,855 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:19,855 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,856 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,856 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 [2018-11-23 06:08:19,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,856 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:19,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:19,857 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:19,857 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,858 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:08:19,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,858 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:19,858 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:19,859 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:19,859 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,859 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:08:19,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,860 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:19,860 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:19,860 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:19,860 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,861 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,861 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:08:19,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,862 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:19,862 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:19,862 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:19,862 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,863 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,863 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 [2018-11-23 06:08:19,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,863 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:19,864 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:19,864 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:19,864 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,864 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,865 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 [2018-11-23 06:08:19,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,865 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:19,865 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:19,866 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:19,866 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,867 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,867 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 [2018-11-23 06:08:19,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,867 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:19,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:19,868 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:19,868 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,869 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,869 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 [2018-11-23 06:08:19,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,869 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,869 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:19,869 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:19,870 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:19,870 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,871 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,871 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:08:19,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,871 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:19,872 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:19,872 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:19,872 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,873 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,873 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 [2018-11-23 06:08:19,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,873 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:19,873 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:19,874 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:19,874 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,874 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,875 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:08:19,875 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,875 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,875 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,875 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:19,875 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:19,875 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:19,876 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,876 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,876 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 [2018-11-23 06:08:19,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,877 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:19,877 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:19,877 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:19,877 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,878 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,878 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 [2018-11-23 06:08:19,878 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,878 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:19,879 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:19,879 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:19,879 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,880 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,880 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 [2018-11-23 06:08:19,880 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,880 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:19,881 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:19,881 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:19,881 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,882 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,882 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:08:19,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,882 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:19,883 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:08:19,883 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:08:19,883 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,883 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,883 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-23 06:08:19,884 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 [2018-11-23 06:08:19,884 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,884 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:19,885 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:08:19,885 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 06:08:19,885 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,885 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,886 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:08:19,886 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,886 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:19,914 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:08:19,914 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 06:08:19,914 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,915 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,915 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 [2018-11-23 06:08:19,916 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,916 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,916 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,916 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:19,916 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:08:19,916 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 06:08:19,916 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,917 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,917 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:08:19,917 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,917 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:19,918 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:08:19,918 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 06:08:19,918 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,919 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,919 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 [2018-11-23 06:08:19,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,919 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,920 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:19,920 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:08:19,920 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 06:08:19,920 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,948 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,949 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 [2018-11-23 06:08:19,949 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,949 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,949 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,949 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:19,949 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:08:19,950 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 06:08:19,950 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,950 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,951 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 [2018-11-23 06:08:19,951 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,951 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:19,951 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:08:19,952 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 06:08:19,952 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,953 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,954 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 [2018-11-23 06:08:19,954 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,954 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,954 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,954 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:19,954 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:08:19,955 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 06:08:19,955 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,955 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,956 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 [2018-11-23 06:08:19,981 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,981 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,981 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:19,981 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:08:19,982 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 06:08:19,982 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,982 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,983 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 [2018-11-23 06:08:19,983 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,983 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:19,983 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:08:19,983 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 06:08:19,984 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,984 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,984 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 [2018-11-23 06:08:19,985 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,985 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:19,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:19,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:19,985 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:08:19,985 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 06:08:19,985 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:19,986 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:08:19,986 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 [2018-11-23 06:08:19,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:08:19,986 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:08:20,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:08:20,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:08:20,028 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:08:20,028 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 06:08:20,028 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:08:20,031 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 06:08:20,035 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-23 06:08:20,035 INFO L444 ModelExtractionUtils]: 2 out of 9 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 06:08:20,036 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 06:08:20,036 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 06:08:20,037 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 06:08:20,038 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function 2-nested ranking function: f0 = 1*~cleanupTimeShifts~0 - 1*ULTIMATE.start_cleanup_~i~2 f1 = -1*ULTIMATE.start_cleanup_~i~2 + 1*ULTIMATE.start_cleanup_~__cil_tmp4~0 Supporting invariants [] [2018-11-23 06:08:20,038 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 06:08:20,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:08:20,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:08:20,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:08:20,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:08:20,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:08:20,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:08:20,332 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 [2018-11-23 06:08:20,332 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 130843 states and 240112 transitions. cyclomatic complexity: 109312 Second operand 4 states. [2018-11-23 06:08:21,099 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 130843 states and 240112 transitions. cyclomatic complexity: 109312. Second operand 4 states. Result 272022 states and 500735 transitions. Complement of second has 7 states. [2018-11-23 06:08:21,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 06:08:21,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 06:08:21,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4514 transitions. [2018-11-23 06:08:21,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 4514 transitions. Stem has 50 letters. Loop has 49 letters. [2018-11-23 06:08:21,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:08:21,102 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 06:08:21,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:08:21,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:08:21,172 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:08:21,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:08:21,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:08:21,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:08:21,288 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-23 06:08:21,288 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 130843 states and 240112 transitions. cyclomatic complexity: 109312 Second operand 4 states. [2018-11-23 06:08:22,002 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 130843 states and 240112 transitions. cyclomatic complexity: 109312. Second operand 4 states. Result 281596 states and 516652 transitions. Complement of second has 6 states. [2018-11-23 06:08:22,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 06:08:22,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 06:08:22,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4515 transitions. [2018-11-23 06:08:22,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 4515 transitions. Stem has 50 letters. Loop has 49 letters. [2018-11-23 06:08:22,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:08:22,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 4515 transitions. Stem has 99 letters. Loop has 49 letters. [2018-11-23 06:08:22,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:08:22,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 4515 transitions. Stem has 50 letters. Loop has 98 letters. [2018-11-23 06:08:22,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:08:22,006 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 281596 states and 516652 transitions. [2018-11-23 06:08:23,071 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 06:08:23,072 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 281596 states to 0 states and 0 transitions. [2018-11-23 06:08:23,072 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 06:08:23,072 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 06:08:23,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 06:08:23,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:08:23,072 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 06:08:23,072 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 06:08:23,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 06:08:23,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 06:08:23,073 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 4 states. [2018-11-23 06:08:23,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:08:23,073 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 06:08:23,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 06:08:23,073 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-23 06:08:23,073 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 06:08:23,073 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 06:08:23,073 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 06:08:23,073 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 06:08:23,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 06:08:23,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:08:23,073 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 06:08:23,073 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 06:08:23,073 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 06:08:23,073 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-23 06:08:23,073 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 06:08:23,074 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 06:08:23,074 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 06:08:23,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 06:08:23 BoogieIcfgContainer [2018-11-23 06:08:23,078 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 06:08:23,078 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 06:08:23,078 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 06:08:23,078 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 06:08:23,078 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:07:28" (3/4) ... [2018-11-23 06:08:23,081 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 06:08:23,081 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 06:08:23,081 INFO L168 Benchmark]: Toolchain (without parser) took 59097.86 ms. Allocated memory was 1.0 GB in the beginning and 6.0 GB in the end (delta: 5.0 GB). Free memory was 956.4 MB in the beginning and 3.6 GB in the end (delta: -2.7 GB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. [2018-11-23 06:08:23,082 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:08:23,082 INFO L168 Benchmark]: CACSL2BoogieTranslator took 588.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.4 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -179.5 MB). Peak memory consumption was 56.7 MB. Max. memory is 11.5 GB. [2018-11-23 06:08:23,083 INFO L168 Benchmark]: Boogie Procedure Inliner took 126.07 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: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2018-11-23 06:08:23,083 INFO L168 Benchmark]: Boogie Preprocessor took 110.19 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: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2018-11-23 06:08:23,084 INFO L168 Benchmark]: RCFGBuilder took 3423.91 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 66.6 MB). Free memory was 1.1 GB in the beginning and 968.2 MB in the end (delta: 119.4 MB). Peak memory consumption was 212.7 MB. Max. memory is 11.5 GB. [2018-11-23 06:08:23,084 INFO L168 Benchmark]: BuchiAutomizer took 54843.06 ms. Allocated memory was 1.3 GB in the beginning and 6.0 GB in the end (delta: 4.8 GB). Free memory was 968.2 MB in the beginning and 3.6 GB in the end (delta: -2.7 GB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. [2018-11-23 06:08:23,085 INFO L168 Benchmark]: Witness Printer took 2.80 ms. Allocated memory is still 6.0 GB. Free memory is still 3.6 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:08:23,089 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 588.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.4 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -179.5 MB). Peak memory consumption was 56.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 126.07 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: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 110.19 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: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3423.91 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 66.6 MB). Free memory was 1.1 GB in the beginning and 968.2 MB in the end (delta: 119.4 MB). Peak memory consumption was 212.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 54843.06 ms. Allocated memory was 1.3 GB in the beginning and 6.0 GB in the end (delta: 4.8 GB). Free memory was 968.2 MB in the beginning and 3.6 GB in the end (delta: -2.7 GB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. * Witness Printer took 2.80 ms. Allocated memory is still 6.0 GB. Free memory is still 3.6 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (8 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function doorState and consists of 3 locations. One deterministic module has affine ranking function currentFloorID and consists of 85 locations. One deterministic module has 2-nested ranking function (if cleanupTimeShifts + -1 * i > 0 then 1 else 0), (if cleanupTimeShifts + -1 * i > 0 then cleanupTimeShifts + -1 * i else -1 * i + __cil_tmp4) and consists of 4 locations. 8 modules have a trivial ranking function, the largest among these consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 54.8s and 9 iterations. TraceHistogramMax:1. Analysis of lassos took 11.5s. Construction of modules took 6.6s. Büchi inclusion checks took 16.6s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 7. Automata minimization 6.9s AutomataMinimizationTime, 9 MinimizatonAttempts, 1062771 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 11.9s Buchi closure took 0.3s. Biggest automaton had 130843 states and ocurred in iteration 7. Nontrivial modules had stage [2, 1, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 60308 SDtfs, 384179 SDslu, 213489 SDs, 0 SdLazy, 14047 SolverSat, 3104 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.6s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI5 SILT3 lasso0 LassoPreprocessingBenchmarks: Lassos: inital192 mio100 ax100 hnf99 lsp20 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq212 hnf88 smp93 dnf167 smp86 tf102 neg97 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 0 VariablesLoop: 8 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 20 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 3.7s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...