./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/elevator_spec14_product24_false-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/product-lines/elevator_spec14_product24_false-unreach-call_true-termination.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2fd90e89c0e98d2aa335e1695a5b9f6f2ec5e5af ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 03:53:43,108 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 03:53:43,110 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 03:53:43,125 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 03:53:43,126 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 03:53:43,128 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 03:53:43,131 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 03:53:43,134 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 03:53:43,136 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 03:53:43,139 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 03:53:43,141 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 03:53:43,142 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 03:53:43,143 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 03:53:43,146 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 03:53:43,148 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 03:53:43,150 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 03:53:43,151 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 03:53:43,153 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 03:53:43,155 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 03:53:43,156 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 03:53:43,157 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 03:53:43,158 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 03:53:43,161 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 03:53:43,161 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 03:53:43,161 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 03:53:43,162 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 03:53:43,163 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 03:53:43,164 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 03:53:43,165 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 03:53:43,166 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 03:53:43,167 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 03:53:43,167 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 03:53:43,168 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 03:53:43,168 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 03:53:43,169 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 03:53:43,170 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 03:53:43,171 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 03:53:43,188 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 03:53:43,189 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 03:53:43,190 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 03:53:43,190 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 03:53:43,190 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 03:53:43,191 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 03:53:43,191 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 03:53:43,192 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 03:53:43,192 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 03:53:43,192 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 03:53:43,192 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 03:53:43,192 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 03:53:43,192 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 03:53:43,193 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 03:53:43,193 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 03:53:43,193 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 03:53:43,193 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 03:53:43,193 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 03:53:43,193 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 03:53:43,194 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 03:53:43,195 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 03:53:43,196 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 03:53:43,196 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 03:53:43,196 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 03:53:43,196 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 03:53:43,196 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 03:53:43,196 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 03:53:43,197 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 03:53:43,198 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 03:53:43,198 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 03:53:43,198 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 03:53:43,199 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 03:53:43,200 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2fd90e89c0e98d2aa335e1695a5b9f6f2ec5e5af [2019-01-14 03:53:43,235 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 03:53:43,247 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 03:53:43,251 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 03:53:43,253 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 03:53:43,253 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 03:53:43,254 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/elevator_spec14_product24_false-unreach-call_true-termination.cil.c [2019-01-14 03:53:43,325 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6c4b4cff/9d3387c0cb4147c9b25b98843cd067fa/FLAGbcc209aea [2019-01-14 03:53:43,945 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 03:53:43,946 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/elevator_spec14_product24_false-unreach-call_true-termination.cil.c [2019-01-14 03:53:43,975 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6c4b4cff/9d3387c0cb4147c9b25b98843cd067fa/FLAGbcc209aea [2019-01-14 03:53:44,108 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6c4b4cff/9d3387c0cb4147c9b25b98843cd067fa [2019-01-14 03:53:44,112 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 03:53:44,114 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 03:53:44,115 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 03:53:44,115 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 03:53:44,120 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 03:53:44,121 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:53:44" (1/1) ... [2019-01-14 03:53:44,124 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34a6c6e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:53:44, skipping insertion in model container [2019-01-14 03:53:44,124 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:53:44" (1/1) ... [2019-01-14 03:53:44,133 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 03:53:44,227 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 03:53:44,896 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 03:53:44,928 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 03:53:45,156 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 03:53:45,226 INFO L195 MainTranslator]: Completed translation [2019-01-14 03:53:45,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:53:45 WrapperNode [2019-01-14 03:53:45,226 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 03:53:45,228 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 03:53:45,228 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 03:53:45,228 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 03:53:45,238 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:53:45" (1/1) ... [2019-01-14 03:53:45,280 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:53:45" (1/1) ... [2019-01-14 03:53:46,019 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 03:53:46,021 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 03:53:46,021 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 03:53:46,022 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 03:53:46,033 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:53:45" (1/1) ... [2019-01-14 03:53:46,033 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:53:45" (1/1) ... [2019-01-14 03:53:46,161 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:53:45" (1/1) ... [2019-01-14 03:53:46,163 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:53:45" (1/1) ... [2019-01-14 03:53:46,464 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:53:45" (1/1) ... [2019-01-14 03:53:46,997 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:53:45" (1/1) ... [2019-01-14 03:53:47,088 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:53:45" (1/1) ... [2019-01-14 03:53:47,267 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 03:53:47,267 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 03:53:47,268 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 03:53:47,268 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 03:53:47,269 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:53:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:53:47,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 03:53:47,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-14 03:53:47,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 03:53:47,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 03:54:17,174 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 03:54:17,175 INFO L286 CfgBuilder]: Removed 3823 assue(true) statements. [2019-01-14 03:54:17,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:54:17 BoogieIcfgContainer [2019-01-14 03:54:17,185 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 03:54:17,186 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 03:54:17,186 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 03:54:17,190 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 03:54:17,191 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 03:54:17,191 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 03:53:44" (1/3) ... [2019-01-14 03:54:17,193 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5703588e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 03:54:17, skipping insertion in model container [2019-01-14 03:54:17,193 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 03:54:17,193 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:53:45" (2/3) ... [2019-01-14 03:54:17,194 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5703588e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 03:54:17, skipping insertion in model container [2019-01-14 03:54:17,195 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 03:54:17,195 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:54:17" (3/3) ... [2019-01-14 03:54:17,196 INFO L375 chiAutomizerObserver]: Analyzing ICFG elevator_spec14_product24_false-unreach-call_true-termination.cil.c [2019-01-14 03:54:17,259 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 03:54:17,260 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 03:54:17,260 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 03:54:17,260 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 03:54:17,261 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 03:54:17,261 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 03:54:17,261 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 03:54:17,261 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 03:54:17,261 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 03:54:17,474 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16942 states. [2019-01-14 03:54:17,765 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3406 [2019-01-14 03:54:17,766 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:54:17,766 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:54:17,790 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:54:17,791 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:54:17,791 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 03:54:17,791 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16942 states. [2019-01-14 03:54:17,971 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3406 [2019-01-14 03:54:17,971 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:54:17,971 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:54:17,978 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:54:17,978 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:54:17,987 INFO L794 eck$LassoCheckResult]: Stem: 2705#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~cleanupTimeShifts~0 := 12;~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~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~string78.base, #t~string78.offset := #Ultimate.allocOnStack(10);call #t~string80.base, #t~string80.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string80.base, #t~string80.offset, 1);call write~init~int(95, #t~string80.base, 1 + #t~string80.offset, 1);call write~init~int(93, #t~string80.base, 2 + #t~string80.offset, 1);call write~init~int(0, #t~string80.base, 3 + #t~string80.offset, 1);call #t~string82.base, #t~string82.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string82.base, #t~string82.offset, 1);call write~init~int(93, #t~string82.base, 1 + #t~string82.offset, 1);call write~init~int(32, #t~string82.base, 2 + #t~string82.offset, 1);call write~init~int(0, #t~string82.base, 3 + #t~string82.offset, 1);call #t~string84.base, #t~string84.offset := #Ultimate.allocOnStack(5);call write~init~int(32, #t~string84.base, #t~string84.offset, 1);call write~init~int(97, #t~string84.base, 1 + #t~string84.offset, 1);call write~init~int(116, #t~string84.base, 2 + #t~string84.offset, 1);call write~init~int(32, #t~string84.base, 3 + #t~string84.offset, 1);call write~init~int(0, #t~string84.base, 4 + #t~string84.offset, 1);call #t~string86.base, #t~string86.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string86.base, #t~string86.offset, 1);call write~init~int(105, #t~string86.base, 1 + #t~string86.offset, 1);call write~init~int(0, #t~string86.base, 2 + #t~string86.offset, 1);call #t~string88.base, #t~string88.offset := #Ultimate.allocOnStack(10);call #t~string90.base, #t~string90.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string90.base, #t~string90.offset, 1);call write~init~int(112, #t~string90.base, 1 + #t~string90.offset, 1);call write~init~int(0, #t~string90.base, 2 + #t~string90.offset, 1);call #t~string92.base, #t~string92.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string92.base, #t~string92.offset, 1);call write~init~int(111, #t~string92.base, 1 + #t~string92.offset, 1);call write~init~int(119, #t~string92.base, 2 + #t~string92.offset, 1);call write~init~int(110, #t~string92.base, 3 + #t~string92.offset, 1);call write~init~int(0, #t~string92.base, 4 + #t~string92.offset, 1);call #t~string94.base, #t~string94.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string94.base, #t~string94.offset, 1);call write~init~int(73, #t~string94.base, 1 + #t~string94.offset, 1);call write~init~int(76, #t~string94.base, 2 + #t~string94.offset, 1);call write~init~int(95, #t~string94.base, 3 + #t~string94.offset, 1);call write~init~int(112, #t~string94.base, 4 + #t~string94.offset, 1);call write~init~int(58, #t~string94.base, 5 + #t~string94.offset, 1);call write~init~int(0, #t~string94.base, 6 + #t~string94.offset, 1);call #t~string96.base, #t~string96.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string96.base, #t~string96.offset, 1);call write~init~int(37, #t~string96.base, 1 + #t~string96.offset, 1);call write~init~int(105, #t~string96.base, 2 + #t~string96.offset, 1);call write~init~int(0, #t~string96.base, 3 + #t~string96.offset, 1);call #t~string98.base, #t~string98.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string98.base, #t~string98.offset, 1);call write~init~int(37, #t~string98.base, 1 + #t~string98.offset, 1);call write~init~int(105, #t~string98.base, 2 + #t~string98.offset, 1);call write~init~int(0, #t~string98.base, 3 + #t~string98.offset, 1);call #t~string100.base, #t~string100.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string100.base, #t~string100.offset, 1);call write~init~int(37, #t~string100.base, 1 + #t~string100.offset, 1);call write~init~int(105, #t~string100.base, 2 + #t~string100.offset, 1);call write~init~int(0, #t~string100.base, 3 + #t~string100.offset, 1);call #t~string102.base, #t~string102.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string102.base, #t~string102.offset, 1);call write~init~int(37, #t~string102.base, 1 + #t~string102.offset, 1);call write~init~int(105, #t~string102.base, 2 + #t~string102.offset, 1);call write~init~int(0, #t~string102.base, 3 + #t~string102.offset, 1);call #t~string104.base, #t~string104.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string104.base, #t~string104.offset, 1);call write~init~int(37, #t~string104.base, 1 + #t~string104.offset, 1);call write~init~int(105, #t~string104.base, 2 + #t~string104.offset, 1);call write~init~int(0, #t~string104.base, 3 + #t~string104.offset, 1);call #t~string106.base, #t~string106.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string106.base, #t~string106.offset, 1);call write~init~int(70, #t~string106.base, 1 + #t~string106.offset, 1);call write~init~int(95, #t~string106.base, 2 + #t~string106.offset, 1);call write~init~int(112, #t~string106.base, 3 + #t~string106.offset, 1);call write~init~int(58, #t~string106.base, 4 + #t~string106.offset, 1);call write~init~int(0, #t~string106.base, 5 + #t~string106.offset, 1);call #t~string109.base, #t~string109.offset := #Ultimate.allocOnStack(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~string112.base, #t~string112.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string112.base, #t~string112.offset, 1);call write~init~int(37, #t~string112.base, 1 + #t~string112.offset, 1);call write~init~int(105, #t~string112.base, 2 + #t~string112.offset, 1);call write~init~int(0, #t~string112.base, 3 + #t~string112.offset, 1);call #t~string115.base, #t~string115.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string115.base, #t~string115.offset, 1);call write~init~int(37, #t~string115.base, 1 + #t~string115.offset, 1);call write~init~int(105, #t~string115.base, 2 + #t~string115.offset, 1);call write~init~int(0, #t~string115.base, 3 + #t~string115.offset, 1);call #t~string118.base, #t~string118.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string118.base, #t~string118.offset, 1);call write~init~int(37, #t~string118.base, 1 + #t~string118.offset, 1);call write~init~int(105, #t~string118.base, 2 + #t~string118.offset, 1);call write~init~int(0, #t~string118.base, 3 + #t~string118.offset, 1);call #t~string121.base, #t~string121.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string121.base, #t~string121.offset, 1);call write~init~int(37, #t~string121.base, 1 + #t~string121.offset, 1);call write~init~int(105, #t~string121.base, 2 + #t~string121.offset, 1);call write~init~int(0, #t~string121.base, 3 + #t~string121.offset, 1);call #t~string123.base, #t~string123.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string123.base, #t~string123.offset, 1);call write~init~int(0, #t~string123.base, 1 + #t~string123.offset, 1);call #t~string126.base, #t~string126.offset := #Ultimate.allocOnStack(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;~head~0.base, ~head~0.offset := 0, 0;call #t~string147.base, #t~string147.offset := #Ultimate.allocOnStack(30);call #t~string148.base, #t~string148.offset := #Ultimate.allocOnStack(9);call #t~string149.base, #t~string149.offset := #Ultimate.allocOnStack(21);call #t~string150.base, #t~string150.offset := #Ultimate.allocOnStack(30);call #t~string151.base, #t~string151.offset := #Ultimate.allocOnStack(9);call #t~string152.base, #t~string152.offset := #Ultimate.allocOnStack(21);call #t~string156.base, #t~string156.offset := #Ultimate.allocOnStack(30);call #t~string157.base, #t~string157.offset := #Ultimate.allocOnStack(9);call #t~string158.base, #t~string158.offset := #Ultimate.allocOnStack(25);call #t~string159.base, #t~string159.offset := #Ultimate.allocOnStack(30);call #t~string160.base, #t~string160.offset := #Ultimate.allocOnStack(9);call #t~string161.base, #t~string161.offset := #Ultimate.allocOnStack(25); 16234#L-1true havoc main_#res;havoc main_#t~ret13, main_~retValue_acc~1, main_~tmp~8;havoc main_~retValue_acc~1;havoc main_~tmp~8; 14544#L3152true havoc valid_product_#res;havoc valid_product_~retValue_acc~28;havoc valid_product_~retValue_acc~28;valid_product_~retValue_acc~28 := 1;valid_product_#res := valid_product_~retValue_acc~28; 14696#L3160true main_#t~ret13 := valid_product_#res;main_~tmp~8 := main_#t~ret13;havoc main_#t~ret13; 15890#L385true assume 0 != main_~tmp~8; 16066#L358true havoc bigMacCall_#t~ret6, bigMacCall_~tmp~5;havoc bigMacCall_~tmp~5;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~30;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~30; 15832#L3208true assume 0 == getOrigin_~person;getOrigin_~retValue_acc~30 := 4;getOrigin_#res := getOrigin_~retValue_acc~30; 7962#L3233true bigMacCall_#t~ret6 := getOrigin_#res;bigMacCall_~tmp~5 := bigMacCall_#t~ret6;havoc bigMacCall_#t~ret6;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~5;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 14665#L2456true assume 0 == initPersonOnFloor_~floor; 14662#L2457true assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 13548#L2564-1true callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 5086#L2248true assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 5422#L2260-2true havoc timeShift_#t~ret77, timeShift_~tmp~23;havoc timeShift_~tmp~23;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~4;havoc areDoorsOpen_~retValue_acc~4;areDoorsOpen_~retValue_acc~4 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~4; 14658#L699true timeShift_#t~ret77 := areDoorsOpen_#res;timeShift_~tmp~23 := timeShift_#t~ret77;havoc timeShift_#t~ret77; 3042#L1709true assume 0 != timeShift_~tmp~23; 2903#L1710true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 2992#L1355-11true havoc __utac_acc__Specification14_spec__1_#t~ret14, __utac_acc__Specification14_spec__1_#t~ret15, __utac_acc__Specification14_spec__1_#t~ret16, __utac_acc__Specification14_spec__1_#t~ret17, __utac_acc__Specification14_spec__1_~tmp~9, __utac_acc__Specification14_spec__1_~tmp___0~2, __utac_acc__Specification14_spec__1_~tmp___1~1, __utac_acc__Specification14_spec__1_~tmp___2~1;havoc __utac_acc__Specification14_spec__1_~tmp~9;havoc __utac_acc__Specification14_spec__1_~tmp___0~2;havoc __utac_acc__Specification14_spec__1_~tmp___1~1;havoc __utac_acc__Specification14_spec__1_~tmp___2~1;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret128, isExecutiveFloorCalling_~retValue_acc~19;havoc isExecutiveFloorCalling_~retValue_acc~19;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~21;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~21; 8699#L2185-130true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~21 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~21; 13285#L2212-130true isExecutiveFloorCalling_#t~ret128 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~19 := isExecutiveFloorCalling_#t~ret128;havoc isExecutiveFloorCalling_#t~ret128;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~19; 14616#L2089-6true __utac_acc__Specification14_spec__1_#t~ret14 := isExecutiveFloorCalling_#res;__utac_acc__Specification14_spec__1_~tmp___2~1 := __utac_acc__Specification14_spec__1_#t~ret14;havoc __utac_acc__Specification14_spec__1_#t~ret14; 8517#L432true assume !(0 != __utac_acc__Specification14_spec__1_~tmp___2~1); 8522#L432-1true havoc timeShift_#t~ret77, timeShift_~tmp~23;havoc timeShift_~tmp~23;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~4;havoc areDoorsOpen_~retValue_acc~4;areDoorsOpen_~retValue_acc~4 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~4; 14653#L699-2true timeShift_#t~ret77 := areDoorsOpen_#res;timeShift_~tmp~23 := timeShift_#t~ret77;havoc timeShift_#t~ret77; 3048#L1709-1true assume 0 != timeShift_~tmp~23; 2908#L1710-2true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 2973#L1355-23true havoc __utac_acc__Specification14_spec__1_#t~ret14, __utac_acc__Specification14_spec__1_#t~ret15, __utac_acc__Specification14_spec__1_#t~ret16, __utac_acc__Specification14_spec__1_#t~ret17, __utac_acc__Specification14_spec__1_~tmp~9, __utac_acc__Specification14_spec__1_~tmp___0~2, __utac_acc__Specification14_spec__1_~tmp___1~1, __utac_acc__Specification14_spec__1_~tmp___2~1;havoc __utac_acc__Specification14_spec__1_~tmp~9;havoc __utac_acc__Specification14_spec__1_~tmp___0~2;havoc __utac_acc__Specification14_spec__1_~tmp___1~1;havoc __utac_acc__Specification14_spec__1_~tmp___2~1;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret128, isExecutiveFloorCalling_~retValue_acc~19;havoc isExecutiveFloorCalling_~retValue_acc~19;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~21;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~21; 8527#L2185-261true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~21 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~21; 9994#L2212-261true isExecutiveFloorCalling_#t~ret128 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~19 := isExecutiveFloorCalling_#t~ret128;havoc isExecutiveFloorCalling_#t~ret128;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~19; 14613#L2089-13true __utac_acc__Specification14_spec__1_#t~ret14 := isExecutiveFloorCalling_#res;__utac_acc__Specification14_spec__1_~tmp___2~1 := __utac_acc__Specification14_spec__1_#t~ret14;havoc __utac_acc__Specification14_spec__1_#t~ret14; 8481#L432-2true assume !(0 != __utac_acc__Specification14_spec__1_~tmp___2~1); 8485#L432-3true havoc timeShift_#t~ret77, timeShift_~tmp~23;havoc timeShift_~tmp~23;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~4;havoc areDoorsOpen_~retValue_acc~4;areDoorsOpen_~retValue_acc~4 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~4; 14655#L699-4true timeShift_#t~ret77 := areDoorsOpen_#res;timeShift_~tmp~23 := timeShift_#t~ret77;havoc timeShift_#t~ret77; 3049#L1709-2true assume 0 != timeShift_~tmp~23; 2909#L1710-4true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 3075#L1355-35true havoc __utac_acc__Specification14_spec__1_#t~ret14, __utac_acc__Specification14_spec__1_#t~ret15, __utac_acc__Specification14_spec__1_#t~ret16, __utac_acc__Specification14_spec__1_#t~ret17, __utac_acc__Specification14_spec__1_~tmp~9, __utac_acc__Specification14_spec__1_~tmp___0~2, __utac_acc__Specification14_spec__1_~tmp___1~1, __utac_acc__Specification14_spec__1_~tmp___2~1;havoc __utac_acc__Specification14_spec__1_~tmp~9;havoc __utac_acc__Specification14_spec__1_~tmp___0~2;havoc __utac_acc__Specification14_spec__1_~tmp___1~1;havoc __utac_acc__Specification14_spec__1_~tmp___2~1;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret128, isExecutiveFloorCalling_~retValue_acc~19;havoc isExecutiveFloorCalling_~retValue_acc~19;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~21;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~21; 12374#L2185-392true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~21 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~21; 9725#L2212-392true isExecutiveFloorCalling_#t~ret128 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~19 := isExecutiveFloorCalling_#t~ret128;havoc isExecutiveFloorCalling_#t~ret128;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~19; 14609#L2089-20true __utac_acc__Specification14_spec__1_#t~ret14 := isExecutiveFloorCalling_#res;__utac_acc__Specification14_spec__1_~tmp___2~1 := __utac_acc__Specification14_spec__1_#t~ret14;havoc __utac_acc__Specification14_spec__1_#t~ret14; 8493#L432-4true assume !(0 != __utac_acc__Specification14_spec__1_~tmp___2~1); 8497#L432-5true havoc bobCall_#t~ret1, bobCall_~tmp~0;havoc bobCall_~tmp~0;getOrigin_#in~person := 0;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~30;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~30; 15833#L3208-1true assume 0 == getOrigin_~person;getOrigin_~retValue_acc~30 := 4;getOrigin_#res := getOrigin_~retValue_acc~30; 7961#L3233-1true bobCall_#t~ret1 := getOrigin_#res;bobCall_~tmp~0 := bobCall_#t~ret1;havoc bobCall_#t~ret1;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 0, bobCall_~tmp~0;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 14664#L2456-1true assume 0 == initPersonOnFloor_~floor; 14663#L2457-2true assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 13565#L2564-3true callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 5088#L2248-2true assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 5429#L2260-5true havoc cleanup_#t~ret7, cleanup_#t~ret8, cleanup_~i~0, cleanup_~tmp~6, cleanup_~tmp___0~0, cleanup_~__cil_tmp4~0;havoc cleanup_~i~0;havoc cleanup_~tmp~6;havoc cleanup_~tmp___0~0;havoc cleanup_~__cil_tmp4~0;havoc timeShift_#t~ret77, timeShift_~tmp~23;havoc timeShift_~tmp~23;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~4;havoc areDoorsOpen_~retValue_acc~4;areDoorsOpen_~retValue_acc~4 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~4; 14657#L699-6true timeShift_#t~ret77 := areDoorsOpen_#res;timeShift_~tmp~23 := timeShift_#t~ret77;havoc timeShift_#t~ret77; 3050#L1709-3true assume 0 != timeShift_~tmp~23; 2901#L1710-6true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 3058#L1355-47true havoc __utac_acc__Specification14_spec__1_#t~ret14, __utac_acc__Specification14_spec__1_#t~ret15, __utac_acc__Specification14_spec__1_#t~ret16, __utac_acc__Specification14_spec__1_#t~ret17, __utac_acc__Specification14_spec__1_~tmp~9, __utac_acc__Specification14_spec__1_~tmp___0~2, __utac_acc__Specification14_spec__1_~tmp___1~1, __utac_acc__Specification14_spec__1_~tmp___2~1;havoc __utac_acc__Specification14_spec__1_~tmp~9;havoc __utac_acc__Specification14_spec__1_~tmp___0~2;havoc __utac_acc__Specification14_spec__1_~tmp___1~1;havoc __utac_acc__Specification14_spec__1_~tmp___2~1;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret128, isExecutiveFloorCalling_~retValue_acc~19;havoc isExecutiveFloorCalling_~retValue_acc~19;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~21;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~21; 12071#L2185-523true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~21 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~21; 9620#L2212-523true isExecutiveFloorCalling_#t~ret128 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~19 := isExecutiveFloorCalling_#t~ret128;havoc isExecutiveFloorCalling_#t~ret128;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~19; 14581#L2089-27true __utac_acc__Specification14_spec__1_#t~ret14 := isExecutiveFloorCalling_#res;__utac_acc__Specification14_spec__1_~tmp___2~1 := __utac_acc__Specification14_spec__1_#t~ret14;havoc __utac_acc__Specification14_spec__1_#t~ret14; 8498#L432-6true assume !(0 != __utac_acc__Specification14_spec__1_~tmp___2~1); 8455#L432-7true cleanup_~i~0 := 0; 7618#L188-2true [2019-01-14 03:54:17,988 INFO L796 eck$LassoCheckResult]: Loop: 7618#L188-2true assume !false; 7669#L189true cleanup_~__cil_tmp4~0 := ~cleanupTimeShifts~0 - 1; 7610#L192true assume cleanup_~i~0 < cleanup_~__cil_tmp4~0;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~2;havoc isBlocked_~retValue_acc~2;isBlocked_~retValue_acc~2 := ~blocked~0;isBlocked_#res := isBlocked_~retValue_acc~2; 7751#L537true cleanup_#t~ret7 := isBlocked_#res;cleanup_~tmp___0~0 := cleanup_#t~ret7;havoc cleanup_#t~ret7; 6167#L196true assume 1 != cleanup_~tmp___0~0; 6162#L196-1true havoc isIdle_#res;havoc isIdle_#t~ret25, isIdle_~retValue_acc~9, isIdle_~tmp~13;havoc isIdle_~retValue_acc~9;havoc isIdle_~tmp~13;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret20, anyStopRequested_#t~ret21, anyStopRequested_#t~ret22, anyStopRequested_#t~ret23, anyStopRequested_#t~ret24, anyStopRequested_~retValue_acc~8, anyStopRequested_~tmp~12, anyStopRequested_~tmp___0~3, anyStopRequested_~tmp___1~2, anyStopRequested_~tmp___2~2, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~8;havoc anyStopRequested_~tmp~12;havoc anyStopRequested_~tmp___0~3;havoc anyStopRequested_~tmp___1~2;havoc anyStopRequested_~tmp___2~2;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~21;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~21; 12080#L2185-524true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~21 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~21; 9623#L2212-524true anyStopRequested_#t~ret20 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret20;havoc anyStopRequested_#t~ret20; 10982#L798true assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~8 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~8; 4447#L862true isIdle_#t~ret25 := anyStopRequested_#res;isIdle_~tmp~13 := isIdle_#t~ret25;havoc isIdle_#t~ret25;isIdle_~retValue_acc~9 := (if 0 == isIdle_~tmp~13 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~9; 4753#L875true cleanup_#t~ret8 := isIdle_#res;cleanup_~tmp~6 := cleanup_#t~ret8;havoc cleanup_#t~ret8; 6680#L208true assume !(0 != cleanup_~tmp~6);havoc timeShift_#t~ret77, timeShift_~tmp~23;havoc timeShift_~tmp~23;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~4;havoc areDoorsOpen_~retValue_acc~4;areDoorsOpen_~retValue_acc~4 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~4; 14651#L699-8true timeShift_#t~ret77 := areDoorsOpen_#res;timeShift_~tmp~23 := timeShift_#t~ret77;havoc timeShift_#t~ret77; 3033#L1709-4true assume 0 != timeShift_~tmp~23; 2902#L1710-8true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 3039#L1355-59true havoc __utac_acc__Specification14_spec__1_#t~ret14, __utac_acc__Specification14_spec__1_#t~ret15, __utac_acc__Specification14_spec__1_#t~ret16, __utac_acc__Specification14_spec__1_#t~ret17, __utac_acc__Specification14_spec__1_~tmp~9, __utac_acc__Specification14_spec__1_~tmp___0~2, __utac_acc__Specification14_spec__1_~tmp___1~1, __utac_acc__Specification14_spec__1_~tmp___2~1;havoc __utac_acc__Specification14_spec__1_~tmp~9;havoc __utac_acc__Specification14_spec__1_~tmp___0~2;havoc __utac_acc__Specification14_spec__1_~tmp___1~1;havoc __utac_acc__Specification14_spec__1_~tmp___2~1;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret128, isExecutiveFloorCalling_~retValue_acc~19;havoc isExecutiveFloorCalling_~retValue_acc~19;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~21;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~21; 10730#L2185-659true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~21 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~21; 10328#L2212-659true isExecutiveFloorCalling_#t~ret128 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~19 := isExecutiveFloorCalling_#t~ret128;havoc isExecutiveFloorCalling_#t~ret128;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~19; 14579#L2089-34true __utac_acc__Specification14_spec__1_#t~ret14 := isExecutiveFloorCalling_#res;__utac_acc__Specification14_spec__1_~tmp___2~1 := __utac_acc__Specification14_spec__1_#t~ret14;havoc __utac_acc__Specification14_spec__1_#t~ret14; 8465#L432-8true assume !(0 != __utac_acc__Specification14_spec__1_~tmp___2~1); 8467#L432-9true cleanup_~i~0 := 1 + cleanup_~i~0; 7618#L188-2true [2019-01-14 03:54:18,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:54:18,007 INFO L82 PathProgramCache]: Analyzing trace with hash -689435377, now seen corresponding path program 1 times [2019-01-14 03:54:18,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:54:18,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:54:18,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:54:18,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:54:18,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:54:18,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:54:18,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:54:18,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:54:18,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 03:54:18,446 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 03:54:18,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:54:18,446 INFO L82 PathProgramCache]: Analyzing trace with hash 982382477, now seen corresponding path program 1 times [2019-01-14 03:54:18,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:54:18,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:54:18,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:54:18,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:54:18,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:54:18,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:54:18,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:54:18,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:54:18,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-14 03:54:18,726 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 03:54:18,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 03:54:18,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-14 03:54:18,742 INFO L87 Difference]: Start difference. First operand 16942 states. Second operand 8 states. [2019-01-14 03:55:04,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:55:04,130 INFO L93 Difference]: Finished difference Result 227262 states and 428244 transitions. [2019-01-14 03:55:04,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-14 03:55:04,133 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 227262 states and 428244 transitions. [2019-01-14 03:55:05,246 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78338 [2019-01-14 03:55:06,418 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 227262 states to 227162 states and 428117 transitions. [2019-01-14 03:55:06,419 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 227162 [2019-01-14 03:55:06,642 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 227162 [2019-01-14 03:55:06,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 227162 states and 428117 transitions. [2019-01-14 03:55:06,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:55:06,961 INFO L706 BuchiCegarLoop]: Abstraction has 227162 states and 428117 transitions. [2019-01-14 03:55:07,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227162 states and 428117 transitions. [2019-01-14 03:55:09,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227162 to 33831. [2019-01-14 03:55:09,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33831 states. [2019-01-14 03:55:09,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33831 states to 33831 states and 63910 transitions. [2019-01-14 03:55:09,131 INFO L729 BuchiCegarLoop]: Abstraction has 33831 states and 63910 transitions. [2019-01-14 03:55:09,133 INFO L609 BuchiCegarLoop]: Abstraction has 33831 states and 63910 transitions. [2019-01-14 03:55:09,133 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 03:55:09,133 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33831 states and 63910 transitions. [2019-01-14 03:55:09,245 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6817 [2019-01-14 03:55:09,246 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:55:09,246 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:55:09,253 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:55:09,254 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:55:09,254 INFO L794 eck$LassoCheckResult]: Stem: 248069#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~cleanupTimeShifts~0 := 12;~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~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~string78.base, #t~string78.offset := #Ultimate.allocOnStack(10);call #t~string80.base, #t~string80.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string80.base, #t~string80.offset, 1);call write~init~int(95, #t~string80.base, 1 + #t~string80.offset, 1);call write~init~int(93, #t~string80.base, 2 + #t~string80.offset, 1);call write~init~int(0, #t~string80.base, 3 + #t~string80.offset, 1);call #t~string82.base, #t~string82.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string82.base, #t~string82.offset, 1);call write~init~int(93, #t~string82.base, 1 + #t~string82.offset, 1);call write~init~int(32, #t~string82.base, 2 + #t~string82.offset, 1);call write~init~int(0, #t~string82.base, 3 + #t~string82.offset, 1);call #t~string84.base, #t~string84.offset := #Ultimate.allocOnStack(5);call write~init~int(32, #t~string84.base, #t~string84.offset, 1);call write~init~int(97, #t~string84.base, 1 + #t~string84.offset, 1);call write~init~int(116, #t~string84.base, 2 + #t~string84.offset, 1);call write~init~int(32, #t~string84.base, 3 + #t~string84.offset, 1);call write~init~int(0, #t~string84.base, 4 + #t~string84.offset, 1);call #t~string86.base, #t~string86.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string86.base, #t~string86.offset, 1);call write~init~int(105, #t~string86.base, 1 + #t~string86.offset, 1);call write~init~int(0, #t~string86.base, 2 + #t~string86.offset, 1);call #t~string88.base, #t~string88.offset := #Ultimate.allocOnStack(10);call #t~string90.base, #t~string90.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string90.base, #t~string90.offset, 1);call write~init~int(112, #t~string90.base, 1 + #t~string90.offset, 1);call write~init~int(0, #t~string90.base, 2 + #t~string90.offset, 1);call #t~string92.base, #t~string92.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string92.base, #t~string92.offset, 1);call write~init~int(111, #t~string92.base, 1 + #t~string92.offset, 1);call write~init~int(119, #t~string92.base, 2 + #t~string92.offset, 1);call write~init~int(110, #t~string92.base, 3 + #t~string92.offset, 1);call write~init~int(0, #t~string92.base, 4 + #t~string92.offset, 1);call #t~string94.base, #t~string94.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string94.base, #t~string94.offset, 1);call write~init~int(73, #t~string94.base, 1 + #t~string94.offset, 1);call write~init~int(76, #t~string94.base, 2 + #t~string94.offset, 1);call write~init~int(95, #t~string94.base, 3 + #t~string94.offset, 1);call write~init~int(112, #t~string94.base, 4 + #t~string94.offset, 1);call write~init~int(58, #t~string94.base, 5 + #t~string94.offset, 1);call write~init~int(0, #t~string94.base, 6 + #t~string94.offset, 1);call #t~string96.base, #t~string96.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string96.base, #t~string96.offset, 1);call write~init~int(37, #t~string96.base, 1 + #t~string96.offset, 1);call write~init~int(105, #t~string96.base, 2 + #t~string96.offset, 1);call write~init~int(0, #t~string96.base, 3 + #t~string96.offset, 1);call #t~string98.base, #t~string98.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string98.base, #t~string98.offset, 1);call write~init~int(37, #t~string98.base, 1 + #t~string98.offset, 1);call write~init~int(105, #t~string98.base, 2 + #t~string98.offset, 1);call write~init~int(0, #t~string98.base, 3 + #t~string98.offset, 1);call #t~string100.base, #t~string100.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string100.base, #t~string100.offset, 1);call write~init~int(37, #t~string100.base, 1 + #t~string100.offset, 1);call write~init~int(105, #t~string100.base, 2 + #t~string100.offset, 1);call write~init~int(0, #t~string100.base, 3 + #t~string100.offset, 1);call #t~string102.base, #t~string102.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string102.base, #t~string102.offset, 1);call write~init~int(37, #t~string102.base, 1 + #t~string102.offset, 1);call write~init~int(105, #t~string102.base, 2 + #t~string102.offset, 1);call write~init~int(0, #t~string102.base, 3 + #t~string102.offset, 1);call #t~string104.base, #t~string104.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string104.base, #t~string104.offset, 1);call write~init~int(37, #t~string104.base, 1 + #t~string104.offset, 1);call write~init~int(105, #t~string104.base, 2 + #t~string104.offset, 1);call write~init~int(0, #t~string104.base, 3 + #t~string104.offset, 1);call #t~string106.base, #t~string106.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string106.base, #t~string106.offset, 1);call write~init~int(70, #t~string106.base, 1 + #t~string106.offset, 1);call write~init~int(95, #t~string106.base, 2 + #t~string106.offset, 1);call write~init~int(112, #t~string106.base, 3 + #t~string106.offset, 1);call write~init~int(58, #t~string106.base, 4 + #t~string106.offset, 1);call write~init~int(0, #t~string106.base, 5 + #t~string106.offset, 1);call #t~string109.base, #t~string109.offset := #Ultimate.allocOnStack(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~string112.base, #t~string112.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string112.base, #t~string112.offset, 1);call write~init~int(37, #t~string112.base, 1 + #t~string112.offset, 1);call write~init~int(105, #t~string112.base, 2 + #t~string112.offset, 1);call write~init~int(0, #t~string112.base, 3 + #t~string112.offset, 1);call #t~string115.base, #t~string115.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string115.base, #t~string115.offset, 1);call write~init~int(37, #t~string115.base, 1 + #t~string115.offset, 1);call write~init~int(105, #t~string115.base, 2 + #t~string115.offset, 1);call write~init~int(0, #t~string115.base, 3 + #t~string115.offset, 1);call #t~string118.base, #t~string118.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string118.base, #t~string118.offset, 1);call write~init~int(37, #t~string118.base, 1 + #t~string118.offset, 1);call write~init~int(105, #t~string118.base, 2 + #t~string118.offset, 1);call write~init~int(0, #t~string118.base, 3 + #t~string118.offset, 1);call #t~string121.base, #t~string121.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string121.base, #t~string121.offset, 1);call write~init~int(37, #t~string121.base, 1 + #t~string121.offset, 1);call write~init~int(105, #t~string121.base, 2 + #t~string121.offset, 1);call write~init~int(0, #t~string121.base, 3 + #t~string121.offset, 1);call #t~string123.base, #t~string123.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string123.base, #t~string123.offset, 1);call write~init~int(0, #t~string123.base, 1 + #t~string123.offset, 1);call #t~string126.base, #t~string126.offset := #Ultimate.allocOnStack(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;~head~0.base, ~head~0.offset := 0, 0;call #t~string147.base, #t~string147.offset := #Ultimate.allocOnStack(30);call #t~string148.base, #t~string148.offset := #Ultimate.allocOnStack(9);call #t~string149.base, #t~string149.offset := #Ultimate.allocOnStack(21);call #t~string150.base, #t~string150.offset := #Ultimate.allocOnStack(30);call #t~string151.base, #t~string151.offset := #Ultimate.allocOnStack(9);call #t~string152.base, #t~string152.offset := #Ultimate.allocOnStack(21);call #t~string156.base, #t~string156.offset := #Ultimate.allocOnStack(30);call #t~string157.base, #t~string157.offset := #Ultimate.allocOnStack(9);call #t~string158.base, #t~string158.offset := #Ultimate.allocOnStack(25);call #t~string159.base, #t~string159.offset := #Ultimate.allocOnStack(30);call #t~string160.base, #t~string160.offset := #Ultimate.allocOnStack(9);call #t~string161.base, #t~string161.offset := #Ultimate.allocOnStack(25); 248070#L-1 havoc main_#res;havoc main_#t~ret13, main_~retValue_acc~1, main_~tmp~8;havoc main_~retValue_acc~1;havoc main_~tmp~8; 260122#L3152 havoc valid_product_#res;havoc valid_product_~retValue_acc~28;havoc valid_product_~retValue_acc~28;valid_product_~retValue_acc~28 := 1;valid_product_#res := valid_product_~retValue_acc~28; 260123#L3160 main_#t~ret13 := valid_product_#res;main_~tmp~8 := main_#t~ret13;havoc main_#t~ret13; 260302#L385 assume 0 != main_~tmp~8; 261323#L358 havoc bigMacCall_#t~ret6, bigMacCall_~tmp~5;havoc bigMacCall_~tmp~5;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~30;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~30; 261266#L3208 assume 0 == getOrigin_~person;getOrigin_~retValue_acc~30 := 4;getOrigin_#res := getOrigin_~retValue_acc~30; 253658#L3233 bigMacCall_#t~ret6 := getOrigin_#res;bigMacCall_~tmp~5 := bigMacCall_#t~ret6;havoc bigMacCall_#t~ret6;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~5;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 253659#L2456 assume 0 == initPersonOnFloor_~floor; 260247#L2457 assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 253542#L2564-1 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 250659#L2248 assume !(0 == callOnFloor_~floorID); 250529#L2251 assume 1 == callOnFloor_~floorID;~calls_1~0 := 1; 250530#L2260-2 havoc timeShift_#t~ret77, timeShift_~tmp~23;havoc timeShift_~tmp~23;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~4;havoc areDoorsOpen_~retValue_acc~4;areDoorsOpen_~retValue_acc~4 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~4; 251050#L699 timeShift_#t~ret77 := areDoorsOpen_#res;timeShift_~tmp~23 := timeShift_#t~ret77;havoc timeShift_#t~ret77; 248580#L1709 assume 0 != timeShift_~tmp~23; 248581#L1710 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 262198#L1355-11 havoc __utac_acc__Specification14_spec__1_#t~ret14, __utac_acc__Specification14_spec__1_#t~ret15, __utac_acc__Specification14_spec__1_#t~ret16, __utac_acc__Specification14_spec__1_#t~ret17, __utac_acc__Specification14_spec__1_~tmp~9, __utac_acc__Specification14_spec__1_~tmp___0~2, __utac_acc__Specification14_spec__1_~tmp___1~1, __utac_acc__Specification14_spec__1_~tmp___2~1;havoc __utac_acc__Specification14_spec__1_~tmp~9;havoc __utac_acc__Specification14_spec__1_~tmp___0~2;havoc __utac_acc__Specification14_spec__1_~tmp___1~1;havoc __utac_acc__Specification14_spec__1_~tmp___2~1;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret128, isExecutiveFloorCalling_~retValue_acc~19;havoc isExecutiveFloorCalling_~retValue_acc~19;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~21;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~21; 255260#L2185-130 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~21 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~21; 255129#L2212-130 isExecutiveFloorCalling_#t~ret128 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~19 := isExecutiveFloorCalling_#t~ret128;havoc isExecutiveFloorCalling_#t~ret128;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~19; 259621#L2089-6 __utac_acc__Specification14_spec__1_#t~ret14 := isExecutiveFloorCalling_#res;__utac_acc__Specification14_spec__1_~tmp___2~1 := __utac_acc__Specification14_spec__1_#t~ret14;havoc __utac_acc__Specification14_spec__1_#t~ret14; 260176#L432 assume !(0 != __utac_acc__Specification14_spec__1_~tmp___2~1); 254989#L432-1 havoc timeShift_#t~ret77, timeShift_~tmp~23;havoc timeShift_~tmp~23;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~4;havoc areDoorsOpen_~retValue_acc~4;areDoorsOpen_~retValue_acc~4 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~4; 254990#L699-2 timeShift_#t~ret77 := areDoorsOpen_#res;timeShift_~tmp~23 := timeShift_#t~ret77;havoc timeShift_#t~ret77; 248591#L1709-1 assume 0 != timeShift_~tmp~23; 248358#L1710-2 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 248359#L1355-23 havoc __utac_acc__Specification14_spec__1_#t~ret14, __utac_acc__Specification14_spec__1_#t~ret15, __utac_acc__Specification14_spec__1_#t~ret16, __utac_acc__Specification14_spec__1_#t~ret17, __utac_acc__Specification14_spec__1_~tmp~9, __utac_acc__Specification14_spec__1_~tmp___0~2, __utac_acc__Specification14_spec__1_~tmp___1~1, __utac_acc__Specification14_spec__1_~tmp___2~1;havoc __utac_acc__Specification14_spec__1_~tmp~9;havoc __utac_acc__Specification14_spec__1_~tmp___0~2;havoc __utac_acc__Specification14_spec__1_~tmp___1~1;havoc __utac_acc__Specification14_spec__1_~tmp___2~1;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret128, isExecutiveFloorCalling_~retValue_acc~19;havoc isExecutiveFloorCalling_~retValue_acc~19;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~21;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~21; 255001#L2185-261 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~21 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~21; 255002#L2212-261 isExecutiveFloorCalling_#t~ret128 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~19 := isExecutiveFloorCalling_#t~ret128;havoc isExecutiveFloorCalling_#t~ret128;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~19; 256773#L2089-13 __utac_acc__Specification14_spec__1_#t~ret14 := isExecutiveFloorCalling_#res;__utac_acc__Specification14_spec__1_~tmp___2~1 := __utac_acc__Specification14_spec__1_#t~ret14;havoc __utac_acc__Specification14_spec__1_#t~ret14; 260172#L432-2 assume !(0 != __utac_acc__Specification14_spec__1_~tmp___2~1); 254893#L432-3 havoc timeShift_#t~ret77, timeShift_~tmp~23;havoc timeShift_~tmp~23;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~4;havoc areDoorsOpen_~retValue_acc~4;areDoorsOpen_~retValue_acc~4 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~4; 254894#L699-4 timeShift_#t~ret77 := areDoorsOpen_#res;timeShift_~tmp~23 := timeShift_#t~ret77;havoc timeShift_#t~ret77; 248593#L1709-2 assume 0 != timeShift_~tmp~23; 248361#L1710-4 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 248362#L1355-35 havoc __utac_acc__Specification14_spec__1_#t~ret14, __utac_acc__Specification14_spec__1_#t~ret15, __utac_acc__Specification14_spec__1_#t~ret16, __utac_acc__Specification14_spec__1_#t~ret17, __utac_acc__Specification14_spec__1_~tmp~9, __utac_acc__Specification14_spec__1_~tmp___0~2, __utac_acc__Specification14_spec__1_~tmp___1~1, __utac_acc__Specification14_spec__1_~tmp___2~1;havoc __utac_acc__Specification14_spec__1_~tmp~9;havoc __utac_acc__Specification14_spec__1_~tmp___0~2;havoc __utac_acc__Specification14_spec__1_~tmp___1~1;havoc __utac_acc__Specification14_spec__1_~tmp___2~1;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret128, isExecutiveFloorCalling_~retValue_acc~19;havoc isExecutiveFloorCalling_~retValue_acc~19;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~21;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~21; 259159#L2185-392 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~21 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~21; 256514#L2212-392 isExecutiveFloorCalling_#t~ret128 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~19 := isExecutiveFloorCalling_#t~ret128;havoc isExecutiveFloorCalling_#t~ret128;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~19; 256515#L2089-20 __utac_acc__Specification14_spec__1_#t~ret14 := isExecutiveFloorCalling_#res;__utac_acc__Specification14_spec__1_~tmp___2~1 := __utac_acc__Specification14_spec__1_#t~ret14;havoc __utac_acc__Specification14_spec__1_#t~ret14; 260167#L432-4 assume !(0 != __utac_acc__Specification14_spec__1_~tmp___2~1); 254924#L432-5 havoc bobCall_#t~ret1, bobCall_~tmp~0;havoc bobCall_~tmp~0;getOrigin_#in~person := 0;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~30;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~30; 254925#L3208-1 assume 0 == getOrigin_~person;getOrigin_~retValue_acc~30 := 4;getOrigin_#res := getOrigin_~retValue_acc~30; 253656#L3233-1 bobCall_#t~ret1 := getOrigin_#res;bobCall_~tmp~0 := bobCall_#t~ret1;havoc bobCall_#t~ret1;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 0, bobCall_~tmp~0;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 253657#L2456-1 assume 0 == initPersonOnFloor_~floor; 260248#L2457-2 assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 253512#L2564-3 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 250663#L2248-2 assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 250510#L2260-5 havoc cleanup_#t~ret7, cleanup_#t~ret8, cleanup_~i~0, cleanup_~tmp~6, cleanup_~tmp___0~0, cleanup_~__cil_tmp4~0;havoc cleanup_~i~0;havoc cleanup_~tmp~6;havoc cleanup_~tmp___0~0;havoc cleanup_~__cil_tmp4~0;havoc timeShift_#t~ret77, timeShift_~tmp~23;havoc timeShift_~tmp~23;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~4;havoc areDoorsOpen_~retValue_acc~4;areDoorsOpen_~retValue_acc~4 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~4; 251055#L699-6 timeShift_#t~ret77 := areDoorsOpen_#res;timeShift_~tmp~23 := timeShift_#t~ret77;havoc timeShift_#t~ret77; 248595#L1709-3 assume 0 != timeShift_~tmp~23; 248596#L1710-6 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 248608#L1355-47 havoc __utac_acc__Specification14_spec__1_#t~ret14, __utac_acc__Specification14_spec__1_#t~ret15, __utac_acc__Specification14_spec__1_#t~ret16, __utac_acc__Specification14_spec__1_#t~ret17, __utac_acc__Specification14_spec__1_~tmp~9, __utac_acc__Specification14_spec__1_~tmp___0~2, __utac_acc__Specification14_spec__1_~tmp___1~1, __utac_acc__Specification14_spec__1_~tmp___2~1;havoc __utac_acc__Specification14_spec__1_~tmp~9;havoc __utac_acc__Specification14_spec__1_~tmp___0~2;havoc __utac_acc__Specification14_spec__1_~tmp___1~1;havoc __utac_acc__Specification14_spec__1_~tmp___2~1;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret128, isExecutiveFloorCalling_~retValue_acc~19;havoc isExecutiveFloorCalling_~retValue_acc~19;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~21;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~21; 248609#L2185-523 assume !(0 == isFloorCalling_~floorID); 262191#L2189-523 assume 1 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~21 := ~calls_1~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~21; 267224#L2212-523 isExecutiveFloorCalling_#t~ret128 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~19 := isExecutiveFloorCalling_#t~ret128;havoc isExecutiveFloorCalling_#t~ret128;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~19; 267223#L2089-27 __utac_acc__Specification14_spec__1_#t~ret14 := isExecutiveFloorCalling_#res;__utac_acc__Specification14_spec__1_~tmp___2~1 := __utac_acc__Specification14_spec__1_#t~ret14;havoc __utac_acc__Specification14_spec__1_#t~ret14; 267222#L432-6 assume !(0 != __utac_acc__Specification14_spec__1_~tmp___2~1); 254816#L432-7 cleanup_~i~0 := 0; 253239#L188-2 [2019-01-14 03:55:09,255 INFO L796 eck$LassoCheckResult]: Loop: 253239#L188-2 assume !false; 253240#L189 cleanup_~__cil_tmp4~0 := ~cleanupTimeShifts~0 - 1; 253230#L192 assume cleanup_~i~0 < cleanup_~__cil_tmp4~0;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~2;havoc isBlocked_~retValue_acc~2;isBlocked_~retValue_acc~2 := ~blocked~0;isBlocked_#res := isBlocked_~retValue_acc~2; 253231#L537 cleanup_#t~ret7 := isBlocked_#res;cleanup_~tmp___0~0 := cleanup_#t~ret7;havoc cleanup_#t~ret7; 252066#L196 assume 1 != cleanup_~tmp___0~0; 252060#L196-1 havoc isIdle_#res;havoc isIdle_#t~ret25, isIdle_~retValue_acc~9, isIdle_~tmp~13;havoc isIdle_~retValue_acc~9;havoc isIdle_~tmp~13;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret20, anyStopRequested_#t~ret21, anyStopRequested_#t~ret22, anyStopRequested_#t~ret23, anyStopRequested_#t~ret24, anyStopRequested_~retValue_acc~8, anyStopRequested_~tmp~12, anyStopRequested_~tmp___0~3, anyStopRequested_~tmp___1~2, anyStopRequested_~tmp___2~2, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~8;havoc anyStopRequested_~tmp~12;havoc anyStopRequested_~tmp___0~3;havoc anyStopRequested_~tmp___1~2;havoc anyStopRequested_~tmp___2~2;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~21;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~21; 252061#L2185-524 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~21 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~21; 265217#L2212-524 anyStopRequested_#t~ret20 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret20;havoc anyStopRequested_#t~ret20; 257770#L798 assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~8 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~8; 249736#L862 isIdle_#t~ret25 := anyStopRequested_#res;isIdle_~tmp~13 := isIdle_#t~ret25;havoc isIdle_#t~ret25;isIdle_~retValue_acc~9 := (if 0 == isIdle_~tmp~13 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~9; 249737#L875 cleanup_#t~ret8 := isIdle_#res;cleanup_~tmp~6 := cleanup_#t~ret8;havoc cleanup_#t~ret8; 250161#L208 assume !(0 != cleanup_~tmp~6);havoc timeShift_#t~ret77, timeShift_~tmp~23;havoc timeShift_~tmp~23;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~4;havoc areDoorsOpen_~retValue_acc~4;areDoorsOpen_~retValue_acc~4 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~4; 252413#L699-8 timeShift_#t~ret77 := areDoorsOpen_#res;timeShift_~tmp~23 := timeShift_#t~ret77;havoc timeShift_#t~ret77; 248563#L1709-4 assume 0 != timeShift_~tmp~23; 248345#L1710-8 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 248346#L1355-59 havoc __utac_acc__Specification14_spec__1_#t~ret14, __utac_acc__Specification14_spec__1_#t~ret15, __utac_acc__Specification14_spec__1_#t~ret16, __utac_acc__Specification14_spec__1_#t~ret17, __utac_acc__Specification14_spec__1_~tmp~9, __utac_acc__Specification14_spec__1_~tmp___0~2, __utac_acc__Specification14_spec__1_~tmp___1~1, __utac_acc__Specification14_spec__1_~tmp___2~1;havoc __utac_acc__Specification14_spec__1_~tmp~9;havoc __utac_acc__Specification14_spec__1_~tmp___0~2;havoc __utac_acc__Specification14_spec__1_~tmp___1~1;havoc __utac_acc__Specification14_spec__1_~tmp___2~1;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret128, isExecutiveFloorCalling_~retValue_acc~19;havoc isExecutiveFloorCalling_~retValue_acc~19;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~21;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~21; 248575#L2185-659 assume !(0 == isFloorCalling_~floorID); 267765#L2189-659 assume 1 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~21 := ~calls_1~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~21; 267767#L2212-659 isExecutiveFloorCalling_#t~ret128 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~19 := isExecutiveFloorCalling_#t~ret128;havoc isExecutiveFloorCalling_#t~ret128;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~19; 267707#L2089-34 __utac_acc__Specification14_spec__1_#t~ret14 := isExecutiveFloorCalling_#res;__utac_acc__Specification14_spec__1_~tmp___2~1 := __utac_acc__Specification14_spec__1_#t~ret14;havoc __utac_acc__Specification14_spec__1_#t~ret14; 267708#L432-8 assume !(0 != __utac_acc__Specification14_spec__1_~tmp___2~1); 254843#L432-9 cleanup_~i~0 := 1 + cleanup_~i~0; 253239#L188-2 [2019-01-14 03:55:09,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:55:09,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1080640158, now seen corresponding path program 1 times [2019-01-14 03:55:09,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:55:09,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:55:09,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:55:09,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:55:09,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:55:09,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:55:12,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:55:12,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:55:12,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 03:55:12,391 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 03:55:12,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:55:12,391 INFO L82 PathProgramCache]: Analyzing trace with hash 428794613, now seen corresponding path program 1 times [2019-01-14 03:55:12,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:55:12,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:55:12,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:55:12,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:55:12,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:55:12,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:55:12,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:55:12,713 WARN L181 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 81 [2019-01-14 03:55:13,147 WARN L181 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 [2019-01-14 03:55:13,158 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:55:13,159 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:55:13,159 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:55:13,159 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:55:13,160 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 03:55:13,160 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:55:13,160 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:55:13,160 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:55:13,160 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec14_product24_false-unreach-call_true-termination.cil.c_Iteration2_Loop [2019-01-14 03:55:13,160 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:55:13,161 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:55:13,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:55:13,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:55:13,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:55:13,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:55:13,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:55:13,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:55:13,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:55:13,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:55:13,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:55:13,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:55:13,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:55:13,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:55:13,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:55:13,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:55:13,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:55:13,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:55:13,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:55:13,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:55:13,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:55:13,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:55:13,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:55:13,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:55:13,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:55:13,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:55:13,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:55:13,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:55:13,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:55:13,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:55:13,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:55:13,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:55:14,132 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:55:14,133 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:55:14,141 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:55:14,141 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:55:14,149 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:55:14,149 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification14_spec__1_~tmp___1~1=0} Honda state: {ULTIMATE.start___utac_acc__Specification14_spec__1_~tmp___1~1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:55:14,173 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:55:14,173 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:55:14,177 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:55:14,177 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_~tmp___1~2=0} Honda state: {ULTIMATE.start_anyStopRequested_~tmp___1~2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:55:14,198 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:55:14,198 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:55:14,219 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:55:14,219 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:55:14,234 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:55:14,234 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:55:14,249 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:55:14,249 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~executiveFloor~0=1, ULTIMATE.start_isFloorCalling_#in~floorID=1, ULTIMATE.start_isFloorCalling_~floorID=1} Honda state: {~executiveFloor~0=1, ULTIMATE.start_isFloorCalling_#in~floorID=1, ULTIMATE.start_isFloorCalling_~floorID=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 03:55:14,309 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:55:14,309 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:55:14,406 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 03:55:14,406 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:55:15,060 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 03:55:15,063 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:55:15,063 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:55:15,063 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:55:15,063 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:55:15,063 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 03:55:15,063 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:55:15,064 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:55:15,064 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:55:15,064 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec14_product24_false-unreach-call_true-termination.cil.c_Iteration2_Loop [2019-01-14 03:55:15,064 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:55:15,064 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:55:15,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:55:15,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:55:15,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:55:15,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:55:15,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:55:15,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:55:15,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:55:15,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:55:15,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:55:15,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:55:15,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:55:15,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:55:15,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:55:15,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:55:15,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:55:15,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:55:15,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:55:15,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:55:15,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:55:15,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:55:15,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:55:15,401 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-14 03:55:15,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:55:15,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:55:15,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:55:15,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:55:15,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:55:15,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:55:15,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:55:15,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:55:15,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:55:16,024 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-14 03:55:16,331 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:55:16,340 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 03:55:16,342 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:55:16,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:55:16,345 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:55:16,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:55:16,348 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:55:16,348 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:55:16,351 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:55:16,353 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:55:16,368 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:55:16,368 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:55:16,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:55:16,371 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:55:16,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:55:16,371 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:55:16,371 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:55:16,378 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:55:16,378 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:55:16,379 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:55:16,380 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:55:16,380 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:55:16,381 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:55:16,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:55:16,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:55:16,381 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:55:16,381 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:55:16,381 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:55:16,382 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:55:16,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:55:16,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:55:16,393 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:55:16,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:55:16,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:55:16,393 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:55:16,394 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:55:16,394 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:55:16,395 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:55:16,395 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:55:16,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:55:16,396 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:55:16,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:55:16,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:55:16,396 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:55:16,397 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:55:16,397 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:55:16,401 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 03:55:16,408 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 03:55:16,409 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 03:55:16,411 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 03:55:16,411 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 03:55:16,411 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 03:55:16,411 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~cleanupTimeShifts~0, ULTIMATE.start_cleanup_~i~0) = 1*~cleanupTimeShifts~0 - 1*ULTIMATE.start_cleanup_~i~0 Supporting invariants [] [2019-01-14 03:55:16,412 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 03:55:16,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:55:16,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:55:16,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:55:16,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:55:16,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:55:17,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:55:17,055 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-14 03:55:17,056 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33831 states and 63910 transitions. cyclomatic complexity: 30080 Second operand 5 states. [2019-01-14 03:55:18,456 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33831 states and 63910 transitions. cyclomatic complexity: 30080. Second operand 5 states. Result 40648 states and 76774 transitions. Complement of second has 8 states. [2019-01-14 03:55:18,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 03:55:18,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 03:55:18,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31995 transitions. [2019-01-14 03:55:18,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31995 transitions. Stem has 58 letters. Loop has 22 letters. [2019-01-14 03:55:18,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:55:18,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31995 transitions. Stem has 80 letters. Loop has 22 letters. [2019-01-14 03:55:18,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:55:18,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31995 transitions. Stem has 58 letters. Loop has 44 letters. [2019-01-14 03:55:18,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:55:18,510 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40648 states and 76774 transitions. [2019-01-14 03:55:18,834 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 03:55:18,834 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40648 states to 0 states and 0 transitions. [2019-01-14 03:55:18,834 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 03:55:18,834 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 03:55:18,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 03:55:18,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:55:18,835 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 03:55:18,835 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 03:55:18,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 03:55:18,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 03:55:18,835 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2019-01-14 03:55:18,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:55:18,836 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-14 03:55:18,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 03:55:18,837 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-14 03:55:18,837 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 03:55:18,837 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 03:55:18,838 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 03:55:18,838 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 03:55:18,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 03:55:18,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:55:18,838 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 03:55:18,838 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 03:55:18,838 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 03:55:18,838 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 03:55:18,838 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 03:55:18,838 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 03:55:18,839 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 03:55:18,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 03:55:18 BoogieIcfgContainer [2019-01-14 03:55:18,847 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 03:55:18,848 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 03:55:18,848 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 03:55:18,848 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 03:55:18,848 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:54:17" (3/4) ... [2019-01-14 03:55:18,853 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 03:55:18,853 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 03:55:18,854 INFO L168 Benchmark]: Toolchain (without parser) took 94741.04 ms. Allocated memory was 1.0 GB in the beginning and 4.2 GB in the end (delta: 3.2 GB). Free memory was 945.9 MB in the beginning and 2.6 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2019-01-14 03:55:18,856 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 03:55:18,856 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1111.89 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -135.7 MB). Peak memory consumption was 56.6 MB. Max. memory is 11.5 GB. [2019-01-14 03:55:18,857 INFO L168 Benchmark]: Boogie Procedure Inliner took 793.14 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 869.0 MB in the end (delta: 212.6 MB). Peak memory consumption was 212.6 MB. Max. memory is 11.5 GB. [2019-01-14 03:55:18,859 INFO L168 Benchmark]: Boogie Preprocessor took 1245.81 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 194.0 MB). Free memory was 869.0 MB in the beginning and 1.1 GB in the end (delta: -260.8 MB). Peak memory consumption was 200.7 MB. Max. memory is 11.5 GB. [2019-01-14 03:55:18,860 INFO L168 Benchmark]: RCFGBuilder took 29917.69 ms. Allocated memory was 1.3 GB in the beginning and 2.4 GB in the end (delta: 1.1 GB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 108.4 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-01-14 03:55:18,863 INFO L168 Benchmark]: BuchiAutomizer took 61661.39 ms. Allocated memory was 2.4 GB in the beginning and 4.2 GB in the end (delta: 1.8 GB). Free memory was 1.0 GB in the beginning and 2.6 GB in the end (delta: -1.6 GB). Peak memory consumption was 246.0 MB. Max. memory is 11.5 GB. [2019-01-14 03:55:18,864 INFO L168 Benchmark]: Witness Printer took 5.51 ms. Allocated memory is still 4.2 GB. Free memory is still 2.6 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 03:55:18,870 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 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1111.89 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -135.7 MB). Peak memory consumption was 56.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 793.14 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 869.0 MB in the end (delta: 212.6 MB). Peak memory consumption was 212.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 1245.81 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 194.0 MB). Free memory was 869.0 MB in the beginning and 1.1 GB in the end (delta: -260.8 MB). Peak memory consumption was 200.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 29917.69 ms. Allocated memory was 1.3 GB in the beginning and 2.4 GB in the end (delta: 1.1 GB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 108.4 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * BuchiAutomizer took 61661.39 ms. Allocated memory was 2.4 GB in the beginning and 4.2 GB in the end (delta: 1.8 GB). Free memory was 1.0 GB in the beginning and 2.6 GB in the end (delta: -1.6 GB). Peak memory consumption was 246.0 MB. Max. memory is 11.5 GB. * Witness Printer took 5.51 ms. Allocated memory is still 4.2 GB. Free memory is still 2.6 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (2 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function cleanupTimeShifts + -1 * i and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 61.6s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 7.9s. Construction of modules took 30.0s. Büchi inclusion checks took 17.4s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 2.1s AutomataMinimizationTime, 1 MinimizatonAttempts, 193331 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 2.6s Buchi closure took 0.2s. Biggest automaton had 33831 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 99978 SDtfs, 472816 SDslu, 592438 SDs, 0 SdLazy, 33471 SolverSat, 3431 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 30.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI1 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital99 mio100 ax100 hnf100 lsp20 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq220 hnf86 smp100 dnf157 smp100 tf103 neg96 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 27ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.8s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...