./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/elevator_spec1_product30_false-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/product-lines/elevator_spec1_product30_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 b315ebc9aa87bd57f2da57a423e25fac07ed5d29 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 03:58:48,664 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 03:58:48,666 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 03:58:48,679 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 03:58:48,679 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 03:58:48,680 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 03:58:48,682 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 03:58:48,683 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 03:58:48,685 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 03:58:48,686 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 03:58:48,687 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 03:58:48,687 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 03:58:48,688 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 03:58:48,689 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 03:58:48,690 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 03:58:48,691 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 03:58:48,692 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 03:58:48,694 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 03:58:48,695 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 03:58:48,697 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 03:58:48,698 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 03:58:48,700 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 03:58:48,702 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 03:58:48,702 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 03:58:48,703 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 03:58:48,704 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 03:58:48,705 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 03:58:48,706 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 03:58:48,710 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 03:58:48,711 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 03:58:48,711 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 03:58:48,717 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 03:58:48,718 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 03:58:48,718 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 03:58:48,719 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 03:58:48,719 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 03:58:48,721 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 03:58:48,742 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 03:58:48,742 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 03:58:48,743 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 03:58:48,743 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 03:58:48,743 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 03:58:48,744 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 03:58:48,744 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 03:58:48,744 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 03:58:48,744 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 03:58:48,744 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 03:58:48,745 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 03:58:48,745 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 03:58:48,745 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 03:58:48,745 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 03:58:48,745 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 03:58:48,745 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 03:58:48,746 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 03:58:48,746 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 03:58:48,746 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 03:58:48,746 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 03:58:48,746 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 03:58:48,749 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 03:58:48,749 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 03:58:48,749 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 03:58:48,749 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 03:58:48,749 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 03:58:48,750 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 03:58:48,750 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 03:58:48,750 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 03:58:48,750 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 03:58:48,750 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 03:58:48,751 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 03:58:48,752 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 -> b315ebc9aa87bd57f2da57a423e25fac07ed5d29 [2019-01-14 03:58:48,803 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 03:58:48,820 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 03:58:48,828 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 03:58:48,830 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 03:58:48,830 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 03:58:48,831 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/elevator_spec1_product30_false-unreach-call_true-termination.cil.c [2019-01-14 03:58:48,888 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b607ee059/0fe5f27489724dd3886b02be0e243a21/FLAG610dec84e [2019-01-14 03:58:49,557 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 03:58:49,558 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/elevator_spec1_product30_false-unreach-call_true-termination.cil.c [2019-01-14 03:58:49,578 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b607ee059/0fe5f27489724dd3886b02be0e243a21/FLAG610dec84e [2019-01-14 03:58:49,724 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b607ee059/0fe5f27489724dd3886b02be0e243a21 [2019-01-14 03:58:49,731 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 03:58:49,733 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 03:58:49,735 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 03:58:49,736 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 03:58:49,740 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 03:58:49,741 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:58:49" (1/1) ... [2019-01-14 03:58:49,744 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bbae27e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:58:49, skipping insertion in model container [2019-01-14 03:58:49,745 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:58:49" (1/1) ... [2019-01-14 03:58:49,754 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 03:58:49,853 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 03:58:50,596 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 03:58:50,731 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 03:58:50,862 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 03:58:50,945 INFO L195 MainTranslator]: Completed translation [2019-01-14 03:58:50,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:58:50 WrapperNode [2019-01-14 03:58:50,946 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 03:58:50,948 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 03:58:50,948 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 03:58:50,948 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 03:58:50,958 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:58:50" (1/1) ... [2019-01-14 03:58:50,994 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:58:50" (1/1) ... [2019-01-14 03:58:51,371 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 03:58:51,372 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 03:58:51,372 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 03:58:51,372 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 03:58:51,384 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:58:50" (1/1) ... [2019-01-14 03:58:51,385 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:58:50" (1/1) ... [2019-01-14 03:58:51,442 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:58:50" (1/1) ... [2019-01-14 03:58:51,443 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:58:50" (1/1) ... [2019-01-14 03:58:51,583 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:58:50" (1/1) ... [2019-01-14 03:58:51,730 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:58:50" (1/1) ... [2019-01-14 03:58:51,780 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:58:50" (1/1) ... [2019-01-14 03:58:51,842 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 03:58:51,843 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 03:58:51,843 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 03:58:51,844 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 03:58:51,845 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:58:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:58:51,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 03:58:51,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-14 03:58:51,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 03:58:51,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 03:59:09,164 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 03:59:09,165 INFO L286 CfgBuilder]: Removed 1529 assue(true) statements. [2019-01-14 03:59:09,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:59:09 BoogieIcfgContainer [2019-01-14 03:59:09,170 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 03:59:09,171 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 03:59:09,171 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 03:59:09,174 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 03:59:09,176 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 03:59:09,176 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 03:58:49" (1/3) ... [2019-01-14 03:59:09,177 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@26a7a5aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 03:59:09, skipping insertion in model container [2019-01-14 03:59:09,177 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 03:59:09,177 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:58:50" (2/3) ... [2019-01-14 03:59:09,178 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@26a7a5aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 03:59:09, skipping insertion in model container [2019-01-14 03:59:09,178 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 03:59:09,178 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:59:09" (3/3) ... [2019-01-14 03:59:09,180 INFO L375 chiAutomizerObserver]: Analyzing ICFG elevator_spec1_product30_false-unreach-call_true-termination.cil.c [2019-01-14 03:59:09,236 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 03:59:09,236 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 03:59:09,237 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 03:59:09,237 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 03:59:09,237 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 03:59:09,237 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 03:59:09,237 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 03:59:09,237 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 03:59:09,237 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 03:59:09,352 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6902 states. [2019-01-14 03:59:09,535 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3411 [2019-01-14 03:59:09,535 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:59:09,535 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:59:09,560 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:59:09,561 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:59:09,561 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 03:59:09,562 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6902 states. [2019-01-14 03:59:09,655 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3411 [2019-01-14 03:59:09,655 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:59:09,655 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:59:09,664 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:59:09,666 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:59:09,678 INFO L794 eck$LassoCheckResult]: Stem: 1556#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~weight~0 := 0;~maximumWeight~0 := 100;~blocked~0 := 0;~cleanupTimeShifts~0 := 12;~head~0.base, ~head~0.offset := 0, 0;call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(30);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(9);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(21);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(30);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(9);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(21);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(30);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(9);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(25);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(30);call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(9);call #t~string38.base, #t~string38.offset := #Ultimate.allocOnStack(25);~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;~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~string110.base, #t~string110.offset := #Ultimate.allocOnStack(10);call #t~string112.base, #t~string112.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string112.base, #t~string112.offset, 1);call write~init~int(95, #t~string112.base, 1 + #t~string112.offset, 1);call write~init~int(93, #t~string112.base, 2 + #t~string112.offset, 1);call write~init~int(0, #t~string112.base, 3 + #t~string112.offset, 1);call #t~string114.base, #t~string114.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string114.base, #t~string114.offset, 1);call write~init~int(93, #t~string114.base, 1 + #t~string114.offset, 1);call write~init~int(32, #t~string114.base, 2 + #t~string114.offset, 1);call write~init~int(0, #t~string114.base, 3 + #t~string114.offset, 1);call #t~string116.base, #t~string116.offset := #Ultimate.allocOnStack(5);call write~init~int(32, #t~string116.base, #t~string116.offset, 1);call write~init~int(97, #t~string116.base, 1 + #t~string116.offset, 1);call write~init~int(116, #t~string116.base, 2 + #t~string116.offset, 1);call write~init~int(32, #t~string116.base, 3 + #t~string116.offset, 1);call write~init~int(0, #t~string116.base, 4 + #t~string116.offset, 1);call #t~string118.base, #t~string118.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string118.base, #t~string118.offset, 1);call write~init~int(105, #t~string118.base, 1 + #t~string118.offset, 1);call write~init~int(0, #t~string118.base, 2 + #t~string118.offset, 1);call #t~string120.base, #t~string120.offset := #Ultimate.allocOnStack(10);call #t~string122.base, #t~string122.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string122.base, #t~string122.offset, 1);call write~init~int(112, #t~string122.base, 1 + #t~string122.offset, 1);call write~init~int(0, #t~string122.base, 2 + #t~string122.offset, 1);call #t~string124.base, #t~string124.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string124.base, #t~string124.offset, 1);call write~init~int(111, #t~string124.base, 1 + #t~string124.offset, 1);call write~init~int(119, #t~string124.base, 2 + #t~string124.offset, 1);call write~init~int(110, #t~string124.base, 3 + #t~string124.offset, 1);call write~init~int(0, #t~string124.base, 4 + #t~string124.offset, 1);call #t~string126.base, #t~string126.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string126.base, #t~string126.offset, 1);call write~init~int(73, #t~string126.base, 1 + #t~string126.offset, 1);call write~init~int(76, #t~string126.base, 2 + #t~string126.offset, 1);call write~init~int(95, #t~string126.base, 3 + #t~string126.offset, 1);call write~init~int(112, #t~string126.base, 4 + #t~string126.offset, 1);call write~init~int(58, #t~string126.base, 5 + #t~string126.offset, 1);call write~init~int(0, #t~string126.base, 6 + #t~string126.offset, 1);call #t~string128.base, #t~string128.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string128.base, #t~string128.offset, 1);call write~init~int(37, #t~string128.base, 1 + #t~string128.offset, 1);call write~init~int(105, #t~string128.base, 2 + #t~string128.offset, 1);call write~init~int(0, #t~string128.base, 3 + #t~string128.offset, 1);call #t~string130.base, #t~string130.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string130.base, #t~string130.offset, 1);call write~init~int(37, #t~string130.base, 1 + #t~string130.offset, 1);call write~init~int(105, #t~string130.base, 2 + #t~string130.offset, 1);call write~init~int(0, #t~string130.base, 3 + #t~string130.offset, 1);call #t~string132.base, #t~string132.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string132.base, #t~string132.offset, 1);call write~init~int(37, #t~string132.base, 1 + #t~string132.offset, 1);call write~init~int(105, #t~string132.base, 2 + #t~string132.offset, 1);call write~init~int(0, #t~string132.base, 3 + #t~string132.offset, 1);call #t~string134.base, #t~string134.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string134.base, #t~string134.offset, 1);call write~init~int(37, #t~string134.base, 1 + #t~string134.offset, 1);call write~init~int(105, #t~string134.base, 2 + #t~string134.offset, 1);call write~init~int(0, #t~string134.base, 3 + #t~string134.offset, 1);call #t~string136.base, #t~string136.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string136.base, #t~string136.offset, 1);call write~init~int(37, #t~string136.base, 1 + #t~string136.offset, 1);call write~init~int(105, #t~string136.base, 2 + #t~string136.offset, 1);call write~init~int(0, #t~string136.base, 3 + #t~string136.offset, 1);call #t~string138.base, #t~string138.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string138.base, #t~string138.offset, 1);call write~init~int(70, #t~string138.base, 1 + #t~string138.offset, 1);call write~init~int(95, #t~string138.base, 2 + #t~string138.offset, 1);call write~init~int(112, #t~string138.base, 3 + #t~string138.offset, 1);call write~init~int(58, #t~string138.base, 4 + #t~string138.offset, 1);call write~init~int(0, #t~string138.base, 5 + #t~string138.offset, 1);call #t~string141.base, #t~string141.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string141.base, #t~string141.offset, 1);call write~init~int(37, #t~string141.base, 1 + #t~string141.offset, 1);call write~init~int(105, #t~string141.base, 2 + #t~string141.offset, 1);call write~init~int(0, #t~string141.base, 3 + #t~string141.offset, 1);call #t~string144.base, #t~string144.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string144.base, #t~string144.offset, 1);call write~init~int(37, #t~string144.base, 1 + #t~string144.offset, 1);call write~init~int(105, #t~string144.base, 2 + #t~string144.offset, 1);call write~init~int(0, #t~string144.base, 3 + #t~string144.offset, 1);call #t~string147.base, #t~string147.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string147.base, #t~string147.offset, 1);call write~init~int(37, #t~string147.base, 1 + #t~string147.offset, 1);call write~init~int(105, #t~string147.base, 2 + #t~string147.offset, 1);call write~init~int(0, #t~string147.base, 3 + #t~string147.offset, 1);call #t~string150.base, #t~string150.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string150.base, #t~string150.offset, 1);call write~init~int(37, #t~string150.base, 1 + #t~string150.offset, 1);call write~init~int(105, #t~string150.base, 2 + #t~string150.offset, 1);call write~init~int(0, #t~string150.base, 3 + #t~string150.offset, 1);call #t~string153.base, #t~string153.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string153.base, #t~string153.offset, 1);call write~init~int(37, #t~string153.base, 1 + #t~string153.offset, 1);call write~init~int(105, #t~string153.base, 2 + #t~string153.offset, 1);call write~init~int(0, #t~string153.base, 3 + #t~string153.offset, 1);call #t~string155.base, #t~string155.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string155.base, #t~string155.offset, 1);call write~init~int(0, #t~string155.base, 1 + #t~string155.offset, 1);call #t~string158.base, #t~string158.offset := #Ultimate.allocOnStack(9);~landingButtons_spc1_0~0 := 0;~landingButtons_spc1_1~0 := 0;~landingButtons_spc1_2~0 := 0;~landingButtons_spc1_3~0 := 0;~landingButtons_spc1_4~0 := 0; 6568#L-1true havoc main_#res;havoc main_#t~ret55, main_~retValue_acc~6, main_~tmp~13;havoc main_~retValue_acc~6;havoc main_~tmp~13; 6319#L557true havoc valid_product_#res;havoc valid_product_~retValue_acc~4;havoc valid_product_~retValue_acc~4;valid_product_~retValue_acc~4 := 1;valid_product_#res := valid_product_~retValue_acc~4; 6101#L565true main_#t~ret55 := valid_product_#res;main_~tmp~13 := main_#t~ret55;havoc main_#t~ret55; 6330#L909true assume 0 != main_~tmp~13; 6508#L882true ~landingButtons_spc1_0~0 := 0;~landingButtons_spc1_1~0 := 0;~landingButtons_spc1_2~0 := 0;~landingButtons_spc1_3~0 := 0;~landingButtons_spc1_4~0 := 0; 4246#L3307true havoc bigMacCall_#t~ret48, bigMacCall_~tmp~10;havoc bigMacCall_~tmp~10;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~11;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~11; 1130#L1640true assume 0 == getOrigin_~person;getOrigin_~retValue_acc~11 := 4;getOrigin_#res := getOrigin_~retValue_acc~11; 451#L1665true bigMacCall_#t~ret48 := getOrigin_#res;bigMacCall_~tmp~10 := bigMacCall_#t~ret48;havoc bigMacCall_#t~ret48;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~10;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 1090#L1287true assume 0 == initPersonOnFloor_~floor; 1119#L1288true assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 4146#L1395-1true callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID, callOnFloor_~__utac__ad__arg1~0;callOnFloor_~floorID := callOnFloor_#in~floorID;havoc callOnFloor_~__utac__ad__arg1~0;callOnFloor_~__utac__ad__arg1~0 := callOnFloor_~floorID;__utac_acc__Specification1_spec__2_#in~floor := callOnFloor_~__utac__ad__arg1~0;havoc __utac_acc__Specification1_spec__2_~floor;__utac_acc__Specification1_spec__2_~floor := __utac_acc__Specification1_spec__2_#in~floor; 5495#L3314true assume 0 == __utac_acc__Specification1_spec__2_~floor;~landingButtons_spc1_0~0 := 1; 3224#L3326-2true assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 6138#L1091-2true havoc angelinaCall_#t~ret45, angelinaCall_~tmp~7;havoc angelinaCall_~tmp~7;getOrigin_#in~person := 2;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~11;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~11; 1132#L1640-1true assume 0 == getOrigin_~person;getOrigin_~retValue_acc~11 := 4;getOrigin_#res := getOrigin_~retValue_acc~11; 455#L1665-1true angelinaCall_#t~ret45 := getOrigin_#res;angelinaCall_~tmp~7 := angelinaCall_#t~ret45;havoc angelinaCall_#t~ret45;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 2, angelinaCall_~tmp~7;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 1093#L1287-1true assume 0 == initPersonOnFloor_~floor; 1120#L1288-2true assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 4150#L1395-3true callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID, callOnFloor_~__utac__ad__arg1~0;callOnFloor_~floorID := callOnFloor_#in~floorID;havoc callOnFloor_~__utac__ad__arg1~0;callOnFloor_~__utac__ad__arg1~0 := callOnFloor_~floorID;__utac_acc__Specification1_spec__2_#in~floor := callOnFloor_~__utac__ad__arg1~0;havoc __utac_acc__Specification1_spec__2_~floor;__utac_acc__Specification1_spec__2_~floor := __utac_acc__Specification1_spec__2_#in~floor; 5500#L3314-2true assume 0 == __utac_acc__Specification1_spec__2_~floor;~landingButtons_spc1_0~0 := 1; 3217#L3326-5true assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 6131#L1091-5true havoc cleanup_#t~ret49, cleanup_#t~ret50, cleanup_~i~2, cleanup_~tmp~11, cleanup_~tmp___0~2, cleanup_~__cil_tmp4~2;havoc cleanup_~i~2;havoc cleanup_~tmp~11;havoc cleanup_~tmp___0~2;havoc cleanup_~__cil_tmp4~2;havoc timeShift_#t~ret109, timeShift_~tmp~26;havoc timeShift_~tmp~26;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~15;havoc areDoorsOpen_~retValue_acc~15;areDoorsOpen_~retValue_acc~15 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~15; 6229#L1969true timeShift_#t~ret109 := areDoorsOpen_#res;timeShift_~tmp~26 := timeShift_#t~ret109;havoc timeShift_#t~ret109; 2753#L2919true assume 0 != timeShift_~tmp~26; 2810#L2920true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 4795#L2595-11true havoc __utac_acc__Specification1_spec__3_#t~ret160, __utac_acc__Specification1_spec__3_#t~ret161, __utac_acc__Specification1_spec__3_#t~ret162, __utac_acc__Specification1_spec__3_#t~ret163, __utac_acc__Specification1_spec__3_#t~ret164, __utac_acc__Specification1_spec__3_#t~ret165, __utac_acc__Specification1_spec__3_~floor~0, __utac_acc__Specification1_spec__3_~tmp~29, __utac_acc__Specification1_spec__3_~tmp___0~11, __utac_acc__Specification1_spec__3_~tmp___1~8, __utac_acc__Specification1_spec__3_~tmp___2~6, __utac_acc__Specification1_spec__3_~tmp___3~5, __utac_acc__Specification1_spec__3_~tmp___4~3;havoc __utac_acc__Specification1_spec__3_~floor~0;havoc __utac_acc__Specification1_spec__3_~tmp~29;havoc __utac_acc__Specification1_spec__3_~tmp___0~11;havoc __utac_acc__Specification1_spec__3_~tmp___1~8;havoc __utac_acc__Specification1_spec__3_~tmp___2~6;havoc __utac_acc__Specification1_spec__3_~tmp___3~5;havoc __utac_acc__Specification1_spec__3_~tmp___4~3;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~14;havoc getCurrentFloorID_~retValue_acc~14;getCurrentFloorID_~retValue_acc~14 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~14; 5952#L1960-2true __utac_acc__Specification1_spec__3_#t~ret160 := getCurrentFloorID_#res;__utac_acc__Specification1_spec__3_~tmp~29 := __utac_acc__Specification1_spec__3_#t~ret160;havoc __utac_acc__Specification1_spec__3_#t~ret160;__utac_acc__Specification1_spec__3_~floor~0 := __utac_acc__Specification1_spec__3_~tmp~29; 6467#L3352true assume 0 == __utac_acc__Specification1_spec__3_~floor~0; 6408#L3353true assume 0 != ~landingButtons_spc1_0~0;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~15;havoc areDoorsOpen_~retValue_acc~15;areDoorsOpen_~retValue_acc~15 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~15; 6231#L1969-1true __utac_acc__Specification1_spec__3_#t~ret161 := areDoorsOpen_#res;__utac_acc__Specification1_spec__3_~tmp___4~3 := __utac_acc__Specification1_spec__3_#t~ret161;havoc __utac_acc__Specification1_spec__3_#t~ret161; 6770#L3357true assume 0 != __utac_acc__Specification1_spec__3_~tmp___4~3;~landingButtons_spc1_0~0 := 0; 143#L3412true cleanup_~i~2 := 0; 6773#L714-2true [2019-01-14 03:59:09,679 INFO L796 eck$LassoCheckResult]: Loop: 6773#L714-2true assume !false; 6796#L715true cleanup_~__cil_tmp4~2 := ~cleanupTimeShifts~0 - 1; 6766#L718true assume cleanup_~i~2 < cleanup_~__cil_tmp4~2;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~13;havoc isBlocked_~retValue_acc~13;isBlocked_~retValue_acc~13 := ~blocked~0;isBlocked_#res := isBlocked_~retValue_acc~13; 5755#L1787true cleanup_#t~ret49 := isBlocked_#res;cleanup_~tmp___0~2 := cleanup_#t~ret49;havoc cleanup_#t~ret49; 5980#L722true assume 1 != cleanup_~tmp___0~2; 5981#L722-1true havoc isIdle_#res;havoc isIdle_#t~ret64, isIdle_~retValue_acc~20, isIdle_~tmp~18;havoc isIdle_~retValue_acc~20;havoc isIdle_~tmp~18;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret59, anyStopRequested_#t~ret60, anyStopRequested_#t~ret61, anyStopRequested_#t~ret62, anyStopRequested_#t~ret63, anyStopRequested_~retValue_acc~19, anyStopRequested_~tmp~17, anyStopRequested_~tmp___0~4, anyStopRequested_~tmp___1~3, anyStopRequested_~tmp___2~1, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~19;havoc anyStopRequested_~tmp~17;havoc anyStopRequested_~tmp___0~4;havoc anyStopRequested_~tmp___1~3;havoc anyStopRequested_~tmp___2~1;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~7;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~7; 4670#L1011-122true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~7 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~7; 4030#L1038-122true anyStopRequested_#t~ret59 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret59;havoc anyStopRequested_#t~ret59; 4711#L2068true assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~19 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~19; 5960#L2132true isIdle_#t~ret64 := anyStopRequested_#res;isIdle_~tmp~18 := isIdle_#t~ret64;havoc isIdle_#t~ret64;isIdle_~retValue_acc~20 := (if 0 == isIdle_~tmp~18 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~20; 6234#L2145true cleanup_#t~ret50 := isIdle_#res;cleanup_~tmp~11 := cleanup_#t~ret50;havoc cleanup_#t~ret50; 6361#L734true assume !(0 != cleanup_~tmp~11);havoc timeShift_#t~ret109, timeShift_~tmp~26;havoc timeShift_~tmp~26;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~15;havoc areDoorsOpen_~retValue_acc~15;areDoorsOpen_~retValue_acc~15 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~15; 6222#L1969-6true timeShift_#t~ret109 := areDoorsOpen_#res;timeShift_~tmp~26 := timeShift_#t~ret109;havoc timeShift_#t~ret109; 2756#L2919-1true assume 0 != timeShift_~tmp~26; 2811#L2920-2true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 4787#L2595-23true havoc __utac_acc__Specification1_spec__3_#t~ret160, __utac_acc__Specification1_spec__3_#t~ret161, __utac_acc__Specification1_spec__3_#t~ret162, __utac_acc__Specification1_spec__3_#t~ret163, __utac_acc__Specification1_spec__3_#t~ret164, __utac_acc__Specification1_spec__3_#t~ret165, __utac_acc__Specification1_spec__3_~floor~0, __utac_acc__Specification1_spec__3_~tmp~29, __utac_acc__Specification1_spec__3_~tmp___0~11, __utac_acc__Specification1_spec__3_~tmp___1~8, __utac_acc__Specification1_spec__3_~tmp___2~6, __utac_acc__Specification1_spec__3_~tmp___3~5, __utac_acc__Specification1_spec__3_~tmp___4~3;havoc __utac_acc__Specification1_spec__3_~floor~0;havoc __utac_acc__Specification1_spec__3_~tmp~29;havoc __utac_acc__Specification1_spec__3_~tmp___0~11;havoc __utac_acc__Specification1_spec__3_~tmp___1~8;havoc __utac_acc__Specification1_spec__3_~tmp___2~6;havoc __utac_acc__Specification1_spec__3_~tmp___3~5;havoc __utac_acc__Specification1_spec__3_~tmp___4~3;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~14;havoc getCurrentFloorID_~retValue_acc~14;getCurrentFloorID_~retValue_acc~14 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~14; 5948#L1960-5true __utac_acc__Specification1_spec__3_#t~ret160 := getCurrentFloorID_#res;__utac_acc__Specification1_spec__3_~tmp~29 := __utac_acc__Specification1_spec__3_#t~ret160;havoc __utac_acc__Specification1_spec__3_#t~ret160;__utac_acc__Specification1_spec__3_~floor~0 := __utac_acc__Specification1_spec__3_~tmp~29; 6468#L3352-1true assume 0 == __utac_acc__Specification1_spec__3_~floor~0; 6405#L3353-1true assume 0 != ~landingButtons_spc1_0~0;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~15;havoc areDoorsOpen_~retValue_acc~15;areDoorsOpen_~retValue_acc~15 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~15; 6224#L1969-7true __utac_acc__Specification1_spec__3_#t~ret161 := areDoorsOpen_#res;__utac_acc__Specification1_spec__3_~tmp___4~3 := __utac_acc__Specification1_spec__3_#t~ret161;havoc __utac_acc__Specification1_spec__3_#t~ret161; 6771#L3357-2true assume 0 != __utac_acc__Specification1_spec__3_~tmp___4~3;~landingButtons_spc1_0~0 := 0; 144#L3412-1true cleanup_~i~2 := 1 + cleanup_~i~2; 6773#L714-2true [2019-01-14 03:59:09,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:59:09,696 INFO L82 PathProgramCache]: Analyzing trace with hash -745177872, now seen corresponding path program 1 times [2019-01-14 03:59:09,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:59:09,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:59:09,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:59:09,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:59:09,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:59:09,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:59:10,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:59:10,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:59:10,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 03:59:10,108 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 03:59:10,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:59:10,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1113299661, now seen corresponding path program 1 times [2019-01-14 03:59:10,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:59:10,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:59:10,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:59:10,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:59:10,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:59:10,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:59:10,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:59:11,201 WARN L181 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 88 DAG size of output: 84 [2019-01-14 03:59:11,551 WARN L181 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2019-01-14 03:59:11,562 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:59:11,563 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:59:11,563 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:59:11,563 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:59:11,563 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 03:59:11,564 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:59:11,564 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:59:11,564 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:59:11,564 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec1_product30_false-unreach-call_true-termination.cil.c_Iteration1_Loop [2019-01-14 03:59:11,564 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:59:11,564 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:59:11,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:59:11,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:59:11,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:59:11,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:59:11,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:59:11,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:59:11,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:59:11,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:59:11,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:59:11,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:59:11,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:59:11,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:59:11,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:59:11,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:59:11,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:59:11,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:59:11,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:59:11,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:59:11,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:59:11,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:59:11,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:59:11,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:59:11,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:59:11,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:59:12,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:59:12,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:59:12,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:59:12,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:59:12,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:59:12,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:59:12,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:59:12,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:59:12,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:59:12,658 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:59:12,659 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:59:12,674 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:59:12,675 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:59:12,691 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:59:12,691 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification1_spec__3_#t~ret162=0} Honda state: {ULTIMATE.start___utac_acc__Specification1_spec__3_#t~ret162=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:59:12,720 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:59:12,720 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:59:12,740 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:59:12,740 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification1_spec__3_#t~ret161=0} Honda state: {ULTIMATE.start___utac_acc__Specification1_spec__3_#t~ret161=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 03:59:12,792 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:59:12,792 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:59:12,807 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:59:12,807 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification1_spec__3_#t~ret160=0} Honda state: {ULTIMATE.start___utac_acc__Specification1_spec__3_#t~ret160=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 03:59:12,848 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:59:12,848 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:59:12,858 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:59:12,858 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_~tmp___1~3=0} Honda state: {ULTIMATE.start_anyStopRequested_~tmp___1~3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:59:12,880 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:59:12,881 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:59:12,931 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 03:59:12,931 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:59:24,980 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-01-14 03:59:24,983 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:59:24,983 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:59:24,983 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:59:24,983 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:59:24,983 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 03:59:24,983 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:59:24,984 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:59:24,984 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:59:24,984 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec1_product30_false-unreach-call_true-termination.cil.c_Iteration1_Loop [2019-01-14 03:59:24,984 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:59:24,984 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:59:24,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:59:25,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:59:25,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:59:25,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:59:25,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:59:25,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:59:25,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:59:25,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:59:25,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:59:25,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:59:25,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:59:25,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:59:25,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:59:25,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:59:25,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:59:25,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:59:25,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:59:25,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:59:25,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:59:25,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:59:25,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:59:25,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:59:25,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:59:25,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:59:25,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:59:25,348 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-14 03:59:25,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:59:25,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:59:25,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:59:25,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:59:25,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:59:25,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:59:25,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:59:25,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:59:25,730 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-14 03:59:26,087 WARN L181 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-14 03:59:26,588 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:59:26,594 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 03:59:26,596 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:59:26,598 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:59:26,598 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:59:26,599 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:59:26,599 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:59:26,599 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:59:26,602 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:59:26,602 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:59:26,604 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:59:26,605 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:59:26,608 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:59:26,608 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:59:26,609 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:59:26,609 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:59:26,609 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:59:26,611 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:59:26,611 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:59:26,614 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:59:26,616 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:59:26,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:59:26,617 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:59:26,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:59:26,617 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:59:26,618 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:59:26,618 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:59:26,618 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:59:26,624 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:59:26,625 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:59:26,625 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:59:26,626 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:59:26,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:59:26,628 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:59:26,628 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:59:26,630 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:59:26,630 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:59:26,662 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:59:26,663 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:59:26,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:59:26,665 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:59:26,665 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:59:26,665 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:59:26,666 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:59:26,666 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:59:26,666 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:59:26,669 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:59:26,669 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:59:26,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:59:26,672 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:59:26,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:59:26,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:59:26,672 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:59:26,673 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:59:26,674 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:59:26,675 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:59:26,676 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:59:26,676 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:59:26,676 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:59:26,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:59:26,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:59:26,677 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:59:26,677 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:59:26,677 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:59:26,680 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:59:26,681 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:59:26,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:59:26,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:59:26,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:59:26,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:59:26,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:59:26,688 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:59:26,688 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:59:26,694 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:59:26,694 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:59:26,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:59:26,697 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:59:26,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:59:26,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:59:26,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:59:26,699 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:59:26,699 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:59:26,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:59:26,702 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:59:26,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:59:26,702 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:59:26,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:59:26,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:59:26,703 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:59:26,703 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:59:26,704 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:59:26,707 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:59:26,708 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:59:26,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:59:26,711 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:59:26,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:59:26,711 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:59:26,711 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:59:26,714 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:59:26,714 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:59:26,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:59:26,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 [2019-01-14 03:59:26,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:59:26,724 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:59:26,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:59:26,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:59:26,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:59:26,727 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:59:26,727 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:59:26,728 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:59:26,729 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:59:26,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:59:26,730 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:59:26,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:59:26,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:59:26,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:59:26,731 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:59:26,731 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:59:26,732 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:59:26,733 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:59:26,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:59:26,733 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:59:26,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:59:26,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:59:26,734 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:59:26,734 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:59:26,734 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:59:26,735 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:59:26,737 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:59:26,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:59:26,737 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:59:26,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:59:26,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:59:26,738 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:59:26,738 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:59:26,738 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:59:26,739 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:59:26,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 [2019-01-14 03:59:26,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:59:26,740 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:59:26,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:59:26,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:59:26,742 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:59:26,742 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:59:26,742 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:59:26,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:59:26,744 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:59:26,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:59:26,744 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:59:26,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:59:26,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:59:26,745 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:59:26,745 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:59:26,745 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:59:26,754 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:59:26,755 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:59:26,755 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:59:26,755 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:59:26,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:59:26,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:59:26,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:59:26,756 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:59:26,756 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:59:26,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:59:26,759 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:59:26,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:59:26,760 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:59:26,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:59:26,760 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:59:26,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:59:26,761 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:59:26,761 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:59:26,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:59:26,771 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:59:26,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:59:26,771 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:59:26,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:59:26,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:59:26,774 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:59:26,775 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:59:26,775 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:59:26,777 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:59:26,778 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:59:26,778 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:59:26,778 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:59:26,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:59:26,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:59:26,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:59:26,780 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:59:26,780 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:59:26,784 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 03:59:26,791 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 03:59:26,791 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 03:59:26,794 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 03:59:26,794 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 03:59:26,795 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 03:59:26,795 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~cleanupTimeShifts~0, ULTIMATE.start_cleanup_~i~2) = 1*~cleanupTimeShifts~0 - 1*ULTIMATE.start_cleanup_~i~2 Supporting invariants [] [2019-01-14 03:59:26,796 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 03:59:26,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:59:26,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:59:26,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:59:27,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:59:27,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:59:27,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:59:27,119 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-14 03:59:27,120 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6902 states. Second operand 5 states. [2019-01-14 03:59:28,280 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6902 states.. Second operand 5 states. Result 10373 states and 19581 transitions. Complement of second has 9 states. [2019-01-14 03:59:28,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 03:59:28,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 03:59:28,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13098 transitions. [2019-01-14 03:59:28,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13098 transitions. Stem has 33 letters. Loop has 22 letters. [2019-01-14 03:59:28,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:59:28,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13098 transitions. Stem has 55 letters. Loop has 22 letters. [2019-01-14 03:59:28,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:59:28,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13098 transitions. Stem has 33 letters. Loop has 44 letters. [2019-01-14 03:59:28,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:59:28,325 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10373 states and 19581 transitions. [2019-01-14 03:59:28,436 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 03:59:28,440 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10373 states to 0 states and 0 transitions. [2019-01-14 03:59:28,442 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 03:59:28,442 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 03:59:28,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 03:59:28,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:59:28,443 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 03:59:28,443 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 03:59:28,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 03:59:28,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 03:59:28,451 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2019-01-14 03:59:28,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:59:28,456 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-14 03:59:28,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 03:59:28,456 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-14 03:59:28,457 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 03:59:28,457 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 03:59:28,457 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 03:59:28,457 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 03:59:28,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 03:59:28,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:59:28,457 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 03:59:28,457 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 03:59:28,457 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 03:59:28,458 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 03:59:28,461 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 03:59:28,461 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 03:59:28,461 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 03:59:28,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 03:59:28 BoogieIcfgContainer [2019-01-14 03:59:28,470 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 03:59:28,470 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 03:59:28,470 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 03:59:28,470 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 03:59:28,471 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:59:09" (3/4) ... [2019-01-14 03:59:28,478 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 03:59:28,479 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 03:59:28,480 INFO L168 Benchmark]: Toolchain (without parser) took 38747.77 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 618.7 MB). Free memory was 943.2 MB in the beginning and 1.3 GB in the end (delta: -374.5 MB). Peak memory consumption was 244.2 MB. Max. memory is 11.5 GB. [2019-01-14 03:59:28,482 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 03:59:28,483 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1211.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 943.2 MB in the beginning and 1.1 GB in the end (delta: -167.1 MB). Peak memory consumption was 51.1 MB. Max. memory is 11.5 GB. [2019-01-14 03:59:28,484 INFO L168 Benchmark]: Boogie Procedure Inliner took 424.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 74.7 MB). Peak memory consumption was 74.7 MB. Max. memory is 11.5 GB. [2019-01-14 03:59:28,486 INFO L168 Benchmark]: Boogie Preprocessor took 470.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 974.4 MB in the end (delta: 61.2 MB). Peak memory consumption was 61.2 MB. Max. memory is 11.5 GB. [2019-01-14 03:59:28,487 INFO L168 Benchmark]: RCFGBuilder took 17326.89 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 474.5 MB). Free memory was 974.4 MB in the beginning and 1.3 GB in the end (delta: -369.5 MB). Peak memory consumption was 436.7 MB. Max. memory is 11.5 GB. [2019-01-14 03:59:28,488 INFO L168 Benchmark]: BuchiAutomizer took 19298.92 ms. Allocated memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: -1.0 MB). Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 26.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. [2019-01-14 03:59:28,489 INFO L168 Benchmark]: Witness Printer took 8.51 ms. Allocated memory is still 1.6 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 03:59:28,495 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1211.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 943.2 MB in the beginning and 1.1 GB in the end (delta: -167.1 MB). Peak memory consumption was 51.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 424.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 74.7 MB). Peak memory consumption was 74.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 470.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 974.4 MB in the end (delta: 61.2 MB). Peak memory consumption was 61.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 17326.89 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 474.5 MB). Free memory was 974.4 MB in the beginning and 1.3 GB in the end (delta: -369.5 MB). Peak memory consumption was 436.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 19298.92 ms. Allocated memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: -1.0 MB). Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 26.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. * Witness Printer took 8.51 ms. Allocated memory is still 1.6 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function cleanupTimeShifts + -1 * i and consists of 6 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 19.2s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 17.1s. Construction of modules took 0.1s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 13064 SDtfs, 25979 SDslu, 6491 SDs, 0 SdLazy, 9 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital109 mio100 ax100 hnf100 lsp16 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq211 hnf89 smp100 dnf176 smp100 tf103 neg96 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 37ms VariablesStem: 0 VariablesLoop: 5 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 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...