./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/product-lines/elevator_spec9_product26_false-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f1f97b6a-77d8-4157-9007-6f87c4d542a3/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f1f97b6a-77d8-4157-9007-6f87c4d542a3/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f1f97b6a-77d8-4157-9007-6f87c4d542a3/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f1f97b6a-77d8-4157-9007-6f87c4d542a3/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/product-lines/elevator_spec9_product26_false-unreach-call_true-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_f1f97b6a-77d8-4157-9007-6f87c4d542a3/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f1f97b6a-77d8-4157-9007-6f87c4d542a3/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 6918e197f4f4b34e9e598cdd0f1a12bdba0c59a1 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 10:42:57,613 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 10:42:57,615 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 10:42:57,622 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 10:42:57,622 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 10:42:57,623 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 10:42:57,623 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 10:42:57,624 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 10:42:57,625 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 10:42:57,626 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 10:42:57,627 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 10:42:57,627 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 10:42:57,628 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 10:42:57,628 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 10:42:57,629 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 10:42:57,630 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 10:42:57,631 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 10:42:57,632 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 10:42:57,633 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 10:42:57,634 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 10:42:57,635 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 10:42:57,636 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 10:42:57,638 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 10:42:57,638 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 10:42:57,638 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 10:42:57,638 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 10:42:57,639 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 10:42:57,640 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 10:42:57,640 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 10:42:57,641 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 10:42:57,641 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 10:42:57,642 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 10:42:57,642 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 10:42:57,642 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 10:42:57,643 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 10:42:57,643 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 10:42:57,644 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f1f97b6a-77d8-4157-9007-6f87c4d542a3/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-28 10:42:57,654 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 10:42:57,654 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 10:42:57,655 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 10:42:57,655 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 10:42:57,655 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 10:42:57,655 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 10:42:57,656 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 10:42:57,656 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 10:42:57,656 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 10:42:57,656 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 10:42:57,656 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 10:42:57,656 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 10:42:57,656 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 10:42:57,656 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 10:42:57,657 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 10:42:57,657 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 10:42:57,657 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 10:42:57,657 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 10:42:57,657 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 10:42:57,657 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 10:42:57,657 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 10:42:57,657 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 10:42:57,658 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 10:42:57,658 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 10:42:57,658 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 10:42:57,658 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 10:42:57,658 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 10:42:57,658 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 10:42:57,658 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 10:42:57,659 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 10:42:57,659 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 10:42:57,659 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 10:42:57,659 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_f1f97b6a-77d8-4157-9007-6f87c4d542a3/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 -> 6918e197f4f4b34e9e598cdd0f1a12bdba0c59a1 [2018-11-28 10:42:57,682 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 10:42:57,691 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 10:42:57,693 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 10:42:57,694 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 10:42:57,694 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 10:42:57,695 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f1f97b6a-77d8-4157-9007-6f87c4d542a3/bin-2019/uautomizer/../../sv-benchmarks/c/product-lines/elevator_spec9_product26_false-unreach-call_true-termination.cil.c [2018-11-28 10:42:57,736 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f1f97b6a-77d8-4157-9007-6f87c4d542a3/bin-2019/uautomizer/data/d07a12567/d64c4793b4204271a3beb90587bb8367/FLAGfe3b1722d [2018-11-28 10:42:58,174 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 10:42:58,174 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f1f97b6a-77d8-4157-9007-6f87c4d542a3/sv-benchmarks/c/product-lines/elevator_spec9_product26_false-unreach-call_true-termination.cil.c [2018-11-28 10:42:58,188 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f1f97b6a-77d8-4157-9007-6f87c4d542a3/bin-2019/uautomizer/data/d07a12567/d64c4793b4204271a3beb90587bb8367/FLAGfe3b1722d [2018-11-28 10:42:58,200 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f1f97b6a-77d8-4157-9007-6f87c4d542a3/bin-2019/uautomizer/data/d07a12567/d64c4793b4204271a3beb90587bb8367 [2018-11-28 10:42:58,202 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 10:42:58,203 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 10:42:58,204 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 10:42:58,204 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 10:42:58,207 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 10:42:58,207 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:42:58" (1/1) ... [2018-11-28 10:42:58,209 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59b6a12e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:42:58, skipping insertion in model container [2018-11-28 10:42:58,209 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:42:58" (1/1) ... [2018-11-28 10:42:58,213 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 10:42:58,255 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 10:42:58,664 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 10:42:58,676 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 10:42:58,763 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 10:42:58,794 INFO L195 MainTranslator]: Completed translation [2018-11-28 10:42:58,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:42:58 WrapperNode [2018-11-28 10:42:58,795 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 10:42:58,795 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 10:42:58,795 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 10:42:58,796 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 10:42:58,801 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:42:58" (1/1) ... [2018-11-28 10:42:58,822 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:42:58" (1/1) ... [2018-11-28 10:42:58,951 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 10:42:58,952 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 10:42:58,952 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 10:42:58,952 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 10:42:58,958 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:42:58" (1/1) ... [2018-11-28 10:42:58,958 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:42:58" (1/1) ... [2018-11-28 10:42:58,977 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:42:58" (1/1) ... [2018-11-28 10:42:58,977 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:42:58" (1/1) ... [2018-11-28 10:42:59,026 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:42:58" (1/1) ... [2018-11-28 10:42:59,069 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:42:58" (1/1) ... [2018-11-28 10:42:59,087 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:42:58" (1/1) ... [2018-11-28 10:42:59,111 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 10:42:59,111 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 10:42:59,111 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 10:42:59,111 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 10:42:59,112 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:42:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f1f97b6a-77d8-4157-9007-6f87c4d542a3/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-28 10:42:59,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 10:42:59,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-11-28 10:42:59,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 10:42:59,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 10:43:04,391 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 10:43:04,392 INFO L280 CfgBuilder]: Removed 1113 assue(true) statements. [2018-11-28 10:43:04,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:43:04 BoogieIcfgContainer [2018-11-28 10:43:04,392 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 10:43:04,392 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 10:43:04,393 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 10:43:04,394 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 10:43:04,395 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 10:43:04,395 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 10:42:58" (1/3) ... [2018-11-28 10:43:04,396 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4328a062 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 10:43:04, skipping insertion in model container [2018-11-28 10:43:04,396 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 10:43:04,396 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:42:58" (2/3) ... [2018-11-28 10:43:04,396 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4328a062 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 10:43:04, skipping insertion in model container [2018-11-28 10:43:04,396 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 10:43:04,397 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:43:04" (3/3) ... [2018-11-28 10:43:04,398 INFO L375 chiAutomizerObserver]: Analyzing ICFG elevator_spec9_product26_false-unreach-call_true-termination.cil.c [2018-11-28 10:43:04,433 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 10:43:04,434 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 10:43:04,434 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 10:43:04,434 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 10:43:04,434 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 10:43:04,434 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 10:43:04,435 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 10:43:04,435 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 10:43:04,435 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 10:43:04,477 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4855 states. [2018-11-28 10:43:04,540 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2417 [2018-11-28 10:43:04,540 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:43:04,540 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:43:04,550 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] [2018-11-28 10:43:04,550 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] [2018-11-28 10:43:04,550 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 10:43:04,550 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4855 states. [2018-11-28 10:43:04,575 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2417 [2018-11-28 10:43:04,575 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:43:04,575 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:43:04,577 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] [2018-11-28 10:43:04,577 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] [2018-11-28 10:43:04,581 INFO L794 eck$LassoCheckResult]: Stem: 2215#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string18.base, #t~string18.offset := #Ultimate.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);~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;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0;call #t~string85.base, #t~string85.offset := #Ultimate.alloc(10);call #t~string87.base, #t~string87.offset := #Ultimate.alloc(4);call write~init~int(91, #t~string87.base, #t~string87.offset, 1);call write~init~int(95, #t~string87.base, 1 + #t~string87.offset, 1);call write~init~int(93, #t~string87.base, 2 + #t~string87.offset, 1);call write~init~int(0, #t~string87.base, 3 + #t~string87.offset, 1);call #t~string89.base, #t~string89.offset := #Ultimate.alloc(4);call write~init~int(91, #t~string89.base, #t~string89.offset, 1);call write~init~int(93, #t~string89.base, 1 + #t~string89.offset, 1);call write~init~int(32, #t~string89.base, 2 + #t~string89.offset, 1);call write~init~int(0, #t~string89.base, 3 + #t~string89.offset, 1);call #t~string91.base, #t~string91.offset := #Ultimate.alloc(5);call write~init~int(32, #t~string91.base, #t~string91.offset, 1);call write~init~int(97, #t~string91.base, 1 + #t~string91.offset, 1);call write~init~int(116, #t~string91.base, 2 + #t~string91.offset, 1);call write~init~int(32, #t~string91.base, 3 + #t~string91.offset, 1);call write~init~int(0, #t~string91.base, 4 + #t~string91.offset, 1);call #t~string93.base, #t~string93.offset := #Ultimate.alloc(3);call write~init~int(37, #t~string93.base, #t~string93.offset, 1);call write~init~int(105, #t~string93.base, 1 + #t~string93.offset, 1);call write~init~int(0, #t~string93.base, 2 + #t~string93.offset, 1);call #t~string95.base, #t~string95.offset := #Ultimate.alloc(10);call #t~string97.base, #t~string97.offset := #Ultimate.alloc(3);call write~init~int(117, #t~string97.base, #t~string97.offset, 1);call write~init~int(112, #t~string97.base, 1 + #t~string97.offset, 1);call write~init~int(0, #t~string97.base, 2 + #t~string97.offset, 1);call #t~string99.base, #t~string99.offset := #Ultimate.alloc(5);call write~init~int(100, #t~string99.base, #t~string99.offset, 1);call write~init~int(111, #t~string99.base, 1 + #t~string99.offset, 1);call write~init~int(119, #t~string99.base, 2 + #t~string99.offset, 1);call write~init~int(110, #t~string99.base, 3 + #t~string99.offset, 1);call write~init~int(0, #t~string99.base, 4 + #t~string99.offset, 1);call #t~string101.base, #t~string101.offset := #Ultimate.alloc(7);call write~init~int(32, #t~string101.base, #t~string101.offset, 1);call write~init~int(73, #t~string101.base, 1 + #t~string101.offset, 1);call write~init~int(76, #t~string101.base, 2 + #t~string101.offset, 1);call write~init~int(95, #t~string101.base, 3 + #t~string101.offset, 1);call write~init~int(112, #t~string101.base, 4 + #t~string101.offset, 1);call write~init~int(58, #t~string101.base, 5 + #t~string101.offset, 1);call write~init~int(0, #t~string101.base, 6 + #t~string101.offset, 1);call #t~string103.base, #t~string103.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string103.base, #t~string103.offset, 1);call write~init~int(37, #t~string103.base, 1 + #t~string103.offset, 1);call write~init~int(105, #t~string103.base, 2 + #t~string103.offset, 1);call write~init~int(0, #t~string103.base, 3 + #t~string103.offset, 1);call #t~string105.base, #t~string105.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string105.base, #t~string105.offset, 1);call write~init~int(37, #t~string105.base, 1 + #t~string105.offset, 1);call write~init~int(105, #t~string105.base, 2 + #t~string105.offset, 1);call write~init~int(0, #t~string105.base, 3 + #t~string105.offset, 1);call #t~string107.base, #t~string107.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string107.base, #t~string107.offset, 1);call write~init~int(37, #t~string107.base, 1 + #t~string107.offset, 1);call write~init~int(105, #t~string107.base, 2 + #t~string107.offset, 1);call write~init~int(0, #t~string107.base, 3 + #t~string107.offset, 1);call #t~string109.base, #t~string109.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string109.base, #t~string109.offset, 1);call write~init~int(37, #t~string109.base, 1 + #t~string109.offset, 1);call write~init~int(105, #t~string109.base, 2 + #t~string109.offset, 1);call write~init~int(0, #t~string109.base, 3 + #t~string109.offset, 1);call #t~string111.base, #t~string111.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string111.base, #t~string111.offset, 1);call write~init~int(37, #t~string111.base, 1 + #t~string111.offset, 1);call write~init~int(105, #t~string111.base, 2 + #t~string111.offset, 1);call write~init~int(0, #t~string111.base, 3 + #t~string111.offset, 1);call #t~string113.base, #t~string113.offset := #Ultimate.alloc(6);call write~init~int(32, #t~string113.base, #t~string113.offset, 1);call write~init~int(70, #t~string113.base, 1 + #t~string113.offset, 1);call write~init~int(95, #t~string113.base, 2 + #t~string113.offset, 1);call write~init~int(112, #t~string113.base, 3 + #t~string113.offset, 1);call write~init~int(58, #t~string113.base, 4 + #t~string113.offset, 1);call write~init~int(0, #t~string113.base, 5 + #t~string113.offset, 1);call #t~string116.base, #t~string116.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string116.base, #t~string116.offset, 1);call write~init~int(37, #t~string116.base, 1 + #t~string116.offset, 1);call write~init~int(105, #t~string116.base, 2 + #t~string116.offset, 1);call write~init~int(0, #t~string116.base, 3 + #t~string116.offset, 1);call #t~string119.base, #t~string119.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string119.base, #t~string119.offset, 1);call write~init~int(37, #t~string119.base, 1 + #t~string119.offset, 1);call write~init~int(105, #t~string119.base, 2 + #t~string119.offset, 1);call write~init~int(0, #t~string119.base, 3 + #t~string119.offset, 1);call #t~string122.base, #t~string122.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string122.base, #t~string122.offset, 1);call write~init~int(37, #t~string122.base, 1 + #t~string122.offset, 1);call write~init~int(105, #t~string122.base, 2 + #t~string122.offset, 1);call write~init~int(0, #t~string122.base, 3 + #t~string122.offset, 1);call #t~string125.base, #t~string125.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string125.base, #t~string125.offset, 1);call write~init~int(37, #t~string125.base, 1 + #t~string125.offset, 1);call write~init~int(105, #t~string125.base, 2 + #t~string125.offset, 1);call write~init~int(0, #t~string125.base, 3 + #t~string125.offset, 1);call #t~string128.base, #t~string128.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string128.base, #t~string128.offset, 1);call write~init~int(37, #t~string128.base, 1 + #t~string128.offset, 1);call write~init~int(105, #t~string128.base, 2 + #t~string128.offset, 1);call write~init~int(0, #t~string128.base, 3 + #t~string128.offset, 1);call #t~string130.base, #t~string130.offset := #Ultimate.alloc(2);call write~init~int(10, #t~string130.base, #t~string130.offset, 1);call write~init~int(0, #t~string130.base, 1 + #t~string130.offset, 1);call #t~string133.base, #t~string133.offset := #Ultimate.alloc(9);~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;~cleanupTimeShifts~0 := 12; 3589#L-1true havoc main_#res;havoc main_#t~ret148, main_~retValue_acc~20, main_~tmp~25;havoc main_~retValue_acc~20;havoc main_~tmp~25; 554#L3249true havoc valid_product_#res;havoc valid_product_~retValue_acc~22;havoc valid_product_~retValue_acc~22;valid_product_~retValue_acc~22 := 1;valid_product_#res := valid_product_~retValue_acc~22; 3647#L3257true main_#t~ret148 := valid_product_#res;main_~tmp~25 := main_#t~ret148;havoc main_#t~ret148; 1314#L3122true assume 0 != main_~tmp~25; 4520#L3094true ~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; 3699#L440true havoc bigMacCall_#t~ret141, bigMacCall_~tmp~22;havoc bigMacCall_~tmp~22;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~24;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~24; 1216#L3305true assume 0 == getOrigin_~person;getOrigin_~retValue_acc~24 := 4;getOrigin_#res := getOrigin_~retValue_acc~24; 132#L3330true bigMacCall_#t~ret141 := getOrigin_#res;bigMacCall_~tmp~22 := bigMacCall_#t~ret141;havoc bigMacCall_#t~ret141;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~22;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 4631#L2473true assume 0 == initPersonOnFloor_~floor; 4841#L2474true assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 1822#L2581-1true callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 402#L2265true assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 670#L2277-2true havoc cleanup_#t~ret142, cleanup_#t~ret143, cleanup_~i~1, cleanup_~tmp~23, cleanup_~tmp___0~7, cleanup_~__cil_tmp4~2;havoc cleanup_~i~1;havoc cleanup_~tmp~23;havoc cleanup_~tmp___0~7;havoc cleanup_~__cil_tmp4~2;havoc timeShift_#t~ret84, timeShift_~tmp~14;havoc timeShift_~tmp~14;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~5;havoc areDoorsOpen_~retValue_acc~5;areDoorsOpen_~retValue_acc~5 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~5; 363#L854true timeShift_#t~ret84 := areDoorsOpen_#res;timeShift_~tmp~14 := timeShift_#t~ret84;havoc timeShift_#t~ret84; 436#L1736true assume 0 != timeShift_~tmp~14; 380#L1737true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 2813#L1441-11true havoc __utac_acc__Specification9_spec__3_#t~ret35, __utac_acc__Specification9_spec__3_#t~ret36, __utac_acc__Specification9_spec__3_#t~ret37, __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;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~4;havoc getCurrentFloorID_~retValue_acc~4;getCurrentFloorID_~retValue_acc~4 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~4; 1633#L845true __utac_acc__Specification9_spec__3_#t~ret35 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~3 := __utac_acc__Specification9_spec__3_#t~ret35;havoc __utac_acc__Specification9_spec__3_#t~ret35;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~3;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~8;havoc isEmpty_~retValue_acc~8; 1996#L905-12true assume 1 == ~persons_0~0;isEmpty_~retValue_acc~8 := 0;isEmpty_#res := isEmpty_~retValue_acc~8; 1467#L937-12true __utac_acc__Specification9_spec__3_#t~ret36 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~0 := __utac_acc__Specification9_spec__3_#t~ret36;havoc __utac_acc__Specification9_spec__3_#t~ret36; 1229#L483true 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; 1613#L493-1true cleanup_~i~1 := 0; 2417#L2926-2true [2018-11-28 10:43:04,581 INFO L796 eck$LassoCheckResult]: Loop: 2417#L2926-2true assume !false; 2131#L2927true cleanup_~__cil_tmp4~2 := ~cleanupTimeShifts~0 - 1; 1881#L2930true assume cleanup_~i~1 < cleanup_~__cil_tmp4~2;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~3;havoc isBlocked_~retValue_acc~3;isBlocked_~retValue_acc~3 := ~blocked~0;isBlocked_#res := isBlocked_~retValue_acc~3; 1664#L668true cleanup_#t~ret142 := isBlocked_#res;cleanup_~tmp___0~7 := cleanup_#t~ret142;havoc cleanup_#t~ret142; 1785#L2934true assume 1 != cleanup_~tmp___0~7; 1791#L2934-1true havoc isIdle_#res;havoc isIdle_#t~ret46, isIdle_~retValue_acc~10, isIdle_~tmp~8;havoc isIdle_~retValue_acc~10;havoc isIdle_~tmp~8;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret41, anyStopRequested_#t~ret42, anyStopRequested_#t~ret43, anyStopRequested_#t~ret44, anyStopRequested_#t~ret45, anyStopRequested_~retValue_acc~9, anyStopRequested_~tmp~7, anyStopRequested_~tmp___0~1, anyStopRequested_~tmp___1~1, anyStopRequested_~tmp___2~0, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~9;havoc anyStopRequested_~tmp~7;havoc anyStopRequested_~tmp___0~1;havoc anyStopRequested_~tmp___1~1;havoc anyStopRequested_~tmp___2~0;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~16;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~16; 3384#L2202-42true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~16 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~16; 3056#L2229-42true anyStopRequested_#t~ret41 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret41;havoc anyStopRequested_#t~ret41; 788#L953true assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~9 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~9; 879#L1017true isIdle_#t~ret46 := anyStopRequested_#res;isIdle_~tmp~8 := isIdle_#t~ret46;havoc isIdle_#t~ret46;isIdle_~retValue_acc~10 := (if 0 == isIdle_~tmp~8 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~10; 369#L1030true cleanup_#t~ret143 := isIdle_#res;cleanup_~tmp~23 := cleanup_#t~ret143;havoc cleanup_#t~ret143; 1310#L2946true assume !(0 != cleanup_~tmp~23);havoc timeShift_#t~ret84, timeShift_~tmp~14;havoc timeShift_~tmp~14;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~5;havoc areDoorsOpen_~retValue_acc~5;areDoorsOpen_~retValue_acc~5 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~5; 358#L854-2true timeShift_#t~ret84 := areDoorsOpen_#res;timeShift_~tmp~14 := timeShift_#t~ret84;havoc timeShift_#t~ret84; 435#L1736-1true assume 0 != timeShift_~tmp~14; 382#L1737-2true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 2954#L1441-23true havoc __utac_acc__Specification9_spec__3_#t~ret35, __utac_acc__Specification9_spec__3_#t~ret36, __utac_acc__Specification9_spec__3_#t~ret37, __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;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~4;havoc getCurrentFloorID_~retValue_acc~4;getCurrentFloorID_~retValue_acc~4 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~4; 1635#L845-1true __utac_acc__Specification9_spec__3_#t~ret35 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~3 := __utac_acc__Specification9_spec__3_#t~ret35;havoc __utac_acc__Specification9_spec__3_#t~ret35;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~3;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~8;havoc isEmpty_~retValue_acc~8; 1979#L905-25true assume 1 == ~persons_0~0;isEmpty_~retValue_acc~8 := 0;isEmpty_#res := isEmpty_~retValue_acc~8; 1536#L937-25true __utac_acc__Specification9_spec__3_#t~ret36 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~0 := __utac_acc__Specification9_spec__3_#t~ret36;havoc __utac_acc__Specification9_spec__3_#t~ret36; 1232#L483-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; 1619#L493-3true cleanup_~i~1 := 1 + cleanup_~i~1; 2417#L2926-2true [2018-11-28 10:43:04,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:43:04,586 INFO L82 PathProgramCache]: Analyzing trace with hash -2120884841, now seen corresponding path program 1 times [2018-11-28 10:43:04,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:43:04,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:43:04,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:43:04,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:43:04,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:43:04,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:43:04,753 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-28 10:43:04,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:43:04,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 10:43:04,758 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 10:43:04,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:43:04,758 INFO L82 PathProgramCache]: Analyzing trace with hash 467648044, now seen corresponding path program 1 times [2018-11-28 10:43:04,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:43:04,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:43:04,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:43:04,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:43:04,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:43:04,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:43:04,805 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-28 10:43:04,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:43:04,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 10:43:04,806 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 10:43:04,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 10:43:04,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 10:43:04,817 INFO L87 Difference]: Start difference. First operand 4855 states. Second operand 4 states. [2018-11-28 10:43:05,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:43:05,375 INFO L93 Difference]: Finished difference Result 12925 states and 24453 transitions. [2018-11-28 10:43:05,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 10:43:05,377 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12925 states and 24453 transitions. [2018-11-28 10:43:05,432 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8797 [2018-11-28 10:43:05,484 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12925 states to 12883 states and 24404 transitions. [2018-11-28 10:43:05,485 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12883 [2018-11-28 10:43:05,496 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12883 [2018-11-28 10:43:05,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12883 states and 24404 transitions. [2018-11-28 10:43:05,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 10:43:05,513 INFO L705 BuchiCegarLoop]: Abstraction has 12883 states and 24404 transitions. [2018-11-28 10:43:05,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12883 states and 24404 transitions. [2018-11-28 10:43:05,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12883 to 4845. [2018-11-28 10:43:05,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4845 states. [2018-11-28 10:43:05,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4845 states to 4845 states and 9174 transitions. [2018-11-28 10:43:05,632 INFO L728 BuchiCegarLoop]: Abstraction has 4845 states and 9174 transitions. [2018-11-28 10:43:05,632 INFO L608 BuchiCegarLoop]: Abstraction has 4845 states and 9174 transitions. [2018-11-28 10:43:05,632 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 10:43:05,632 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4845 states and 9174 transitions. [2018-11-28 10:43:05,644 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2419 [2018-11-28 10:43:05,645 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:43:05,645 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:43:05,646 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] [2018-11-28 10:43:05,646 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-28 10:43:05,647 INFO L794 eck$LassoCheckResult]: Stem: 20658#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string18.base, #t~string18.offset := #Ultimate.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);~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;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0;call #t~string85.base, #t~string85.offset := #Ultimate.alloc(10);call #t~string87.base, #t~string87.offset := #Ultimate.alloc(4);call write~init~int(91, #t~string87.base, #t~string87.offset, 1);call write~init~int(95, #t~string87.base, 1 + #t~string87.offset, 1);call write~init~int(93, #t~string87.base, 2 + #t~string87.offset, 1);call write~init~int(0, #t~string87.base, 3 + #t~string87.offset, 1);call #t~string89.base, #t~string89.offset := #Ultimate.alloc(4);call write~init~int(91, #t~string89.base, #t~string89.offset, 1);call write~init~int(93, #t~string89.base, 1 + #t~string89.offset, 1);call write~init~int(32, #t~string89.base, 2 + #t~string89.offset, 1);call write~init~int(0, #t~string89.base, 3 + #t~string89.offset, 1);call #t~string91.base, #t~string91.offset := #Ultimate.alloc(5);call write~init~int(32, #t~string91.base, #t~string91.offset, 1);call write~init~int(97, #t~string91.base, 1 + #t~string91.offset, 1);call write~init~int(116, #t~string91.base, 2 + #t~string91.offset, 1);call write~init~int(32, #t~string91.base, 3 + #t~string91.offset, 1);call write~init~int(0, #t~string91.base, 4 + #t~string91.offset, 1);call #t~string93.base, #t~string93.offset := #Ultimate.alloc(3);call write~init~int(37, #t~string93.base, #t~string93.offset, 1);call write~init~int(105, #t~string93.base, 1 + #t~string93.offset, 1);call write~init~int(0, #t~string93.base, 2 + #t~string93.offset, 1);call #t~string95.base, #t~string95.offset := #Ultimate.alloc(10);call #t~string97.base, #t~string97.offset := #Ultimate.alloc(3);call write~init~int(117, #t~string97.base, #t~string97.offset, 1);call write~init~int(112, #t~string97.base, 1 + #t~string97.offset, 1);call write~init~int(0, #t~string97.base, 2 + #t~string97.offset, 1);call #t~string99.base, #t~string99.offset := #Ultimate.alloc(5);call write~init~int(100, #t~string99.base, #t~string99.offset, 1);call write~init~int(111, #t~string99.base, 1 + #t~string99.offset, 1);call write~init~int(119, #t~string99.base, 2 + #t~string99.offset, 1);call write~init~int(110, #t~string99.base, 3 + #t~string99.offset, 1);call write~init~int(0, #t~string99.base, 4 + #t~string99.offset, 1);call #t~string101.base, #t~string101.offset := #Ultimate.alloc(7);call write~init~int(32, #t~string101.base, #t~string101.offset, 1);call write~init~int(73, #t~string101.base, 1 + #t~string101.offset, 1);call write~init~int(76, #t~string101.base, 2 + #t~string101.offset, 1);call write~init~int(95, #t~string101.base, 3 + #t~string101.offset, 1);call write~init~int(112, #t~string101.base, 4 + #t~string101.offset, 1);call write~init~int(58, #t~string101.base, 5 + #t~string101.offset, 1);call write~init~int(0, #t~string101.base, 6 + #t~string101.offset, 1);call #t~string103.base, #t~string103.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string103.base, #t~string103.offset, 1);call write~init~int(37, #t~string103.base, 1 + #t~string103.offset, 1);call write~init~int(105, #t~string103.base, 2 + #t~string103.offset, 1);call write~init~int(0, #t~string103.base, 3 + #t~string103.offset, 1);call #t~string105.base, #t~string105.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string105.base, #t~string105.offset, 1);call write~init~int(37, #t~string105.base, 1 + #t~string105.offset, 1);call write~init~int(105, #t~string105.base, 2 + #t~string105.offset, 1);call write~init~int(0, #t~string105.base, 3 + #t~string105.offset, 1);call #t~string107.base, #t~string107.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string107.base, #t~string107.offset, 1);call write~init~int(37, #t~string107.base, 1 + #t~string107.offset, 1);call write~init~int(105, #t~string107.base, 2 + #t~string107.offset, 1);call write~init~int(0, #t~string107.base, 3 + #t~string107.offset, 1);call #t~string109.base, #t~string109.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string109.base, #t~string109.offset, 1);call write~init~int(37, #t~string109.base, 1 + #t~string109.offset, 1);call write~init~int(105, #t~string109.base, 2 + #t~string109.offset, 1);call write~init~int(0, #t~string109.base, 3 + #t~string109.offset, 1);call #t~string111.base, #t~string111.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string111.base, #t~string111.offset, 1);call write~init~int(37, #t~string111.base, 1 + #t~string111.offset, 1);call write~init~int(105, #t~string111.base, 2 + #t~string111.offset, 1);call write~init~int(0, #t~string111.base, 3 + #t~string111.offset, 1);call #t~string113.base, #t~string113.offset := #Ultimate.alloc(6);call write~init~int(32, #t~string113.base, #t~string113.offset, 1);call write~init~int(70, #t~string113.base, 1 + #t~string113.offset, 1);call write~init~int(95, #t~string113.base, 2 + #t~string113.offset, 1);call write~init~int(112, #t~string113.base, 3 + #t~string113.offset, 1);call write~init~int(58, #t~string113.base, 4 + #t~string113.offset, 1);call write~init~int(0, #t~string113.base, 5 + #t~string113.offset, 1);call #t~string116.base, #t~string116.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string116.base, #t~string116.offset, 1);call write~init~int(37, #t~string116.base, 1 + #t~string116.offset, 1);call write~init~int(105, #t~string116.base, 2 + #t~string116.offset, 1);call write~init~int(0, #t~string116.base, 3 + #t~string116.offset, 1);call #t~string119.base, #t~string119.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string119.base, #t~string119.offset, 1);call write~init~int(37, #t~string119.base, 1 + #t~string119.offset, 1);call write~init~int(105, #t~string119.base, 2 + #t~string119.offset, 1);call write~init~int(0, #t~string119.base, 3 + #t~string119.offset, 1);call #t~string122.base, #t~string122.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string122.base, #t~string122.offset, 1);call write~init~int(37, #t~string122.base, 1 + #t~string122.offset, 1);call write~init~int(105, #t~string122.base, 2 + #t~string122.offset, 1);call write~init~int(0, #t~string122.base, 3 + #t~string122.offset, 1);call #t~string125.base, #t~string125.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string125.base, #t~string125.offset, 1);call write~init~int(37, #t~string125.base, 1 + #t~string125.offset, 1);call write~init~int(105, #t~string125.base, 2 + #t~string125.offset, 1);call write~init~int(0, #t~string125.base, 3 + #t~string125.offset, 1);call #t~string128.base, #t~string128.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string128.base, #t~string128.offset, 1);call write~init~int(37, #t~string128.base, 1 + #t~string128.offset, 1);call write~init~int(105, #t~string128.base, 2 + #t~string128.offset, 1);call write~init~int(0, #t~string128.base, 3 + #t~string128.offset, 1);call #t~string130.base, #t~string130.offset := #Ultimate.alloc(2);call write~init~int(10, #t~string130.base, #t~string130.offset, 1);call write~init~int(0, #t~string130.base, 1 + #t~string130.offset, 1);call #t~string133.base, #t~string133.offset := #Ultimate.alloc(9);~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;~cleanupTimeShifts~0 := 12; 20659#L-1 havoc main_#res;havoc main_#t~ret148, main_~retValue_acc~20, main_~tmp~25;havoc main_~retValue_acc~20;havoc main_~tmp~25; 18782#L3249 havoc valid_product_#res;havoc valid_product_~retValue_acc~22;havoc valid_product_~retValue_acc~22;valid_product_~retValue_acc~22 := 1;valid_product_#res := valid_product_~retValue_acc~22; 18783#L3257 main_#t~ret148 := valid_product_#res;main_~tmp~25 := main_#t~ret148;havoc main_#t~ret148; 19590#L3122 assume 0 != main_~tmp~25; 19591#L3094 ~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; 22013#L440 havoc bigMacCall_#t~ret141, bigMacCall_~tmp~22;havoc bigMacCall_~tmp~22;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~24;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~24; 19481#L3305 assume 0 == getOrigin_~person;getOrigin_~retValue_acc~24 := 4;getOrigin_#res := getOrigin_~retValue_acc~24; 18131#L3330 bigMacCall_#t~ret141 := getOrigin_#res;bigMacCall_~tmp~22 := bigMacCall_#t~ret141;havoc bigMacCall_#t~ret141;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~22;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 18132#L2473 assume 0 == initPersonOnFloor_~floor; 22631#L2474 assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 18148#L2581-1 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 18532#L2265 assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 18082#L2277-2 havoc cleanup_#t~ret142, cleanup_#t~ret143, cleanup_~i~1, cleanup_~tmp~23, cleanup_~tmp___0~7, cleanup_~__cil_tmp4~2;havoc cleanup_~i~1;havoc cleanup_~tmp~23;havoc cleanup_~tmp___0~7;havoc cleanup_~__cil_tmp4~2;havoc timeShift_#t~ret84, timeShift_~tmp~14;havoc timeShift_~tmp~14;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~5;havoc areDoorsOpen_~retValue_acc~5;areDoorsOpen_~retValue_acc~5 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~5; 18473#L854 timeShift_#t~ret84 := areDoorsOpen_#res;timeShift_~tmp~14 := timeShift_#t~ret84;havoc timeShift_#t~ret84; 18474#L1736 assume 0 != timeShift_~tmp~14; 18498#L1737 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 18499#L1441-11 havoc __utac_acc__Specification9_spec__3_#t~ret35, __utac_acc__Specification9_spec__3_#t~ret36, __utac_acc__Specification9_spec__3_#t~ret37, __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;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~4;havoc getCurrentFloorID_~retValue_acc~4;getCurrentFloorID_~retValue_acc~4 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~4; 19861#L845 __utac_acc__Specification9_spec__3_#t~ret35 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~3 := __utac_acc__Specification9_spec__3_#t~ret35;havoc __utac_acc__Specification9_spec__3_#t~ret35;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~3;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~8;havoc isEmpty_~retValue_acc~8; 19862#L905-12 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~8 := 0;isEmpty_#res := isEmpty_~retValue_acc~8; 19432#L937-12 __utac_acc__Specification9_spec__3_#t~ret36 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~0 := __utac_acc__Specification9_spec__3_#t~ret36;havoc __utac_acc__Specification9_spec__3_#t~ret36; 19497#L483 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~0);havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~5;havoc areDoorsOpen_~retValue_acc~5;areDoorsOpen_~retValue_acc~5 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~5; 18475#L854-1 __utac_acc__Specification9_spec__3_#t~ret37 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~0 := __utac_acc__Specification9_spec__3_#t~ret37;havoc __utac_acc__Specification9_spec__3_#t~ret37; 18476#L493 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___0~0); 17819#L493-1 cleanup_~i~1 := 0; 19842#L2926-2 [2018-11-28 10:43:05,647 INFO L796 eck$LassoCheckResult]: Loop: 19842#L2926-2 assume !false; 20547#L2927 cleanup_~__cil_tmp4~2 := ~cleanupTimeShifts~0 - 1; 20213#L2930 assume cleanup_~i~1 < cleanup_~__cil_tmp4~2;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~3;havoc isBlocked_~retValue_acc~3;isBlocked_~retValue_acc~3 := ~blocked~0;isBlocked_#res := isBlocked_~retValue_acc~3; 19867#L668 cleanup_#t~ret142 := isBlocked_#res;cleanup_~tmp___0~7 := cleanup_#t~ret142;havoc cleanup_#t~ret142; 19868#L2934 assume 1 != cleanup_~tmp___0~7; 20084#L2934-1 havoc isIdle_#res;havoc isIdle_#t~ret46, isIdle_~retValue_acc~10, isIdle_~tmp~8;havoc isIdle_~retValue_acc~10;havoc isIdle_~tmp~8;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret41, anyStopRequested_#t~ret42, anyStopRequested_#t~ret43, anyStopRequested_#t~ret44, anyStopRequested_#t~ret45, anyStopRequested_~retValue_acc~9, anyStopRequested_~tmp~7, anyStopRequested_~tmp___0~1, anyStopRequested_~tmp___1~1, anyStopRequested_~tmp___2~0, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~9;havoc anyStopRequested_~tmp~7;havoc anyStopRequested_~tmp___0~1;havoc anyStopRequested_~tmp___1~1;havoc anyStopRequested_~tmp___2~0;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~16;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~16; 20094#L2202-42 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~16 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~16; 20844#L2229-42 anyStopRequested_#t~ret41 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret41;havoc anyStopRequested_#t~ret41; 18991#L953 assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~9 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~9; 18984#L1017 isIdle_#t~ret46 := anyStopRequested_#res;isIdle_~tmp~8 := isIdle_#t~ret46;havoc isIdle_#t~ret46;isIdle_~retValue_acc~10 := (if 0 == isIdle_~tmp~8 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~10; 18485#L1030 cleanup_#t~ret143 := isIdle_#res;cleanup_~tmp~23 := cleanup_#t~ret143;havoc cleanup_#t~ret143; 18486#L2946 assume !(0 != cleanup_~tmp~23);havoc timeShift_#t~ret84, timeShift_~tmp~14;havoc timeShift_~tmp~14;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~5;havoc areDoorsOpen_~retValue_acc~5;areDoorsOpen_~retValue_acc~5 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~5; 18463#L854-2 timeShift_#t~ret84 := areDoorsOpen_#res;timeShift_~tmp~14 := timeShift_#t~ret84;havoc timeShift_#t~ret84; 18464#L1736-1 assume 0 != timeShift_~tmp~14; 18504#L1737-2 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 18505#L1441-23 havoc __utac_acc__Specification9_spec__3_#t~ret35, __utac_acc__Specification9_spec__3_#t~ret36, __utac_acc__Specification9_spec__3_#t~ret37, __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;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~4;havoc getCurrentFloorID_~retValue_acc~4;getCurrentFloorID_~retValue_acc~4 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~4; 19863#L845-1 __utac_acc__Specification9_spec__3_#t~ret35 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~3 := __utac_acc__Specification9_spec__3_#t~ret35;havoc __utac_acc__Specification9_spec__3_#t~ret35;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~3;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~8;havoc isEmpty_~retValue_acc~8; 19864#L905-25 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~8 := 0;isEmpty_#res := isEmpty_~retValue_acc~8; 19366#L937-25 __utac_acc__Specification9_spec__3_#t~ret36 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~0 := __utac_acc__Specification9_spec__3_#t~ret36;havoc __utac_acc__Specification9_spec__3_#t~ret36; 19500#L483-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~0);havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~5;havoc areDoorsOpen_~retValue_acc~5;areDoorsOpen_~retValue_acc~5 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~5; 18465#L854-3 __utac_acc__Specification9_spec__3_#t~ret37 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~0 := __utac_acc__Specification9_spec__3_#t~ret37;havoc __utac_acc__Specification9_spec__3_#t~ret37; 18466#L493-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___0~0); 18155#L493-3 cleanup_~i~1 := 1 + cleanup_~i~1; 19842#L2926-2 [2018-11-28 10:43:05,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:43:05,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1939500596, now seen corresponding path program 1 times [2018-11-28 10:43:05,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:43:05,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:43:05,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:43:05,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:43:05,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:43:05,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:43:05,696 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-28 10:43:05,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:43:05,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 10:43:05,696 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 10:43:05,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:43:05,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1561055767, now seen corresponding path program 1 times [2018-11-28 10:43:05,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:43:05,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:43:05,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:43:05,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:43:05,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:43:05,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:43:05,738 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-28 10:43:05,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:43:05,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 10:43:05,739 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 10:43:05,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 10:43:05,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 10:43:05,740 INFO L87 Difference]: Start difference. First operand 4845 states and 9174 transitions. cyclomatic complexity: 4330 Second operand 7 states. [2018-11-28 10:43:06,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:43:06,175 INFO L93 Difference]: Finished difference Result 7976 states and 14976 transitions. [2018-11-28 10:43:06,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-28 10:43:06,176 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7976 states and 14976 transitions. [2018-11-28 10:43:06,200 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6395 [2018-11-28 10:43:06,225 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7976 states to 7976 states and 14976 transitions. [2018-11-28 10:43:06,225 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7976 [2018-11-28 10:43:06,231 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7976 [2018-11-28 10:43:06,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7976 states and 14976 transitions. [2018-11-28 10:43:06,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 10:43:06,239 INFO L705 BuchiCegarLoop]: Abstraction has 7976 states and 14976 transitions. [2018-11-28 10:43:06,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7976 states and 14976 transitions. [2018-11-28 10:43:06,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7976 to 4319. [2018-11-28 10:43:06,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4319 states. [2018-11-28 10:43:06,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4319 states to 4319 states and 8148 transitions. [2018-11-28 10:43:06,297 INFO L728 BuchiCegarLoop]: Abstraction has 4319 states and 8148 transitions. [2018-11-28 10:43:06,297 INFO L608 BuchiCegarLoop]: Abstraction has 4319 states and 8148 transitions. [2018-11-28 10:43:06,297 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 10:43:06,297 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4319 states and 8148 transitions. [2018-11-28 10:43:06,307 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2767 [2018-11-28 10:43:06,307 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:43:06,307 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:43:06,308 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-28 10:43:06,308 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-28 10:43:06,308 INFO L794 eck$LassoCheckResult]: Stem: 32891#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string18.base, #t~string18.offset := #Ultimate.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);~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;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0;call #t~string85.base, #t~string85.offset := #Ultimate.alloc(10);call #t~string87.base, #t~string87.offset := #Ultimate.alloc(4);call write~init~int(91, #t~string87.base, #t~string87.offset, 1);call write~init~int(95, #t~string87.base, 1 + #t~string87.offset, 1);call write~init~int(93, #t~string87.base, 2 + #t~string87.offset, 1);call write~init~int(0, #t~string87.base, 3 + #t~string87.offset, 1);call #t~string89.base, #t~string89.offset := #Ultimate.alloc(4);call write~init~int(91, #t~string89.base, #t~string89.offset, 1);call write~init~int(93, #t~string89.base, 1 + #t~string89.offset, 1);call write~init~int(32, #t~string89.base, 2 + #t~string89.offset, 1);call write~init~int(0, #t~string89.base, 3 + #t~string89.offset, 1);call #t~string91.base, #t~string91.offset := #Ultimate.alloc(5);call write~init~int(32, #t~string91.base, #t~string91.offset, 1);call write~init~int(97, #t~string91.base, 1 + #t~string91.offset, 1);call write~init~int(116, #t~string91.base, 2 + #t~string91.offset, 1);call write~init~int(32, #t~string91.base, 3 + #t~string91.offset, 1);call write~init~int(0, #t~string91.base, 4 + #t~string91.offset, 1);call #t~string93.base, #t~string93.offset := #Ultimate.alloc(3);call write~init~int(37, #t~string93.base, #t~string93.offset, 1);call write~init~int(105, #t~string93.base, 1 + #t~string93.offset, 1);call write~init~int(0, #t~string93.base, 2 + #t~string93.offset, 1);call #t~string95.base, #t~string95.offset := #Ultimate.alloc(10);call #t~string97.base, #t~string97.offset := #Ultimate.alloc(3);call write~init~int(117, #t~string97.base, #t~string97.offset, 1);call write~init~int(112, #t~string97.base, 1 + #t~string97.offset, 1);call write~init~int(0, #t~string97.base, 2 + #t~string97.offset, 1);call #t~string99.base, #t~string99.offset := #Ultimate.alloc(5);call write~init~int(100, #t~string99.base, #t~string99.offset, 1);call write~init~int(111, #t~string99.base, 1 + #t~string99.offset, 1);call write~init~int(119, #t~string99.base, 2 + #t~string99.offset, 1);call write~init~int(110, #t~string99.base, 3 + #t~string99.offset, 1);call write~init~int(0, #t~string99.base, 4 + #t~string99.offset, 1);call #t~string101.base, #t~string101.offset := #Ultimate.alloc(7);call write~init~int(32, #t~string101.base, #t~string101.offset, 1);call write~init~int(73, #t~string101.base, 1 + #t~string101.offset, 1);call write~init~int(76, #t~string101.base, 2 + #t~string101.offset, 1);call write~init~int(95, #t~string101.base, 3 + #t~string101.offset, 1);call write~init~int(112, #t~string101.base, 4 + #t~string101.offset, 1);call write~init~int(58, #t~string101.base, 5 + #t~string101.offset, 1);call write~init~int(0, #t~string101.base, 6 + #t~string101.offset, 1);call #t~string103.base, #t~string103.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string103.base, #t~string103.offset, 1);call write~init~int(37, #t~string103.base, 1 + #t~string103.offset, 1);call write~init~int(105, #t~string103.base, 2 + #t~string103.offset, 1);call write~init~int(0, #t~string103.base, 3 + #t~string103.offset, 1);call #t~string105.base, #t~string105.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string105.base, #t~string105.offset, 1);call write~init~int(37, #t~string105.base, 1 + #t~string105.offset, 1);call write~init~int(105, #t~string105.base, 2 + #t~string105.offset, 1);call write~init~int(0, #t~string105.base, 3 + #t~string105.offset, 1);call #t~string107.base, #t~string107.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string107.base, #t~string107.offset, 1);call write~init~int(37, #t~string107.base, 1 + #t~string107.offset, 1);call write~init~int(105, #t~string107.base, 2 + #t~string107.offset, 1);call write~init~int(0, #t~string107.base, 3 + #t~string107.offset, 1);call #t~string109.base, #t~string109.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string109.base, #t~string109.offset, 1);call write~init~int(37, #t~string109.base, 1 + #t~string109.offset, 1);call write~init~int(105, #t~string109.base, 2 + #t~string109.offset, 1);call write~init~int(0, #t~string109.base, 3 + #t~string109.offset, 1);call #t~string111.base, #t~string111.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string111.base, #t~string111.offset, 1);call write~init~int(37, #t~string111.base, 1 + #t~string111.offset, 1);call write~init~int(105, #t~string111.base, 2 + #t~string111.offset, 1);call write~init~int(0, #t~string111.base, 3 + #t~string111.offset, 1);call #t~string113.base, #t~string113.offset := #Ultimate.alloc(6);call write~init~int(32, #t~string113.base, #t~string113.offset, 1);call write~init~int(70, #t~string113.base, 1 + #t~string113.offset, 1);call write~init~int(95, #t~string113.base, 2 + #t~string113.offset, 1);call write~init~int(112, #t~string113.base, 3 + #t~string113.offset, 1);call write~init~int(58, #t~string113.base, 4 + #t~string113.offset, 1);call write~init~int(0, #t~string113.base, 5 + #t~string113.offset, 1);call #t~string116.base, #t~string116.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string116.base, #t~string116.offset, 1);call write~init~int(37, #t~string116.base, 1 + #t~string116.offset, 1);call write~init~int(105, #t~string116.base, 2 + #t~string116.offset, 1);call write~init~int(0, #t~string116.base, 3 + #t~string116.offset, 1);call #t~string119.base, #t~string119.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string119.base, #t~string119.offset, 1);call write~init~int(37, #t~string119.base, 1 + #t~string119.offset, 1);call write~init~int(105, #t~string119.base, 2 + #t~string119.offset, 1);call write~init~int(0, #t~string119.base, 3 + #t~string119.offset, 1);call #t~string122.base, #t~string122.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string122.base, #t~string122.offset, 1);call write~init~int(37, #t~string122.base, 1 + #t~string122.offset, 1);call write~init~int(105, #t~string122.base, 2 + #t~string122.offset, 1);call write~init~int(0, #t~string122.base, 3 + #t~string122.offset, 1);call #t~string125.base, #t~string125.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string125.base, #t~string125.offset, 1);call write~init~int(37, #t~string125.base, 1 + #t~string125.offset, 1);call write~init~int(105, #t~string125.base, 2 + #t~string125.offset, 1);call write~init~int(0, #t~string125.base, 3 + #t~string125.offset, 1);call #t~string128.base, #t~string128.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string128.base, #t~string128.offset, 1);call write~init~int(37, #t~string128.base, 1 + #t~string128.offset, 1);call write~init~int(105, #t~string128.base, 2 + #t~string128.offset, 1);call write~init~int(0, #t~string128.base, 3 + #t~string128.offset, 1);call #t~string130.base, #t~string130.offset := #Ultimate.alloc(2);call write~init~int(10, #t~string130.base, #t~string130.offset, 1);call write~init~int(0, #t~string130.base, 1 + #t~string130.offset, 1);call #t~string133.base, #t~string133.offset := #Ultimate.alloc(9);~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;~cleanupTimeShifts~0 := 12; 32892#L-1 havoc main_#res;havoc main_#t~ret148, main_~retValue_acc~20, main_~tmp~25;havoc main_~retValue_acc~20;havoc main_~tmp~25; 31420#L3249 havoc valid_product_#res;havoc valid_product_~retValue_acc~22;havoc valid_product_~retValue_acc~22;valid_product_~retValue_acc~22 := 1;valid_product_#res := valid_product_~retValue_acc~22; 31421#L3257 main_#t~ret148 := valid_product_#res;main_~tmp~25 := main_#t~ret148;havoc main_#t~ret148; 32037#L3122 assume 0 != main_~tmp~25; 32038#L3094 ~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; 33955#L440 havoc bigMacCall_#t~ret141, bigMacCall_~tmp~22;havoc bigMacCall_~tmp~22;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~24;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~24; 31950#L3305 assume 0 == getOrigin_~person;getOrigin_~retValue_acc~24 := 4;getOrigin_#res := getOrigin_~retValue_acc~24; 30911#L3330 bigMacCall_#t~ret141 := getOrigin_#res;bigMacCall_~tmp~22 := bigMacCall_#t~ret141;havoc bigMacCall_#t~ret141;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~22;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 30912#L2473 assume 0 == initPersonOnFloor_~floor; 34450#L2474 assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 30927#L2581-1 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 31225#L2265 assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 30873#L2277-2 havoc cleanup_#t~ret142, cleanup_#t~ret143, cleanup_~i~1, cleanup_~tmp~23, cleanup_~tmp___0~7, cleanup_~__cil_tmp4~2;havoc cleanup_~i~1;havoc cleanup_~tmp~23;havoc cleanup_~tmp___0~7;havoc cleanup_~__cil_tmp4~2;havoc timeShift_#t~ret84, timeShift_~tmp~14;havoc timeShift_~tmp~14;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~5;havoc areDoorsOpen_~retValue_acc~5;areDoorsOpen_~retValue_acc~5 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~5; 31173#L854 timeShift_#t~ret84 := areDoorsOpen_#res;timeShift_~tmp~14 := timeShift_#t~ret84;havoc timeShift_#t~ret84; 31174#L1736 assume 0 != timeShift_~tmp~14; 31194#L1737 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 31195#L1441-11 havoc __utac_acc__Specification9_spec__3_#t~ret35, __utac_acc__Specification9_spec__3_#t~ret36, __utac_acc__Specification9_spec__3_#t~ret37, __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;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~4;havoc getCurrentFloorID_~retValue_acc~4;getCurrentFloorID_~retValue_acc~4 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~4; 32250#L845 __utac_acc__Specification9_spec__3_#t~ret35 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~3 := __utac_acc__Specification9_spec__3_#t~ret35;havoc __utac_acc__Specification9_spec__3_#t~ret35;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~3;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~8;havoc isEmpty_~retValue_acc~8; 32251#L905-12 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~8 := 0;isEmpty_#res := isEmpty_~retValue_acc~8; 31908#L937-12 __utac_acc__Specification9_spec__3_#t~ret36 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~0 := __utac_acc__Specification9_spec__3_#t~ret36;havoc __utac_acc__Specification9_spec__3_#t~ret36; 31960#L483 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~0);havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~5;havoc areDoorsOpen_~retValue_acc~5;areDoorsOpen_~retValue_acc~5 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~5; 31175#L854-1 __utac_acc__Specification9_spec__3_#t~ret37 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~0 := __utac_acc__Specification9_spec__3_#t~ret37;havoc __utac_acc__Specification9_spec__3_#t~ret37; 31176#L493 assume 0 != __utac_acc__Specification9_spec__3_~tmp___0~0; 32196#L494 assume 0 == __utac_acc__Specification9_spec__3_~floor~0; 32197#L495 assume 0 != ~floorButtons_spc9_0~0;~floorButtons_spc9_0~0 := 0; 30680#L493-1 cleanup_~i~1 := 0; 34706#L2926-2 [2018-11-28 10:43:06,309 INFO L796 eck$LassoCheckResult]: Loop: 34706#L2926-2 assume !false; 34705#L2927 cleanup_~__cil_tmp4~2 := ~cleanupTimeShifts~0 - 1; 34704#L2930 assume cleanup_~i~1 < cleanup_~__cil_tmp4~2;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~3;havoc isBlocked_~retValue_acc~3;isBlocked_~retValue_acc~3 := ~blocked~0;isBlocked_#res := isBlocked_~retValue_acc~3; 34703#L668 cleanup_#t~ret142 := isBlocked_#res;cleanup_~tmp___0~7 := cleanup_#t~ret142;havoc cleanup_#t~ret142; 34702#L2934 assume 1 != cleanup_~tmp___0~7; 32422#L2934-1 havoc isIdle_#res;havoc isIdle_#t~ret46, isIdle_~retValue_acc~10, isIdle_~tmp~8;havoc isIdle_~retValue_acc~10;havoc isIdle_~tmp~8;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret41, anyStopRequested_#t~ret42, anyStopRequested_#t~ret43, anyStopRequested_#t~ret44, anyStopRequested_#t~ret45, anyStopRequested_~retValue_acc~9, anyStopRequested_~tmp~7, anyStopRequested_~tmp___0~1, anyStopRequested_~tmp___1~1, anyStopRequested_~tmp___2~0, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~9;havoc anyStopRequested_~tmp~7;havoc anyStopRequested_~tmp___0~1;havoc anyStopRequested_~tmp___1~1;havoc anyStopRequested_~tmp___2~0;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~16;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~16; 32423#L2202-42 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~16 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~16; 33040#L2229-42 anyStopRequested_#t~ret41 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret41;havoc anyStopRequested_#t~ret41; 31575#L953 assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~9 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~9; 31565#L1017 isIdle_#t~ret46 := anyStopRequested_#res;isIdle_~tmp~8 := isIdle_#t~ret46;havoc isIdle_#t~ret46;isIdle_~retValue_acc~10 := (if 0 == isIdle_~tmp~8 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~10; 34466#L1030 cleanup_#t~ret143 := isIdle_#res;cleanup_~tmp~23 := cleanup_#t~ret143;havoc cleanup_#t~ret143; 32033#L2946 assume !(0 != cleanup_~tmp~23);havoc timeShift_#t~ret84, timeShift_~tmp~14;havoc timeShift_~tmp~14;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~5;havoc areDoorsOpen_~retValue_acc~5;areDoorsOpen_~retValue_acc~5 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~5; 31163#L854-2 timeShift_#t~ret84 := areDoorsOpen_#res;timeShift_~tmp~14 := timeShift_#t~ret84;havoc timeShift_#t~ret84; 31164#L1736-1 assume 0 != timeShift_~tmp~14; 31200#L1737-2 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 31201#L1441-23 havoc __utac_acc__Specification9_spec__3_#t~ret35, __utac_acc__Specification9_spec__3_#t~ret36, __utac_acc__Specification9_spec__3_#t~ret37, __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;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~4;havoc getCurrentFloorID_~retValue_acc~4;getCurrentFloorID_~retValue_acc~4 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~4; 32252#L845-1 __utac_acc__Specification9_spec__3_#t~ret35 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~3 := __utac_acc__Specification9_spec__3_#t~ret35;havoc __utac_acc__Specification9_spec__3_#t~ret35;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~3;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~8;havoc isEmpty_~retValue_acc~8; 32253#L905-25 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~8 := 0;isEmpty_#res := isEmpty_~retValue_acc~8; 34725#L937-25 __utac_acc__Specification9_spec__3_#t~ret36 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~0 := __utac_acc__Specification9_spec__3_#t~ret36;havoc __utac_acc__Specification9_spec__3_#t~ret36; 31963#L483-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~0);havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~5;havoc areDoorsOpen_~retValue_acc~5;areDoorsOpen_~retValue_acc~5 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~5; 31165#L854-3 __utac_acc__Specification9_spec__3_#t~ret37 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~0 := __utac_acc__Specification9_spec__3_#t~ret37;havoc __utac_acc__Specification9_spec__3_#t~ret37; 31166#L493-2 assume 0 != __utac_acc__Specification9_spec__3_~tmp___0~0; 32198#L494-1 assume 0 == __utac_acc__Specification9_spec__3_~floor~0; 32199#L495-2 assume 0 != ~floorButtons_spc9_0~0;~floorButtons_spc9_0~0 := 0; 34707#L493-3 cleanup_~i~1 := 1 + cleanup_~i~1; 34706#L2926-2 [2018-11-28 10:43:06,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:43:06,309 INFO L82 PathProgramCache]: Analyzing trace with hash -157269105, now seen corresponding path program 1 times [2018-11-28 10:43:06,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:43:06,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:43:06,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:43:06,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:43:06,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:43:06,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:43:06,356 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-28 10:43:06,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:43:06,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 10:43:06,356 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 10:43:06,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:43:06,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1232168348, now seen corresponding path program 1 times [2018-11-28 10:43:06,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:43:06,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:43:06,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:43:06,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:43:06,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:43:06,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:43:06,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:43:06,593 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 92 [2018-11-28 10:43:06,823 WARN L180 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 86 [2018-11-28 10:43:06,830 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 10:43:06,831 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 10:43:06,831 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 10:43:06,832 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 10:43:06,832 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 10:43:06,832 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 10:43:06,832 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 10:43:06,832 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 10:43:06,832 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec9_product26_false-unreach-call_true-termination.cil.c_Iteration3_Loop [2018-11-28 10:43:06,832 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 10:43:06,832 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 10:43:06,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-28 10:43:06,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-28 10:43:06,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:43:06,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-28 10:43:06,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-28 10:43:06,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:43:06,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:43:06,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-28 10:43:06,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-28 10:43:06,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-28 10:43:06,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-28 10:43:06,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:43:06,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:43:06,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:43:06,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:43:06,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:43:06,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:43:06,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:43:06,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:43:06,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:43:06,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:43:06,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:43:06,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:43:06,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:43:06,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:43:06,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:43:06,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:43:06,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:43:06,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:43:07,202 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 10:43:07,203 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f1f97b6a-77d8-4157-9007-6f87c4d542a3/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-28 10:43:07,209 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 10:43:07,209 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 10:43:07,221 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 10:43:07,221 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_getCurrentFloorID_#res=0, ULTIMATE.start_getCurrentFloorID_~retValue_acc~4=0, ULTIMATE.start___utac_acc__Specification9_spec__3_~tmp~3=0, ~currentFloorID~0=0, ULTIMATE.start___utac_acc__Specification9_spec__3_~floor~0=0} Honda state: {ULTIMATE.start_getCurrentFloorID_#res=0, ULTIMATE.start_getCurrentFloorID_~retValue_acc~4=0, ULTIMATE.start___utac_acc__Specification9_spec__3_~tmp~3=0, ~currentFloorID~0=0, ULTIMATE.start___utac_acc__Specification9_spec__3_~floor~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f1f97b6a-77d8-4157-9007-6f87c4d542a3/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-28 10:43:07,246 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 10:43:07,246 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 10:43:07,251 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 10:43:07,251 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~persons_0~0=1} Honda state: {~persons_0~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f1f97b6a-77d8-4157-9007-6f87c4d542a3/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-28 10:43:07,276 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 10:43:07,276 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 10:43:07,278 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 10:43:07,278 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_~tmp___1~1=0} Honda state: {ULTIMATE.start_anyStopRequested_~tmp___1~1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f1f97b6a-77d8-4157-9007-6f87c4d542a3/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 10:43:07,298 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 10:43:07,299 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 10:43:07,319 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 10:43:07,319 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_isFloorCalling_#in~floorID=0, ULTIMATE.start_isFloorCalling_~floorID=0} Honda state: {ULTIMATE.start_isFloorCalling_#in~floorID=0, ULTIMATE.start_isFloorCalling_~floorID=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f1f97b6a-77d8-4157-9007-6f87c4d542a3/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 10:43:07,345 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 10:43:07,346 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 10:43:07,351 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 10:43:07,351 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_isIdle_#res=0, ULTIMATE.start_isIdle_~retValue_acc~10=0} Honda state: {ULTIMATE.start_isIdle_#res=0, ULTIMATE.start_isIdle_~retValue_acc~10=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f1f97b6a-77d8-4157-9007-6f87c4d542a3/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 10:43:07,366 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 10:43:07,366 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 10:43:07,368 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 10:43:07,368 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_#t~ret42=0} Honda state: {ULTIMATE.start_anyStopRequested_#t~ret42=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f1f97b6a-77d8-4157-9007-6f87c4d542a3/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 10:43:07,385 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 10:43:07,385 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 10:43:07,387 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 10:43:07,387 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_#t~ret41=0} Honda state: {ULTIMATE.start_anyStopRequested_#t~ret41=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f1f97b6a-77d8-4157-9007-6f87c4d542a3/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 10:43:07,403 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 10:43:07,403 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 10:43:07,419 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 10:43:07,419 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_#res=1, ULTIMATE.start_anyStopRequested_~retValue_acc~9=1, ULTIMATE.start_isIdle_~tmp~8=1} Honda state: {ULTIMATE.start_anyStopRequested_#res=1, ULTIMATE.start_anyStopRequested_~retValue_acc~9=1, ULTIMATE.start_isIdle_~tmp~8=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f1f97b6a-77d8-4157-9007-6f87c4d542a3/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 10:43:07,441 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 10:43:07,441 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 10:43:07,455 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 10:43:07,455 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~weight~0=1, ~maximumWeight~0=0} Honda state: {~weight~0=1, ~maximumWeight~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f1f97b6a-77d8-4157-9007-6f87c4d542a3/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 10:43:07,458 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 10:43:07,459 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 10:43:07,460 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 10:43:07,460 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_#t~ret45=0} Honda state: {ULTIMATE.start_anyStopRequested_#t~ret45=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f1f97b6a-77d8-4157-9007-6f87c4d542a3/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 10:43:07,477 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 10:43:07,477 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 10:43:07,478 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 10:43:07,479 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_#t~ret44=0} Honda state: {ULTIMATE.start_anyStopRequested_#t~ret44=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f1f97b6a-77d8-4157-9007-6f87c4d542a3/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 10:43:07,494 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 10:43:07,494 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f1f97b6a-77d8-4157-9007-6f87c4d542a3/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 10:43:07,511 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 10:43:07,511 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 10:43:07,534 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 10:43:07,535 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 10:43:07,535 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 10:43:07,535 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 10:43:07,535 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 10:43:07,536 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 10:43:07,536 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 10:43:07,536 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 10:43:07,536 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 10:43:07,536 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec9_product26_false-unreach-call_true-termination.cil.c_Iteration3_Loop [2018-11-28 10:43:07,536 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 10:43:07,536 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 10:43:07,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:43:07,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:43:07,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:43:07,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:43:07,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:43:07,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:43:07,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:43:07,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:43:07,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:43:07,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:43:07,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:43:07,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:43:07,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:43:07,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:43:07,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:43:07,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:43:07,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:43:07,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:43:07,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:43:07,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:43:07,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:43:07,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:43:07,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:43:07,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:43:07,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:43:07,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:43:07,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:43:07,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:43:07,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:43:08,004 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 10:43:08,008 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 10:43:08,009 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:43:08,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:43:08,011 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:43:08,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:43:08,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:43:08,011 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:43:08,013 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:43:08,013 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:43:08,014 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:43:08,015 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:43:08,015 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:43:08,015 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:43:08,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:43:08,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:43:08,016 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:43:08,016 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:43:08,016 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:43:08,017 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:43:08,018 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-28 10:43:08,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:43:08,018 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:43:08,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:43:08,018 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 10:43:08,019 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:43:08,020 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 10:43:08,020 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:43:08,025 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:43:08,025 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:43:08,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:43:08,026 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:43:08,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:43:08,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:43:08,026 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:43:08,026 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:43:08,027 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:43:08,032 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:43:08,033 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:43:08,033 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:43:08,033 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:43:08,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:43:08,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:43:08,034 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:43:08,034 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:43:08,034 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:43:08,035 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:43:08,035 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:43:08,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:43:08,035 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:43:08,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:43:08,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:43:08,036 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:43:08,036 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:43:08,037 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:43:08,045 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:43:08,045 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-28 10:43:08,046 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:43:08,046 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:43:08,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:43:08,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:43:08,046 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:43:08,047 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:43:08,047 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:43:08,048 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:43:08,048 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-28 10:43:08,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:43:08,054 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:43:08,054 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:43:08,054 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:43:08,054 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:43:08,054 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:43:08,055 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:43:08,056 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:43:08,056 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-28 10:43:08,056 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:43:08,056 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:43:08,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:43:08,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:43:08,057 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:43:08,057 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:43:08,057 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:43:08,058 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:43:08,058 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-28 10:43:08,058 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:43:08,059 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:43:08,059 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:43:08,059 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:43:08,059 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:43:08,059 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:43:08,059 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:43:08,063 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:43:08,063 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-28 10:43:08,064 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:43:08,064 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:43:08,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:43:08,064 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:43:08,064 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:43:08,064 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:43:08,065 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:43:08,065 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:43:08,066 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:43:08,066 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:43:08,066 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:43:08,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:43:08,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:43:08,066 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:43:08,067 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:43:08,067 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:43:08,067 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:43:08,068 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:43:08,068 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:43:08,068 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:43:08,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:43:08,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:43:08,068 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:43:08,069 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:43:08,069 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:43:08,069 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:43:08,069 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-28 10:43:08,070 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:43:08,070 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:43:08,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:43:08,070 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 10:43:08,082 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:43:08,083 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 10:43:08,083 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:43:08,086 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:43:08,086 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:43:08,087 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:43:08,087 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:43:08,087 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:43:08,087 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:43:08,087 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:43:08,087 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:43:08,087 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:43:08,090 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:43:08,091 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:43:08,091 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:43:08,091 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:43:08,091 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:43:08,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:43:08,092 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:43:08,092 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:43:08,092 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:43:08,092 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:43:08,093 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:43:08,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:43:08,093 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:43:08,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:43:08,093 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:43:08,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:43:08,094 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:43:08,094 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:43:08,094 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:43:08,095 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-28 10:43:08,095 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:43:08,095 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:43:08,095 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:43:08,095 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:43:08,095 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:43:08,096 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:43:08,096 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:43:08,096 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:43:08,097 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-28 10:43:08,097 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:43:08,097 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:43:08,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:43:08,097 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 10:43:08,097 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:43:08,105 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 10:43:08,105 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:43:08,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:43:08,111 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:43:08,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:43:08,111 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:43:08,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:43:08,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:43:08,112 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:43:08,112 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:43:08,112 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:43:08,113 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:43:08,113 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-28 10:43:08,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:43:08,113 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:43:08,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:43:08,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:43:08,114 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:43:08,114 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:43:08,114 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:43:08,115 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:43:08,115 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-28 10:43:08,115 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:43:08,115 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:43:08,115 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:43:08,115 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:43:08,116 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:43:08,116 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:43:08,116 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:43:08,116 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:43:08,117 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-28 10:43:08,117 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:43:08,117 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:43:08,117 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:43:08,117 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:43:08,117 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:43:08,117 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:43:08,118 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:43:08,118 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:43:08,118 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-28 10:43:08,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:43:08,119 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:43:08,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:43:08,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:43:08,119 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:43:08,119 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:43:08,120 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:43:08,121 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:43:08,121 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-28 10:43:08,121 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:43:08,121 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:43:08,122 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:43:08,122 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 10:43:08,122 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:43:08,123 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 10:43:08,123 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:43:08,127 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:43:08,127 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-28 10:43:08,127 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:43:08,127 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:43:08,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:43:08,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:43:08,128 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:43:08,128 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:43:08,128 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:43:08,129 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:43:08,129 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-28 10:43:08,129 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:43:08,129 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:43:08,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:43:08,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:43:08,130 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:43:08,130 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:43:08,130 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:43:08,135 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:43:08,135 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-28 10:43:08,136 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:43:08,136 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:43:08,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:43:08,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:43:08,136 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:43:08,136 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:43:08,136 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:43:08,137 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:43:08,137 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-28 10:43:08,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:43:08,138 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:43:08,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:43:08,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:43:08,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:43:08,138 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:43:08,139 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:43:08,141 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 10:43:08,145 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 10:43:08,145 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 10:43:08,146 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 10:43:08,146 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 10:43:08,147 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 10:43:08,147 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~cleanupTimeShifts~0, ULTIMATE.start_cleanup_~i~1) = 1*~cleanupTimeShifts~0 - 1*ULTIMATE.start_cleanup_~i~1 Supporting invariants [] [2018-11-28 10:43:08,148 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 10:43:08,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:43:08,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:43:08,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:43:08,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:43:08,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:43:08,291 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-28 10:43:08,294 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-28 10:43:08,295 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 4319 states and 8148 transitions. cyclomatic complexity: 3830 Second operand 5 states. [2018-11-28 10:43:08,507 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 4319 states and 8148 transitions. cyclomatic complexity: 3830. Second operand 5 states. Result 7086 states and 13370 transitions. Complement of second has 8 states. [2018-11-28 10:43:08,507 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-28 10:43:08,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 10:43:08,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 6946 transitions. [2018-11-28 10:43:08,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6946 transitions. Stem has 27 letters. Loop has 25 letters. [2018-11-28 10:43:08,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:43:08,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6946 transitions. Stem has 52 letters. Loop has 25 letters. [2018-11-28 10:43:08,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:43:08,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6946 transitions. Stem has 27 letters. Loop has 50 letters. [2018-11-28 10:43:08,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:43:08,516 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7086 states and 13370 transitions. [2018-11-28 10:43:08,539 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 10:43:08,540 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7086 states to 0 states and 0 transitions. [2018-11-28 10:43:08,540 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 10:43:08,540 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 10:43:08,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 10:43:08,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 10:43:08,540 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 10:43:08,540 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 10:43:08,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 10:43:08,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 10:43:08,541 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2018-11-28 10:43:08,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:43:08,541 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-28 10:43:08,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 10:43:08,541 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-28 10:43:08,541 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 10:43:08,541 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 10:43:08,541 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 10:43:08,541 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 10:43:08,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 10:43:08,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 10:43:08,541 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 10:43:08,541 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 10:43:08,542 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 10:43:08,542 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 10:43:08,542 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 10:43:08,542 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 10:43:08,542 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 10:43:08,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 10:43:08 BoogieIcfgContainer [2018-11-28 10:43:08,547 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 10:43:08,548 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 10:43:08,548 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 10:43:08,548 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 10:43:08,548 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:43:04" (3/4) ... [2018-11-28 10:43:08,551 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 10:43:08,551 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 10:43:08,552 INFO L168 Benchmark]: Toolchain (without parser) took 10349.40 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 505.4 MB). Free memory was 958.0 MB in the beginning and 1.2 GB in the end (delta: -249.4 MB). Peak memory consumption was 256.1 MB. Max. memory is 11.5 GB. [2018-11-28 10:43:08,553 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 984.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 10:43:08,553 INFO L168 Benchmark]: CACSL2BoogieTranslator took 591.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 958.0 MB in the beginning and 1.1 GB in the end (delta: -139.4 MB). Peak memory consumption was 48.7 MB. Max. memory is 11.5 GB. [2018-11-28 10:43:08,553 INFO L168 Benchmark]: Boogie Procedure Inliner took 156.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.5 MB). Peak memory consumption was 45.5 MB. Max. memory is 11.5 GB. [2018-11-28 10:43:08,554 INFO L168 Benchmark]: Boogie Preprocessor took 159.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 42.0 MB). Peak memory consumption was 42.0 MB. Max. memory is 11.5 GB. [2018-11-28 10:43:08,554 INFO L168 Benchmark]: RCFGBuilder took 5281.11 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 186.6 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -131.4 MB). Peak memory consumption was 444.3 MB. Max. memory is 11.5 GB. [2018-11-28 10:43:08,555 INFO L168 Benchmark]: BuchiAutomizer took 4155.03 ms. Allocated memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: 179.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -66.1 MB). Peak memory consumption was 113.2 MB. Max. memory is 11.5 GB. [2018-11-28 10:43:08,555 INFO L168 Benchmark]: Witness Printer took 3.66 ms. Allocated memory is still 1.5 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 10:43:08,558 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 984.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 591.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 958.0 MB in the beginning and 1.1 GB in the end (delta: -139.4 MB). Peak memory consumption was 48.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 156.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.5 MB). Peak memory consumption was 45.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 159.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 42.0 MB). Peak memory consumption was 42.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 5281.11 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 186.6 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -131.4 MB). Peak memory consumption was 444.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4155.03 ms. Allocated memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: 179.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -66.1 MB). Peak memory consumption was 113.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.66 ms. Allocated memory is still 1.5 GB. Free memory is still 1.2 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 4.1s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.1s. Construction of modules took 0.3s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 11695 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 4845 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 30400 SDtfs, 58233 SDslu, 68802 SDs, 0 SdLazy, 267 SolverSat, 284 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s 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: 4 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 11 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...