./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/elevator_spec2_product26_false-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/product-lines/elevator_spec2_product26_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 773d2c4d0eda21b7c46dba917d93fd8caf4fa295 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:47:16,014 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:47:16,016 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:47:16,028 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:47:16,029 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:47:16,030 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:47:16,031 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:47:16,033 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:47:16,035 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:47:16,036 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:47:16,037 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:47:16,037 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:47:16,039 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:47:16,040 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:47:16,041 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:47:16,042 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:47:16,043 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:47:16,045 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:47:16,047 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:47:16,049 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:47:16,050 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:47:16,055 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:47:16,060 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:47:16,060 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:47:16,061 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:47:16,062 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:47:16,063 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:47:16,064 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:47:16,065 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:47:16,067 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:47:16,067 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:47:16,068 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:47:16,068 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:47:16,068 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:47:16,069 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:47:16,071 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:47:16,071 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-28 23:47:16,096 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:47:16,097 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:47:16,099 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:47:16,101 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:47:16,101 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:47:16,101 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:47:16,101 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:47:16,101 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:47:16,102 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:47:16,103 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:47:16,103 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:47:16,103 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:47:16,104 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 23:47:16,104 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:47:16,104 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:47:16,104 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 23:47:16,104 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:47:16,104 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:47:16,105 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:47:16,107 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:47:16,107 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 23:47:16,107 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:47:16,108 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:47:16,108 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:47:16,108 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:47:16,108 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:47:16,108 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:47:16,108 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:47:16,109 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:47:16,109 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:47:16,109 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:47:16,112 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:47:16,113 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 -> 773d2c4d0eda21b7c46dba917d93fd8caf4fa295 [2018-11-28 23:47:16,179 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:47:16,196 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:47:16,202 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:47:16,204 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:47:16,205 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:47:16,207 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/elevator_spec2_product26_false-unreach-call_true-termination.cil.c [2018-11-28 23:47:16,266 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5820b7ea1/8ac94945bc0748249a757befca9bc6dd/FLAG9d5abeaa4 [2018-11-28 23:47:16,945 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:47:16,947 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/elevator_spec2_product26_false-unreach-call_true-termination.cil.c [2018-11-28 23:47:16,974 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5820b7ea1/8ac94945bc0748249a757befca9bc6dd/FLAG9d5abeaa4 [2018-11-28 23:47:17,068 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5820b7ea1/8ac94945bc0748249a757befca9bc6dd [2018-11-28 23:47:17,071 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:47:17,073 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:47:17,074 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:47:17,074 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:47:17,078 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:47:17,079 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:47:17" (1/1) ... [2018-11-28 23:47:17,082 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dd6fc27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:47:17, skipping insertion in model container [2018-11-28 23:47:17,082 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:47:17" (1/1) ... [2018-11-28 23:47:17,090 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:47:17,197 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:47:17,884 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:47:17,904 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:47:18,158 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:47:18,232 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:47:18,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:47:18 WrapperNode [2018-11-28 23:47:18,233 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:47:18,234 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:47:18,234 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:47:18,234 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:47:18,244 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:47:18" (1/1) ... [2018-11-28 23:47:18,276 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:47:18" (1/1) ... [2018-11-28 23:47:18,538 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:47:18,538 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:47:18,539 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:47:18,539 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:47:18,550 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:47:18" (1/1) ... [2018-11-28 23:47:18,550 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:47:18" (1/1) ... [2018-11-28 23:47:18,592 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:47:18" (1/1) ... [2018-11-28 23:47:18,592 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:47:18" (1/1) ... [2018-11-28 23:47:18,718 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:47:18" (1/1) ... [2018-11-28 23:47:18,830 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:47:18" (1/1) ... [2018-11-28 23:47:18,864 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:47:18" (1/1) ... [2018-11-28 23:47:18,911 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:47:18,912 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:47:18,912 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:47:18,912 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:47:18,913 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:47:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:47:18,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:47:18,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-11-28 23:47:18,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:47:18,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:47:32,847 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:47:32,847 INFO L280 CfgBuilder]: Removed 1125 assue(true) statements. [2018-11-28 23:47:32,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:47:32 BoogieIcfgContainer [2018-11-28 23:47:32,848 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:47:32,849 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:47:32,849 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:47:32,853 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:47:32,854 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:47:32,854 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:47:17" (1/3) ... [2018-11-28 23:47:32,855 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@75f14d29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:47:32, skipping insertion in model container [2018-11-28 23:47:32,855 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:47:32,855 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:47:18" (2/3) ... [2018-11-28 23:47:32,856 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@75f14d29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:47:32, skipping insertion in model container [2018-11-28 23:47:32,856 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:47:32,856 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:47:32" (3/3) ... [2018-11-28 23:47:32,858 INFO L375 chiAutomizerObserver]: Analyzing ICFG elevator_spec2_product26_false-unreach-call_true-termination.cil.c [2018-11-28 23:47:32,930 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:47:32,931 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:47:32,931 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:47:32,931 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:47:32,931 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:47:32,931 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:47:32,931 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:47:32,931 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:47:32,932 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:47:33,033 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4855 states. [2018-11-28 23:47:33,186 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2417 [2018-11-28 23:47:33,186 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:47:33,186 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:47:33,208 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:47:33,209 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:47:33,209 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:47:33,209 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4855 states. [2018-11-28 23:47:33,273 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2417 [2018-11-28 23:47:33,274 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:47:33,274 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:47:33,277 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:47:33,278 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:47:33,286 INFO L794 eck$LassoCheckResult]: Stem: 2374#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~cleanupTimeShifts~0 := 12;~weight~0 := 0;~maximumWeight~0 := 100;~blocked~0 := 0;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0;call #t~string61.base, #t~string61.offset := #Ultimate.alloc(10);call #t~string63.base, #t~string63.offset := #Ultimate.alloc(4);call write~init~int(91, #t~string63.base, #t~string63.offset, 1);call write~init~int(95, #t~string63.base, 1 + #t~string63.offset, 1);call write~init~int(93, #t~string63.base, 2 + #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 3 + #t~string63.offset, 1);call #t~string65.base, #t~string65.offset := #Ultimate.alloc(4);call write~init~int(91, #t~string65.base, #t~string65.offset, 1);call write~init~int(93, #t~string65.base, 1 + #t~string65.offset, 1);call write~init~int(32, #t~string65.base, 2 + #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 3 + #t~string65.offset, 1);call #t~string67.base, #t~string67.offset := #Ultimate.alloc(5);call write~init~int(32, #t~string67.base, #t~string67.offset, 1);call write~init~int(97, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(116, #t~string67.base, 2 + #t~string67.offset, 1);call write~init~int(32, #t~string67.base, 3 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 4 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.alloc(3);call write~init~int(37, #t~string69.base, #t~string69.offset, 1);call write~init~int(105, #t~string69.base, 1 + #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 2 + #t~string69.offset, 1);call #t~string71.base, #t~string71.offset := #Ultimate.alloc(10);call #t~string73.base, #t~string73.offset := #Ultimate.alloc(3);call write~init~int(117, #t~string73.base, #t~string73.offset, 1);call write~init~int(112, #t~string73.base, 1 + #t~string73.offset, 1);call write~init~int(0, #t~string73.base, 2 + #t~string73.offset, 1);call #t~string75.base, #t~string75.offset := #Ultimate.alloc(5);call write~init~int(100, #t~string75.base, #t~string75.offset, 1);call write~init~int(111, #t~string75.base, 1 + #t~string75.offset, 1);call write~init~int(119, #t~string75.base, 2 + #t~string75.offset, 1);call write~init~int(110, #t~string75.base, 3 + #t~string75.offset, 1);call write~init~int(0, #t~string75.base, 4 + #t~string75.offset, 1);call #t~string77.base, #t~string77.offset := #Ultimate.alloc(7);call write~init~int(32, #t~string77.base, #t~string77.offset, 1);call write~init~int(73, #t~string77.base, 1 + #t~string77.offset, 1);call write~init~int(76, #t~string77.base, 2 + #t~string77.offset, 1);call write~init~int(95, #t~string77.base, 3 + #t~string77.offset, 1);call write~init~int(112, #t~string77.base, 4 + #t~string77.offset, 1);call write~init~int(58, #t~string77.base, 5 + #t~string77.offset, 1);call write~init~int(0, #t~string77.base, 6 + #t~string77.offset, 1);call #t~string79.base, #t~string79.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string79.base, #t~string79.offset, 1);call write~init~int(37, #t~string79.base, 1 + #t~string79.offset, 1);call write~init~int(105, #t~string79.base, 2 + #t~string79.offset, 1);call write~init~int(0, #t~string79.base, 3 + #t~string79.offset, 1);call #t~string81.base, #t~string81.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string81.base, #t~string81.offset, 1);call write~init~int(37, #t~string81.base, 1 + #t~string81.offset, 1);call write~init~int(105, #t~string81.base, 2 + #t~string81.offset, 1);call write~init~int(0, #t~string81.base, 3 + #t~string81.offset, 1);call #t~string83.base, #t~string83.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string83.base, #t~string83.offset, 1);call write~init~int(37, #t~string83.base, 1 + #t~string83.offset, 1);call write~init~int(105, #t~string83.base, 2 + #t~string83.offset, 1);call write~init~int(0, #t~string83.base, 3 + #t~string83.offset, 1);call #t~string85.base, #t~string85.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string85.base, #t~string85.offset, 1);call write~init~int(37, #t~string85.base, 1 + #t~string85.offset, 1);call write~init~int(105, #t~string85.base, 2 + #t~string85.offset, 1);call write~init~int(0, #t~string85.base, 3 + #t~string85.offset, 1);call #t~string87.base, #t~string87.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string87.base, #t~string87.offset, 1);call write~init~int(37, #t~string87.base, 1 + #t~string87.offset, 1);call write~init~int(105, #t~string87.base, 2 + #t~string87.offset, 1);call write~init~int(0, #t~string87.base, 3 + #t~string87.offset, 1);call #t~string89.base, #t~string89.offset := #Ultimate.alloc(6);call write~init~int(32, #t~string89.base, #t~string89.offset, 1);call write~init~int(70, #t~string89.base, 1 + #t~string89.offset, 1);call write~init~int(95, #t~string89.base, 2 + #t~string89.offset, 1);call write~init~int(112, #t~string89.base, 3 + #t~string89.offset, 1);call write~init~int(58, #t~string89.base, 4 + #t~string89.offset, 1);call write~init~int(0, #t~string89.base, 5 + #t~string89.offset, 1);call #t~string92.base, #t~string92.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string92.base, #t~string92.offset, 1);call write~init~int(37, #t~string92.base, 1 + #t~string92.offset, 1);call write~init~int(105, #t~string92.base, 2 + #t~string92.offset, 1);call write~init~int(0, #t~string92.base, 3 + #t~string92.offset, 1);call #t~string95.base, #t~string95.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string95.base, #t~string95.offset, 1);call write~init~int(37, #t~string95.base, 1 + #t~string95.offset, 1);call write~init~int(105, #t~string95.base, 2 + #t~string95.offset, 1);call write~init~int(0, #t~string95.base, 3 + #t~string95.offset, 1);call #t~string98.base, #t~string98.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string98.base, #t~string98.offset, 1);call write~init~int(37, #t~string98.base, 1 + #t~string98.offset, 1);call write~init~int(105, #t~string98.base, 2 + #t~string98.offset, 1);call write~init~int(0, #t~string98.base, 3 + #t~string98.offset, 1);call #t~string101.base, #t~string101.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string101.base, #t~string101.offset, 1);call write~init~int(37, #t~string101.base, 1 + #t~string101.offset, 1);call write~init~int(105, #t~string101.base, 2 + #t~string101.offset, 1);call write~init~int(0, #t~string101.base, 3 + #t~string101.offset, 1);call #t~string104.base, #t~string104.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string104.base, #t~string104.offset, 1);call write~init~int(37, #t~string104.base, 1 + #t~string104.offset, 1);call write~init~int(105, #t~string104.base, 2 + #t~string104.offset, 1);call write~init~int(0, #t~string104.base, 3 + #t~string104.offset, 1);call #t~string106.base, #t~string106.offset := #Ultimate.alloc(2);call write~init~int(10, #t~string106.base, #t~string106.offset, 1);call write~init~int(0, #t~string106.base, 1 + #t~string106.offset, 1);call #t~string109.base, #t~string109.offset := #Ultimate.alloc(9);~head~0.base, ~head~0.offset := 0, 0;call #t~string129.base, #t~string129.offset := #Ultimate.alloc(30);call #t~string130.base, #t~string130.offset := #Ultimate.alloc(9);call #t~string131.base, #t~string131.offset := #Ultimate.alloc(21);call #t~string132.base, #t~string132.offset := #Ultimate.alloc(30);call #t~string133.base, #t~string133.offset := #Ultimate.alloc(9);call #t~string134.base, #t~string134.offset := #Ultimate.alloc(21);call #t~string138.base, #t~string138.offset := #Ultimate.alloc(30);call #t~string139.base, #t~string139.offset := #Ultimate.alloc(9);call #t~string140.base, #t~string140.offset := #Ultimate.alloc(25);call #t~string141.base, #t~string141.offset := #Ultimate.alloc(30);call #t~string142.base, #t~string142.offset := #Ultimate.alloc(9);call #t~string143.base, #t~string143.offset := #Ultimate.alloc(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;~floorButtons_spc2_0~0 := 0;~floorButtons_spc2_1~0 := 0;~floorButtons_spc2_2~0 := 0;~floorButtons_spc2_3~0 := 0;~floorButtons_spc2_4~0 := 0; 3679#L-1true havoc main_#res;havoc main_#t~ret13, main_~retValue_acc~1, main_~tmp~8;havoc main_~retValue_acc~1;havoc main_~tmp~8; 153#L2449true havoc valid_product_#res;havoc valid_product_~retValue_acc~22;havoc valid_product_~retValue_acc~22;valid_product_~retValue_acc~22 := 1;valid_product_#res := valid_product_~retValue_acc~22; 681#L2457true main_#t~ret13 := valid_product_#res;main_~tmp~8 := main_#t~ret13;havoc main_#t~ret13; 2637#L389true assume 0 != main_~tmp~8; 3323#L358true ~floorButtons_spc2_0~0 := 0;~floorButtons_spc2_1~0 := 0;~floorButtons_spc2_2~0 := 0;~floorButtons_spc2_3~0 := 0;~floorButtons_spc2_4~0 := 0; 1833#L3138true havoc bigMacCall_#t~ret6, bigMacCall_~tmp~5;havoc bigMacCall_~tmp~5;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~16;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~16; 2801#L1974true assume 0 == getOrigin_~person;getOrigin_~retValue_acc~16 := 4;getOrigin_#res := getOrigin_~retValue_acc~16; 442#L1999true bigMacCall_#t~ret6 := getOrigin_#res;bigMacCall_~tmp~5 := bigMacCall_#t~ret6;havoc bigMacCall_#t~ret6;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~5;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 3982#L2815true assume 0 == initPersonOnFloor_~floor; 4126#L2816true assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 4282#L2923-1true callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 1891#L2607true assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 283#L2619-2true havoc cleanup_#t~ret7, cleanup_#t~ret8, cleanup_~i~0, cleanup_~tmp~6, cleanup_~tmp___0~0, cleanup_~__cil_tmp4~0;havoc cleanup_~i~0;havoc cleanup_~tmp~6;havoc cleanup_~tmp___0~0;havoc cleanup_~__cil_tmp4~0;havoc timeShift_#t~ret60, timeShift_~tmp~19;havoc timeShift_~tmp~19;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~4;havoc areDoorsOpen_~retValue_acc~4;areDoorsOpen_~retValue_acc~4 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~4; 1736#L674true timeShift_#t~ret60 := areDoorsOpen_#res;timeShift_~tmp~19 := timeShift_#t~ret60;havoc timeShift_#t~ret60; 1498#L1557true assume 0 != timeShift_~tmp~19; 1588#L1558true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 3071#L1261-11true havoc __utac_acc__Specification2_spec__3_#t~ret147, __utac_acc__Specification2_spec__3_#t~ret148, __utac_acc__Specification2_spec__3_#t~ret149, __utac_acc__Specification2_spec__3_#t~ret150, __utac_acc__Specification2_spec__3_#t~ret151, __utac_acc__Specification2_spec__3_#t~ret152, __utac_acc__Specification2_spec__3_~floor~0, __utac_acc__Specification2_spec__3_~tmp~25, __utac_acc__Specification2_spec__3_~tmp___0~8, __utac_acc__Specification2_spec__3_~tmp___1~6, __utac_acc__Specification2_spec__3_~tmp___2~6, __utac_acc__Specification2_spec__3_~tmp___3~5, __utac_acc__Specification2_spec__3_~tmp___4~3;havoc __utac_acc__Specification2_spec__3_~floor~0;havoc __utac_acc__Specification2_spec__3_~tmp~25;havoc __utac_acc__Specification2_spec__3_~tmp___0~8;havoc __utac_acc__Specification2_spec__3_~tmp___1~6;havoc __utac_acc__Specification2_spec__3_~tmp___2~6;havoc __utac_acc__Specification2_spec__3_~tmp___3~5;havoc __utac_acc__Specification2_spec__3_~tmp___4~3;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~3;havoc getCurrentFloorID_~retValue_acc~3;getCurrentFloorID_~retValue_acc~3 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~3; 1166#L665true __utac_acc__Specification2_spec__3_#t~ret147 := getCurrentFloorID_#res;__utac_acc__Specification2_spec__3_~tmp~25 := __utac_acc__Specification2_spec__3_#t~ret147;havoc __utac_acc__Specification2_spec__3_#t~ret147;__utac_acc__Specification2_spec__3_~floor~0 := __utac_acc__Specification2_spec__3_~tmp~25; 4376#L3183true assume 0 == __utac_acc__Specification2_spec__3_~floor~0; 4508#L3184true assume 0 != ~floorButtons_spc2_0~0;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~4;havoc areDoorsOpen_~retValue_acc~4;areDoorsOpen_~retValue_acc~4 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~4; 1737#L674-1true __utac_acc__Specification2_spec__3_#t~ret148 := areDoorsOpen_#res;__utac_acc__Specification2_spec__3_~tmp___4~3 := __utac_acc__Specification2_spec__3_#t~ret148;havoc __utac_acc__Specification2_spec__3_#t~ret148; 2485#L3188true assume 0 != __utac_acc__Specification2_spec__3_~tmp___4~3;~floorButtons_spc2_0~0 := 0; 88#L3243true cleanup_~i~0 := 0; 4356#L188-2true [2018-11-28 23:47:33,287 INFO L796 eck$LassoCheckResult]: Loop: 4356#L188-2true assume !false; 4498#L189true cleanup_~__cil_tmp4~0 := ~cleanupTimeShifts~0 - 1; 4297#L192true assume cleanup_~i~0 < cleanup_~__cil_tmp4~0;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~2;havoc isBlocked_~retValue_acc~2;isBlocked_~retValue_acc~2 := ~blocked~0;isBlocked_#res := isBlocked_~retValue_acc~2; 1269#L487true cleanup_#t~ret7 := isBlocked_#res;cleanup_~tmp___0~0 := cleanup_#t~ret7;havoc cleanup_#t~ret7; 2350#L196true assume 1 != cleanup_~tmp___0~0; 2347#L196-1true havoc isIdle_#res;havoc isIdle_#t~ret22, isIdle_~retValue_acc~9, isIdle_~tmp~13;havoc isIdle_~retValue_acc~9;havoc isIdle_~tmp~13;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret17, anyStopRequested_#t~ret18, anyStopRequested_#t~ret19, anyStopRequested_#t~ret20, anyStopRequested_#t~ret21, anyStopRequested_~retValue_acc~8, anyStopRequested_~tmp~12, anyStopRequested_~tmp___0~2, anyStopRequested_~tmp___1~1, anyStopRequested_~tmp___2~1, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~8;havoc anyStopRequested_~tmp~12;havoc anyStopRequested_~tmp___0~2;havoc anyStopRequested_~tmp___1~1;havoc anyStopRequested_~tmp___2~1;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~23;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~23; 878#L2544-42true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~23 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~23; 2416#L2571-42true anyStopRequested_#t~ret17 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret17;havoc anyStopRequested_#t~ret17; 252#L773true assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~8 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~8; 1382#L837true isIdle_#t~ret22 := anyStopRequested_#res;isIdle_~tmp~13 := isIdle_#t~ret22;havoc isIdle_#t~ret22;isIdle_~retValue_acc~9 := (if 0 == isIdle_~tmp~13 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~9; 1749#L850true cleanup_#t~ret8 := isIdle_#res;cleanup_~tmp~6 := cleanup_#t~ret8;havoc cleanup_#t~ret8; 2859#L208true assume !(0 != cleanup_~tmp~6);havoc timeShift_#t~ret60, timeShift_~tmp~19;havoc timeShift_~tmp~19;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~4;havoc areDoorsOpen_~retValue_acc~4;areDoorsOpen_~retValue_acc~4 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~4; 1723#L674-6true timeShift_#t~ret60 := areDoorsOpen_#res;timeShift_~tmp~19 := timeShift_#t~ret60;havoc timeShift_#t~ret60; 1646#L1557-1true assume 0 != timeShift_~tmp~19; 1570#L1558-2true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 3053#L1261-23true havoc __utac_acc__Specification2_spec__3_#t~ret147, __utac_acc__Specification2_spec__3_#t~ret148, __utac_acc__Specification2_spec__3_#t~ret149, __utac_acc__Specification2_spec__3_#t~ret150, __utac_acc__Specification2_spec__3_#t~ret151, __utac_acc__Specification2_spec__3_#t~ret152, __utac_acc__Specification2_spec__3_~floor~0, __utac_acc__Specification2_spec__3_~tmp~25, __utac_acc__Specification2_spec__3_~tmp___0~8, __utac_acc__Specification2_spec__3_~tmp___1~6, __utac_acc__Specification2_spec__3_~tmp___2~6, __utac_acc__Specification2_spec__3_~tmp___3~5, __utac_acc__Specification2_spec__3_~tmp___4~3;havoc __utac_acc__Specification2_spec__3_~floor~0;havoc __utac_acc__Specification2_spec__3_~tmp~25;havoc __utac_acc__Specification2_spec__3_~tmp___0~8;havoc __utac_acc__Specification2_spec__3_~tmp___1~6;havoc __utac_acc__Specification2_spec__3_~tmp___2~6;havoc __utac_acc__Specification2_spec__3_~tmp___3~5;havoc __utac_acc__Specification2_spec__3_~tmp___4~3;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~3;havoc getCurrentFloorID_~retValue_acc~3;getCurrentFloorID_~retValue_acc~3 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~3; 1167#L665-1true __utac_acc__Specification2_spec__3_#t~ret147 := getCurrentFloorID_#res;__utac_acc__Specification2_spec__3_~tmp~25 := __utac_acc__Specification2_spec__3_#t~ret147;havoc __utac_acc__Specification2_spec__3_#t~ret147;__utac_acc__Specification2_spec__3_~floor~0 := __utac_acc__Specification2_spec__3_~tmp~25; 4361#L3183-1true assume 0 == __utac_acc__Specification2_spec__3_~floor~0; 4512#L3184-1true assume 0 != ~floorButtons_spc2_0~0;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~4;havoc areDoorsOpen_~retValue_acc~4;areDoorsOpen_~retValue_acc~4 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~4; 1725#L674-7true __utac_acc__Specification2_spec__3_#t~ret148 := areDoorsOpen_#res;__utac_acc__Specification2_spec__3_~tmp___4~3 := __utac_acc__Specification2_spec__3_#t~ret148;havoc __utac_acc__Specification2_spec__3_#t~ret148; 2482#L3188-2true assume 0 != __utac_acc__Specification2_spec__3_~tmp___4~3;~floorButtons_spc2_0~0 := 0; 81#L3243-1true cleanup_~i~0 := 1 + cleanup_~i~0; 4356#L188-2true [2018-11-28 23:47:33,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:47:33,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1323712467, now seen corresponding path program 1 times [2018-11-28 23:47:33,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:47:33,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:47:33,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:47:33,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:47:33,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:47:33,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:47:33,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:47:33,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:47:33,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 23:47:33,654 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:47:33,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:47:33,655 INFO L82 PathProgramCache]: Analyzing trace with hash 2119774427, now seen corresponding path program 1 times [2018-11-28 23:47:33,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:47:33,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:47:33,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:47:33,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:47:33,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:47:33,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:47:33,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:47:34,596 WARN L180 SmtUtils]: Spent 865.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 84 [2018-11-28 23:47:35,484 WARN L180 SmtUtils]: Spent 876.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2018-11-28 23:47:35,496 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:47:35,498 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:47:35,498 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:47:35,498 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:47:35,498 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:47:35,498 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:47:35,498 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:47:35,499 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:47:35,499 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec2_product26_false-unreach-call_true-termination.cil.c_Iteration1_Loop [2018-11-28 23:47:35,499 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:47:35,499 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:47:35,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:35,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:35,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:35,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:35,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:35,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:35,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:35,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:35,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:35,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:35,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:35,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:35,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:35,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:35,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:35,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:35,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:35,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:35,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:35,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:35,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:35,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:35,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:35,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:35,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:35,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:35,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:35,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:35,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:35,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:35,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:35,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:35,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:36,356 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-28 23:47:36,573 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:47:36,574 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:47:36,583 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:47:36,583 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:47:36,591 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:47:36,591 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification2_spec__3_#t~ret147=0} Honda state: {ULTIMATE.start___utac_acc__Specification2_spec__3_#t~ret147=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 [2018-11-28 23:47:36,614 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:47:36,614 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:47:36,635 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:47:36,636 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification2_spec__3_~tmp___1~6=0} Honda state: {ULTIMATE.start___utac_acc__Specification2_spec__3_~tmp___1~6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:47:36,669 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:47:36,669 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:47:36,675 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:47:36,675 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification2_spec__3_#t~ret151=0} Honda state: {ULTIMATE.start___utac_acc__Specification2_spec__3_#t~ret151=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:47:36,735 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:47:36,735 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:47:36,758 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:47:36,758 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_areDoorsOpen_#res=-8, ULTIMATE.start_areDoorsOpen_~retValue_acc~4=-8, ULTIMATE.start_timeShift_~tmp~19=-8, ~doorState~0=-8, ULTIMATE.start___utac_acc__Specification2_spec__3_~tmp___4~3=-8} Honda state: {ULTIMATE.start_areDoorsOpen_#res=-8, ULTIMATE.start_areDoorsOpen_~retValue_acc~4=-8, ULTIMATE.start_timeShift_~tmp~19=-8, ~doorState~0=-8, ULTIMATE.start___utac_acc__Specification2_spec__3_~tmp___4~3=-8} 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) [2018-11-28 23:47:36,798 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:47:36,798 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:47:36,812 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:47:36,812 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_~tmp___1~1=0} Honda state: {ULTIMATE.start_anyStopRequested_~tmp___1~1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /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 [2018-11-28 23:47:36,833 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:47:36,833 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-11-28 23:47:36,883 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:47:36,883 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:47:37,521 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:47:37,523 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:47:37,524 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:47:37,524 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:47:37,524 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:47:37,524 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:47:37,524 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:47:37,524 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:47:37,524 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:47:37,524 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec2_product26_false-unreach-call_true-termination.cil.c_Iteration1_Loop [2018-11-28 23:47:37,525 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:47:37,525 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:47:37,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:37,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:37,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:37,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:37,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:37,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:37,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:37,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:37,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:37,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:37,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:37,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:37,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:37,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:37,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:37,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:37,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:37,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:37,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:37,847 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-28 23:47:37,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:37,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:37,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:37,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:37,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:37,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:37,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:37,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:37,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:37,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:37,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:37,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:37,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:38,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:38,502 WARN L180 SmtUtils]: Spent 407.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-28 23:47:38,757 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-28 23:47:38,923 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-28 23:47:39,234 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-28 23:47:39,655 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:47:39,662 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:47:39,664 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:47:39,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:47:39,666 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:47:39,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:47:39,667 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:47:39,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:47:39,674 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:47:39,674 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:47:39,693 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:47:39,693 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:47:39,694 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:47:39,694 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:47:39,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:47:39,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:47:39,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:47:39,697 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:47:39,697 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:47:39,698 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:47:39,700 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:47:39,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:47:39,701 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:47:39,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:47:39,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:47:39,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:47:39,704 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:47:39,704 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:47:39,705 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:47:39,706 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:47:39,706 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:47:39,706 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:47:39,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:47:39,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:47:39,709 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:47:39,709 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:47:39,709 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:47:39,712 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:47:39,712 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:47:39,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:47:39,713 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:47:39,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:47:39,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:47:39,714 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:47:39,714 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:47:39,714 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:47:39,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:47:39,718 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:47:39,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:47:39,719 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:47:39,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:47:39,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:47:39,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:47:39,723 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:47:39,723 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:47:39,731 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:47:39,740 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:47:39,740 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:47:39,743 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:47:39,744 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:47:39,744 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:47:39,744 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~cleanupTimeShifts~0, ULTIMATE.start_cleanup_~i~0) = 1*~cleanupTimeShifts~0 - 1*ULTIMATE.start_cleanup_~i~0 Supporting invariants [] [2018-11-28 23:47:39,747 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:47:40,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:47:40,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:47:40,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:47:40,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:47:40,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:47:40,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:47:40,623 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 23:47:40,625 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 4855 states. Second operand 5 states. [2018-11-28 23:47:41,066 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-28 23:47:41,616 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 4855 states.. Second operand 5 states. Result 7332 states and 13832 transitions. Complement of second has 9 states. [2018-11-28 23:47:41,617 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 [2018-11-28 23:47:41,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:47:41,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9227 transitions. [2018-11-28 23:47:41,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 9227 transitions. Stem has 24 letters. Loop has 22 letters. [2018-11-28 23:47:41,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:47:41,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 9227 transitions. Stem has 46 letters. Loop has 22 letters. [2018-11-28 23:47:41,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:47:41,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 9227 transitions. Stem has 24 letters. Loop has 44 letters. [2018-11-28 23:47:41,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:47:41,655 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7332 states and 13832 transitions. [2018-11-28 23:47:41,743 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:47:41,747 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7332 states to 0 states and 0 transitions. [2018-11-28 23:47:41,748 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:47:41,748 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:47:41,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:47:41,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:47:41,749 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:47:41,751 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:47:41,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:47:41,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:47:41,759 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2018-11-28 23:47:41,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:47:41,763 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-28 23:47:41,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 23:47:41,764 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-28 23:47:41,764 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:47:41,764 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 23:47:41,764 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:47:41,764 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:47:41,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:47:41,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:47:41,766 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:47:41,767 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:47:41,767 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:47:41,767 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:47:41,767 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:47:41,767 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:47:41,767 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:47:41,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:47:41 BoogieIcfgContainer [2018-11-28 23:47:41,777 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:47:41,778 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:47:41,778 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:47:41,778 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:47:41,780 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:47:32" (3/4) ... [2018-11-28 23:47:41,785 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:47:41,785 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:47:41,787 INFO L168 Benchmark]: Toolchain (without parser) took 24714.18 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 553.6 MB). Free memory was 941.9 MB in the beginning and 1.2 GB in the end (delta: -254.7 MB). Peak memory consumption was 298.9 MB. Max. memory is 11.5 GB. [2018-11-28 23:47:41,790 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:47:41,791 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1159.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 941.9 MB in the beginning and 1.1 GB in the end (delta: -171.1 MB). Peak memory consumption was 51.0 MB. Max. memory is 11.5 GB. [2018-11-28 23:47:41,792 INFO L168 Benchmark]: Boogie Procedure Inliner took 304.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 11.5 GB. [2018-11-28 23:47:41,792 INFO L168 Benchmark]: Boogie Preprocessor took 372.76 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: 47.1 MB). Peak memory consumption was 47.1 MB. Max. memory is 11.5 GB. [2018-11-28 23:47:41,796 INFO L168 Benchmark]: RCFGBuilder took 13936.80 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 201.3 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -121.2 MB). Peak memory consumption was 450.8 MB. Max. memory is 11.5 GB. [2018-11-28 23:47:41,798 INFO L168 Benchmark]: BuchiAutomizer took 8928.68 ms. Allocated memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: 205.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -56.5 MB). Peak memory consumption was 148.5 MB. Max. memory is 11.5 GB. [2018-11-28 23:47:41,800 INFO L168 Benchmark]: Witness Printer took 7.33 ms. Allocated memory is still 1.6 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:47:41,807 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1159.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 941.9 MB in the beginning and 1.1 GB in the end (delta: -171.1 MB). Peak memory consumption was 51.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 304.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 372.76 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: 47.1 MB). Peak memory consumption was 47.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 13936.80 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 201.3 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -121.2 MB). Peak memory consumption was 450.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8928.68 ms. Allocated memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: 205.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -56.5 MB). Peak memory consumption was 148.5 MB. Max. memory is 11.5 GB. * Witness Printer took 7.33 ms. Allocated memory is still 1.6 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function cleanupTimeShifts + -1 * i and consists of 6 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.8s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 6.4s. Construction of modules took 0.1s. Büchi inclusion checks took 1.7s. 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.0s 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: 9193 SDtfs, 18352 SDslu, 4613 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: 29ms VariablesStem: 0 VariablesLoop: 5 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.8s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...