./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/elevator_spec9_product28_false-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e 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_spec9_product28_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 669200e45e1afee8a0f15d0fcb8e259472bfb6db ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:49:19,567 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:49:19,569 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:49:19,585 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:49:19,585 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:49:19,586 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:49:19,587 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:49:19,589 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:49:19,591 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:49:19,591 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:49:19,592 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:49:19,593 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:49:19,593 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:49:19,594 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:49:19,595 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:49:19,596 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:49:19,597 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:49:19,599 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:49:19,601 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:49:19,602 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:49:19,603 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:49:19,605 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:49:19,610 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:49:19,613 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:49:19,613 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:49:19,614 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:49:19,615 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:49:19,617 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:49:19,617 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:49:19,618 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:49:19,619 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:49:19,620 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:49:19,620 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:49:19,620 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:49:19,621 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:49:19,622 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:49:19,622 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-28 23:49:19,639 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:49:19,639 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:49:19,641 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:49:19,641 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:49:19,641 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:49:19,641 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:49:19,641 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:49:19,642 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:49:19,642 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:49:19,642 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:49:19,642 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:49:19,642 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:49:19,643 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 23:49:19,643 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:49:19,643 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:49:19,643 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 23:49:19,643 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:49:19,643 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:49:19,645 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:49:19,645 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:49:19,645 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 23:49:19,646 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:49:19,646 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:49:19,646 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:49:19,646 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:49:19,646 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:49:19,647 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:49:19,648 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:49:19,648 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:49:19,648 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:49:19,648 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:49:19,649 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:49:19,650 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 -> 669200e45e1afee8a0f15d0fcb8e259472bfb6db [2018-11-28 23:49:19,685 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:49:19,698 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:49:19,702 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:49:19,703 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:49:19,704 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:49:19,704 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/elevator_spec9_product28_false-unreach-call_true-termination.cil.c [2018-11-28 23:49:19,765 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e92e4c3b9/2cebb20766384147ad40fa5495f4eeb4/FLAG2a031ba7e [2018-11-28 23:49:20,370 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:49:20,371 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/elevator_spec9_product28_false-unreach-call_true-termination.cil.c [2018-11-28 23:49:20,397 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e92e4c3b9/2cebb20766384147ad40fa5495f4eeb4/FLAG2a031ba7e [2018-11-28 23:49:20,558 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e92e4c3b9/2cebb20766384147ad40fa5495f4eeb4 [2018-11-28 23:49:20,562 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:49:20,564 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:49:20,566 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:49:20,566 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:49:20,570 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:49:20,572 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:49:20" (1/1) ... [2018-11-28 23:49:20,575 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dc9f617 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:49:20, skipping insertion in model container [2018-11-28 23:49:20,576 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:49:20" (1/1) ... [2018-11-28 23:49:20,585 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:49:20,692 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:49:21,377 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:49:21,400 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:49:21,706 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:49:21,777 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:49:21,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:49:21 WrapperNode [2018-11-28 23:49:21,778 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:49:21,779 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:49:21,779 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:49:21,779 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:49:21,788 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:49:21" (1/1) ... [2018-11-28 23:49:21,838 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:49:21" (1/1) ... [2018-11-28 23:49:22,120 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:49:22,122 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:49:22,122 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:49:22,123 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:49:22,135 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:49:21" (1/1) ... [2018-11-28 23:49:22,136 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:49:21" (1/1) ... [2018-11-28 23:49:22,186 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:49:21" (1/1) ... [2018-11-28 23:49:22,187 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:49:21" (1/1) ... [2018-11-28 23:49:22,306 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:49:21" (1/1) ... [2018-11-28 23:49:22,440 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:49:21" (1/1) ... [2018-11-28 23:49:22,478 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:49:21" (1/1) ... [2018-11-28 23:49:22,521 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:49:22,522 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:49:22,522 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:49:22,522 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:49:22,523 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:49:21" (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 [2018-11-28 23:49:22,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:49:22,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-11-28 23:49:22,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:49:22,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:49:38,822 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:49:38,823 INFO L280 CfgBuilder]: Removed 1233 assue(true) statements. [2018-11-28 23:49:38,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:49:38 BoogieIcfgContainer [2018-11-28 23:49:38,823 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:49:38,824 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:49:38,824 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:49:38,828 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:49:38,830 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:49:38,830 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:49:20" (1/3) ... [2018-11-28 23:49:38,831 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1b14fe8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:49:38, skipping insertion in model container [2018-11-28 23:49:38,831 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:49:38,832 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:49:21" (2/3) ... [2018-11-28 23:49:38,832 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1b14fe8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:49:38, skipping insertion in model container [2018-11-28 23:49:38,832 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:49:38,833 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:49:38" (3/3) ... [2018-11-28 23:49:38,835 INFO L375 chiAutomizerObserver]: Analyzing ICFG elevator_spec9_product28_false-unreach-call_true-termination.cil.c [2018-11-28 23:49:38,909 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:49:38,910 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:49:38,910 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:49:38,910 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:49:38,911 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:49:38,911 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:49:38,911 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:49:38,911 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:49:38,911 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:49:38,997 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5039 states. [2018-11-28 23:49:39,149 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2509 [2018-11-28 23:49:39,149 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:49:39,149 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:49:39,173 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:49:39,174 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:49:39,174 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:49:39,174 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5039 states. [2018-11-28 23:49:39,235 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2509 [2018-11-28 23:49:39,236 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:49:39,236 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:49:39,240 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:49:39,240 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:49:39,248 INFO L794 eck$LassoCheckResult]: Stem: 3172#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[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;~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~0 := 0;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0;call #t~string55.base, #t~string55.offset := #Ultimate.alloc(10);call #t~string57.base, #t~string57.offset := #Ultimate.alloc(4);call write~init~int(91, #t~string57.base, #t~string57.offset, 1);call write~init~int(95, #t~string57.base, 1 + #t~string57.offset, 1);call write~init~int(93, #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.alloc(4);call write~init~int(91, #t~string59.base, #t~string59.offset, 1);call write~init~int(93, #t~string59.base, 1 + #t~string59.offset, 1);call write~init~int(32, #t~string59.base, 2 + #t~string59.offset, 1);call write~init~int(0, #t~string59.base, 3 + #t~string59.offset, 1);call #t~string61.base, #t~string61.offset := #Ultimate.alloc(5);call write~init~int(32, #t~string61.base, #t~string61.offset, 1);call write~init~int(97, #t~string61.base, 1 + #t~string61.offset, 1);call write~init~int(116, #t~string61.base, 2 + #t~string61.offset, 1);call write~init~int(32, #t~string61.base, 3 + #t~string61.offset, 1);call write~init~int(0, #t~string61.base, 4 + #t~string61.offset, 1);call #t~string63.base, #t~string63.offset := #Ultimate.alloc(3);call write~init~int(37, #t~string63.base, #t~string63.offset, 1);call write~init~int(105, #t~string63.base, 1 + #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 2 + #t~string63.offset, 1);call #t~string65.base, #t~string65.offset := #Ultimate.alloc(10);call #t~string67.base, #t~string67.offset := #Ultimate.alloc(3);call write~init~int(117, #t~string67.base, #t~string67.offset, 1);call write~init~int(112, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 2 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.alloc(5);call write~init~int(100, #t~string69.base, #t~string69.offset, 1);call write~init~int(111, #t~string69.base, 1 + #t~string69.offset, 1);call write~init~int(119, #t~string69.base, 2 + #t~string69.offset, 1);call write~init~int(110, #t~string69.base, 3 + #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 4 + #t~string69.offset, 1);call #t~string71.base, #t~string71.offset := #Ultimate.alloc(7);call write~init~int(32, #t~string71.base, #t~string71.offset, 1);call write~init~int(73, #t~string71.base, 1 + #t~string71.offset, 1);call write~init~int(76, #t~string71.base, 2 + #t~string71.offset, 1);call write~init~int(95, #t~string71.base, 3 + #t~string71.offset, 1);call write~init~int(112, #t~string71.base, 4 + #t~string71.offset, 1);call write~init~int(58, #t~string71.base, 5 + #t~string71.offset, 1);call write~init~int(0, #t~string71.base, 6 + #t~string71.offset, 1);call #t~string73.base, #t~string73.offset := #Ultimate.alloc(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.alloc(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.alloc(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.alloc(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.alloc(4);call write~init~int(32, #t~string81.base, #t~string81.offset, 1);call write~init~int(37, #t~string81.base, 1 + #t~string81.offset, 1);call write~init~int(105, #t~string81.base, 2 + #t~string81.offset, 1);call write~init~int(0, #t~string81.base, 3 + #t~string81.offset, 1);call #t~string83.base, #t~string83.offset := #Ultimate.alloc(6);call write~init~int(32, #t~string83.base, #t~string83.offset, 1);call write~init~int(70, #t~string83.base, 1 + #t~string83.offset, 1);call write~init~int(95, #t~string83.base, 2 + #t~string83.offset, 1);call write~init~int(112, #t~string83.base, 3 + #t~string83.offset, 1);call write~init~int(58, #t~string83.base, 4 + #t~string83.offset, 1);call write~init~int(0, #t~string83.base, 5 + #t~string83.offset, 1);call #t~string86.base, #t~string86.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string86.base, #t~string86.offset, 1);call write~init~int(37, #t~string86.base, 1 + #t~string86.offset, 1);call write~init~int(105, #t~string86.base, 2 + #t~string86.offset, 1);call write~init~int(0, #t~string86.base, 3 + #t~string86.offset, 1);call #t~string89.base, #t~string89.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string89.base, #t~string89.offset, 1);call write~init~int(37, #t~string89.base, 1 + #t~string89.offset, 1);call write~init~int(105, #t~string89.base, 2 + #t~string89.offset, 1);call write~init~int(0, #t~string89.base, 3 + #t~string89.offset, 1);call #t~string92.base, #t~string92.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string92.base, #t~string92.offset, 1);call write~init~int(37, #t~string92.base, 1 + #t~string92.offset, 1);call write~init~int(105, #t~string92.base, 2 + #t~string92.offset, 1);call write~init~int(0, #t~string92.base, 3 + #t~string92.offset, 1);call #t~string95.base, #t~string95.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string95.base, #t~string95.offset, 1);call write~init~int(37, #t~string95.base, 1 + #t~string95.offset, 1);call write~init~int(105, #t~string95.base, 2 + #t~string95.offset, 1);call write~init~int(0, #t~string95.base, 3 + #t~string95.offset, 1);call #t~string98.base, #t~string98.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string98.base, #t~string98.offset, 1);call write~init~int(37, #t~string98.base, 1 + #t~string98.offset, 1);call write~init~int(105, #t~string98.base, 2 + #t~string98.offset, 1);call write~init~int(0, #t~string98.base, 3 + #t~string98.offset, 1);call #t~string100.base, #t~string100.offset := #Ultimate.alloc(2);call write~init~int(10, #t~string100.base, #t~string100.offset, 1);call write~init~int(0, #t~string100.base, 1 + #t~string100.offset, 1);call #t~string103.base, #t~string103.offset := #Ultimate.alloc(9);~head~0.base, ~head~0.offset := 0, 0;call #t~string124.base, #t~string124.offset := #Ultimate.alloc(30);call #t~string125.base, #t~string125.offset := #Ultimate.alloc(9);call #t~string126.base, #t~string126.offset := #Ultimate.alloc(21);call #t~string127.base, #t~string127.offset := #Ultimate.alloc(30);call #t~string128.base, #t~string128.offset := #Ultimate.alloc(9);call #t~string129.base, #t~string129.offset := #Ultimate.alloc(21);call #t~string133.base, #t~string133.offset := #Ultimate.alloc(30);call #t~string134.base, #t~string134.offset := #Ultimate.alloc(9);call #t~string135.base, #t~string135.offset := #Ultimate.alloc(25);call #t~string136.base, #t~string136.offset := #Ultimate.alloc(30);call #t~string137.base, #t~string137.offset := #Ultimate.alloc(9);call #t~string138.base, #t~string138.offset := #Ultimate.alloc(25);~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0;~cleanupTimeShifts~0 := 12; 4153#L-1true havoc main_#res;havoc main_#t~ret157, main_~retValue_acc~29, main_~tmp~27;havoc main_~retValue_acc~29;havoc main_~tmp~27; 1895#L853true havoc valid_product_#res;havoc valid_product_~retValue_acc~7;havoc valid_product_~retValue_acc~7;valid_product_~retValue_acc~7 := 1;valid_product_#res := valid_product_~retValue_acc~7; 249#L861true main_#t~ret157 := valid_product_#res;main_~tmp~27 := main_#t~ret157;havoc main_#t~ret157; 597#L3338true assume 0 != main_~tmp~27; 2247#L3312true ~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 3413#L2855true havoc bigMacCall_#t~ret150, bigMacCall_~tmp~24;havoc bigMacCall_~tmp~24;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~4;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~4; 938#L753true assume 0 == getOrigin_~person;getOrigin_~retValue_acc~4 := 4;getOrigin_#res := getOrigin_~retValue_acc~4; 869#L778true bigMacCall_#t~ret150 := getOrigin_#res;bigMacCall_~tmp~24 := bigMacCall_#t~ret150;havoc bigMacCall_#t~ret150;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~24;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 1292#L399true assume 0 == initPersonOnFloor_~floor; 986#L400true assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 193#L507-1true callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 4535#L191true assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 2801#L203-2true havoc cleanup_#t~ret151, cleanup_#t~ret152, cleanup_~i~1, cleanup_~tmp~25, cleanup_~tmp___0~9, cleanup_~__cil_tmp4~2;havoc cleanup_~i~1;havoc cleanup_~tmp~25;havoc cleanup_~tmp___0~9;havoc cleanup_~__cil_tmp4~2;havoc timeShift_#t~ret54, timeShift_~tmp~12;havoc timeShift_~tmp~12;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~10;havoc areDoorsOpen_~retValue_acc~10;areDoorsOpen_~retValue_acc~10 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~10; 664#L1137true timeShift_#t~ret54 := areDoorsOpen_#res;timeShift_~tmp~12 := timeShift_#t~ret54;havoc timeShift_#t~ret54; 2146#L2080true assume 0 != timeShift_~tmp~12; 2314#L2081true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 668#L1753-11true havoc __utac_acc__Specification9_spec__3_#t~ret141, __utac_acc__Specification9_spec__3_#t~ret142, __utac_acc__Specification9_spec__3_#t~ret143, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~18, __utac_acc__Specification9_spec__3_~tmp___0~8, __utac_acc__Specification9_spec__3_~tmp___1~5;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~18;havoc __utac_acc__Specification9_spec__3_~tmp___0~8;havoc __utac_acc__Specification9_spec__3_~tmp___1~5;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~9;havoc getCurrentFloorID_~retValue_acc~9;getCurrentFloorID_~retValue_acc~9 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~9; 72#L1128-6true __utac_acc__Specification9_spec__3_#t~ret141 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~18 := __utac_acc__Specification9_spec__3_#t~ret141;havoc __utac_acc__Specification9_spec__3_#t~ret141;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~18;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~13;havoc isEmpty_~retValue_acc~13; 1597#L1188-12true assume 1 == ~persons_0~0;isEmpty_~retValue_acc~13 := 0;isEmpty_#res := isEmpty_~retValue_acc~13; 749#L1220-12true __utac_acc__Specification9_spec__3_#t~ret142 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~5 := __utac_acc__Specification9_spec__3_#t~ret142;havoc __utac_acc__Specification9_spec__3_#t~ret142; 688#L2898true assume 0 != __utac_acc__Specification9_spec__3_~tmp___1~5;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 4052#L2908-1true cleanup_~i~1 := 0; 379#L3144-2true [2018-11-28 23:49:39,255 INFO L796 eck$LassoCheckResult]: Loop: 379#L3144-2true assume !false; 360#L3145true cleanup_~__cil_tmp4~2 := ~cleanupTimeShifts~0 - 1; 277#L3148true assume cleanup_~i~1 < cleanup_~__cil_tmp4~2;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~8;havoc isBlocked_~retValue_acc~8;isBlocked_~retValue_acc~8 := ~blocked~0;isBlocked_#res := isBlocked_~retValue_acc~8; 201#L950true cleanup_#t~ret151 := isBlocked_#res;cleanup_~tmp___0~9 := cleanup_#t~ret151;havoc cleanup_#t~ret151; 207#L3152true assume 1 != cleanup_~tmp___0~9; 209#L3152-1true havoc isIdle_#res;havoc isIdle_#t~ret9, isIdle_~retValue_acc~15, isIdle_~tmp~4;havoc isIdle_~retValue_acc~15;havoc isIdle_~tmp~4;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret4, anyStopRequested_#t~ret5, anyStopRequested_#t~ret6, anyStopRequested_#t~ret7, anyStopRequested_#t~ret8, anyStopRequested_~retValue_acc~14, anyStopRequested_~tmp~3, anyStopRequested_~tmp___0~0, anyStopRequested_~tmp___1~0, anyStopRequested_~tmp___2~0, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~14;havoc anyStopRequested_~tmp~3;havoc anyStopRequested_~tmp___0~0;havoc anyStopRequested_~tmp___1~0;havoc anyStopRequested_~tmp___2~0;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~0;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~0; 1718#L128-50true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~0 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~0; 219#L155-50true anyStopRequested_#t~ret4 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret4;havoc anyStopRequested_#t~ret4; 4127#L1236true assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~14 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~14; 153#L1300true isIdle_#t~ret9 := anyStopRequested_#res;isIdle_~tmp~4 := isIdle_#t~ret9;havoc isIdle_#t~ret9;isIdle_~retValue_acc~15 := (if 0 == isIdle_~tmp~4 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~15; 674#L1313true cleanup_#t~ret152 := isIdle_#res;cleanup_~tmp~25 := cleanup_#t~ret152;havoc cleanup_#t~ret152; 505#L3164true assume !(0 != cleanup_~tmp~25);havoc timeShift_#t~ret54, timeShift_~tmp~12;havoc timeShift_~tmp~12;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~10;havoc areDoorsOpen_~retValue_acc~10;areDoorsOpen_~retValue_acc~10 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~10; 667#L1137-2true timeShift_#t~ret54 := areDoorsOpen_#res;timeShift_~tmp~12 := timeShift_#t~ret54;havoc timeShift_#t~ret54; 2145#L2080-1true assume 0 != timeShift_~tmp~12; 2317#L2081-2true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 654#L1753-23true havoc __utac_acc__Specification9_spec__3_#t~ret141, __utac_acc__Specification9_spec__3_#t~ret142, __utac_acc__Specification9_spec__3_#t~ret143, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~18, __utac_acc__Specification9_spec__3_~tmp___0~8, __utac_acc__Specification9_spec__3_~tmp___1~5;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~18;havoc __utac_acc__Specification9_spec__3_~tmp___0~8;havoc __utac_acc__Specification9_spec__3_~tmp___1~5;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~9;havoc getCurrentFloorID_~retValue_acc~9;getCurrentFloorID_~retValue_acc~9 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~9; 64#L1128-13true __utac_acc__Specification9_spec__3_#t~ret141 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~18 := __utac_acc__Specification9_spec__3_#t~ret141;havoc __utac_acc__Specification9_spec__3_#t~ret141;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~18;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~13;havoc isEmpty_~retValue_acc~13; 1566#L1188-25true assume 1 == ~persons_0~0;isEmpty_~retValue_acc~13 := 0;isEmpty_#res := isEmpty_~retValue_acc~13; 728#L1220-25true __utac_acc__Specification9_spec__3_#t~ret142 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~5 := __utac_acc__Specification9_spec__3_#t~ret142;havoc __utac_acc__Specification9_spec__3_#t~ret142; 691#L2898-2true assume 0 != __utac_acc__Specification9_spec__3_~tmp___1~5;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 4029#L2908-3true cleanup_~i~1 := 1 + cleanup_~i~1; 379#L3144-2true [2018-11-28 23:49:39,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:49:39,265 INFO L82 PathProgramCache]: Analyzing trace with hash 235059287, now seen corresponding path program 1 times [2018-11-28 23:49:39,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:49:39,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:49:39,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:49:39,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:49:39,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:49:39,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:49:39,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:49:39,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:49:39,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 23:49:39,647 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:49:39,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:49:39,647 INFO L82 PathProgramCache]: Analyzing trace with hash 2025712606, now seen corresponding path program 1 times [2018-11-28 23:49:39,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:49:39,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:49:39,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:49:39,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:49:39,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:49:39,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:49:39,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:49:39,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:49:39,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 23:49:39,783 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 23:49:39,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 23:49:39,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 23:49:39,807 INFO L87 Difference]: Start difference. First operand 5039 states. Second operand 4 states. [2018-11-28 23:49:43,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:49:43,091 INFO L93 Difference]: Finished difference Result 13293 states and 25069 transitions. [2018-11-28 23:49:43,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 23:49:43,094 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13293 states and 25069 transitions. [2018-11-28 23:49:43,221 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9073 [2018-11-28 23:49:43,337 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13293 states to 13251 states and 25020 transitions. [2018-11-28 23:49:43,339 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13251 [2018-11-28 23:49:43,366 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13251 [2018-11-28 23:49:43,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13251 states and 25020 transitions. [2018-11-28 23:49:43,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:49:43,410 INFO L705 BuchiCegarLoop]: Abstraction has 13251 states and 25020 transitions. [2018-11-28 23:49:43,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13251 states and 25020 transitions. [2018-11-28 23:49:43,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13251 to 5029. [2018-11-28 23:49:43,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5029 states. [2018-11-28 23:49:43,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5029 states to 5029 states and 9482 transitions. [2018-11-28 23:49:43,885 INFO L728 BuchiCegarLoop]: Abstraction has 5029 states and 9482 transitions. [2018-11-28 23:49:43,885 INFO L608 BuchiCegarLoop]: Abstraction has 5029 states and 9482 transitions. [2018-11-28 23:49:43,885 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:49:43,885 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5029 states and 9482 transitions. [2018-11-28 23:49:43,910 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2511 [2018-11-28 23:49:43,910 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:49:43,910 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:49:43,913 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:49:43,914 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:49:43,914 INFO L794 eck$LassoCheckResult]: Stem: 22189#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[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;~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~0 := 0;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0;call #t~string55.base, #t~string55.offset := #Ultimate.alloc(10);call #t~string57.base, #t~string57.offset := #Ultimate.alloc(4);call write~init~int(91, #t~string57.base, #t~string57.offset, 1);call write~init~int(95, #t~string57.base, 1 + #t~string57.offset, 1);call write~init~int(93, #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.alloc(4);call write~init~int(91, #t~string59.base, #t~string59.offset, 1);call write~init~int(93, #t~string59.base, 1 + #t~string59.offset, 1);call write~init~int(32, #t~string59.base, 2 + #t~string59.offset, 1);call write~init~int(0, #t~string59.base, 3 + #t~string59.offset, 1);call #t~string61.base, #t~string61.offset := #Ultimate.alloc(5);call write~init~int(32, #t~string61.base, #t~string61.offset, 1);call write~init~int(97, #t~string61.base, 1 + #t~string61.offset, 1);call write~init~int(116, #t~string61.base, 2 + #t~string61.offset, 1);call write~init~int(32, #t~string61.base, 3 + #t~string61.offset, 1);call write~init~int(0, #t~string61.base, 4 + #t~string61.offset, 1);call #t~string63.base, #t~string63.offset := #Ultimate.alloc(3);call write~init~int(37, #t~string63.base, #t~string63.offset, 1);call write~init~int(105, #t~string63.base, 1 + #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 2 + #t~string63.offset, 1);call #t~string65.base, #t~string65.offset := #Ultimate.alloc(10);call #t~string67.base, #t~string67.offset := #Ultimate.alloc(3);call write~init~int(117, #t~string67.base, #t~string67.offset, 1);call write~init~int(112, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 2 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.alloc(5);call write~init~int(100, #t~string69.base, #t~string69.offset, 1);call write~init~int(111, #t~string69.base, 1 + #t~string69.offset, 1);call write~init~int(119, #t~string69.base, 2 + #t~string69.offset, 1);call write~init~int(110, #t~string69.base, 3 + #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 4 + #t~string69.offset, 1);call #t~string71.base, #t~string71.offset := #Ultimate.alloc(7);call write~init~int(32, #t~string71.base, #t~string71.offset, 1);call write~init~int(73, #t~string71.base, 1 + #t~string71.offset, 1);call write~init~int(76, #t~string71.base, 2 + #t~string71.offset, 1);call write~init~int(95, #t~string71.base, 3 + #t~string71.offset, 1);call write~init~int(112, #t~string71.base, 4 + #t~string71.offset, 1);call write~init~int(58, #t~string71.base, 5 + #t~string71.offset, 1);call write~init~int(0, #t~string71.base, 6 + #t~string71.offset, 1);call #t~string73.base, #t~string73.offset := #Ultimate.alloc(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.alloc(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.alloc(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.alloc(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.alloc(4);call write~init~int(32, #t~string81.base, #t~string81.offset, 1);call write~init~int(37, #t~string81.base, 1 + #t~string81.offset, 1);call write~init~int(105, #t~string81.base, 2 + #t~string81.offset, 1);call write~init~int(0, #t~string81.base, 3 + #t~string81.offset, 1);call #t~string83.base, #t~string83.offset := #Ultimate.alloc(6);call write~init~int(32, #t~string83.base, #t~string83.offset, 1);call write~init~int(70, #t~string83.base, 1 + #t~string83.offset, 1);call write~init~int(95, #t~string83.base, 2 + #t~string83.offset, 1);call write~init~int(112, #t~string83.base, 3 + #t~string83.offset, 1);call write~init~int(58, #t~string83.base, 4 + #t~string83.offset, 1);call write~init~int(0, #t~string83.base, 5 + #t~string83.offset, 1);call #t~string86.base, #t~string86.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string86.base, #t~string86.offset, 1);call write~init~int(37, #t~string86.base, 1 + #t~string86.offset, 1);call write~init~int(105, #t~string86.base, 2 + #t~string86.offset, 1);call write~init~int(0, #t~string86.base, 3 + #t~string86.offset, 1);call #t~string89.base, #t~string89.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string89.base, #t~string89.offset, 1);call write~init~int(37, #t~string89.base, 1 + #t~string89.offset, 1);call write~init~int(105, #t~string89.base, 2 + #t~string89.offset, 1);call write~init~int(0, #t~string89.base, 3 + #t~string89.offset, 1);call #t~string92.base, #t~string92.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string92.base, #t~string92.offset, 1);call write~init~int(37, #t~string92.base, 1 + #t~string92.offset, 1);call write~init~int(105, #t~string92.base, 2 + #t~string92.offset, 1);call write~init~int(0, #t~string92.base, 3 + #t~string92.offset, 1);call #t~string95.base, #t~string95.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string95.base, #t~string95.offset, 1);call write~init~int(37, #t~string95.base, 1 + #t~string95.offset, 1);call write~init~int(105, #t~string95.base, 2 + #t~string95.offset, 1);call write~init~int(0, #t~string95.base, 3 + #t~string95.offset, 1);call #t~string98.base, #t~string98.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string98.base, #t~string98.offset, 1);call write~init~int(37, #t~string98.base, 1 + #t~string98.offset, 1);call write~init~int(105, #t~string98.base, 2 + #t~string98.offset, 1);call write~init~int(0, #t~string98.base, 3 + #t~string98.offset, 1);call #t~string100.base, #t~string100.offset := #Ultimate.alloc(2);call write~init~int(10, #t~string100.base, #t~string100.offset, 1);call write~init~int(0, #t~string100.base, 1 + #t~string100.offset, 1);call #t~string103.base, #t~string103.offset := #Ultimate.alloc(9);~head~0.base, ~head~0.offset := 0, 0;call #t~string124.base, #t~string124.offset := #Ultimate.alloc(30);call #t~string125.base, #t~string125.offset := #Ultimate.alloc(9);call #t~string126.base, #t~string126.offset := #Ultimate.alloc(21);call #t~string127.base, #t~string127.offset := #Ultimate.alloc(30);call #t~string128.base, #t~string128.offset := #Ultimate.alloc(9);call #t~string129.base, #t~string129.offset := #Ultimate.alloc(21);call #t~string133.base, #t~string133.offset := #Ultimate.alloc(30);call #t~string134.base, #t~string134.offset := #Ultimate.alloc(9);call #t~string135.base, #t~string135.offset := #Ultimate.alloc(25);call #t~string136.base, #t~string136.offset := #Ultimate.alloc(30);call #t~string137.base, #t~string137.offset := #Ultimate.alloc(9);call #t~string138.base, #t~string138.offset := #Ultimate.alloc(25);~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0;~cleanupTimeShifts~0 := 12; 22190#L-1 havoc main_#res;havoc main_#t~ret157, main_~retValue_acc~29, main_~tmp~27;havoc main_~retValue_acc~29;havoc main_~tmp~27; 20972#L853 havoc valid_product_#res;havoc valid_product_~retValue_acc~7;havoc valid_product_~retValue_acc~7;valid_product_~retValue_acc~7 := 1;valid_product_#res := valid_product_~retValue_acc~7; 18822#L861 main_#t~ret157 := valid_product_#res;main_~tmp~27 := main_#t~ret157;havoc main_#t~ret157; 18823#L3338 assume 0 != main_~tmp~27; 19458#L3312 ~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 21296#L2855 havoc bigMacCall_#t~ret150, bigMacCall_~tmp~24;havoc bigMacCall_~tmp~24;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~4;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~4; 19813#L753 assume 0 == getOrigin_~person;getOrigin_~retValue_acc~4 := 4;getOrigin_#res := getOrigin_~retValue_acc~4; 18829#L778 bigMacCall_#t~ret150 := getOrigin_#res;bigMacCall_~tmp~24 := bigMacCall_#t~ret150;havoc bigMacCall_#t~ret150;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~24;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 19747#L399 assume 0 == initPersonOnFloor_~floor; 19909#L400 assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 18361#L507-1 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 18733#L191 assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 21799#L203-2 havoc cleanup_#t~ret151, cleanup_#t~ret152, cleanup_~i~1, cleanup_~tmp~25, cleanup_~tmp___0~9, cleanup_~__cil_tmp4~2;havoc cleanup_~i~1;havoc cleanup_~tmp~25;havoc cleanup_~tmp___0~9;havoc cleanup_~__cil_tmp4~2;havoc timeShift_#t~ret54, timeShift_~tmp~12;havoc timeShift_~tmp~12;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~10;havoc areDoorsOpen_~retValue_acc~10;areDoorsOpen_~retValue_acc~10 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~10; 19540#L1137 timeShift_#t~ret54 := areDoorsOpen_#res;timeShift_~tmp~12 := timeShift_#t~ret54;havoc timeShift_#t~ret54; 19541#L2080 assume 0 != timeShift_~tmp~12; 21244#L2081 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 19547#L1753-11 havoc __utac_acc__Specification9_spec__3_#t~ret141, __utac_acc__Specification9_spec__3_#t~ret142, __utac_acc__Specification9_spec__3_#t~ret143, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~18, __utac_acc__Specification9_spec__3_~tmp___0~8, __utac_acc__Specification9_spec__3_~tmp___1~5;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~18;havoc __utac_acc__Specification9_spec__3_~tmp___0~8;havoc __utac_acc__Specification9_spec__3_~tmp___1~5;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~9;havoc getCurrentFloorID_~retValue_acc~9;getCurrentFloorID_~retValue_acc~9 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~9; 18496#L1128-6 __utac_acc__Specification9_spec__3_#t~ret141 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~18 := __utac_acc__Specification9_spec__3_#t~ret141;havoc __utac_acc__Specification9_spec__3_#t~ret141;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~18;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~13;havoc isEmpty_~retValue_acc~13; 18497#L1188-12 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~13 := 0;isEmpty_#res := isEmpty_~retValue_acc~13; 19097#L1220-12 __utac_acc__Specification9_spec__3_#t~ret142 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~5 := __utac_acc__Specification9_spec__3_#t~ret142;havoc __utac_acc__Specification9_spec__3_#t~ret142; 19566#L2898 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~5);havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~10;havoc areDoorsOpen_~retValue_acc~10;areDoorsOpen_~retValue_acc~10 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~10; 19544#L1137-1 __utac_acc__Specification9_spec__3_#t~ret143 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~8 := __utac_acc__Specification9_spec__3_#t~ret143;havoc __utac_acc__Specification9_spec__3_#t~ret143; 19545#L2908 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___0~8); 21795#L2908-1 cleanup_~i~1 := 0; 19028#L3144-2 [2018-11-28 23:49:43,914 INFO L796 eck$LassoCheckResult]: Loop: 19028#L3144-2 assume !false; 19009#L3145 cleanup_~__cil_tmp4~2 := ~cleanupTimeShifts~0 - 1; 18866#L3148 assume cleanup_~i~1 < cleanup_~__cil_tmp4~2;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~8;havoc isBlocked_~retValue_acc~8;isBlocked_~retValue_acc~8 := ~blocked~0;isBlocked_#res := isBlocked_~retValue_acc~8; 18751#L950 cleanup_#t~ret151 := isBlocked_#res;cleanup_~tmp___0~9 := cleanup_#t~ret151;havoc cleanup_#t~ret151; 18752#L3152 assume 1 != cleanup_~tmp___0~9; 18764#L3152-1 havoc isIdle_#res;havoc isIdle_#t~ret9, isIdle_~retValue_acc~15, isIdle_~tmp~4;havoc isIdle_~retValue_acc~15;havoc isIdle_~tmp~4;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret4, anyStopRequested_#t~ret5, anyStopRequested_#t~ret6, anyStopRequested_#t~ret7, anyStopRequested_#t~ret8, anyStopRequested_~retValue_acc~14, anyStopRequested_~tmp~3, anyStopRequested_~tmp___0~0, anyStopRequested_~tmp___1~0, anyStopRequested_~tmp___2~0, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~14;havoc anyStopRequested_~tmp~3;havoc anyStopRequested_~tmp___0~0;havoc anyStopRequested_~tmp___1~0;havoc anyStopRequested_~tmp___2~0;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~0;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~0; 18767#L128-50 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~0 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~0; 18783#L155-50 anyStopRequested_#t~ret4 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret4;havoc anyStopRequested_#t~ret4; 18784#L1236 assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~14 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~14; 18657#L1300 isIdle_#t~ret9 := anyStopRequested_#res;isIdle_~tmp~4 := isIdle_#t~ret9;havoc isIdle_#t~ret9;isIdle_~retValue_acc~15 := (if 0 == isIdle_~tmp~4 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~15; 18658#L1313 cleanup_#t~ret152 := isIdle_#res;cleanup_~tmp~25 := cleanup_#t~ret152;havoc cleanup_#t~ret152; 19263#L3164 assume !(0 != cleanup_~tmp~25);havoc timeShift_#t~ret54, timeShift_~tmp~12;havoc timeShift_~tmp~12;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~10;havoc areDoorsOpen_~retValue_acc~10;areDoorsOpen_~retValue_acc~10 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~10; 19264#L1137-2 timeShift_#t~ret54 := areDoorsOpen_#res;timeShift_~tmp~12 := timeShift_#t~ret54;havoc timeShift_#t~ret54; 19546#L2080-1 assume 0 != timeShift_~tmp~12; 21243#L2081-2 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 19524#L1753-23 havoc __utac_acc__Specification9_spec__3_#t~ret141, __utac_acc__Specification9_spec__3_#t~ret142, __utac_acc__Specification9_spec__3_#t~ret143, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~18, __utac_acc__Specification9_spec__3_~tmp___0~8, __utac_acc__Specification9_spec__3_~tmp___1~5;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~18;havoc __utac_acc__Specification9_spec__3_~tmp___0~8;havoc __utac_acc__Specification9_spec__3_~tmp___1~5;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~9;havoc getCurrentFloorID_~retValue_acc~9;getCurrentFloorID_~retValue_acc~9 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~9; 18475#L1128-13 __utac_acc__Specification9_spec__3_#t~ret141 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~18 := __utac_acc__Specification9_spec__3_#t~ret141;havoc __utac_acc__Specification9_spec__3_#t~ret141;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~18;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~13;havoc isEmpty_~retValue_acc~13; 18476#L1188-25 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~13 := 0;isEmpty_#res := isEmpty_~retValue_acc~13; 19056#L1220-25 __utac_acc__Specification9_spec__3_#t~ret142 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~5 := __utac_acc__Specification9_spec__3_#t~ret142;havoc __utac_acc__Specification9_spec__3_#t~ret142; 19569#L2898-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~5);havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~10;havoc areDoorsOpen_~retValue_acc~10;areDoorsOpen_~retValue_acc~10 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~10; 19522#L1137-3 __utac_acc__Specification9_spec__3_#t~ret143 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~8 := __utac_acc__Specification9_spec__3_#t~ret143;havoc __utac_acc__Specification9_spec__3_#t~ret143; 19523#L2908-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___0~8); 21788#L2908-3 cleanup_~i~1 := 1 + cleanup_~i~1; 19028#L3144-2 [2018-11-28 23:49:43,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:49:43,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1740912844, now seen corresponding path program 1 times [2018-11-28 23:49:43,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:49:43,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:49:43,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:49:43,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:49:43,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:49:43,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:49:44,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:49:44,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:49:44,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 23:49:44,065 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:49:44,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:49:44,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1090392987, now seen corresponding path program 1 times [2018-11-28 23:49:44,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:49:44,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:49:44,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:49:44,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:49:44,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:49:44,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:49:44,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:49:44,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:49:44,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 23:49:44,164 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 23:49:44,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 23:49:44,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 23:49:44,166 INFO L87 Difference]: Start difference. First operand 5029 states and 9482 transitions. cyclomatic complexity: 4454 Second operand 7 states. [2018-11-28 23:49:44,854 WARN L180 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2018-11-28 23:49:45,340 WARN L180 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-11-28 23:49:46,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:49:46,401 INFO L93 Difference]: Finished difference Result 8306 states and 15521 transitions. [2018-11-28 23:49:46,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-28 23:49:46,402 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8306 states and 15521 transitions. [2018-11-28 23:49:46,456 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6659 [2018-11-28 23:49:46,515 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8306 states to 8306 states and 15521 transitions. [2018-11-28 23:49:46,515 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8306 [2018-11-28 23:49:46,524 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8306 [2018-11-28 23:49:46,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8306 states and 15521 transitions. [2018-11-28 23:49:46,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:49:46,538 INFO L705 BuchiCegarLoop]: Abstraction has 8306 states and 15521 transitions. [2018-11-28 23:49:46,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8306 states and 15521 transitions. [2018-11-28 23:49:46,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8306 to 4497. [2018-11-28 23:49:46,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4497 states. [2018-11-28 23:49:46,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4497 states to 4497 states and 8443 transitions. [2018-11-28 23:49:46,647 INFO L728 BuchiCegarLoop]: Abstraction has 4497 states and 8443 transitions. [2018-11-28 23:49:46,647 INFO L608 BuchiCegarLoop]: Abstraction has 4497 states and 8443 transitions. [2018-11-28 23:49:46,647 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:49:46,647 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4497 states and 8443 transitions. [2018-11-28 23:49:46,670 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2879 [2018-11-28 23:49:46,671 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:49:46,671 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:49:46,673 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:49:46,673 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:49:46,673 INFO L794 eck$LassoCheckResult]: Stem: 34745#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[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;~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~0 := 0;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0;call #t~string55.base, #t~string55.offset := #Ultimate.alloc(10);call #t~string57.base, #t~string57.offset := #Ultimate.alloc(4);call write~init~int(91, #t~string57.base, #t~string57.offset, 1);call write~init~int(95, #t~string57.base, 1 + #t~string57.offset, 1);call write~init~int(93, #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.alloc(4);call write~init~int(91, #t~string59.base, #t~string59.offset, 1);call write~init~int(93, #t~string59.base, 1 + #t~string59.offset, 1);call write~init~int(32, #t~string59.base, 2 + #t~string59.offset, 1);call write~init~int(0, #t~string59.base, 3 + #t~string59.offset, 1);call #t~string61.base, #t~string61.offset := #Ultimate.alloc(5);call write~init~int(32, #t~string61.base, #t~string61.offset, 1);call write~init~int(97, #t~string61.base, 1 + #t~string61.offset, 1);call write~init~int(116, #t~string61.base, 2 + #t~string61.offset, 1);call write~init~int(32, #t~string61.base, 3 + #t~string61.offset, 1);call write~init~int(0, #t~string61.base, 4 + #t~string61.offset, 1);call #t~string63.base, #t~string63.offset := #Ultimate.alloc(3);call write~init~int(37, #t~string63.base, #t~string63.offset, 1);call write~init~int(105, #t~string63.base, 1 + #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 2 + #t~string63.offset, 1);call #t~string65.base, #t~string65.offset := #Ultimate.alloc(10);call #t~string67.base, #t~string67.offset := #Ultimate.alloc(3);call write~init~int(117, #t~string67.base, #t~string67.offset, 1);call write~init~int(112, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 2 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.alloc(5);call write~init~int(100, #t~string69.base, #t~string69.offset, 1);call write~init~int(111, #t~string69.base, 1 + #t~string69.offset, 1);call write~init~int(119, #t~string69.base, 2 + #t~string69.offset, 1);call write~init~int(110, #t~string69.base, 3 + #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 4 + #t~string69.offset, 1);call #t~string71.base, #t~string71.offset := #Ultimate.alloc(7);call write~init~int(32, #t~string71.base, #t~string71.offset, 1);call write~init~int(73, #t~string71.base, 1 + #t~string71.offset, 1);call write~init~int(76, #t~string71.base, 2 + #t~string71.offset, 1);call write~init~int(95, #t~string71.base, 3 + #t~string71.offset, 1);call write~init~int(112, #t~string71.base, 4 + #t~string71.offset, 1);call write~init~int(58, #t~string71.base, 5 + #t~string71.offset, 1);call write~init~int(0, #t~string71.base, 6 + #t~string71.offset, 1);call #t~string73.base, #t~string73.offset := #Ultimate.alloc(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.alloc(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.alloc(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.alloc(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.alloc(4);call write~init~int(32, #t~string81.base, #t~string81.offset, 1);call write~init~int(37, #t~string81.base, 1 + #t~string81.offset, 1);call write~init~int(105, #t~string81.base, 2 + #t~string81.offset, 1);call write~init~int(0, #t~string81.base, 3 + #t~string81.offset, 1);call #t~string83.base, #t~string83.offset := #Ultimate.alloc(6);call write~init~int(32, #t~string83.base, #t~string83.offset, 1);call write~init~int(70, #t~string83.base, 1 + #t~string83.offset, 1);call write~init~int(95, #t~string83.base, 2 + #t~string83.offset, 1);call write~init~int(112, #t~string83.base, 3 + #t~string83.offset, 1);call write~init~int(58, #t~string83.base, 4 + #t~string83.offset, 1);call write~init~int(0, #t~string83.base, 5 + #t~string83.offset, 1);call #t~string86.base, #t~string86.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string86.base, #t~string86.offset, 1);call write~init~int(37, #t~string86.base, 1 + #t~string86.offset, 1);call write~init~int(105, #t~string86.base, 2 + #t~string86.offset, 1);call write~init~int(0, #t~string86.base, 3 + #t~string86.offset, 1);call #t~string89.base, #t~string89.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string89.base, #t~string89.offset, 1);call write~init~int(37, #t~string89.base, 1 + #t~string89.offset, 1);call write~init~int(105, #t~string89.base, 2 + #t~string89.offset, 1);call write~init~int(0, #t~string89.base, 3 + #t~string89.offset, 1);call #t~string92.base, #t~string92.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string92.base, #t~string92.offset, 1);call write~init~int(37, #t~string92.base, 1 + #t~string92.offset, 1);call write~init~int(105, #t~string92.base, 2 + #t~string92.offset, 1);call write~init~int(0, #t~string92.base, 3 + #t~string92.offset, 1);call #t~string95.base, #t~string95.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string95.base, #t~string95.offset, 1);call write~init~int(37, #t~string95.base, 1 + #t~string95.offset, 1);call write~init~int(105, #t~string95.base, 2 + #t~string95.offset, 1);call write~init~int(0, #t~string95.base, 3 + #t~string95.offset, 1);call #t~string98.base, #t~string98.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string98.base, #t~string98.offset, 1);call write~init~int(37, #t~string98.base, 1 + #t~string98.offset, 1);call write~init~int(105, #t~string98.base, 2 + #t~string98.offset, 1);call write~init~int(0, #t~string98.base, 3 + #t~string98.offset, 1);call #t~string100.base, #t~string100.offset := #Ultimate.alloc(2);call write~init~int(10, #t~string100.base, #t~string100.offset, 1);call write~init~int(0, #t~string100.base, 1 + #t~string100.offset, 1);call #t~string103.base, #t~string103.offset := #Ultimate.alloc(9);~head~0.base, ~head~0.offset := 0, 0;call #t~string124.base, #t~string124.offset := #Ultimate.alloc(30);call #t~string125.base, #t~string125.offset := #Ultimate.alloc(9);call #t~string126.base, #t~string126.offset := #Ultimate.alloc(21);call #t~string127.base, #t~string127.offset := #Ultimate.alloc(30);call #t~string128.base, #t~string128.offset := #Ultimate.alloc(9);call #t~string129.base, #t~string129.offset := #Ultimate.alloc(21);call #t~string133.base, #t~string133.offset := #Ultimate.alloc(30);call #t~string134.base, #t~string134.offset := #Ultimate.alloc(9);call #t~string135.base, #t~string135.offset := #Ultimate.alloc(25);call #t~string136.base, #t~string136.offset := #Ultimate.alloc(30);call #t~string137.base, #t~string137.offset := #Ultimate.alloc(9);call #t~string138.base, #t~string138.offset := #Ultimate.alloc(25);~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0;~cleanupTimeShifts~0 := 12; 34746#L-1 havoc main_#res;havoc main_#t~ret157, main_~retValue_acc~29, main_~tmp~27;havoc main_~retValue_acc~29;havoc main_~tmp~27; 33772#L853 havoc valid_product_#res;havoc valid_product_~retValue_acc~7;havoc valid_product_~retValue_acc~7;valid_product_~retValue_acc~7 := 1;valid_product_#res := valid_product_~retValue_acc~7; 32110#L861 main_#t~ret157 := valid_product_#res;main_~tmp~27 := main_#t~ret157;havoc main_#t~ret157; 32111#L3338 assume 0 != main_~tmp~27; 32577#L3312 ~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 34031#L2855 havoc bigMacCall_#t~ret150, bigMacCall_~tmp~24;havoc bigMacCall_~tmp~24;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~4;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~4; 32878#L753 assume 0 == getOrigin_~person;getOrigin_~retValue_acc~4 := 4;getOrigin_#res := getOrigin_~retValue_acc~4; 32113#L778 bigMacCall_#t~ret150 := getOrigin_#res;bigMacCall_~tmp~24 := bigMacCall_#t~ret150;havoc bigMacCall_#t~ret150;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~24;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 32794#L399 assume 0 == initPersonOnFloor_~floor; 32965#L400 assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 31734#L507-1 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 32043#L191 assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 34435#L203-2 havoc cleanup_#t~ret151, cleanup_#t~ret152, cleanup_~i~1, cleanup_~tmp~25, cleanup_~tmp___0~9, cleanup_~__cil_tmp4~2;havoc cleanup_~i~1;havoc cleanup_~tmp~25;havoc cleanup_~tmp___0~9;havoc cleanup_~__cil_tmp4~2;havoc timeShift_#t~ret54, timeShift_~tmp~12;havoc timeShift_~tmp~12;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~10;havoc areDoorsOpen_~retValue_acc~10;areDoorsOpen_~retValue_acc~10 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~10; 32636#L1137 timeShift_#t~ret54 := areDoorsOpen_#res;timeShift_~tmp~12 := timeShift_#t~ret54;havoc timeShift_#t~ret54; 32637#L2080 assume 0 != timeShift_~tmp~12; 33984#L2081 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 32641#L1753-11 havoc __utac_acc__Specification9_spec__3_#t~ret141, __utac_acc__Specification9_spec__3_#t~ret142, __utac_acc__Specification9_spec__3_#t~ret143, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~18, __utac_acc__Specification9_spec__3_~tmp___0~8, __utac_acc__Specification9_spec__3_~tmp___1~5;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~18;havoc __utac_acc__Specification9_spec__3_~tmp___0~8;havoc __utac_acc__Specification9_spec__3_~tmp___1~5;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~9;havoc getCurrentFloorID_~retValue_acc~9;getCurrentFloorID_~retValue_acc~9 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~9; 31852#L1128-6 __utac_acc__Specification9_spec__3_#t~ret141 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~18 := __utac_acc__Specification9_spec__3_#t~ret141;havoc __utac_acc__Specification9_spec__3_#t~ret141;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~18;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~13;havoc isEmpty_~retValue_acc~13; 31853#L1188-12 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~13 := 0;isEmpty_#res := isEmpty_~retValue_acc~13; 32302#L1220-12 __utac_acc__Specification9_spec__3_#t~ret142 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~5 := __utac_acc__Specification9_spec__3_#t~ret142;havoc __utac_acc__Specification9_spec__3_#t~ret142; 32658#L2898 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~5);havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~10;havoc areDoorsOpen_~retValue_acc~10;areDoorsOpen_~retValue_acc~10 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~10; 32638#L1137-1 __utac_acc__Specification9_spec__3_#t~ret143 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~8 := __utac_acc__Specification9_spec__3_#t~ret143;havoc __utac_acc__Specification9_spec__3_#t~ret143; 32639#L2908 assume 0 != __utac_acc__Specification9_spec__3_~tmp___0~8; 35300#L2909 assume 0 == __utac_acc__Specification9_spec__3_~floor~0; 35170#L2910 assume 0 != ~floorButtons_spc9_0~0;~floorButtons_spc9_0~0 := 0; 34432#L2908-1 cleanup_~i~1 := 0; 35280#L3144-2 [2018-11-28 23:49:46,673 INFO L796 eck$LassoCheckResult]: Loop: 35280#L3144-2 assume !false; 35757#L3145 cleanup_~__cil_tmp4~2 := ~cleanupTimeShifts~0 - 1; 35756#L3148 assume cleanup_~i~1 < cleanup_~__cil_tmp4~2;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~8;havoc isBlocked_~retValue_acc~8;isBlocked_~retValue_acc~8 := ~blocked~0;isBlocked_#res := isBlocked_~retValue_acc~8; 35755#L950 cleanup_#t~ret151 := isBlocked_#res;cleanup_~tmp___0~9 := cleanup_#t~ret151;havoc cleanup_#t~ret151; 35754#L3152 assume 1 != cleanup_~tmp___0~9; 35753#L3152-1 havoc isIdle_#res;havoc isIdle_#t~ret9, isIdle_~retValue_acc~15, isIdle_~tmp~4;havoc isIdle_~retValue_acc~15;havoc isIdle_~tmp~4;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret4, anyStopRequested_#t~ret5, anyStopRequested_#t~ret6, anyStopRequested_#t~ret7, anyStopRequested_#t~ret8, anyStopRequested_~retValue_acc~14, anyStopRequested_~tmp~3, anyStopRequested_~tmp___0~0, anyStopRequested_~tmp___1~0, anyStopRequested_~tmp___2~0, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~14;havoc anyStopRequested_~tmp~3;havoc anyStopRequested_~tmp___0~0;havoc anyStopRequested_~tmp___1~0;havoc anyStopRequested_~tmp___2~0;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~0;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~0; 35747#L128-50 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~0 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~0; 35742#L155-50 anyStopRequested_#t~ret4 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret4;havoc anyStopRequested_#t~ret4; 35732#L1236 assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~14 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~14; 35727#L1300 isIdle_#t~ret9 := anyStopRequested_#res;isIdle_~tmp~4 := isIdle_#t~ret9;havoc isIdle_#t~ret9;isIdle_~retValue_acc~15 := (if 0 == isIdle_~tmp~4 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~15; 35726#L1313 cleanup_#t~ret152 := isIdle_#res;cleanup_~tmp~25 := cleanup_#t~ret152;havoc cleanup_#t~ret152; 35725#L3164 assume !(0 != cleanup_~tmp~25);havoc timeShift_#t~ret54, timeShift_~tmp~12;havoc timeShift_~tmp~12;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~10;havoc areDoorsOpen_~retValue_acc~10;areDoorsOpen_~retValue_acc~10 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~10; 35724#L1137-2 timeShift_#t~ret54 := areDoorsOpen_#res;timeShift_~tmp~12 := timeShift_#t~ret54;havoc timeShift_#t~ret54; 33982#L2080-1 assume 0 != timeShift_~tmp~12; 33983#L2081-2 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 32626#L1753-23 havoc __utac_acc__Specification9_spec__3_#t~ret141, __utac_acc__Specification9_spec__3_#t~ret142, __utac_acc__Specification9_spec__3_#t~ret143, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~18, __utac_acc__Specification9_spec__3_~tmp___0~8, __utac_acc__Specification9_spec__3_~tmp___1~5;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~18;havoc __utac_acc__Specification9_spec__3_~tmp___0~8;havoc __utac_acc__Specification9_spec__3_~tmp___1~5;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~9;havoc getCurrentFloorID_~retValue_acc~9;getCurrentFloorID_~retValue_acc~9 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~9; 31838#L1128-13 __utac_acc__Specification9_spec__3_#t~ret141 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~18 := __utac_acc__Specification9_spec__3_#t~ret141;havoc __utac_acc__Specification9_spec__3_#t~ret141;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~18;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~13;havoc isEmpty_~retValue_acc~13; 31839#L1188-25 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~13 := 0;isEmpty_#res := isEmpty_~retValue_acc~13; 32973#L1220-25 __utac_acc__Specification9_spec__3_#t~ret142 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~5 := __utac_acc__Specification9_spec__3_#t~ret142;havoc __utac_acc__Specification9_spec__3_#t~ret142; 32661#L2898-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~5);havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~10;havoc areDoorsOpen_~retValue_acc~10;areDoorsOpen_~retValue_acc~10 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~10; 32624#L1137-3 __utac_acc__Specification9_spec__3_#t~ret143 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~8 := __utac_acc__Specification9_spec__3_#t~ret143;havoc __utac_acc__Specification9_spec__3_#t~ret143; 32625#L2908-2 assume 0 != __utac_acc__Specification9_spec__3_~tmp___0~8; 35302#L2909-1 assume 0 == __utac_acc__Specification9_spec__3_~floor~0; 35353#L2910-2 assume 0 != ~floorButtons_spc9_0~0;~floorButtons_spc9_0~0 := 0; 35279#L2908-3 cleanup_~i~1 := 1 + cleanup_~i~1; 35280#L3144-2 [2018-11-28 23:49:46,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:49:46,682 INFO L82 PathProgramCache]: Analyzing trace with hash 2018478799, now seen corresponding path program 1 times [2018-11-28 23:49:46,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:49:46,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:49:46,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:49:46,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:49:46,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:49:46,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:49:46,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:49:46,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:49:46,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 23:49:46,783 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:49:46,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:49:46,784 INFO L82 PathProgramCache]: Analyzing trace with hash -105498602, now seen corresponding path program 1 times [2018-11-28 23:49:46,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:49:46,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:49:46,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:49:46,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:49:46,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:49:46,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:49:46,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:49:47,296 WARN L180 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 92 [2018-11-28 23:49:47,871 WARN L180 SmtUtils]: Spent 565.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 86 [2018-11-28 23:49:47,889 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:49:47,890 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:49:47,890 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:49:47,890 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:49:47,890 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:49:47,891 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:49:47,891 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:49:47,891 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:49:47,891 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec9_product28_false-unreach-call_true-termination.cil.c_Iteration3_Loop [2018-11-28 23:49:47,891 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:49:47,891 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:49:47,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:49:48,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:49:48,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:49:48,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:49:48,216 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-28 23:49:48,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:49:48,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:49:48,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:49:48,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:49:48,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:49:48,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:49:48,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:49:48,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:49:48,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:49:48,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:49:48,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:49:48,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:49:48,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:49:48,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:49:48,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:49:48,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:49:48,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:49:48,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:49:48,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:49:48,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:49:48,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:49:48,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:49:48,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:49:48,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:49:48,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:49:49,186 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:49:49,187 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 [2018-11-28 23:49:49,200 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:49:49,201 INFO L163 nArgumentSynthesizer]: Using integer mode. 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 [2018-11-28 23:49:49,257 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:49:49,257 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:50:01,315 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2018-11-28 23:50:01,319 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:50:01,319 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:50:01,319 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:50:01,319 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:50:01,319 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:50:01,319 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:50:01,319 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:50:01,320 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:50:01,320 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec9_product28_false-unreach-call_true-termination.cil.c_Iteration3_Loop [2018-11-28 23:50:01,320 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:50:01,320 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:50:01,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:50:01,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:50:01,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:50:01,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:50:01,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:50:01,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:50:01,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:50:01,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:50:01,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:50:01,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:50:01,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:50:01,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:50:01,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:50:01,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:50:01,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:50:01,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:50:01,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:50:01,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:50:01,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:50:01,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:50:01,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:50:01,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:50:01,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:50:01,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:50:01,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:50:01,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:50:01,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:50:01,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:50:01,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:50:02,359 WARN L180 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-28 23:50:02,449 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:50:02,456 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:50:02,458 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:50:02,466 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:50:02,469 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:50:02,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:50:02,470 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:50:02,470 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:50:02,479 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:50:02,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:50:02,505 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:50:02,506 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:50:02,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:50:02,506 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:50:02,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:50:02,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:50:02,512 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:50:02,512 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:50:02,513 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:50:02,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:50:02,518 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:50:02,518 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:50:02,522 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:50:02,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:50:02,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:50:02,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:50:02,523 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:50:02,523 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:50:02,524 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:50:02,526 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:50:02,527 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:50:02,529 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:50:02,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:50:02,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:50:02,530 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:50:02,531 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:50:02,531 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:50:02,532 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:50:02,532 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:50:02,539 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:50:02,539 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:50:02,539 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:50:02,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:50:02,540 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:50:02,542 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:50:02,542 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:50:02,543 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:50:02,547 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:50:02,547 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:50:02,547 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:50:02,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:50:02,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:50:02,551 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:50:02,552 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:50:02,552 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:50:02,563 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:50:02,564 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:50:02,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:50:02,565 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:50:02,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:50:02,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:50:02,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:50:02,566 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:50:02,571 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:50:02,572 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:50:02,572 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:50:02,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:50:02,573 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:50:02,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:50:02,573 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:50:02,573 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:50:02,574 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:50:02,574 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:50:02,581 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:50:02,582 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:50:02,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:50:02,582 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:50:02,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:50:02,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:50:02,583 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:50:02,583 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:50:02,583 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:50:02,587 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:50:02,588 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:50:02,588 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:50:02,588 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:50:02,588 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:50:02,588 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:50:02,589 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:50:02,590 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:50:02,591 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:50:02,592 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:50:02,592 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:50:02,594 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:50:02,594 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:50:02,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:50:02,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:50:02,594 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:50:02,595 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:50:02,595 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:50:02,596 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:50:02,597 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:50:02,597 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:50:02,597 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:50:02,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:50:02,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:50:02,598 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:50:02,598 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:50:02,598 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:50:02,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:50:02,600 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:50:02,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:50:02,600 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:50:02,600 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:50:02,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:50:02,601 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:50:02,609 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:50:02,609 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:50:02,614 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:50:02,614 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:50:02,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:50:02,615 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:50:02,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:50:02,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:50:02,615 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:50:02,616 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:50:02,616 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:50:02,617 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:50:02,620 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:50:02,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:50:02,621 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:50:02,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:50:02,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:50:02,621 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:50:02,621 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:50:02,621 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:50:02,627 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:50:02,628 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:50:02,628 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:50:02,628 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:50:02,629 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:50:02,632 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:50:02,632 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:50:02,632 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:50:02,632 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:50:02,633 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:50:02,636 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:50:02,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:50:02,637 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:50:02,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:50:02,639 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:50:02,639 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:50:02,639 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:50:02,639 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:50:02,640 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:50:02,641 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:50:02,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:50:02,644 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:50:02,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:50:02,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:50:02,645 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:50:02,647 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:50:02,647 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:50:02,648 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:50:02,652 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:50:02,652 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:50:02,652 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:50:02,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:50:02,653 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:50:02,653 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:50:02,655 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:50:02,655 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:50:02,671 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:50:02,674 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:50:02,677 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:50:02,678 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:50:02,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:50:02,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:50:02,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:50:02,680 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:50:02,680 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:50:02,682 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:50:02,682 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:50:02,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:50:02,683 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:50:02,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:50:02,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:50:02,683 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:50:02,683 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:50:02,683 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:50:02,689 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:50:02,691 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:50:02,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:50:02,691 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:50:02,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:50:02,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:50:02,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:50:02,695 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:50:02,695 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:50:02,696 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:50:02,701 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:50:02,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:50:02,702 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:50:02,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:50:02,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:50:02,705 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:50:02,706 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:50:02,706 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:50:02,709 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:50:02,710 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:50:02,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:50:02,711 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:50:02,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:50:02,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:50:02,711 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:50:02,711 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:50:02,712 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:50:02,716 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:50:02,717 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:50:02,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:50:02,717 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:50:02,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:50:02,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:50:02,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:50:02,718 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:50:02,718 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:50:02,722 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:50:02,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:50:02,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:50:02,725 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:50:02,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:50:02,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:50:02,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:50:02,726 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:50:02,726 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:50:02,732 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:50:02,732 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:50:02,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:50:02,733 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:50:02,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:50:02,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:50:02,736 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:50:02,736 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:50:02,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:50:02,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:50:02,740 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:50:02,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:50:02,740 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:50:02,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:50:02,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:50:02,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:50:02,741 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:50:02,742 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:50:02,747 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:50:02,764 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:50:02,764 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:50:02,768 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:50:02,768 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:50:02,768 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:50:02,770 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~cleanupTimeShifts~0, ULTIMATE.start_cleanup_~i~1) = 1*~cleanupTimeShifts~0 - 1*ULTIMATE.start_cleanup_~i~1 Supporting invariants [] [2018-11-28 23:50:02,773 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:50:03,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:50:03,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:50:03,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:50:03,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:50:03,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:50:03,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:50:03,440 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 23:50:03,441 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 4497 states and 8443 transitions. cyclomatic complexity: 3947 Second operand 5 states. [2018-11-28 23:50:04,380 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 4497 states and 8443 transitions. cyclomatic complexity: 3947. Second operand 5 states. Result 7376 states and 13851 transitions. Complement of second has 8 states. [2018-11-28 23:50:04,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 23:50:04,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:50:04,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7177 transitions. [2018-11-28 23:50:04,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7177 transitions. Stem has 27 letters. Loop has 25 letters. [2018-11-28 23:50:04,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:50:04,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7177 transitions. Stem has 52 letters. Loop has 25 letters. [2018-11-28 23:50:04,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:50:04,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7177 transitions. Stem has 27 letters. Loop has 50 letters. [2018-11-28 23:50:04,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:50:04,395 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7376 states and 13851 transitions. [2018-11-28 23:50:04,439 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:50:04,439 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7376 states to 0 states and 0 transitions. [2018-11-28 23:50:04,439 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:50:04,439 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:50:04,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:50:04,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:50:04,440 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:50:04,440 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:50:04,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:50:04,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:50:04,440 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2018-11-28 23:50:04,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:50:04,440 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-28 23:50:04,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 23:50:04,441 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-28 23:50:04,441 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:50:04,441 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 23:50:04,441 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:50:04,441 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:50:04,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:50:04,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:50:04,441 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:50:04,441 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:50:04,441 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:50:04,442 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:50:04,448 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:50:04,448 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:50:04,448 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:50:04,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:50:04 BoogieIcfgContainer [2018-11-28 23:50:04,457 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:50:04,458 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:50:04,458 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:50:04,458 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:50:04,460 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:49:38" (3/4) ... [2018-11-28 23:50:04,464 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:50:04,465 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:50:04,465 INFO L168 Benchmark]: Toolchain (without parser) took 43902.33 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 542.1 MB). Free memory was 940.6 MB in the beginning and 1.3 GB in the end (delta: -339.4 MB). Peak memory consumption was 202.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:50:04,468 INFO L168 Benchmark]: CDTParser took 0.56 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:50:04,468 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1212.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -160.0 MB). Peak memory consumption was 51.3 MB. Max. memory is 11.5 GB. [2018-11-28 23:50:04,470 INFO L168 Benchmark]: Boogie Procedure Inliner took 343.44 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: 47.3 MB). Peak memory consumption was 47.3 MB. Max. memory is 11.5 GB. [2018-11-28 23:50:04,471 INFO L168 Benchmark]: Boogie Preprocessor took 399.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 999.1 MB in the end (delta: 54.1 MB). Peak memory consumption was 54.1 MB. Max. memory is 11.5 GB. [2018-11-28 23:50:04,473 INFO L168 Benchmark]: RCFGBuilder took 16301.58 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 198.7 MB). Free memory was 999.1 MB in the beginning and 1.1 GB in the end (delta: -73.5 MB). Peak memory consumption was 438.9 MB. Max. memory is 11.5 GB. [2018-11-28 23:50:04,475 INFO L168 Benchmark]: BuchiAutomizer took 25633.09 ms. Allocated memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: 201.3 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -207.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:50:04,476 INFO L168 Benchmark]: Witness Printer took 7.06 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. [2018-11-28 23:50:04,482 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.56 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1212.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -160.0 MB). Peak memory consumption was 51.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 343.44 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: 47.3 MB). Peak memory consumption was 47.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 399.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 999.1 MB in the end (delta: 54.1 MB). Peak memory consumption was 54.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 16301.58 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 198.7 MB). Free memory was 999.1 MB in the beginning and 1.1 GB in the end (delta: -73.5 MB). Peak memory consumption was 438.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 25633.09 ms. Allocated memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: 201.3 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -207.4 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 7.06 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 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function cleanupTimeShifts + -1 * i and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 25.5s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 16.9s. Construction of modules took 3.6s. Büchi inclusion checks took 3.4s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.5s AutomataMinimizationTime, 2 MinimizatonAttempts, 12031 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.4s Buchi closure took 0.0s. Biggest automaton had 5029 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 31375 SDtfs, 60377 SDslu, 70745 SDs, 0 SdLazy, 267 SolverSat, 284 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI2 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital121 mio100 ax100 hnf100 lsp14 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq211 hnf89 smp100 dnf176 smp100 tf103 neg96 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 45ms VariablesStem: 0 VariablesLoop: 5 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 1 LassoNonterminationAnalysisTime: 12.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...