./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/product-lines/elevator_spec9_product30_false-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_eaa54a5e-2340-437a-a3ed-af79e41f8ee5/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_eaa54a5e-2340-437a-a3ed-af79e41f8ee5/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_eaa54a5e-2340-437a-a3ed-af79e41f8ee5/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_eaa54a5e-2340-437a-a3ed-af79e41f8ee5/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/product-lines/elevator_spec9_product30_false-unreach-call_true-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_eaa54a5e-2340-437a-a3ed-af79e41f8ee5/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_eaa54a5e-2340-437a-a3ed-af79e41f8ee5/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 8b0793fae3a16c39df4e1ecce9d338c866ff1e9f ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 13:46:42,864 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 13:46:42,865 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 13:46:42,872 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 13:46:42,873 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 13:46:42,873 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 13:46:42,874 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 13:46:42,875 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 13:46:42,876 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 13:46:42,876 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 13:46:42,877 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 13:46:42,877 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 13:46:42,878 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 13:46:42,878 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 13:46:42,879 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 13:46:42,880 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 13:46:42,880 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 13:46:42,881 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 13:46:42,883 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 13:46:42,883 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 13:46:42,884 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 13:46:42,885 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 13:46:42,886 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 13:46:42,887 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 13:46:42,887 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 13:46:42,887 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 13:46:42,888 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 13:46:42,888 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 13:46:42,889 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 13:46:42,890 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 13:46:42,890 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 13:46:42,890 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 13:46:42,891 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 13:46:42,891 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 13:46:42,891 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 13:46:42,892 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 13:46:42,892 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_eaa54a5e-2340-437a-a3ed-af79e41f8ee5/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 13:46:42,902 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 13:46:42,902 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 13:46:42,903 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 13:46:42,903 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 13:46:42,903 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 13:46:42,904 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 13:46:42,904 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 13:46:42,904 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 13:46:42,904 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 13:46:42,904 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 13:46:42,904 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 13:46:42,904 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 13:46:42,904 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 13:46:42,904 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 13:46:42,905 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 13:46:42,905 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 13:46:42,905 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 13:46:42,905 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 13:46:42,905 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 13:46:42,905 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 13:46:42,905 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 13:46:42,905 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 13:46:42,905 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 13:46:42,906 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 13:46:42,906 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 13:46:42,906 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 13:46:42,906 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 13:46:42,906 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 13:46:42,906 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 13:46:42,906 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 13:46:42,906 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 13:46:42,907 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 13:46:42,907 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_eaa54a5e-2340-437a-a3ed-af79e41f8ee5/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 -> 8b0793fae3a16c39df4e1ecce9d338c866ff1e9f [2018-11-18 13:46:42,927 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 13:46:42,935 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 13:46:42,937 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 13:46:42,937 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 13:46:42,938 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 13:46:42,938 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_eaa54a5e-2340-437a-a3ed-af79e41f8ee5/bin-2019/uautomizer/../../sv-benchmarks/c/product-lines/elevator_spec9_product30_false-unreach-call_true-termination.cil.c [2018-11-18 13:46:42,973 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_eaa54a5e-2340-437a-a3ed-af79e41f8ee5/bin-2019/uautomizer/data/aacb4d0a8/0f56431557b44acfa677e4b6766d5a1f/FLAGc0c60e797 [2018-11-18 13:46:43,350 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 13:46:43,351 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_eaa54a5e-2340-437a-a3ed-af79e41f8ee5/sv-benchmarks/c/product-lines/elevator_spec9_product30_false-unreach-call_true-termination.cil.c [2018-11-18 13:46:43,364 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_eaa54a5e-2340-437a-a3ed-af79e41f8ee5/bin-2019/uautomizer/data/aacb4d0a8/0f56431557b44acfa677e4b6766d5a1f/FLAGc0c60e797 [2018-11-18 13:46:43,373 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_eaa54a5e-2340-437a-a3ed-af79e41f8ee5/bin-2019/uautomizer/data/aacb4d0a8/0f56431557b44acfa677e4b6766d5a1f [2018-11-18 13:46:43,375 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 13:46:43,375 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 13:46:43,376 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 13:46:43,376 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 13:46:43,379 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 13:46:43,380 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:46:43" (1/1) ... [2018-11-18 13:46:43,381 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@287b64ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:46:43, skipping insertion in model container [2018-11-18 13:46:43,382 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:46:43" (1/1) ... [2018-11-18 13:46:43,387 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 13:46:43,429 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 13:46:43,749 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:46:43,756 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 13:46:43,900 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:46:43,939 INFO L195 MainTranslator]: Completed translation [2018-11-18 13:46:43,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:46:43 WrapperNode [2018-11-18 13:46:43,940 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 13:46:43,940 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 13:46:43,941 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 13:46:43,941 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 13:46:43,948 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:46:43" (1/1) ... [2018-11-18 13:46:43,971 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:46:43" (1/1) ... [2018-11-18 13:46:44,170 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 13:46:44,170 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 13:46:44,170 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 13:46:44,170 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 13:46:44,178 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:46:43" (1/1) ... [2018-11-18 13:46:44,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:46:43" (1/1) ... [2018-11-18 13:46:44,209 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:46:43" (1/1) ... [2018-11-18 13:46:44,209 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:46:43" (1/1) ... [2018-11-18 13:46:44,275 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:46:43" (1/1) ... [2018-11-18 13:46:44,362 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:46:43" (1/1) ... [2018-11-18 13:46:44,388 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:46:43" (1/1) ... [2018-11-18 13:46:44,429 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 13:46:44,430 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 13:46:44,430 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 13:46:44,430 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 13:46:44,430 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:46:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eaa54a5e-2340-437a-a3ed-af79e41f8ee5/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-18 13:46:44,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 13:46:44,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 13:46:44,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 13:46:51,804 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 13:46:51,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:46:51 BoogieIcfgContainer [2018-11-18 13:46:51,805 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 13:46:51,805 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 13:46:51,805 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 13:46:51,808 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 13:46:51,808 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 13:46:51,808 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 01:46:43" (1/3) ... [2018-11-18 13:46:51,809 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a7fe0f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 01:46:51, skipping insertion in model container [2018-11-18 13:46:51,809 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 13:46:51,809 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:46:43" (2/3) ... [2018-11-18 13:46:51,810 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a7fe0f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 01:46:51, skipping insertion in model container [2018-11-18 13:46:51,810 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 13:46:51,810 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:46:51" (3/3) ... [2018-11-18 13:46:51,811 INFO L375 chiAutomizerObserver]: Analyzing ICFG elevator_spec9_product30_false-unreach-call_true-termination.cil.c [2018-11-18 13:46:51,862 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 13:46:51,863 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 13:46:51,863 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 13:46:51,863 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 13:46:51,863 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 13:46:51,863 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 13:46:51,863 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 13:46:51,863 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 13:46:51,864 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 13:46:51,936 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7098 states. [2018-11-18 13:46:52,042 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3533 [2018-11-18 13:46:52,042 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:46:52,043 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:46:52,056 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] [2018-11-18 13:46:52,056 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] [2018-11-18 13:46:52,056 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 13:46:52,057 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7098 states. [2018-11-18 13:46:52,122 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3533 [2018-11-18 13:46:52,122 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:46:52,122 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:46:52,126 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] [2018-11-18 13:46:52,126 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] [2018-11-18 13:46:52,132 INFO L794 eck$LassoCheckResult]: Stem: 2967#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call #t~string18.base, #t~string18.offset := #Ultimate.alloc(30);call #t~string19.base, #t~string19.offset := #Ultimate.alloc(9);call #t~string20.base, #t~string20.offset := #Ultimate.alloc(21);call #t~string21.base, #t~string21.offset := #Ultimate.alloc(30);call #t~string22.base, #t~string22.offset := #Ultimate.alloc(9);call #t~string23.base, #t~string23.offset := #Ultimate.alloc(21);call #t~string27.base, #t~string27.offset := #Ultimate.alloc(30);call #t~string28.base, #t~string28.offset := #Ultimate.alloc(9);call #t~string29.base, #t~string29.offset := #Ultimate.alloc(25);call #t~string30.base, #t~string30.offset := #Ultimate.alloc(30);call #t~string31.base, #t~string31.offset := #Ultimate.alloc(9);call #t~string32.base, #t~string32.offset := #Ultimate.alloc(25);call #t~string99.base, #t~string99.offset := #Ultimate.alloc(10);call #t~string101.base, #t~string101.offset := #Ultimate.alloc(4);#memory_int := #memory_int[#t~string101.base,#t~string101.offset := 91];#memory_int := #memory_int[#t~string101.base,1 + #t~string101.offset := 95];#memory_int := #memory_int[#t~string101.base,2 + #t~string101.offset := 93];#memory_int := #memory_int[#t~string101.base,3 + #t~string101.offset := 0];call #t~string103.base, #t~string103.offset := #Ultimate.alloc(4);#memory_int := #memory_int[#t~string103.base,#t~string103.offset := 91];#memory_int := #memory_int[#t~string103.base,1 + #t~string103.offset := 93];#memory_int := #memory_int[#t~string103.base,2 + #t~string103.offset := 32];#memory_int := #memory_int[#t~string103.base,3 + #t~string103.offset := 0];call #t~string105.base, #t~string105.offset := #Ultimate.alloc(5);#memory_int := #memory_int[#t~string105.base,#t~string105.offset := 32];#memory_int := #memory_int[#t~string105.base,1 + #t~string105.offset := 97];#memory_int := #memory_int[#t~string105.base,2 + #t~string105.offset := 116];#memory_int := #memory_int[#t~string105.base,3 + #t~string105.offset := 32];#memory_int := #memory_int[#t~string105.base,4 + #t~string105.offset := 0];call #t~string107.base, #t~string107.offset := #Ultimate.alloc(3);#memory_int := #memory_int[#t~string107.base,#t~string107.offset := 37];#memory_int := #memory_int[#t~string107.base,1 + #t~string107.offset := 105];#memory_int := #memory_int[#t~string107.base,2 + #t~string107.offset := 0];call #t~string109.base, #t~string109.offset := #Ultimate.alloc(10);call #t~string111.base, #t~string111.offset := #Ultimate.alloc(3);#memory_int := #memory_int[#t~string111.base,#t~string111.offset := 117];#memory_int := #memory_int[#t~string111.base,1 + #t~string111.offset := 112];#memory_int := #memory_int[#t~string111.base,2 + #t~string111.offset := 0];call #t~string113.base, #t~string113.offset := #Ultimate.alloc(5);#memory_int := #memory_int[#t~string113.base,#t~string113.offset := 100];#memory_int := #memory_int[#t~string113.base,1 + #t~string113.offset := 111];#memory_int := #memory_int[#t~string113.base,2 + #t~string113.offset := 119];#memory_int := #memory_int[#t~string113.base,3 + #t~string113.offset := 110];#memory_int := #memory_int[#t~string113.base,4 + #t~string113.offset := 0];call #t~string115.base, #t~string115.offset := #Ultimate.alloc(7);#memory_int := #memory_int[#t~string115.base,#t~string115.offset := 32];#memory_int := #memory_int[#t~string115.base,1 + #t~string115.offset := 73];#memory_int := #memory_int[#t~string115.base,2 + #t~string115.offset := 76];#memory_int := #memory_int[#t~string115.base,3 + #t~string115.offset := 95];#memory_int := #memory_int[#t~string115.base,4 + #t~string115.offset := 112];#memory_int := #memory_int[#t~string115.base,5 + #t~string115.offset := 58];#memory_int := #memory_int[#t~string115.base,6 + #t~string115.offset := 0];call #t~string117.base, #t~string117.offset := #Ultimate.alloc(4);#memory_int := #memory_int[#t~string117.base,#t~string117.offset := 32];#memory_int := #memory_int[#t~string117.base,1 + #t~string117.offset := 37];#memory_int := #memory_int[#t~string117.base,2 + #t~string117.offset := 105];#memory_int := #memory_int[#t~string117.base,3 + #t~string117.offset := 0];call #t~string119.base, #t~string119.offset := #Ultimate.alloc(4);#memory_int := #memory_int[#t~string119.base,#t~string119.offset := 32];#memory_int := #memory_int[#t~string119.base,1 + #t~string119.offset := 37];#memory_int := #memory_int[#t~string119.base,2 + #t~string119.offset := 105];#memory_int := #memory_int[#t~string119.base,3 + #t~string119.offset := 0];call #t~string121.base, #t~string121.offset := #Ultimate.alloc(4);#memory_int := #memory_int[#t~string121.base,#t~string121.offset := 32];#memory_int := #memory_int[#t~string121.base,1 + #t~string121.offset := 37];#memory_int := #memory_int[#t~string121.base,2 + #t~string121.offset := 105];#memory_int := #memory_int[#t~string121.base,3 + #t~string121.offset := 0];call #t~string123.base, #t~string123.offset := #Ultimate.alloc(4);#memory_int := #memory_int[#t~string123.base,#t~string123.offset := 32];#memory_int := #memory_int[#t~string123.base,1 + #t~string123.offset := 37];#memory_int := #memory_int[#t~string123.base,2 + #t~string123.offset := 105];#memory_int := #memory_int[#t~string123.base,3 + #t~string123.offset := 0];call #t~string125.base, #t~string125.offset := #Ultimate.alloc(4);#memory_int := #memory_int[#t~string125.base,#t~string125.offset := 32];#memory_int := #memory_int[#t~string125.base,1 + #t~string125.offset := 37];#memory_int := #memory_int[#t~string125.base,2 + #t~string125.offset := 105];#memory_int := #memory_int[#t~string125.base,3 + #t~string125.offset := 0];call #t~string127.base, #t~string127.offset := #Ultimate.alloc(6);#memory_int := #memory_int[#t~string127.base,#t~string127.offset := 32];#memory_int := #memory_int[#t~string127.base,1 + #t~string127.offset := 70];#memory_int := #memory_int[#t~string127.base,2 + #t~string127.offset := 95];#memory_int := #memory_int[#t~string127.base,3 + #t~string127.offset := 112];#memory_int := #memory_int[#t~string127.base,4 + #t~string127.offset := 58];#memory_int := #memory_int[#t~string127.base,5 + #t~string127.offset := 0];call #t~string130.base, #t~string130.offset := #Ultimate.alloc(4);#memory_int := #memory_int[#t~string130.base,#t~string130.offset := 32];#memory_int := #memory_int[#t~string130.base,1 + #t~string130.offset := 37];#memory_int := #memory_int[#t~string130.base,2 + #t~string130.offset := 105];#memory_int := #memory_int[#t~string130.base,3 + #t~string130.offset := 0];call #t~string133.base, #t~string133.offset := #Ultimate.alloc(4);#memory_int := #memory_int[#t~string133.base,#t~string133.offset := 32];#memory_int := #memory_int[#t~string133.base,1 + #t~string133.offset := 37];#memory_int := #memory_int[#t~string133.base,2 + #t~string133.offset := 105];#memory_int := #memory_int[#t~string133.base,3 + #t~string133.offset := 0];call #t~string136.base, #t~string136.offset := #Ultimate.alloc(4);#memory_int := #memory_int[#t~string136.base,#t~string136.offset := 32];#memory_int := #memory_int[#t~string136.base,1 + #t~string136.offset := 37];#memory_int := #memory_int[#t~string136.base,2 + #t~string136.offset := 105];#memory_int := #memory_int[#t~string136.base,3 + #t~string136.offset := 0];call #t~string139.base, #t~string139.offset := #Ultimate.alloc(4);#memory_int := #memory_int[#t~string139.base,#t~string139.offset := 32];#memory_int := #memory_int[#t~string139.base,1 + #t~string139.offset := 37];#memory_int := #memory_int[#t~string139.base,2 + #t~string139.offset := 105];#memory_int := #memory_int[#t~string139.base,3 + #t~string139.offset := 0];call #t~string142.base, #t~string142.offset := #Ultimate.alloc(4);#memory_int := #memory_int[#t~string142.base,#t~string142.offset := 32];#memory_int := #memory_int[#t~string142.base,1 + #t~string142.offset := 37];#memory_int := #memory_int[#t~string142.base,2 + #t~string142.offset := 105];#memory_int := #memory_int[#t~string142.base,3 + #t~string142.offset := 0];call #t~string144.base, #t~string144.offset := #Ultimate.alloc(2);#memory_int := #memory_int[#t~string144.base,#t~string144.offset := 10];#memory_int := #memory_int[#t~string144.base,1 + #t~string144.offset := 0];call #t~string147.base, #t~string147.offset := #Ultimate.alloc(9);~weight~0 := 0;~maximumWeight~0 := 100;~blocked~0 := 0;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0;~cleanupTimeShifts~0 := 12;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0;~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; 6577#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret162, main_~retValue_acc~27, main_~tmp~29;havoc main_~retValue_acc~27;havoc main_~tmp~29;assume { :begin_inline_select_helpers } true; 1162#L430true assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; 214#L423true assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res;havoc valid_product_~retValue_acc~4;havoc valid_product_~retValue_acc~4;valid_product_~retValue_acc~4 := 1;valid_product_#res := valid_product_~retValue_acc~4; 3913#L438true main_#t~ret162 := valid_product_#res;assume { :end_inline_valid_product } true;main_~tmp~29 := main_#t~ret162;havoc main_#t~ret162; 3964#L3432true assume 0 != main_~tmp~29;assume { :begin_inline_setup } true; 2029#L3407true assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline___utac_acc__Specification9_spec__1 } true;~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; 3345#L472true assume { :end_inline___utac_acc__Specification9_spec__1 } true;assume { :begin_inline_test } true;assume { :begin_inline_bigMacCall } true;havoc bigMacCall_#t~ret155, bigMacCall_~tmp~26;havoc bigMacCall_~tmp~26;assume { :begin_inline_getOrigin } true;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~6;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~6; 23#L775true assume 0 == getOrigin_~person;getOrigin_~retValue_acc~6 := 4;getOrigin_#res := getOrigin_~retValue_acc~6; 4388#L800true bigMacCall_#t~ret155 := getOrigin_#res;assume { :end_inline_getOrigin } true;bigMacCall_~tmp~26 := bigMacCall_#t~ret155;havoc bigMacCall_#t~ret155;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~26;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 5633#L2788true assume 0 == initPersonOnFloor_~floor; 5534#L2789true assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 1257#L2896-1true assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 2762#L2580true assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 3214#L2592-2true assume { :end_inline_callOnFloor } true; 2787#L2932true assume { :end_inline_initPersonOnFloor } true; 1776#L3212true assume { :end_inline_bigMacCall } true;assume { :begin_inline_cleanup } true;havoc cleanup_#t~ret156, cleanup_#t~ret157, cleanup_~i~3, cleanup_~tmp~27, cleanup_~tmp___0~10, cleanup_~__cil_tmp4~3;havoc cleanup_~i~3;havoc cleanup_~tmp~27;havoc cleanup_~tmp___0~10;havoc cleanup_~__cil_tmp4~3;assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret98, timeShift_~tmp~18;havoc timeShift_~tmp~18;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~10;havoc areDoorsOpen_~retValue_acc~10;areDoorsOpen_~retValue_acc~10 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~10; 2456#L1112true timeShift_#t~ret98 := areDoorsOpen_#res;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~18 := timeShift_#t~ret98;havoc timeShift_#t~ret98; 3329#L2061true assume 0 != timeShift_~tmp~18; 3318#L2062true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 3331#L2061-1true assume { :begin_inline___utac_acc__Specification9_spec__3 } true;havoc __utac_acc__Specification9_spec__3_#t~ret36, __utac_acc__Specification9_spec__3_#t~ret37, __utac_acc__Specification9_spec__3_#t~ret38, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~3, __utac_acc__Specification9_spec__3_~tmp___0~0, __utac_acc__Specification9_spec__3_~tmp___1~0;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~3;havoc __utac_acc__Specification9_spec__3_~tmp___0~0;havoc __utac_acc__Specification9_spec__3_~tmp___1~0;assume { :begin_inline_getCurrentFloorID } true;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~9;havoc getCurrentFloorID_~retValue_acc~9;getCurrentFloorID_~retValue_acc~9 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~9; 1567#L1103-2true __utac_acc__Specification9_spec__3_#t~ret36 := getCurrentFloorID_#res;assume { :end_inline_getCurrentFloorID } true;__utac_acc__Specification9_spec__3_~tmp~3 := __utac_acc__Specification9_spec__3_#t~ret36;havoc __utac_acc__Specification9_spec__3_#t~ret36;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~3;assume { :begin_inline_isEmpty } true;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~13;havoc isEmpty_~retValue_acc~13; 3018#L1163-12true assume 1 == ~persons_0~0;isEmpty_~retValue_acc~13 := 0;isEmpty_#res := isEmpty_~retValue_acc~13; 5787#L1195-12true __utac_acc__Specification9_spec__3_#t~ret37 := isEmpty_#res;assume { :end_inline_isEmpty } true;__utac_acc__Specification9_spec__3_~tmp___1~0 := __utac_acc__Specification9_spec__3_#t~ret37;havoc __utac_acc__Specification9_spec__3_#t~ret37; 4921#L515true assume 0 != __utac_acc__Specification9_spec__3_~tmp___1~0;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 6797#L525-1true assume { :end_inline___utac_acc__Specification9_spec__3 } true; 5678#L2079true assume { :end_inline_timeShift } true;cleanup_~i~3 := 0; 443#L3239-3true [2018-11-18 13:46:52,132 INFO L796 eck$LassoCheckResult]: Loop: 443#L3239-3true assume true; 464#L3239-1true assume !false; 358#L3240true cleanup_~__cil_tmp4~3 := ~cleanupTimeShifts~0 - 1; 160#L3243true assume cleanup_~i~3 < cleanup_~__cil_tmp4~3;assume { :begin_inline_isBlocked } true;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~8;havoc isBlocked_~retValue_acc~8;isBlocked_~retValue_acc~8 := ~blocked~0;isBlocked_#res := isBlocked_~retValue_acc~8; 1529#L926true cleanup_#t~ret156 := isBlocked_#res;assume { :end_inline_isBlocked } true;cleanup_~tmp___0~10 := cleanup_#t~ret156;havoc cleanup_#t~ret156; 1238#L3247true assume 1 != cleanup_~tmp___0~10; 1237#L3247-1true assume { :begin_inline_isIdle } true;havoc isIdle_#res;havoc isIdle_#t~ret53, isIdle_~retValue_acc~15, isIdle_~tmp~10;havoc isIdle_~retValue_acc~15;havoc isIdle_~tmp~10;assume { :begin_inline_anyStopRequested } true;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret48, anyStopRequested_#t~ret49, anyStopRequested_#t~ret50, anyStopRequested_#t~ret51, anyStopRequested_#t~ret52, anyStopRequested_~retValue_acc~14, anyStopRequested_~tmp~9, anyStopRequested_~tmp___0~3, anyStopRequested_~tmp___1~3, anyStopRequested_~tmp___2~0, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~14;havoc anyStopRequested_~tmp~9;havoc anyStopRequested_~tmp___0~3;havoc anyStopRequested_~tmp___1~3;havoc anyStopRequested_~tmp___2~0;havoc anyStopRequested_~tmp___3~0;assume { :begin_inline_isFloorCalling } true;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~23;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~23; 2496#L2517-122true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~23 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~23; 969#L2544-122true anyStopRequested_#t~ret48 := isFloorCalling_#res;assume { :end_inline_isFloorCalling } true;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret48;havoc anyStopRequested_#t~ret48; 4652#L1211true assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~14 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~14; 1606#L1275true isIdle_#t~ret53 := anyStopRequested_#res;assume { :end_inline_anyStopRequested } true;isIdle_~tmp~10 := isIdle_#t~ret53;havoc isIdle_#t~ret53;isIdle_~retValue_acc~15 := (if 0 == isIdle_~tmp~10 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~15; 2472#L1288true cleanup_#t~ret157 := isIdle_#res;assume { :end_inline_isIdle } true;cleanup_~tmp~27 := cleanup_#t~ret157;havoc cleanup_#t~ret157; 3820#L3259true assume !(0 != cleanup_~tmp~27);assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret98, timeShift_~tmp~18;havoc timeShift_~tmp~18;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~10;havoc areDoorsOpen_~retValue_acc~10;areDoorsOpen_~retValue_acc~10 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~10; 2462#L1112-2true timeShift_#t~ret98 := areDoorsOpen_#res;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~18 := timeShift_#t~ret98;havoc timeShift_#t~ret98; 3330#L2061-2true assume 0 != timeShift_~tmp~18; 3319#L2062-3true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 3332#L2061-3true assume { :begin_inline___utac_acc__Specification9_spec__3 } true;havoc __utac_acc__Specification9_spec__3_#t~ret36, __utac_acc__Specification9_spec__3_#t~ret37, __utac_acc__Specification9_spec__3_#t~ret38, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~3, __utac_acc__Specification9_spec__3_~tmp___0~0, __utac_acc__Specification9_spec__3_~tmp___1~0;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~3;havoc __utac_acc__Specification9_spec__3_~tmp___0~0;havoc __utac_acc__Specification9_spec__3_~tmp___1~0;assume { :begin_inline_getCurrentFloorID } true;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~9;havoc getCurrentFloorID_~retValue_acc~9;getCurrentFloorID_~retValue_acc~9 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~9; 1570#L1103-5true __utac_acc__Specification9_spec__3_#t~ret36 := getCurrentFloorID_#res;assume { :end_inline_getCurrentFloorID } true;__utac_acc__Specification9_spec__3_~tmp~3 := __utac_acc__Specification9_spec__3_#t~ret36;havoc __utac_acc__Specification9_spec__3_#t~ret36;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~3;assume { :begin_inline_isEmpty } true;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~13;havoc isEmpty_~retValue_acc~13; 3082#L1163-25true assume 1 == ~persons_0~0;isEmpty_~retValue_acc~13 := 0;isEmpty_#res := isEmpty_~retValue_acc~13; 5765#L1195-25true __utac_acc__Specification9_spec__3_#t~ret37 := isEmpty_#res;assume { :end_inline_isEmpty } true;__utac_acc__Specification9_spec__3_~tmp___1~0 := __utac_acc__Specification9_spec__3_#t~ret37;havoc __utac_acc__Specification9_spec__3_#t~ret37; 4924#L515-2true assume 0 != __utac_acc__Specification9_spec__3_~tmp___1~0;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 6799#L525-3true assume { :end_inline___utac_acc__Specification9_spec__3 } true; 5662#L2079-1true assume { :end_inline_timeShift } true;cleanup_~i~3 := 1 + cleanup_~i~3; 443#L3239-3true [2018-11-18 13:46:52,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:52,140 INFO L82 PathProgramCache]: Analyzing trace with hash -115058102, now seen corresponding path program 1 times [2018-11-18 13:46:52,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:46:52,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:46:52,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:52,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:52,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:52,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:52,986 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-18 13:46:52,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:46:52,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:46:52,992 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 13:46:52,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:52,992 INFO L82 PathProgramCache]: Analyzing trace with hash 876374017, now seen corresponding path program 1 times [2018-11-18 13:46:52,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:46:52,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:46:52,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:52,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:52,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:53,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:53,035 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-18 13:46:53,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:46:53,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 13:46:53,037 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 13:46:53,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 13:46:53,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 13:46:53,052 INFO L87 Difference]: Start difference. First operand 7098 states. Second operand 4 states. [2018-11-18 13:46:53,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:46:53,987 INFO L93 Difference]: Finished difference Result 17513 states and 32817 transitions. [2018-11-18 13:46:53,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 13:46:53,989 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17513 states and 32817 transitions. [2018-11-18 13:46:54,059 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12199 [2018-11-18 13:46:54,126 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17513 states to 17459 states and 32756 transitions. [2018-11-18 13:46:54,127 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17459 [2018-11-18 13:46:54,139 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17459 [2018-11-18 13:46:54,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17459 states and 32756 transitions. [2018-11-18 13:46:54,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:46:54,160 INFO L705 BuchiCegarLoop]: Abstraction has 17459 states and 32756 transitions. [2018-11-18 13:46:54,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17459 states and 32756 transitions. [2018-11-18 13:46:54,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17459 to 7079. [2018-11-18 13:46:54,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7079 states. [2018-11-18 13:46:54,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7079 states to 7079 states and 13296 transitions. [2018-11-18 13:46:54,301 INFO L728 BuchiCegarLoop]: Abstraction has 7079 states and 13296 transitions. [2018-11-18 13:46:54,301 INFO L608 BuchiCegarLoop]: Abstraction has 7079 states and 13296 transitions. [2018-11-18 13:46:54,301 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 13:46:54,301 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7079 states and 13296 transitions. [2018-11-18 13:46:54,317 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3535 [2018-11-18 13:46:54,317 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:46:54,317 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:46:54,320 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] [2018-11-18 13:46:54,320 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] [2018-11-18 13:46:54,321 INFO L794 eck$LassoCheckResult]: Stem: 28389#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call #t~string18.base, #t~string18.offset := #Ultimate.alloc(30);call #t~string19.base, #t~string19.offset := #Ultimate.alloc(9);call #t~string20.base, #t~string20.offset := #Ultimate.alloc(21);call #t~string21.base, #t~string21.offset := #Ultimate.alloc(30);call #t~string22.base, #t~string22.offset := #Ultimate.alloc(9);call #t~string23.base, #t~string23.offset := #Ultimate.alloc(21);call #t~string27.base, #t~string27.offset := #Ultimate.alloc(30);call #t~string28.base, #t~string28.offset := #Ultimate.alloc(9);call #t~string29.base, #t~string29.offset := #Ultimate.alloc(25);call #t~string30.base, #t~string30.offset := #Ultimate.alloc(30);call #t~string31.base, #t~string31.offset := #Ultimate.alloc(9);call #t~string32.base, #t~string32.offset := #Ultimate.alloc(25);call #t~string99.base, #t~string99.offset := #Ultimate.alloc(10);call #t~string101.base, #t~string101.offset := #Ultimate.alloc(4);#memory_int := #memory_int[#t~string101.base,#t~string101.offset := 91];#memory_int := #memory_int[#t~string101.base,1 + #t~string101.offset := 95];#memory_int := #memory_int[#t~string101.base,2 + #t~string101.offset := 93];#memory_int := #memory_int[#t~string101.base,3 + #t~string101.offset := 0];call #t~string103.base, #t~string103.offset := #Ultimate.alloc(4);#memory_int := #memory_int[#t~string103.base,#t~string103.offset := 91];#memory_int := #memory_int[#t~string103.base,1 + #t~string103.offset := 93];#memory_int := #memory_int[#t~string103.base,2 + #t~string103.offset := 32];#memory_int := #memory_int[#t~string103.base,3 + #t~string103.offset := 0];call #t~string105.base, #t~string105.offset := #Ultimate.alloc(5);#memory_int := #memory_int[#t~string105.base,#t~string105.offset := 32];#memory_int := #memory_int[#t~string105.base,1 + #t~string105.offset := 97];#memory_int := #memory_int[#t~string105.base,2 + #t~string105.offset := 116];#memory_int := #memory_int[#t~string105.base,3 + #t~string105.offset := 32];#memory_int := #memory_int[#t~string105.base,4 + #t~string105.offset := 0];call #t~string107.base, #t~string107.offset := #Ultimate.alloc(3);#memory_int := #memory_int[#t~string107.base,#t~string107.offset := 37];#memory_int := #memory_int[#t~string107.base,1 + #t~string107.offset := 105];#memory_int := #memory_int[#t~string107.base,2 + #t~string107.offset := 0];call #t~string109.base, #t~string109.offset := #Ultimate.alloc(10);call #t~string111.base, #t~string111.offset := #Ultimate.alloc(3);#memory_int := #memory_int[#t~string111.base,#t~string111.offset := 117];#memory_int := #memory_int[#t~string111.base,1 + #t~string111.offset := 112];#memory_int := #memory_int[#t~string111.base,2 + #t~string111.offset := 0];call #t~string113.base, #t~string113.offset := #Ultimate.alloc(5);#memory_int := #memory_int[#t~string113.base,#t~string113.offset := 100];#memory_int := #memory_int[#t~string113.base,1 + #t~string113.offset := 111];#memory_int := #memory_int[#t~string113.base,2 + #t~string113.offset := 119];#memory_int := #memory_int[#t~string113.base,3 + #t~string113.offset := 110];#memory_int := #memory_int[#t~string113.base,4 + #t~string113.offset := 0];call #t~string115.base, #t~string115.offset := #Ultimate.alloc(7);#memory_int := #memory_int[#t~string115.base,#t~string115.offset := 32];#memory_int := #memory_int[#t~string115.base,1 + #t~string115.offset := 73];#memory_int := #memory_int[#t~string115.base,2 + #t~string115.offset := 76];#memory_int := #memory_int[#t~string115.base,3 + #t~string115.offset := 95];#memory_int := #memory_int[#t~string115.base,4 + #t~string115.offset := 112];#memory_int := #memory_int[#t~string115.base,5 + #t~string115.offset := 58];#memory_int := #memory_int[#t~string115.base,6 + #t~string115.offset := 0];call #t~string117.base, #t~string117.offset := #Ultimate.alloc(4);#memory_int := #memory_int[#t~string117.base,#t~string117.offset := 32];#memory_int := #memory_int[#t~string117.base,1 + #t~string117.offset := 37];#memory_int := #memory_int[#t~string117.base,2 + #t~string117.offset := 105];#memory_int := #memory_int[#t~string117.base,3 + #t~string117.offset := 0];call #t~string119.base, #t~string119.offset := #Ultimate.alloc(4);#memory_int := #memory_int[#t~string119.base,#t~string119.offset := 32];#memory_int := #memory_int[#t~string119.base,1 + #t~string119.offset := 37];#memory_int := #memory_int[#t~string119.base,2 + #t~string119.offset := 105];#memory_int := #memory_int[#t~string119.base,3 + #t~string119.offset := 0];call #t~string121.base, #t~string121.offset := #Ultimate.alloc(4);#memory_int := #memory_int[#t~string121.base,#t~string121.offset := 32];#memory_int := #memory_int[#t~string121.base,1 + #t~string121.offset := 37];#memory_int := #memory_int[#t~string121.base,2 + #t~string121.offset := 105];#memory_int := #memory_int[#t~string121.base,3 + #t~string121.offset := 0];call #t~string123.base, #t~string123.offset := #Ultimate.alloc(4);#memory_int := #memory_int[#t~string123.base,#t~string123.offset := 32];#memory_int := #memory_int[#t~string123.base,1 + #t~string123.offset := 37];#memory_int := #memory_int[#t~string123.base,2 + #t~string123.offset := 105];#memory_int := #memory_int[#t~string123.base,3 + #t~string123.offset := 0];call #t~string125.base, #t~string125.offset := #Ultimate.alloc(4);#memory_int := #memory_int[#t~string125.base,#t~string125.offset := 32];#memory_int := #memory_int[#t~string125.base,1 + #t~string125.offset := 37];#memory_int := #memory_int[#t~string125.base,2 + #t~string125.offset := 105];#memory_int := #memory_int[#t~string125.base,3 + #t~string125.offset := 0];call #t~string127.base, #t~string127.offset := #Ultimate.alloc(6);#memory_int := #memory_int[#t~string127.base,#t~string127.offset := 32];#memory_int := #memory_int[#t~string127.base,1 + #t~string127.offset := 70];#memory_int := #memory_int[#t~string127.base,2 + #t~string127.offset := 95];#memory_int := #memory_int[#t~string127.base,3 + #t~string127.offset := 112];#memory_int := #memory_int[#t~string127.base,4 + #t~string127.offset := 58];#memory_int := #memory_int[#t~string127.base,5 + #t~string127.offset := 0];call #t~string130.base, #t~string130.offset := #Ultimate.alloc(4);#memory_int := #memory_int[#t~string130.base,#t~string130.offset := 32];#memory_int := #memory_int[#t~string130.base,1 + #t~string130.offset := 37];#memory_int := #memory_int[#t~string130.base,2 + #t~string130.offset := 105];#memory_int := #memory_int[#t~string130.base,3 + #t~string130.offset := 0];call #t~string133.base, #t~string133.offset := #Ultimate.alloc(4);#memory_int := #memory_int[#t~string133.base,#t~string133.offset := 32];#memory_int := #memory_int[#t~string133.base,1 + #t~string133.offset := 37];#memory_int := #memory_int[#t~string133.base,2 + #t~string133.offset := 105];#memory_int := #memory_int[#t~string133.base,3 + #t~string133.offset := 0];call #t~string136.base, #t~string136.offset := #Ultimate.alloc(4);#memory_int := #memory_int[#t~string136.base,#t~string136.offset := 32];#memory_int := #memory_int[#t~string136.base,1 + #t~string136.offset := 37];#memory_int := #memory_int[#t~string136.base,2 + #t~string136.offset := 105];#memory_int := #memory_int[#t~string136.base,3 + #t~string136.offset := 0];call #t~string139.base, #t~string139.offset := #Ultimate.alloc(4);#memory_int := #memory_int[#t~string139.base,#t~string139.offset := 32];#memory_int := #memory_int[#t~string139.base,1 + #t~string139.offset := 37];#memory_int := #memory_int[#t~string139.base,2 + #t~string139.offset := 105];#memory_int := #memory_int[#t~string139.base,3 + #t~string139.offset := 0];call #t~string142.base, #t~string142.offset := #Ultimate.alloc(4);#memory_int := #memory_int[#t~string142.base,#t~string142.offset := 32];#memory_int := #memory_int[#t~string142.base,1 + #t~string142.offset := 37];#memory_int := #memory_int[#t~string142.base,2 + #t~string142.offset := 105];#memory_int := #memory_int[#t~string142.base,3 + #t~string142.offset := 0];call #t~string144.base, #t~string144.offset := #Ultimate.alloc(2);#memory_int := #memory_int[#t~string144.base,#t~string144.offset := 10];#memory_int := #memory_int[#t~string144.base,1 + #t~string144.offset := 0];call #t~string147.base, #t~string147.offset := #Ultimate.alloc(9);~weight~0 := 0;~maximumWeight~0 := 100;~blocked~0 := 0;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0;~cleanupTimeShifts~0 := 12;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0;~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; 28390#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret162, main_~retValue_acc~27, main_~tmp~29;havoc main_~retValue_acc~27;havoc main_~tmp~29;assume { :begin_inline_select_helpers } true; 26375#L430 assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; 25112#L423 assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res;havoc valid_product_~retValue_acc~4;havoc valid_product_~retValue_acc~4;valid_product_~retValue_acc~4 := 1;valid_product_#res := valid_product_~retValue_acc~4; 25113#L438 main_#t~ret162 := valid_product_#res;assume { :end_inline_valid_product } true;main_~tmp~29 := main_#t~ret162;havoc main_#t~ret162; 29308#L3432 assume 0 != main_~tmp~29;assume { :begin_inline_setup } true; 27269#L3407 assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline___utac_acc__Specification9_spec__1 } true;~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; 27270#L472 assume { :end_inline___utac_acc__Specification9_spec__1 } true;assume { :begin_inline_test } true;assume { :begin_inline_bigMacCall } true;havoc bigMacCall_#t~ret155, bigMacCall_~tmp~26;havoc bigMacCall_~tmp~26;assume { :begin_inline_getOrigin } true;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~6;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~6; 24673#L775 assume 0 == getOrigin_~person;getOrigin_~retValue_acc~6 := 4;getOrigin_#res := getOrigin_~retValue_acc~6; 24674#L800 bigMacCall_#t~ret155 := getOrigin_#res;assume { :end_inline_getOrigin } true;bigMacCall_~tmp~26 := bigMacCall_#t~ret155;havoc bigMacCall_#t~ret155;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~26;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 29589#L2788 assume 0 == initPersonOnFloor_~floor; 30634#L2789 assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 25747#L2896-1 assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 26478#L2580 assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 28078#L2592-2 assume { :end_inline_callOnFloor } true; 28142#L2932 assume { :end_inline_initPersonOnFloor } true; 27019#L3212 assume { :end_inline_bigMacCall } true;assume { :begin_inline_cleanup } true;havoc cleanup_#t~ret156, cleanup_#t~ret157, cleanup_~i~3, cleanup_~tmp~27, cleanup_~tmp___0~10, cleanup_~__cil_tmp4~3;havoc cleanup_~i~3;havoc cleanup_~tmp~27;havoc cleanup_~tmp___0~10;havoc cleanup_~__cil_tmp4~3;assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret98, timeShift_~tmp~18;havoc timeShift_~tmp~18;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~10;havoc areDoorsOpen_~retValue_acc~10;areDoorsOpen_~retValue_acc~10 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~10; 27020#L1112 timeShift_#t~ret98 := areDoorsOpen_#res;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~18 := timeShift_#t~ret98;havoc timeShift_#t~ret98; 27692#L2061 assume 0 != timeShift_~tmp~18; 28821#L2062 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 28822#L2061-1 assume { :begin_inline___utac_acc__Specification9_spec__3 } true;havoc __utac_acc__Specification9_spec__3_#t~ret36, __utac_acc__Specification9_spec__3_#t~ret37, __utac_acc__Specification9_spec__3_#t~ret38, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~3, __utac_acc__Specification9_spec__3_~tmp___0~0, __utac_acc__Specification9_spec__3_~tmp___1~0;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~3;havoc __utac_acc__Specification9_spec__3_~tmp___0~0;havoc __utac_acc__Specification9_spec__3_~tmp___1~0;assume { :begin_inline_getCurrentFloorID } true;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~9;havoc getCurrentFloorID_~retValue_acc~9;getCurrentFloorID_~retValue_acc~9 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~9; 26813#L1103-2 __utac_acc__Specification9_spec__3_#t~ret36 := getCurrentFloorID_#res;assume { :end_inline_getCurrentFloorID } true;__utac_acc__Specification9_spec__3_~tmp~3 := __utac_acc__Specification9_spec__3_#t~ret36;havoc __utac_acc__Specification9_spec__3_#t~ret36;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~3;assume { :begin_inline_isEmpty } true;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~13;havoc isEmpty_~retValue_acc~13; 26814#L1163-12 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~13 := 0;isEmpty_#res := isEmpty_~retValue_acc~13; 27916#L1195-12 __utac_acc__Specification9_spec__3_#t~ret37 := isEmpty_#res;assume { :end_inline_isEmpty } true;__utac_acc__Specification9_spec__3_~tmp___1~0 := __utac_acc__Specification9_spec__3_#t~ret37;havoc __utac_acc__Specification9_spec__3_#t~ret37; 30187#L515 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~0);assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~10;havoc areDoorsOpen_~retValue_acc~10;areDoorsOpen_~retValue_acc~10 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~10; 27693#L1112-1 __utac_acc__Specification9_spec__3_#t~ret38 := areDoorsOpen_#res;assume { :end_inline_areDoorsOpen } true;__utac_acc__Specification9_spec__3_~tmp___0~0 := __utac_acc__Specification9_spec__3_#t~ret38;havoc __utac_acc__Specification9_spec__3_#t~ret38; 27694#L525 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___0~0); 30962#L525-1 assume { :end_inline___utac_acc__Specification9_spec__3 } true; 30745#L2079 assume { :end_inline_timeShift } true;cleanup_~i~3 := 0; 25554#L3239-3 [2018-11-18 13:46:54,321 INFO L796 eck$LassoCheckResult]: Loop: 25554#L3239-3 assume true; 25555#L3239-1 assume !false; 25368#L3240 cleanup_~__cil_tmp4~3 := ~cleanupTimeShifts~0 - 1; 24997#L3243 assume cleanup_~i~3 < cleanup_~__cil_tmp4~3;assume { :begin_inline_isBlocked } true;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~8;havoc isBlocked_~retValue_acc~8;isBlocked_~retValue_acc~8 := ~blocked~0;isBlocked_#res := isBlocked_~retValue_acc~8; 24998#L926 cleanup_#t~ret156 := isBlocked_#res;assume { :end_inline_isBlocked } true;cleanup_~tmp___0~10 := cleanup_#t~ret156;havoc cleanup_#t~ret156; 26451#L3247 assume 1 != cleanup_~tmp___0~10; 26449#L3247-1 assume { :begin_inline_isIdle } true;havoc isIdle_#res;havoc isIdle_#t~ret53, isIdle_~retValue_acc~15, isIdle_~tmp~10;havoc isIdle_~retValue_acc~15;havoc isIdle_~tmp~10;assume { :begin_inline_anyStopRequested } true;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret48, anyStopRequested_#t~ret49, anyStopRequested_#t~ret50, anyStopRequested_#t~ret51, anyStopRequested_#t~ret52, anyStopRequested_~retValue_acc~14, anyStopRequested_~tmp~9, anyStopRequested_~tmp___0~3, anyStopRequested_~tmp___1~3, anyStopRequested_~tmp___2~0, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~14;havoc anyStopRequested_~tmp~9;havoc anyStopRequested_~tmp___0~3;havoc anyStopRequested_~tmp___1~3;havoc anyStopRequested_~tmp___2~0;havoc anyStopRequested_~tmp___3~0;assume { :begin_inline_isFloorCalling } true;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~23;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~23; 26450#L2517-122 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~23 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~23; 24638#L2544-122 anyStopRequested_#t~ret48 := isFloorCalling_#res;assume { :end_inline_isFloorCalling } true;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret48;havoc anyStopRequested_#t~ret48; 26126#L1211 assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~14 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~14; 26854#L1275 isIdle_#t~ret53 := anyStopRequested_#res;assume { :end_inline_anyStopRequested } true;isIdle_~tmp~10 := isIdle_#t~ret53;havoc isIdle_#t~ret53;isIdle_~retValue_acc~15 := (if 0 == isIdle_~tmp~10 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~15; 26855#L1288 cleanup_#t~ret157 := isIdle_#res;assume { :end_inline_isIdle } true;cleanup_~tmp~27 := cleanup_#t~ret157;havoc cleanup_#t~ret157; 27712#L3259 assume !(0 != cleanup_~tmp~27);assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret98, timeShift_~tmp~18;havoc timeShift_~tmp~18;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~10;havoc areDoorsOpen_~retValue_acc~10;areDoorsOpen_~retValue_acc~10 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~10; 27699#L1112-2 timeShift_#t~ret98 := areDoorsOpen_#res;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~18 := timeShift_#t~ret98;havoc timeShift_#t~ret98; 27700#L2061-2 assume 0 != timeShift_~tmp~18; 28824#L2062-3 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 28825#L2061-3 assume { :begin_inline___utac_acc__Specification9_spec__3 } true;havoc __utac_acc__Specification9_spec__3_#t~ret36, __utac_acc__Specification9_spec__3_#t~ret37, __utac_acc__Specification9_spec__3_#t~ret38, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~3, __utac_acc__Specification9_spec__3_~tmp___0~0, __utac_acc__Specification9_spec__3_~tmp___1~0;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~3;havoc __utac_acc__Specification9_spec__3_~tmp___0~0;havoc __utac_acc__Specification9_spec__3_~tmp___1~0;assume { :begin_inline_getCurrentFloorID } true;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~9;havoc getCurrentFloorID_~retValue_acc~9;getCurrentFloorID_~retValue_acc~9 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~9; 26817#L1103-5 __utac_acc__Specification9_spec__3_#t~ret36 := getCurrentFloorID_#res;assume { :end_inline_getCurrentFloorID } true;__utac_acc__Specification9_spec__3_~tmp~3 := __utac_acc__Specification9_spec__3_#t~ret36;havoc __utac_acc__Specification9_spec__3_#t~ret36;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~3;assume { :begin_inline_isEmpty } true;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~13;havoc isEmpty_~retValue_acc~13; 26818#L1163-25 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~13 := 0;isEmpty_#res := isEmpty_~retValue_acc~13; 28227#L1195-25 __utac_acc__Specification9_spec__3_#t~ret37 := isEmpty_#res;assume { :end_inline_isEmpty } true;__utac_acc__Specification9_spec__3_~tmp___1~0 := __utac_acc__Specification9_spec__3_#t~ret37;havoc __utac_acc__Specification9_spec__3_#t~ret37; 30188#L515-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~0);assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~10;havoc areDoorsOpen_~retValue_acc~10;areDoorsOpen_~retValue_acc~10 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~10; 27703#L1112-3 __utac_acc__Specification9_spec__3_#t~ret38 := areDoorsOpen_#res;assume { :end_inline_areDoorsOpen } true;__utac_acc__Specification9_spec__3_~tmp___0~0 := __utac_acc__Specification9_spec__3_#t~ret38;havoc __utac_acc__Specification9_spec__3_#t~ret38; 27704#L525-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___0~0); 30965#L525-3 assume { :end_inline___utac_acc__Specification9_spec__3 } true; 30733#L2079-1 assume { :end_inline_timeShift } true;cleanup_~i~3 := 1 + cleanup_~i~3; 25554#L3239-3 [2018-11-18 13:46:54,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:54,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1098668845, now seen corresponding path program 1 times [2018-11-18 13:46:54,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:46:54,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:46:54,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:54,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:54,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:54,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:55,091 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-18 13:46:55,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:46:55,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:46:55,092 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 13:46:55,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:55,092 INFO L82 PathProgramCache]: Analyzing trace with hash 382732996, now seen corresponding path program 1 times [2018-11-18 13:46:55,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:46:55,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:46:55,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:55,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:55,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:55,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:55,127 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-18 13:46:55,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:46:55,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 13:46:55,128 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 13:46:55,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 13:46:55,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 13:46:55,128 INFO L87 Difference]: Start difference. First operand 7079 states and 13296 transitions. cyclomatic complexity: 6218 Second operand 7 states. [2018-11-18 13:46:59,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:46:59,006 INFO L93 Difference]: Finished difference Result 13406 states and 25096 transitions. [2018-11-18 13:46:59,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-18 13:46:59,007 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13406 states and 25096 transitions. [2018-11-18 13:46:59,044 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10735 [2018-11-18 13:46:59,083 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13406 states to 13406 states and 25096 transitions. [2018-11-18 13:46:59,083 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13406 [2018-11-18 13:46:59,091 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13406 [2018-11-18 13:46:59,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13406 states and 25096 transitions. [2018-11-18 13:46:59,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:46:59,102 INFO L705 BuchiCegarLoop]: Abstraction has 13406 states and 25096 transitions. [2018-11-18 13:46:59,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13406 states and 25096 transitions. [2018-11-18 13:46:59,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13406 to 7044. [2018-11-18 13:46:59,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7044 states. [2018-11-18 13:46:59,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7044 states to 7044 states and 13221 transitions. [2018-11-18 13:46:59,202 INFO L728 BuchiCegarLoop]: Abstraction has 7044 states and 13221 transitions. [2018-11-18 13:46:59,202 INFO L608 BuchiCegarLoop]: Abstraction has 7044 states and 13221 transitions. [2018-11-18 13:46:59,202 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 13:46:59,202 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7044 states and 13221 transitions. [2018-11-18 13:46:59,216 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4408 [2018-11-18 13:46:59,216 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:46:59,216 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:46:59,218 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] [2018-11-18 13:46:59,218 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] [2018-11-18 13:46:59,218 INFO L794 eck$LassoCheckResult]: Stem: 49358#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call #t~string18.base, #t~string18.offset := #Ultimate.alloc(30);call #t~string19.base, #t~string19.offset := #Ultimate.alloc(9);call #t~string20.base, #t~string20.offset := #Ultimate.alloc(21);call #t~string21.base, #t~string21.offset := #Ultimate.alloc(30);call #t~string22.base, #t~string22.offset := #Ultimate.alloc(9);call #t~string23.base, #t~string23.offset := #Ultimate.alloc(21);call #t~string27.base, #t~string27.offset := #Ultimate.alloc(30);call #t~string28.base, #t~string28.offset := #Ultimate.alloc(9);call #t~string29.base, #t~string29.offset := #Ultimate.alloc(25);call #t~string30.base, #t~string30.offset := #Ultimate.alloc(30);call #t~string31.base, #t~string31.offset := #Ultimate.alloc(9);call #t~string32.base, #t~string32.offset := #Ultimate.alloc(25);call #t~string99.base, #t~string99.offset := #Ultimate.alloc(10);call #t~string101.base, #t~string101.offset := #Ultimate.alloc(4);#memory_int := #memory_int[#t~string101.base,#t~string101.offset := 91];#memory_int := #memory_int[#t~string101.base,1 + #t~string101.offset := 95];#memory_int := #memory_int[#t~string101.base,2 + #t~string101.offset := 93];#memory_int := #memory_int[#t~string101.base,3 + #t~string101.offset := 0];call #t~string103.base, #t~string103.offset := #Ultimate.alloc(4);#memory_int := #memory_int[#t~string103.base,#t~string103.offset := 91];#memory_int := #memory_int[#t~string103.base,1 + #t~string103.offset := 93];#memory_int := #memory_int[#t~string103.base,2 + #t~string103.offset := 32];#memory_int := #memory_int[#t~string103.base,3 + #t~string103.offset := 0];call #t~string105.base, #t~string105.offset := #Ultimate.alloc(5);#memory_int := #memory_int[#t~string105.base,#t~string105.offset := 32];#memory_int := #memory_int[#t~string105.base,1 + #t~string105.offset := 97];#memory_int := #memory_int[#t~string105.base,2 + #t~string105.offset := 116];#memory_int := #memory_int[#t~string105.base,3 + #t~string105.offset := 32];#memory_int := #memory_int[#t~string105.base,4 + #t~string105.offset := 0];call #t~string107.base, #t~string107.offset := #Ultimate.alloc(3);#memory_int := #memory_int[#t~string107.base,#t~string107.offset := 37];#memory_int := #memory_int[#t~string107.base,1 + #t~string107.offset := 105];#memory_int := #memory_int[#t~string107.base,2 + #t~string107.offset := 0];call #t~string109.base, #t~string109.offset := #Ultimate.alloc(10);call #t~string111.base, #t~string111.offset := #Ultimate.alloc(3);#memory_int := #memory_int[#t~string111.base,#t~string111.offset := 117];#memory_int := #memory_int[#t~string111.base,1 + #t~string111.offset := 112];#memory_int := #memory_int[#t~string111.base,2 + #t~string111.offset := 0];call #t~string113.base, #t~string113.offset := #Ultimate.alloc(5);#memory_int := #memory_int[#t~string113.base,#t~string113.offset := 100];#memory_int := #memory_int[#t~string113.base,1 + #t~string113.offset := 111];#memory_int := #memory_int[#t~string113.base,2 + #t~string113.offset := 119];#memory_int := #memory_int[#t~string113.base,3 + #t~string113.offset := 110];#memory_int := #memory_int[#t~string113.base,4 + #t~string113.offset := 0];call #t~string115.base, #t~string115.offset := #Ultimate.alloc(7);#memory_int := #memory_int[#t~string115.base,#t~string115.offset := 32];#memory_int := #memory_int[#t~string115.base,1 + #t~string115.offset := 73];#memory_int := #memory_int[#t~string115.base,2 + #t~string115.offset := 76];#memory_int := #memory_int[#t~string115.base,3 + #t~string115.offset := 95];#memory_int := #memory_int[#t~string115.base,4 + #t~string115.offset := 112];#memory_int := #memory_int[#t~string115.base,5 + #t~string115.offset := 58];#memory_int := #memory_int[#t~string115.base,6 + #t~string115.offset := 0];call #t~string117.base, #t~string117.offset := #Ultimate.alloc(4);#memory_int := #memory_int[#t~string117.base,#t~string117.offset := 32];#memory_int := #memory_int[#t~string117.base,1 + #t~string117.offset := 37];#memory_int := #memory_int[#t~string117.base,2 + #t~string117.offset := 105];#memory_int := #memory_int[#t~string117.base,3 + #t~string117.offset := 0];call #t~string119.base, #t~string119.offset := #Ultimate.alloc(4);#memory_int := #memory_int[#t~string119.base,#t~string119.offset := 32];#memory_int := #memory_int[#t~string119.base,1 + #t~string119.offset := 37];#memory_int := #memory_int[#t~string119.base,2 + #t~string119.offset := 105];#memory_int := #memory_int[#t~string119.base,3 + #t~string119.offset := 0];call #t~string121.base, #t~string121.offset := #Ultimate.alloc(4);#memory_int := #memory_int[#t~string121.base,#t~string121.offset := 32];#memory_int := #memory_int[#t~string121.base,1 + #t~string121.offset := 37];#memory_int := #memory_int[#t~string121.base,2 + #t~string121.offset := 105];#memory_int := #memory_int[#t~string121.base,3 + #t~string121.offset := 0];call #t~string123.base, #t~string123.offset := #Ultimate.alloc(4);#memory_int := #memory_int[#t~string123.base,#t~string123.offset := 32];#memory_int := #memory_int[#t~string123.base,1 + #t~string123.offset := 37];#memory_int := #memory_int[#t~string123.base,2 + #t~string123.offset := 105];#memory_int := #memory_int[#t~string123.base,3 + #t~string123.offset := 0];call #t~string125.base, #t~string125.offset := #Ultimate.alloc(4);#memory_int := #memory_int[#t~string125.base,#t~string125.offset := 32];#memory_int := #memory_int[#t~string125.base,1 + #t~string125.offset := 37];#memory_int := #memory_int[#t~string125.base,2 + #t~string125.offset := 105];#memory_int := #memory_int[#t~string125.base,3 + #t~string125.offset := 0];call #t~string127.base, #t~string127.offset := #Ultimate.alloc(6);#memory_int := #memory_int[#t~string127.base,#t~string127.offset := 32];#memory_int := #memory_int[#t~string127.base,1 + #t~string127.offset := 70];#memory_int := #memory_int[#t~string127.base,2 + #t~string127.offset := 95];#memory_int := #memory_int[#t~string127.base,3 + #t~string127.offset := 112];#memory_int := #memory_int[#t~string127.base,4 + #t~string127.offset := 58];#memory_int := #memory_int[#t~string127.base,5 + #t~string127.offset := 0];call #t~string130.base, #t~string130.offset := #Ultimate.alloc(4);#memory_int := #memory_int[#t~string130.base,#t~string130.offset := 32];#memory_int := #memory_int[#t~string130.base,1 + #t~string130.offset := 37];#memory_int := #memory_int[#t~string130.base,2 + #t~string130.offset := 105];#memory_int := #memory_int[#t~string130.base,3 + #t~string130.offset := 0];call #t~string133.base, #t~string133.offset := #Ultimate.alloc(4);#memory_int := #memory_int[#t~string133.base,#t~string133.offset := 32];#memory_int := #memory_int[#t~string133.base,1 + #t~string133.offset := 37];#memory_int := #memory_int[#t~string133.base,2 + #t~string133.offset := 105];#memory_int := #memory_int[#t~string133.base,3 + #t~string133.offset := 0];call #t~string136.base, #t~string136.offset := #Ultimate.alloc(4);#memory_int := #memory_int[#t~string136.base,#t~string136.offset := 32];#memory_int := #memory_int[#t~string136.base,1 + #t~string136.offset := 37];#memory_int := #memory_int[#t~string136.base,2 + #t~string136.offset := 105];#memory_int := #memory_int[#t~string136.base,3 + #t~string136.offset := 0];call #t~string139.base, #t~string139.offset := #Ultimate.alloc(4);#memory_int := #memory_int[#t~string139.base,#t~string139.offset := 32];#memory_int := #memory_int[#t~string139.base,1 + #t~string139.offset := 37];#memory_int := #memory_int[#t~string139.base,2 + #t~string139.offset := 105];#memory_int := #memory_int[#t~string139.base,3 + #t~string139.offset := 0];call #t~string142.base, #t~string142.offset := #Ultimate.alloc(4);#memory_int := #memory_int[#t~string142.base,#t~string142.offset := 32];#memory_int := #memory_int[#t~string142.base,1 + #t~string142.offset := 37];#memory_int := #memory_int[#t~string142.base,2 + #t~string142.offset := 105];#memory_int := #memory_int[#t~string142.base,3 + #t~string142.offset := 0];call #t~string144.base, #t~string144.offset := #Ultimate.alloc(2);#memory_int := #memory_int[#t~string144.base,#t~string144.offset := 10];#memory_int := #memory_int[#t~string144.base,1 + #t~string144.offset := 0];call #t~string147.base, #t~string147.offset := #Ultimate.alloc(9);~weight~0 := 0;~maximumWeight~0 := 100;~blocked~0 := 0;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0;~cleanupTimeShifts~0 := 12;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0;~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; 49359#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret162, main_~retValue_acc~27, main_~tmp~29;havoc main_~retValue_acc~27;havoc main_~tmp~29;assume { :begin_inline_select_helpers } true; 46911#L430 assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; 45716#L423 assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res;havoc valid_product_~retValue_acc~4;havoc valid_product_~retValue_acc~4;valid_product_~retValue_acc~4 := 1;valid_product_#res := valid_product_~retValue_acc~4; 45717#L438 main_#t~ret162 := valid_product_#res;assume { :end_inline_valid_product } true;main_~tmp~29 := main_#t~ret162;havoc main_#t~ret162; 50397#L3432 assume 0 != main_~tmp~29;assume { :begin_inline_setup } true; 48389#L3407 assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline___utac_acc__Specification9_spec__1 } true;~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; 48390#L472 assume { :end_inline___utac_acc__Specification9_spec__1 } true;assume { :begin_inline_test } true;assume { :begin_inline_bigMacCall } true;havoc bigMacCall_#t~ret155, bigMacCall_~tmp~26;havoc bigMacCall_~tmp~26;assume { :begin_inline_getOrigin } true;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~6;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~6; 45210#L775 assume 0 == getOrigin_~person;getOrigin_~retValue_acc~6 := 4;getOrigin_#res := getOrigin_~retValue_acc~6; 45211#L800 bigMacCall_#t~ret155 := getOrigin_#res;assume { :end_inline_getOrigin } true;bigMacCall_~tmp~26 := bigMacCall_#t~ret155;havoc bigMacCall_#t~ret155;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~26;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 48517#L2788 assume 0 == initPersonOnFloor_~floor; 48249#L2789 assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 45218#L2896-1 assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 47024#L2580 assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 49010#L2592-2 assume { :end_inline_callOnFloor } true; 49067#L2932 assume { :end_inline_initPersonOnFloor } true; 48015#L3212 assume { :end_inline_bigMacCall } true;assume { :begin_inline_cleanup } true;havoc cleanup_#t~ret156, cleanup_#t~ret157, cleanup_~i~3, cleanup_~tmp~27, cleanup_~tmp___0~10, cleanup_~__cil_tmp4~3;havoc cleanup_~i~3;havoc cleanup_~tmp~27;havoc cleanup_~tmp___0~10;havoc cleanup_~__cil_tmp4~3;assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret98, timeShift_~tmp~18;havoc timeShift_~tmp~18;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~10;havoc areDoorsOpen_~retValue_acc~10;areDoorsOpen_~retValue_acc~10 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~10; 48016#L1112 timeShift_#t~ret98 := areDoorsOpen_#res;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~18 := timeShift_#t~ret98;havoc timeShift_#t~ret98; 48695#L2061 assume 0 != timeShift_~tmp~18; 49684#L2062 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 49685#L2061-1 assume { :begin_inline___utac_acc__Specification9_spec__3 } true;havoc __utac_acc__Specification9_spec__3_#t~ret36, __utac_acc__Specification9_spec__3_#t~ret37, __utac_acc__Specification9_spec__3_#t~ret38, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~3, __utac_acc__Specification9_spec__3_~tmp___0~0, __utac_acc__Specification9_spec__3_~tmp___1~0;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~3;havoc __utac_acc__Specification9_spec__3_~tmp___0~0;havoc __utac_acc__Specification9_spec__3_~tmp___1~0;assume { :begin_inline_getCurrentFloorID } true;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~9;havoc getCurrentFloorID_~retValue_acc~9;getCurrentFloorID_~retValue_acc~9 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~9; 47630#L1103-2 __utac_acc__Specification9_spec__3_#t~ret36 := getCurrentFloorID_#res;assume { :end_inline_getCurrentFloorID } true;__utac_acc__Specification9_spec__3_~tmp~3 := __utac_acc__Specification9_spec__3_#t~ret36;havoc __utac_acc__Specification9_spec__3_#t~ret36;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~3;assume { :begin_inline_isEmpty } true;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~13;havoc isEmpty_~retValue_acc~13; 47631#L1163-12 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~13 := 0;isEmpty_#res := isEmpty_~retValue_acc~13; 48899#L1195-12 __utac_acc__Specification9_spec__3_#t~ret37 := isEmpty_#res;assume { :end_inline_isEmpty } true;__utac_acc__Specification9_spec__3_~tmp___1~0 := __utac_acc__Specification9_spec__3_#t~ret37;havoc __utac_acc__Specification9_spec__3_#t~ret37; 47097#L515 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~0);assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~10;havoc areDoorsOpen_~retValue_acc~10;areDoorsOpen_~retValue_acc~10 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~10; 47098#L1112-1 __utac_acc__Specification9_spec__3_#t~ret38 := areDoorsOpen_#res;assume { :end_inline_areDoorsOpen } true;__utac_acc__Specification9_spec__3_~tmp___0~0 := __utac_acc__Specification9_spec__3_#t~ret38;havoc __utac_acc__Specification9_spec__3_#t~ret38; 48696#L525 assume 0 != __utac_acc__Specification9_spec__3_~tmp___0~0; 50394#L526 assume 0 == __utac_acc__Specification9_spec__3_~floor~0; 50299#L527 assume 0 != ~floorButtons_spc9_0~0;~floorButtons_spc9_0~0 := 0; 49251#L525-1 assume { :end_inline___utac_acc__Specification9_spec__3 } true; 48649#L2079 assume { :end_inline_timeShift } true;cleanup_~i~3 := 0; 46116#L3239-3 [2018-11-18 13:46:59,218 INFO L796 eck$LassoCheckResult]: Loop: 46116#L3239-3 assume true; 46117#L3239-1 assume !false; 45975#L3240 cleanup_~__cil_tmp4~3 := ~cleanupTimeShifts~0 - 1; 45502#L3243 assume cleanup_~i~3 < cleanup_~__cil_tmp4~3;assume { :begin_inline_isBlocked } true;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~8;havoc isBlocked_~retValue_acc~8;isBlocked_~retValue_acc~8 := ~blocked~0;isBlocked_#res := isBlocked_~retValue_acc~8; 45503#L926 cleanup_#t~ret156 := isBlocked_#res;assume { :end_inline_isBlocked } true;cleanup_~tmp___0~10 := cleanup_#t~ret156;havoc cleanup_#t~ret156; 50778#L3247 assume 1 != cleanup_~tmp___0~10; 50777#L3247-1 assume { :begin_inline_isIdle } true;havoc isIdle_#res;havoc isIdle_#t~ret53, isIdle_~retValue_acc~15, isIdle_~tmp~10;havoc isIdle_~retValue_acc~15;havoc isIdle_~tmp~10;assume { :begin_inline_anyStopRequested } true;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret48, anyStopRequested_#t~ret49, anyStopRequested_#t~ret50, anyStopRequested_#t~ret51, anyStopRequested_#t~ret52, anyStopRequested_~retValue_acc~14, anyStopRequested_~tmp~9, anyStopRequested_~tmp___0~3, anyStopRequested_~tmp___1~3, anyStopRequested_~tmp___2~0, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~14;havoc anyStopRequested_~tmp~9;havoc anyStopRequested_~tmp___0~3;havoc anyStopRequested_~tmp___1~3;havoc anyStopRequested_~tmp___2~0;havoc anyStopRequested_~tmp___3~0;assume { :begin_inline_isFloorCalling } true;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~23;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~23; 50766#L2517-122 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~23 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~23; 50763#L2544-122 anyStopRequested_#t~ret48 := isFloorCalling_#res;assume { :end_inline_isFloorCalling } true;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret48;havoc anyStopRequested_#t~ret48; 50760#L1211 assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~14 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~14; 47805#L1275 isIdle_#t~ret53 := anyStopRequested_#res;assume { :end_inline_anyStopRequested } true;isIdle_~tmp~10 := isIdle_#t~ret53;havoc isIdle_#t~ret53;isIdle_~retValue_acc~15 := (if 0 == isIdle_~tmp~10 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~15; 47806#L1288 cleanup_#t~ret157 := isIdle_#res;assume { :end_inline_isIdle } true;cleanup_~tmp~27 := cleanup_#t~ret157;havoc cleanup_#t~ret157; 48715#L3259 assume !(0 != cleanup_~tmp~27);assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret98, timeShift_~tmp~18;havoc timeShift_~tmp~18;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~10;havoc areDoorsOpen_~retValue_acc~10;areDoorsOpen_~retValue_acc~10 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~10; 48701#L1112-2 timeShift_#t~ret98 := areDoorsOpen_#res;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~18 := timeShift_#t~ret98;havoc timeShift_#t~ret98; 48702#L2061-2 assume 0 != timeShift_~tmp~18; 49688#L2062-3 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 49689#L2061-3 assume { :begin_inline___utac_acc__Specification9_spec__3 } true;havoc __utac_acc__Specification9_spec__3_#t~ret36, __utac_acc__Specification9_spec__3_#t~ret37, __utac_acc__Specification9_spec__3_#t~ret38, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~3, __utac_acc__Specification9_spec__3_~tmp___0~0, __utac_acc__Specification9_spec__3_~tmp___1~0;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~3;havoc __utac_acc__Specification9_spec__3_~tmp___0~0;havoc __utac_acc__Specification9_spec__3_~tmp___1~0;assume { :begin_inline_getCurrentFloorID } true;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~9;havoc getCurrentFloorID_~retValue_acc~9;getCurrentFloorID_~retValue_acc~9 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~9; 47643#L1103-5 __utac_acc__Specification9_spec__3_#t~ret36 := getCurrentFloorID_#res;assume { :end_inline_getCurrentFloorID } true;__utac_acc__Specification9_spec__3_~tmp~3 := __utac_acc__Specification9_spec__3_#t~ret36;havoc __utac_acc__Specification9_spec__3_#t~ret36;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~3;assume { :begin_inline_isEmpty } true;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~13;havoc isEmpty_~retValue_acc~13; 47644#L1163-25 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~13 := 0;isEmpty_#res := isEmpty_~retValue_acc~13; 51469#L1195-25 __utac_acc__Specification9_spec__3_#t~ret37 := isEmpty_#res;assume { :end_inline_isEmpty } true;__utac_acc__Specification9_spec__3_~tmp___1~0 := __utac_acc__Specification9_spec__3_#t~ret37;havoc __utac_acc__Specification9_spec__3_#t~ret37; 51468#L515-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~0);assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~10;havoc areDoorsOpen_~retValue_acc~10;areDoorsOpen_~retValue_acc~10 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~10; 51466#L1112-3 __utac_acc__Specification9_spec__3_#t~ret38 := areDoorsOpen_#res;assume { :end_inline_areDoorsOpen } true;__utac_acc__Specification9_spec__3_~tmp___0~0 := __utac_acc__Specification9_spec__3_#t~ret38;havoc __utac_acc__Specification9_spec__3_#t~ret38; 51467#L525-2 assume 0 != __utac_acc__Specification9_spec__3_~tmp___0~0; 50395#L526-1 assume 0 == __utac_acc__Specification9_spec__3_~floor~0; 50396#L527-2 assume 0 != ~floorButtons_spc9_0~0;~floorButtons_spc9_0~0 := 0; 51463#L525-3 assume { :end_inline___utac_acc__Specification9_spec__3 } true; 48626#L2079-1 assume { :end_inline_timeShift } true;cleanup_~i~3 := 1 + cleanup_~i~3; 46116#L3239-3 [2018-11-18 13:46:59,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:59,218 INFO L82 PathProgramCache]: Analyzing trace with hash -799820014, now seen corresponding path program 1 times [2018-11-18 13:46:59,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:46:59,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:46:59,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:59,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:59,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:59,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:59,931 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-18 13:46:59,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:46:59,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:46:59,931 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 13:46:59,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:59,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1618866039, now seen corresponding path program 1 times [2018-11-18 13:46:59,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:46:59,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:46:59,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:59,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:59,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:59,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:46:59,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:47:00,090 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 92 [2018-11-18 13:47:00,248 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 86 [2018-11-18 13:47:00,254 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:47:00,255 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:47:00,255 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:47:00,255 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:47:00,256 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 13:47:00,256 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:47:00,256 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:47:00,256 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:47:00,256 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec9_product30_false-unreach-call_true-termination.cil.c_Iteration3_Loop [2018-11-18 13:47:00,256 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:47:00,256 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:47:00,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:47:00,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:47:00,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:47:00,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:47:00,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:47:00,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:47:00,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:47:00,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:47:00,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:47:00,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:47:00,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-18 13:47:00,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-18 13:47:00,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-18 13:47:00,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:47:00,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:47:00,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:47:00,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:47:00,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-18 13:47:00,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:47:00,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-18 13:47:00,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:47:00,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:47:00,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-18 13:47:00,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:47:00,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:47:00,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:47:00,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:47:00,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-18 13:47:00,698 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:47:00,699 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eaa54a5e-2340-437a-a3ed-af79e41f8ee5/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-18 13:47:00,703 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:47:00,703 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:47:00,709 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:47:00,709 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_cleanup_#t~ret157=0} Honda state: {ULTIMATE.start_cleanup_#t~ret157=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eaa54a5e-2340-437a-a3ed-af79e41f8ee5/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-18 13:47:00,731 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:47:00,731 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eaa54a5e-2340-437a-a3ed-af79e41f8ee5/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-18 13:47:00,764 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 13:47:00,764 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:47:12,791 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2018-11-18 13:47:12,794 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:47:12,794 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:47:12,794 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:47:12,794 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:47:12,794 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 13:47:12,794 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:47:12,794 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:47:12,794 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:47:12,795 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec9_product30_false-unreach-call_true-termination.cil.c_Iteration3_Loop [2018-11-18 13:47:12,795 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:47:12,795 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:47:12,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:47:12,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:47:12,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-18 13:47:12,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-18 13:47:12,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-18 13:47:12,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-18 13:47:12,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:47:12,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-18 13:47:12,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:47:12,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:47:12,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:47:12,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-18 13:47:12,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-18 13:47:12,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:47:12,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-18 13:47:12,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-18 13:47:12,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:47:12,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:47:12,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:47:12,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:47:12,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:47:12,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:47:12,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:47:12,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:47:12,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:47:12,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:47:12,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:47:12,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:47:13,123 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-18 13:47:13,287 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:47:13,296 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 13:47:13,297 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-18 13:47:13,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:47:13,301 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:47:13,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:47:13,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:47:13,301 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:47:13,303 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:47:13,303 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:47:13,305 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:47:13,305 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-18 13:47:13,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:47:13,305 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:47:13,306 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:47:13,306 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:47:13,306 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:47:13,310 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:47:13,310 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:47:13,311 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:47:13,312 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-18 13:47:13,312 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:47:13,312 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:47:13,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:47:13,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:47:13,313 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:47:13,313 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:47:13,313 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:47:13,314 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:47:13,314 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-18 13:47:13,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:47:13,318 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:47:13,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:47:13,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:47:13,319 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:47:13,319 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:47:13,319 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:47:13,320 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:47:13,320 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-18 13:47:13,320 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:47:13,320 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:47:13,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:47:13,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:47:13,321 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:47:13,321 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:47:13,321 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:47:13,326 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:47:13,326 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-18 13:47:13,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:47:13,327 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:47:13,327 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:47:13,327 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:47:13,327 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:47:13,328 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:47:13,328 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:47:13,329 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:47:13,329 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-18 13:47:13,329 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:47:13,329 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:47:13,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:47:13,330 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 13:47:13,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:47:13,331 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:47:13,331 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:47:13,337 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:47:13,337 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-18 13:47:13,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:47:13,338 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:47:13,338 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:47:13,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:47:13,338 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:47:13,339 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:47:13,339 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:47:13,340 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:47:13,340 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:47:13,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:47:13,341 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:47:13,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:47:13,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:47:13,341 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:47:13,341 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:47:13,342 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:47:13,342 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:47:13,342 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-18 13:47:13,343 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:47:13,343 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:47:13,343 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:47:13,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:47:13,343 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:47:13,343 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:47:13,344 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:47:13,351 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 13:47:13,358 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 13:47:13,358 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 13:47:13,359 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 13:47:13,359 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 13:47:13,360 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 13:47:13,360 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~cleanupTimeShifts~0, ULTIMATE.start_cleanup_~i~3) = 1*~cleanupTimeShifts~0 - 1*ULTIMATE.start_cleanup_~i~3 Supporting invariants [] [2018-11-18 13:47:13,361 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 13:47:13,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:47:13,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:47:13,489 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:47:13,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:47:13,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:47:13,563 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-18 13:47:13,566 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-18 13:47:13,567 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7044 states and 13221 transitions. cyclomatic complexity: 6178 Second operand 5 states. [2018-11-18 13:47:14,023 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7044 states and 13221 transitions. cyclomatic complexity: 6178. Second operand 5 states. Result 11452 states and 21494 transitions. Complement of second has 8 states. [2018-11-18 13:47:14,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-18 13:47:14,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 13:47:14,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10039 transitions. [2018-11-18 13:47:14,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10039 transitions. Stem has 31 letters. Loop has 27 letters. [2018-11-18 13:47:14,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:47:14,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10039 transitions. Stem has 58 letters. Loop has 27 letters. [2018-11-18 13:47:14,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:47:14,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10039 transitions. Stem has 31 letters. Loop has 54 letters. [2018-11-18 13:47:14,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:47:14,037 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11452 states and 21494 transitions. [2018-11-18 13:47:14,081 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 13:47:14,081 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11452 states to 0 states and 0 transitions. [2018-11-18 13:47:14,081 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 13:47:14,081 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 13:47:14,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 13:47:14,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:47:14,082 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 13:47:14,082 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 13:47:14,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:47:14,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:47:14,082 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2018-11-18 13:47:14,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:47:14,082 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-18 13:47:14,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 13:47:14,082 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-18 13:47:14,083 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 13:47:14,083 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 13:47:14,083 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 13:47:14,083 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 13:47:14,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 13:47:14,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:47:14,083 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 13:47:14,083 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 13:47:14,083 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 13:47:14,083 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 13:47:14,083 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 13:47:14,083 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 13:47:14,084 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 13:47:14,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 01:47:14 BoogieIcfgContainer [2018-11-18 13:47:14,089 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 13:47:14,089 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 13:47:14,089 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 13:47:14,089 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 13:47:14,090 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:46:51" (3/4) ... [2018-11-18 13:47:14,094 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 13:47:14,094 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 13:47:14,095 INFO L168 Benchmark]: Toolchain (without parser) took 30719.85 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 734.5 MB). Free memory was 955.5 MB in the beginning and 1.3 GB in the end (delta: -311.8 MB). Peak memory consumption was 422.7 MB. Max. memory is 11.5 GB. [2018-11-18 13:47:14,096 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:47:14,096 INFO L168 Benchmark]: CACSL2BoogieTranslator took 564.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 955.5 MB in the beginning and 1.1 GB in the end (delta: -175.3 MB). Peak memory consumption was 61.0 MB. Max. memory is 11.5 GB. [2018-11-18 13:47:14,096 INFO L168 Benchmark]: Boogie Procedure Inliner took 229.62 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: 73.0 MB). Peak memory consumption was 73.0 MB. Max. memory is 11.5 GB. [2018-11-18 13:47:14,097 INFO L168 Benchmark]: Boogie Preprocessor took 259.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 977.5 MB in the end (delta: 77.5 MB). Peak memory consumption was 77.5 MB. Max. memory is 11.5 GB. [2018-11-18 13:47:14,097 INFO L168 Benchmark]: RCFGBuilder took 7375.49 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 306.7 MB). Free memory was 977.5 MB in the beginning and 1.1 GB in the end (delta: -100.3 MB). Peak memory consumption was 462.6 MB. Max. memory is 11.5 GB. [2018-11-18 13:47:14,097 INFO L168 Benchmark]: BuchiAutomizer took 22283.64 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 270.0 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -189.5 MB). Peak memory consumption was 80.5 MB. Max. memory is 11.5 GB. [2018-11-18 13:47:14,098 INFO L168 Benchmark]: Witness Printer took 5.16 ms. Allocated memory is still 1.8 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:47:14,101 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 564.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 955.5 MB in the beginning and 1.1 GB in the end (delta: -175.3 MB). Peak memory consumption was 61.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 229.62 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: 73.0 MB). Peak memory consumption was 73.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 259.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 977.5 MB in the end (delta: 77.5 MB). Peak memory consumption was 77.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 7375.49 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 306.7 MB). Free memory was 977.5 MB in the beginning and 1.1 GB in the end (delta: -100.3 MB). Peak memory consumption was 462.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 22283.64 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 270.0 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -189.5 MB). Peak memory consumption was 80.5 MB. Max. memory is 11.5 GB. * Witness Printer took 5.16 ms. Allocated memory is still 1.8 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function cleanupTimeShifts + -1 * i and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 22.2s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 15.8s. Construction of modules took 3.9s. Büchi inclusion checks took 1.5s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.2s AutomataMinimizationTime, 2 MinimizatonAttempts, 16742 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had 7079 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 45737 SDtfs, 88000 SDslu, 103501 SDs, 0 SdLazy, 267 SolverSat, 284 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.9s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI2 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital121 mio100 ax100 hnf100 lsp14 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq211 hnf89 smp100 dnf176 smp100 tf103 neg96 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 0 VariablesLoop: 5 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 1 LassoNonterminationAnalysisTime: 12.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...