./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/elevator_spec2_product18_false-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/product-lines/elevator_spec2_product18_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 fc7d4fa32c225e9bde4f412637f12e9da3676853 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 23:18:43,295 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 23:18:43,297 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 23:18:43,313 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 23:18:43,314 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 23:18:43,315 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 23:18:43,317 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 23:18:43,319 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 23:18:43,321 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 23:18:43,322 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 23:18:43,323 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 23:18:43,323 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 23:18:43,324 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 23:18:43,325 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 23:18:43,327 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 23:18:43,328 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 23:18:43,329 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 23:18:43,331 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 23:18:43,333 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 23:18:43,335 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 23:18:43,336 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 23:18:43,338 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 23:18:43,344 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 23:18:43,344 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 23:18:43,344 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 23:18:43,346 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 23:18:43,347 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 23:18:43,347 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 23:18:43,348 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 23:18:43,349 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 23:18:43,350 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 23:18:43,350 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 23:18:43,351 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 23:18:43,351 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 23:18:43,352 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 23:18:43,352 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 23:18:43,353 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-01 23:18:43,370 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 23:18:43,371 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 23:18:43,374 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 23:18:43,375 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 23:18:43,375 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 23:18:43,376 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 23:18:43,376 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 23:18:43,376 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 23:18:43,376 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 23:18:43,376 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 23:18:43,377 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 23:18:43,378 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 23:18:43,378 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 23:18:43,379 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 23:18:43,379 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 23:18:43,379 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 23:18:43,379 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 23:18:43,379 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 23:18:43,379 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 23:18:43,382 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 23:18:43,382 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 23:18:43,382 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 23:18:43,382 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 23:18:43,382 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 23:18:43,384 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 23:18:43,385 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 23:18:43,385 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 23:18:43,385 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 23:18:43,385 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 23:18:43,385 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 23:18:43,387 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 23:18:43,388 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 23:18:43,389 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 -> fc7d4fa32c225e9bde4f412637f12e9da3676853 [2019-01-01 23:18:43,453 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 23:18:43,471 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 23:18:43,478 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 23:18:43,480 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 23:18:43,481 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 23:18:43,482 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/elevator_spec2_product18_false-unreach-call_true-termination.cil.c [2019-01-01 23:18:43,556 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b601dd5c3/ce8bc8186e1442f681a8604945df0a64/FLAG00fd7ea1c [2019-01-01 23:18:44,249 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 23:18:44,250 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/elevator_spec2_product18_false-unreach-call_true-termination.cil.c [2019-01-01 23:18:44,274 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b601dd5c3/ce8bc8186e1442f681a8604945df0a64/FLAG00fd7ea1c [2019-01-01 23:18:44,360 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b601dd5c3/ce8bc8186e1442f681a8604945df0a64 [2019-01-01 23:18:44,364 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 23:18:44,365 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 23:18:44,366 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 23:18:44,366 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 23:18:44,370 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 23:18:44,371 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:18:44" (1/1) ... [2019-01-01 23:18:44,375 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@511a9c36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:18:44, skipping insertion in model container [2019-01-01 23:18:44,375 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:18:44" (1/1) ... [2019-01-01 23:18:44,383 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 23:18:44,468 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 23:18:45,224 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:18:45,253 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 23:18:45,513 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:18:45,576 INFO L195 MainTranslator]: Completed translation [2019-01-01 23:18:45,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:18:45 WrapperNode [2019-01-01 23:18:45,577 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 23:18:45,578 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 23:18:45,578 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 23:18:45,578 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 23:18:45,588 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:18:45" (1/1) ... [2019-01-01 23:18:45,629 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:18:45" (1/1) ... [2019-01-01 23:18:45,874 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 23:18:45,875 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 23:18:45,875 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 23:18:45,875 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 23:18:45,889 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:18:45" (1/1) ... [2019-01-01 23:18:45,889 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:18:45" (1/1) ... [2019-01-01 23:18:45,919 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:18:45" (1/1) ... [2019-01-01 23:18:45,920 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:18:45" (1/1) ... [2019-01-01 23:18:46,013 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:18:45" (1/1) ... [2019-01-01 23:18:46,090 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:18:45" (1/1) ... [2019-01-01 23:18:46,138 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:18:45" (1/1) ... [2019-01-01 23:18:46,191 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 23:18:46,192 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 23:18:46,192 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 23:18:46,192 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 23:18:46,193 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:18: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-01 23:18:46,273 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 23:18:46,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-01 23:18:46,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 23:18:46,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 23:19:00,283 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 23:19:00,283 INFO L280 CfgBuilder]: Removed 1029 assue(true) statements. [2019-01-01 23:19:00,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:19:00 BoogieIcfgContainer [2019-01-01 23:19:00,284 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 23:19:00,285 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 23:19:00,285 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 23:19:00,288 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 23:19:00,289 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:19:00,289 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 11:18:44" (1/3) ... [2019-01-01 23:19:00,291 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@79b5809d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:19:00, skipping insertion in model container [2019-01-01 23:19:00,291 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:19:00,292 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:18:45" (2/3) ... [2019-01-01 23:19:00,292 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@79b5809d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:19:00, skipping insertion in model container [2019-01-01 23:19:00,292 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:19:00,292 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:19:00" (3/3) ... [2019-01-01 23:19:00,294 INFO L375 chiAutomizerObserver]: Analyzing ICFG elevator_spec2_product18_false-unreach-call_true-termination.cil.c [2019-01-01 23:19:00,349 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 23:19:00,350 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 23:19:00,350 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 23:19:00,350 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 23:19:00,350 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 23:19:00,350 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 23:19:00,351 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 23:19:00,351 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 23:19:00,351 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 23:19:00,444 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4639 states. [2019-01-01 23:19:00,612 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2309 [2019-01-01 23:19:00,613 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:19:00,613 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:19:00,632 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:19:00,633 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:19:00,633 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 23:19:00,633 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4639 states. [2019-01-01 23:19:00,696 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2309 [2019-01-01 23:19:00,696 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:19:00,696 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:19:00,700 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:19:00,701 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:19:00,709 INFO L794 eck$LassoCheckResult]: Stem: 2498#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~weight~0 := 0;~maximumWeight~0 := 100;~blocked~0 := 0;~cleanupTimeShifts~0 := 12;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0;call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(10);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string55.base, #t~string55.offset, 1);call write~init~int(95, #t~string55.base, 1 + #t~string55.offset, 1);call write~init~int(93, #t~string55.base, 2 + #t~string55.offset, 1);call write~init~int(0, #t~string55.base, 3 + #t~string55.offset, 1);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string57.base, #t~string57.offset, 1);call write~init~int(93, #t~string57.base, 1 + #t~string57.offset, 1);call write~init~int(32, #t~string57.base, 2 + #t~string57.offset, 1);call write~init~int(0, #t~string57.base, 3 + #t~string57.offset, 1);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(5);call write~init~int(32, #t~string59.base, #t~string59.offset, 1);call write~init~int(97, #t~string59.base, 1 + #t~string59.offset, 1);call write~init~int(116, #t~string59.base, 2 + #t~string59.offset, 1);call write~init~int(32, #t~string59.base, 3 + #t~string59.offset, 1);call write~init~int(0, #t~string59.base, 4 + #t~string59.offset, 1);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string61.base, #t~string61.offset, 1);call write~init~int(105, #t~string61.base, 1 + #t~string61.offset, 1);call write~init~int(0, #t~string61.base, 2 + #t~string61.offset, 1);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(10);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string65.base, #t~string65.offset, 1);call write~init~int(112, #t~string65.base, 1 + #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 2 + #t~string65.offset, 1);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string67.base, #t~string67.offset, 1);call write~init~int(111, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(119, #t~string67.base, 2 + #t~string67.offset, 1);call write~init~int(110, #t~string67.base, 3 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 4 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string69.base, #t~string69.offset, 1);call write~init~int(73, #t~string69.base, 1 + #t~string69.offset, 1);call write~init~int(76, #t~string69.base, 2 + #t~string69.offset, 1);call write~init~int(95, #t~string69.base, 3 + #t~string69.offset, 1);call write~init~int(112, #t~string69.base, 4 + #t~string69.offset, 1);call write~init~int(58, #t~string69.base, 5 + #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 6 + #t~string69.offset, 1);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string71.base, #t~string71.offset, 1);call write~init~int(37, #t~string71.base, 1 + #t~string71.offset, 1);call write~init~int(105, #t~string71.base, 2 + #t~string71.offset, 1);call write~init~int(0, #t~string71.base, 3 + #t~string71.offset, 1);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string73.base, #t~string73.offset, 1);call write~init~int(37, #t~string73.base, 1 + #t~string73.offset, 1);call write~init~int(105, #t~string73.base, 2 + #t~string73.offset, 1);call write~init~int(0, #t~string73.base, 3 + #t~string73.offset, 1);call #t~string75.base, #t~string75.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string75.base, #t~string75.offset, 1);call write~init~int(37, #t~string75.base, 1 + #t~string75.offset, 1);call write~init~int(105, #t~string75.base, 2 + #t~string75.offset, 1);call write~init~int(0, #t~string75.base, 3 + #t~string75.offset, 1);call #t~string77.base, #t~string77.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string77.base, #t~string77.offset, 1);call write~init~int(37, #t~string77.base, 1 + #t~string77.offset, 1);call write~init~int(105, #t~string77.base, 2 + #t~string77.offset, 1);call write~init~int(0, #t~string77.base, 3 + #t~string77.offset, 1);call #t~string79.base, #t~string79.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string79.base, #t~string79.offset, 1);call write~init~int(37, #t~string79.base, 1 + #t~string79.offset, 1);call write~init~int(105, #t~string79.base, 2 + #t~string79.offset, 1);call write~init~int(0, #t~string79.base, 3 + #t~string79.offset, 1);call #t~string81.base, #t~string81.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string81.base, #t~string81.offset, 1);call write~init~int(70, #t~string81.base, 1 + #t~string81.offset, 1);call write~init~int(95, #t~string81.base, 2 + #t~string81.offset, 1);call write~init~int(112, #t~string81.base, 3 + #t~string81.offset, 1);call write~init~int(58, #t~string81.base, 4 + #t~string81.offset, 1);call write~init~int(0, #t~string81.base, 5 + #t~string81.offset, 1);call #t~string84.base, #t~string84.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string84.base, #t~string84.offset, 1);call write~init~int(37, #t~string84.base, 1 + #t~string84.offset, 1);call write~init~int(105, #t~string84.base, 2 + #t~string84.offset, 1);call write~init~int(0, #t~string84.base, 3 + #t~string84.offset, 1);call #t~string87.base, #t~string87.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string87.base, #t~string87.offset, 1);call write~init~int(37, #t~string87.base, 1 + #t~string87.offset, 1);call write~init~int(105, #t~string87.base, 2 + #t~string87.offset, 1);call write~init~int(0, #t~string87.base, 3 + #t~string87.offset, 1);call #t~string90.base, #t~string90.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string90.base, #t~string90.offset, 1);call write~init~int(37, #t~string90.base, 1 + #t~string90.offset, 1);call write~init~int(105, #t~string90.base, 2 + #t~string90.offset, 1);call write~init~int(0, #t~string90.base, 3 + #t~string90.offset, 1);call #t~string93.base, #t~string93.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string93.base, #t~string93.offset, 1);call write~init~int(37, #t~string93.base, 1 + #t~string93.offset, 1);call write~init~int(105, #t~string93.base, 2 + #t~string93.offset, 1);call write~init~int(0, #t~string93.base, 3 + #t~string93.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(2);call write~init~int(10, #t~string98.base, #t~string98.offset, 1);call write~init~int(0, #t~string98.base, 1 + #t~string98.offset, 1);call #t~string101.base, #t~string101.offset := #Ultimate.allocOnStack(9);~head~0.base, ~head~0.offset := 0, 0;call #t~string121.base, #t~string121.offset := #Ultimate.allocOnStack(30);call #t~string122.base, #t~string122.offset := #Ultimate.allocOnStack(9);call #t~string123.base, #t~string123.offset := #Ultimate.allocOnStack(21);call #t~string124.base, #t~string124.offset := #Ultimate.allocOnStack(30);call #t~string125.base, #t~string125.offset := #Ultimate.allocOnStack(9);call #t~string126.base, #t~string126.offset := #Ultimate.allocOnStack(21);call #t~string130.base, #t~string130.offset := #Ultimate.allocOnStack(30);call #t~string131.base, #t~string131.offset := #Ultimate.allocOnStack(9);call #t~string132.base, #t~string132.offset := #Ultimate.allocOnStack(25);call #t~string133.base, #t~string133.offset := #Ultimate.allocOnStack(30);call #t~string134.base, #t~string134.offset := #Ultimate.allocOnStack(9);call #t~string135.base, #t~string135.offset := #Ultimate.allocOnStack(25);~floorButtons_spc2_0~0 := 0;~floorButtons_spc2_1~0 := 0;~floorButtons_spc2_2~0 := 0;~floorButtons_spc2_3~0 := 0;~floorButtons_spc2_4~0 := 0;~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; 3604#L-1true havoc main_#res;havoc main_#t~ret151, main_~retValue_acc~22, main_~tmp~25;havoc main_~retValue_acc~22;havoc main_~tmp~25; 2826#L300true havoc valid_product_#res;havoc valid_product_~retValue_acc~4;havoc valid_product_~retValue_acc~4;valid_product_~retValue_acc~4 := 1;valid_product_#res := valid_product_~retValue_acc~4; 1608#L308true main_#t~ret151 := valid_product_#res;main_~tmp~25 := main_#t~ret151;havoc main_#t~ret151; 569#L2529true assume 0 != main_~tmp~25; 2830#L2502true ~floorButtons_spc2_0~0 := 0;~floorButtons_spc2_1~0 := 0;~floorButtons_spc2_2~0 := 0;~floorButtons_spc2_3~0 := 0;~floorButtons_spc2_4~0 := 0; 3530#L2557true havoc bigMacCall_#t~ret144, bigMacCall_~tmp~22;havoc bigMacCall_~tmp~22;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~1;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~1; 2418#L200true assume 0 == getOrigin_~person;getOrigin_~retValue_acc~1 := 4;getOrigin_#res := getOrigin_~retValue_acc~1; 1518#L225true bigMacCall_#t~ret144 := getOrigin_#res;bigMacCall_~tmp~22 := bigMacCall_#t~ret144;havoc bigMacCall_#t~ret144;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~22;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 729#L3077true assume 0 == initPersonOnFloor_~floor; 3944#L3078true assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 4273#L3185-1true callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 2132#L2869true assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 402#L2881-2true havoc cleanup_#t~ret145, cleanup_#t~ret146, cleanup_~i~3, cleanup_~tmp~23, cleanup_~tmp___0~8, cleanup_~__cil_tmp4~2;havoc cleanup_~i~3;havoc cleanup_~tmp~23;havoc cleanup_~tmp___0~8;havoc cleanup_~__cil_tmp4~2;havoc timeShift_#t~ret52, timeShift_~tmp~11;havoc timeShift_~tmp~11;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~7;havoc areDoorsOpen_~retValue_acc~7;areDoorsOpen_~retValue_acc~7 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~7; 3077#L559true timeShift_#t~ret52 := areDoorsOpen_#res;timeShift_~tmp~11 := timeShift_#t~ret52;havoc timeShift_#t~ret52; 2976#L1442true assume 0 != timeShift_~tmp~11; 2774#L1443true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 3427#L1146-11true havoc __utac_acc__Specification2_spec__3_#t~ret152, __utac_acc__Specification2_spec__3_#t~ret153, __utac_acc__Specification2_spec__3_#t~ret154, __utac_acc__Specification2_spec__3_#t~ret155, __utac_acc__Specification2_spec__3_#t~ret156, __utac_acc__Specification2_spec__3_#t~ret157, __utac_acc__Specification2_spec__3_~floor~0, __utac_acc__Specification2_spec__3_~tmp~26, __utac_acc__Specification2_spec__3_~tmp___0~10, __utac_acc__Specification2_spec__3_~tmp___1~8, __utac_acc__Specification2_spec__3_~tmp___2~6, __utac_acc__Specification2_spec__3_~tmp___3~5, __utac_acc__Specification2_spec__3_~tmp___4~3;havoc __utac_acc__Specification2_spec__3_~floor~0;havoc __utac_acc__Specification2_spec__3_~tmp~26;havoc __utac_acc__Specification2_spec__3_~tmp___0~10;havoc __utac_acc__Specification2_spec__3_~tmp___1~8;havoc __utac_acc__Specification2_spec__3_~tmp___2~6;havoc __utac_acc__Specification2_spec__3_~tmp___3~5;havoc __utac_acc__Specification2_spec__3_~tmp___4~3;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 2506#L550true __utac_acc__Specification2_spec__3_#t~ret152 := getCurrentFloorID_#res;__utac_acc__Specification2_spec__3_~tmp~26 := __utac_acc__Specification2_spec__3_#t~ret152;havoc __utac_acc__Specification2_spec__3_#t~ret152;__utac_acc__Specification2_spec__3_~floor~0 := __utac_acc__Specification2_spec__3_~tmp~26; 1478#L2602true assume 0 == __utac_acc__Specification2_spec__3_~floor~0; 1422#L2603true assume 0 != ~floorButtons_spc2_0~0;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~7;havoc areDoorsOpen_~retValue_acc~7;areDoorsOpen_~retValue_acc~7 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~7; 3061#L559-1true __utac_acc__Specification2_spec__3_#t~ret153 := areDoorsOpen_#res;__utac_acc__Specification2_spec__3_~tmp___4~3 := __utac_acc__Specification2_spec__3_#t~ret153;havoc __utac_acc__Specification2_spec__3_#t~ret153; 2140#L2607true assume 0 != __utac_acc__Specification2_spec__3_~tmp___4~3;~floorButtons_spc2_0~0 := 0; 2568#L2662true cleanup_~i~3 := 0; 1612#L2334-2true [2019-01-01 23:19:00,720 INFO L796 eck$LassoCheckResult]: Loop: 1612#L2334-2true assume !false; 1547#L2335true cleanup_~__cil_tmp4~2 := ~cleanupTimeShifts~0 - 1; 1453#L2338true assume cleanup_~i~3 < cleanup_~__cil_tmp4~2;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~5;havoc isBlocked_~retValue_acc~5;isBlocked_~retValue_acc~5 := ~blocked~0;isBlocked_#res := isBlocked_~retValue_acc~5; 1657#L392true cleanup_#t~ret145 := isBlocked_#res;cleanup_~tmp___0~8 := cleanup_#t~ret145;havoc cleanup_#t~ret145; 2172#L2342true assume 1 != cleanup_~tmp___0~8; 2178#L2342-1true havoc isIdle_#res;havoc isIdle_#t~ret14, isIdle_~retValue_acc~12, isIdle_~tmp~5;havoc isIdle_~retValue_acc~12;havoc isIdle_~tmp~5;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret9, anyStopRequested_#t~ret10, anyStopRequested_#t~ret11, anyStopRequested_#t~ret12, anyStopRequested_#t~ret13, anyStopRequested_~retValue_acc~11, anyStopRequested_~tmp~4, anyStopRequested_~tmp___0~2, anyStopRequested_~tmp___1~2, anyStopRequested_~tmp___2~0, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~11;havoc anyStopRequested_~tmp~4;havoc anyStopRequested_~tmp___0~2;havoc anyStopRequested_~tmp___1~2;havoc anyStopRequested_~tmp___2~0;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~23;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~23; 1213#L2806-42true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~23 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~23; 4220#L2833-42true anyStopRequested_#t~ret9 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret9;havoc anyStopRequested_#t~ret9; 1687#L658true assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~11 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~11; 2531#L722true isIdle_#t~ret14 := anyStopRequested_#res;isIdle_~tmp~5 := isIdle_#t~ret14;havoc isIdle_#t~ret14;isIdle_~retValue_acc~12 := (if 0 == isIdle_~tmp~5 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~12; 3082#L735true cleanup_#t~ret146 := isIdle_#res;cleanup_~tmp~23 := cleanup_#t~ret146;havoc cleanup_#t~ret146; 292#L2354true assume !(0 != cleanup_~tmp~23);havoc timeShift_#t~ret52, timeShift_~tmp~11;havoc timeShift_~tmp~11;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~7;havoc areDoorsOpen_~retValue_acc~7;areDoorsOpen_~retValue_acc~7 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~7; 2918#L559-6true timeShift_#t~ret52 := areDoorsOpen_#res;timeShift_~tmp~11 := timeShift_#t~ret52;havoc timeShift_#t~ret52; 2978#L1442-1true assume 0 != timeShift_~tmp~11; 2777#L1443-2true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 3355#L1146-23true havoc __utac_acc__Specification2_spec__3_#t~ret152, __utac_acc__Specification2_spec__3_#t~ret153, __utac_acc__Specification2_spec__3_#t~ret154, __utac_acc__Specification2_spec__3_#t~ret155, __utac_acc__Specification2_spec__3_#t~ret156, __utac_acc__Specification2_spec__3_#t~ret157, __utac_acc__Specification2_spec__3_~floor~0, __utac_acc__Specification2_spec__3_~tmp~26, __utac_acc__Specification2_spec__3_~tmp___0~10, __utac_acc__Specification2_spec__3_~tmp___1~8, __utac_acc__Specification2_spec__3_~tmp___2~6, __utac_acc__Specification2_spec__3_~tmp___3~5, __utac_acc__Specification2_spec__3_~tmp___4~3;havoc __utac_acc__Specification2_spec__3_~floor~0;havoc __utac_acc__Specification2_spec__3_~tmp~26;havoc __utac_acc__Specification2_spec__3_~tmp___0~10;havoc __utac_acc__Specification2_spec__3_~tmp___1~8;havoc __utac_acc__Specification2_spec__3_~tmp___2~6;havoc __utac_acc__Specification2_spec__3_~tmp___3~5;havoc __utac_acc__Specification2_spec__3_~tmp___4~3;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 2507#L550-1true __utac_acc__Specification2_spec__3_#t~ret152 := getCurrentFloorID_#res;__utac_acc__Specification2_spec__3_~tmp~26 := __utac_acc__Specification2_spec__3_#t~ret152;havoc __utac_acc__Specification2_spec__3_#t~ret152;__utac_acc__Specification2_spec__3_~floor~0 := __utac_acc__Specification2_spec__3_~tmp~26; 1463#L2602-1true assume 0 == __utac_acc__Specification2_spec__3_~floor~0; 1424#L2603-1true assume 0 != ~floorButtons_spc2_0~0;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~7;havoc areDoorsOpen_~retValue_acc~7;areDoorsOpen_~retValue_acc~7 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~7; 2920#L559-7true __utac_acc__Specification2_spec__3_#t~ret153 := areDoorsOpen_#res;__utac_acc__Specification2_spec__3_~tmp___4~3 := __utac_acc__Specification2_spec__3_#t~ret153;havoc __utac_acc__Specification2_spec__3_#t~ret153; 2138#L2607-2true assume 0 != __utac_acc__Specification2_spec__3_~tmp___4~3;~floorButtons_spc2_0~0 := 0; 2573#L2662-1true cleanup_~i~3 := 1 + cleanup_~i~3; 1612#L2334-2true [2019-01-01 23:19:00,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:19:00,734 INFO L82 PathProgramCache]: Analyzing trace with hash 856093261, now seen corresponding path program 1 times [2019-01-01 23:19:00,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:19:00,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:19:00,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:19:00,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:19:00,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:19:00,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:19:01,139 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-01 23:19:01,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:19:01,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:19:01,147 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:19:01,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:19:01,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1563217659, now seen corresponding path program 1 times [2019-01-01 23:19:01,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:19:01,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:19:01,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:19:01,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:19:01,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:19:01,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:19:01,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:19:02,621 WARN L181 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 88 DAG size of output: 84 [2019-01-01 23:19:03,270 WARN L181 SmtUtils]: Spent 637.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2019-01-01 23:19:03,300 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:19:03,301 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:19:03,306 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:19:03,306 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:19:03,306 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:19:03,306 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:19:03,306 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:19:03,306 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:19:03,307 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec2_product18_false-unreach-call_true-termination.cil.c_Iteration1_Loop [2019-01-01 23:19:03,307 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:19:03,307 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:19:03,346 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-01 23:19:03,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:19:03,400 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-01 23:19:03,491 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-01 23:19:03,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-01 23:19:03,597 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-01 23:19:03,667 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-01 23:19:03,695 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-01 23:19:03,806 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-01 23:19:03,807 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-01 23:19:03,920 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-01 23:19:03,920 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-01 23:19:03,943 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-01 23:19:03,969 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-01 23:19:03,992 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-01 23:19:04,010 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-01 23:19:04,037 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-01 23:19:04,062 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-01 23:19:04,088 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-01 23:19:04,099 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-01 23:19:04,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-01 23:19:04,119 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-01 23:19:04,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:19:04,188 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-01 23:19:04,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-01 23:19:04,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-01 23:19:04,206 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-01 23:19:04,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:19:04,237 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-01 23:19:04,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:19:04,241 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-01 23:19:04,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:19:04,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-01 23:19:04,257 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-01 23:19:04,258 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-01 23:19:04,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-01 23:19:04,858 WARN L181 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-01 23:19:05,037 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:19:05,038 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-01 23:19:05,047 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:19:05,047 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:19:05,066 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:19:05,067 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification2_spec__3_~tmp___1~8=0} Honda state: {ULTIMATE.start___utac_acc__Specification2_spec__3_~tmp___1~8=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-01 23:19:05,089 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:19:05,089 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:19:05,092 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:19:05,092 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-01 23:19:05,114 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:19:05,115 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:19:05,133 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:19:05,134 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_isFloorCalling_#in~floorID=0, ULTIMATE.start_isFloorCalling_~floorID=0} Honda state: {ULTIMATE.start_isFloorCalling_#in~floorID=0, ULTIMATE.start_isFloorCalling_~floorID=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /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) [2019-01-01 23:19:05,186 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:19:05,187 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:19:05,202 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:19:05,202 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_isIdle_~retValue_acc~12=0, ULTIMATE.start_isIdle_#res=0} Honda state: {ULTIMATE.start_isIdle_~retValue_acc~12=0, ULTIMATE.start_isIdle_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 23:19:05,240 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:19:05,240 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:19:05,282 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:19:05,282 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 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-01 23:19:05,289 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:19:05,289 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:19:05,321 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:19:05,321 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:19:05,372 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:19:05,374 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:19:05,374 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:19:05,374 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:19:05,374 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:19:05,375 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:19:05,375 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:19:05,375 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:19:05,375 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:19:05,375 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec2_product18_false-unreach-call_true-termination.cil.c_Iteration1_Loop [2019-01-01 23:19:05,375 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:19:05,375 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:19:05,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:19:05,389 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-01 23:19:05,400 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-01 23:19:05,402 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-01 23:19:05,407 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-01 23:19:05,413 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-01 23:19:05,416 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-01 23:19:05,424 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-01 23:19:05,427 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-01 23:19:05,429 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-01 23:19:05,432 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-01 23:19:05,468 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-01 23:19:05,470 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-01 23:19:05,480 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-01 23:19:05,483 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-01 23:19:05,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-01 23:19:05,489 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-01 23:19:05,493 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-01 23:19:05,496 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-01 23:19:05,552 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-01 23:19:05,578 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-01 23:19:05,601 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-01 23:19:05,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-01 23:19:05,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:19:05,613 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-01 23:19:05,626 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-01 23:19:05,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:19:05,637 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-01 23:19:05,639 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-01 23:19:05,642 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-01 23:19:05,650 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-01 23:19:05,651 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-01 23:19:05,652 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-01 23:19:05,654 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-01 23:19:05,864 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-01 23:19:05,999 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-01 23:19:06,293 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-01 23:19:06,810 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:19:06,816 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:19:06,817 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-01 23:19:06,819 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:19:06,819 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:19:06,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:19:06,820 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:19:06,820 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:19:06,822 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:19:06,822 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:19:06,825 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:19:06,825 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-01 23:19:06,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:19:06,827 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:19:06,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:19:06,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:19:06,827 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:19:06,828 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:19:06,828 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:19:06,830 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:19:06,831 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:19:06,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:19:06,832 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:19:06,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:19:06,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:19:06,832 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:19:06,833 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:19:06,833 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:19:06,836 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:19:06,837 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-01 23:19:06,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:19:06,838 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:19:06,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:19:06,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:19:06,838 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:19:06,839 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:19:06,839 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:19:06,841 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:19:06,842 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:19:06,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:19:06,842 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:19:06,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:19:06,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:19:06,843 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:19:06,843 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:19:06,843 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:19:06,962 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:19:06,963 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:19:06,963 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:19:06,963 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:19:06,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:19:06,967 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:19:06,967 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:19:06,968 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:19:06,968 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:19:06,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:19:06,972 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-01 23:19:06,972 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:19:06,972 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:19:06,972 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:19:06,981 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:19:06,981 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:19:06,982 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:19:06,982 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:19:06,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:19:06,993 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-01 23:19:06,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:19:06,994 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:19:06,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:19:06,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:19:06,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:19:06,995 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:19:06,995 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:19:06,999 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:19:07,000 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-01 23:19:07,001 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:19:07,001 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:19:07,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:19:07,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:19:07,003 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:19:07,004 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:19:07,004 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:19:07,006 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:19:07,007 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-01 23:19:07,007 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:19:07,008 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:19:07,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:19:07,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:19:07,010 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:19:07,010 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:19:07,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:19:07,012 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:19:07,013 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-01 23:19:07,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:19:07,015 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:19:07,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:19:07,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:19:07,016 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:19:07,016 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:19:07,017 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:19:07,023 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:19:07,032 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 23:19:07,033 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 23:19:07,035 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:19:07,035 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:19:07,036 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:19:07,036 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~cleanupTimeShifts~0, ULTIMATE.start_cleanup_~i~3) = 1*~cleanupTimeShifts~0 - 1*ULTIMATE.start_cleanup_~i~3 Supporting invariants [] [2019-01-01 23:19:07,040 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:19:07,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:19:07,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:19:07,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:19:07,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:19:07,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:19:07,536 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-01 23:19:07,559 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-01 23:19:07,561 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 4639 states. Second operand 5 states. [2019-01-01 23:19:08,482 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 4639 states.. Second operand 5 states. Result 7008 states and 13256 transitions. Complement of second has 9 states. [2019-01-01 23:19:08,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 23:19:08,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 23:19:08,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 8843 transitions. [2019-01-01 23:19:08,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 8843 transitions. Stem has 24 letters. Loop has 22 letters. [2019-01-01 23:19:08,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:19:08,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 8843 transitions. Stem has 46 letters. Loop has 22 letters. [2019-01-01 23:19:08,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:19:08,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 8843 transitions. Stem has 24 letters. Loop has 44 letters. [2019-01-01 23:19:08,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:19:08,510 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7008 states and 13256 transitions. [2019-01-01 23:19:08,610 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:19:08,615 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7008 states to 0 states and 0 transitions. [2019-01-01 23:19:08,617 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 23:19:08,617 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 23:19:08,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 23:19:08,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:19:08,618 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:19:08,619 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:19:08,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:19:08,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:19:08,627 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2019-01-01 23:19:08,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:19:08,632 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-01 23:19:08,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-01 23:19:08,633 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-01 23:19:08,633 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:19:08,633 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 23:19:08,633 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 23:19:08,633 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 23:19:08,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 23:19:08,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:19:08,634 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:19:08,634 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:19:08,634 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:19:08,634 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 23:19:08,634 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 23:19:08,634 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:19:08,634 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 23:19:08,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 11:19:08 BoogieIcfgContainer [2019-01-01 23:19:08,646 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 23:19:08,646 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 23:19:08,647 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 23:19:08,647 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 23:19:08,647 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:19:00" (3/4) ... [2019-01-01 23:19:08,654 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 23:19:08,654 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 23:19:08,655 INFO L168 Benchmark]: Toolchain (without parser) took 24290.44 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 540.0 MB). Free memory was 945.9 MB in the beginning and 1.3 GB in the end (delta: -311.3 MB). Peak memory consumption was 228.7 MB. Max. memory is 11.5 GB. [2019-01-01 23:19:08,657 INFO L168 Benchmark]: CDTParser took 0.19 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-01 23:19:08,658 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1211.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -162.8 MB). Peak memory consumption was 51.2 MB. Max. memory is 11.5 GB. [2019-01-01 23:19:08,660 INFO L168 Benchmark]: Boogie Procedure Inliner took 296.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 40.3 MB). Peak memory consumption was 40.3 MB. Max. memory is 11.5 GB. [2019-01-01 23:19:08,662 INFO L168 Benchmark]: Boogie Preprocessor took 316.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 40.4 MB). Peak memory consumption was 40.4 MB. Max. memory is 11.5 GB. [2019-01-01 23:19:08,663 INFO L168 Benchmark]: RCFGBuilder took 14092.66 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 200.8 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -183.9 MB). Peak memory consumption was 459.5 MB. Max. memory is 11.5 GB. [2019-01-01 23:19:08,664 INFO L168 Benchmark]: BuchiAutomizer took 8361.14 ms. Allocated memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: 196.1 MB). Free memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: -45.3 MB). Peak memory consumption was 150.7 MB. Max. memory is 11.5 GB. [2019-01-01 23:19:08,665 INFO L168 Benchmark]: Witness Printer took 7.51 ms. Allocated memory is still 1.6 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:19:08,673 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.19 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 1211.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -162.8 MB). Peak memory consumption was 51.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 296.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 40.3 MB). Peak memory consumption was 40.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 316.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 40.4 MB). Peak memory consumption was 40.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 14092.66 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 200.8 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -183.9 MB). Peak memory consumption was 459.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8361.14 ms. Allocated memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: 196.1 MB). Free memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: -45.3 MB). Peak memory consumption was 150.7 MB. Max. memory is 11.5 GB. * Witness Printer took 7.51 ms. Allocated memory is still 1.6 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function cleanupTimeShifts + -1 * i and consists of 6 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.3s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 6.3s. Construction of modules took 0.1s. Büchi inclusion checks took 1.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 8809 SDtfs, 13204 SDslu, 4421 SDs, 0 SdLazy, 9 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital109 mio100 ax100 hnf100 lsp16 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq211 hnf89 smp100 dnf176 smp100 tf103 neg96 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 23ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...