./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/product-lines/elevator_spec2_product22_false-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_5af4ea3d-9293-44d0-b003-9516b3b9a578/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5af4ea3d-9293-44d0-b003-9516b3b9a578/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5af4ea3d-9293-44d0-b003-9516b3b9a578/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5af4ea3d-9293-44d0-b003-9516b3b9a578/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/product-lines/elevator_spec2_product22_false-unreach-call_true-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_5af4ea3d-9293-44d0-b003-9516b3b9a578/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5af4ea3d-9293-44d0-b003-9516b3b9a578/bin-2019/uautomizer --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 496f188e29fc9ae7e4557430f30be7ed50f3ccf7 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 14:23:17,016 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 14:23:17,017 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 14:23:17,023 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 14:23:17,023 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 14:23:17,024 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 14:23:17,025 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 14:23:17,025 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 14:23:17,026 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 14:23:17,026 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 14:23:17,027 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 14:23:17,027 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 14:23:17,028 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 14:23:17,028 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 14:23:17,029 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 14:23:17,029 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 14:23:17,029 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 14:23:17,030 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 14:23:17,031 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 14:23:17,032 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 14:23:17,032 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 14:23:17,033 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 14:23:17,034 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 14:23:17,034 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 14:23:17,034 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 14:23:17,035 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 14:23:17,035 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 14:23:17,036 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 14:23:17,036 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 14:23:17,037 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 14:23:17,037 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 14:23:17,037 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 14:23:17,037 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 14:23:17,037 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 14:23:17,038 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 14:23:17,038 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 14:23:17,038 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5af4ea3d-9293-44d0-b003-9516b3b9a578/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-08 14:23:17,046 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 14:23:17,046 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 14:23:17,047 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 14:23:17,047 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 14:23:17,047 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 14:23:17,047 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-08 14:23:17,047 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-08 14:23:17,048 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-08 14:23:17,048 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-08 14:23:17,048 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-08 14:23:17,048 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-08 14:23:17,048 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 14:23:17,048 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 14:23:17,048 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 14:23:17,048 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 14:23:17,049 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 14:23:17,049 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 14:23:17,049 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-08 14:23:17,049 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-08 14:23:17,049 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-08 14:23:17,049 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 14:23:17,049 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 14:23:17,049 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-08 14:23:17,050 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 14:23:17,050 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-08 14:23:17,050 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 14:23:17,050 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 14:23:17,050 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-08 14:23:17,050 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 14:23:17,050 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 14:23:17,050 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-08 14:23:17,051 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-08 14:23:17,051 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_5af4ea3d-9293-44d0-b003-9516b3b9a578/bin-2019/uautomizer 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 -> 496f188e29fc9ae7e4557430f30be7ed50f3ccf7 [2018-12-08 14:23:17,069 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 14:23:17,078 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 14:23:17,080 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 14:23:17,081 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 14:23:17,082 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 14:23:17,082 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5af4ea3d-9293-44d0-b003-9516b3b9a578/bin-2019/uautomizer/../../sv-benchmarks/c/product-lines/elevator_spec2_product22_false-unreach-call_true-termination.cil.c [2018-12-08 14:23:17,119 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5af4ea3d-9293-44d0-b003-9516b3b9a578/bin-2019/uautomizer/data/b3163afe1/e90eb01fd6844a49b692558f50f1962a/FLAGeeb4a79c4 [2018-12-08 14:23:17,581 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 14:23:17,581 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5af4ea3d-9293-44d0-b003-9516b3b9a578/sv-benchmarks/c/product-lines/elevator_spec2_product22_false-unreach-call_true-termination.cil.c [2018-12-08 14:23:17,591 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5af4ea3d-9293-44d0-b003-9516b3b9a578/bin-2019/uautomizer/data/b3163afe1/e90eb01fd6844a49b692558f50f1962a/FLAGeeb4a79c4 [2018-12-08 14:23:18,102 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5af4ea3d-9293-44d0-b003-9516b3b9a578/bin-2019/uautomizer/data/b3163afe1/e90eb01fd6844a49b692558f50f1962a [2018-12-08 14:23:18,104 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 14:23:18,105 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 14:23:18,105 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 14:23:18,105 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 14:23:18,107 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 14:23:18,108 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 02:23:18" (1/1) ... [2018-12-08 14:23:18,109 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@797cd78d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:23:18, skipping insertion in model container [2018-12-08 14:23:18,109 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 02:23:18" (1/1) ... [2018-12-08 14:23:18,113 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 14:23:18,145 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 14:23:18,474 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 14:23:18,483 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 14:23:18,559 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 14:23:18,597 INFO L195 MainTranslator]: Completed translation [2018-12-08 14:23:18,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:23:18 WrapperNode [2018-12-08 14:23:18,598 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 14:23:18,598 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 14:23:18,598 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 14:23:18,598 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 14:23:18,603 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:23:18" (1/1) ... [2018-12-08 14:23:18,618 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:23:18" (1/1) ... [2018-12-08 14:23:18,764 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 14:23:18,764 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 14:23:18,764 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 14:23:18,764 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 14:23:18,770 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:23:18" (1/1) ... [2018-12-08 14:23:18,770 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:23:18" (1/1) ... [2018-12-08 14:23:18,792 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:23:18" (1/1) ... [2018-12-08 14:23:18,793 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:23:18" (1/1) ... [2018-12-08 14:23:18,840 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:23:18" (1/1) ... [2018-12-08 14:23:18,893 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:23:18" (1/1) ... [2018-12-08 14:23:18,920 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:23:18" (1/1) ... [2018-12-08 14:23:18,955 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 14:23:18,955 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 14:23:18,956 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 14:23:18,956 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 14:23:18,956 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:23:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5af4ea3d-9293-44d0-b003-9516b3b9a578/bin-2019/uautomizer/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-12-08 14:23:19,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 14:23:19,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-08 14:23:19,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 14:23:19,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 14:23:24,341 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 14:23:24,341 INFO L280 CfgBuilder]: Removed 1469 assue(true) statements. [2018-12-08 14:23:24,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 02:23:24 BoogieIcfgContainer [2018-12-08 14:23:24,342 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 14:23:24,342 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-08 14:23:24,342 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-08 14:23:24,344 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-08 14:23:24,345 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 14:23:24,345 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.12 02:23:18" (1/3) ... [2018-12-08 14:23:24,346 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@456f28a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 02:23:24, skipping insertion in model container [2018-12-08 14:23:24,346 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 14:23:24,346 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:23:18" (2/3) ... [2018-12-08 14:23:24,346 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@456f28a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 02:23:24, skipping insertion in model container [2018-12-08 14:23:24,346 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 14:23:24,346 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 02:23:24" (3/3) ... [2018-12-08 14:23:24,347 INFO L375 chiAutomizerObserver]: Analyzing ICFG elevator_spec2_product22_false-unreach-call_true-termination.cil.c [2018-12-08 14:23:24,385 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 14:23:24,386 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-08 14:23:24,386 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-08 14:23:24,386 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-08 14:23:24,386 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 14:23:24,386 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 14:23:24,386 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-08 14:23:24,386 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 14:23:24,386 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-08 14:23:24,440 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6747 states. [2018-12-08 14:23:24,512 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3363 [2018-12-08 14:23:24,512 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 14:23:24,512 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 14:23:24,523 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-12-08 14:23:24,523 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-12-08 14:23:24,523 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-08 14:23:24,523 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6747 states. [2018-12-08 14:23:24,561 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3363 [2018-12-08 14:23:24,561 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 14:23:24,561 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 14:23:24,563 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-12-08 14:23:24,563 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-12-08 14:23:24,567 INFO L794 eck$LassoCheckResult]: Stem: 1655#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~cleanupTimeShifts~0 := 12;~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~head~0.base, ~head~0.offset := 0, 0;call #t~string32.base, #t~string32.offset := #Ultimate.alloc(30);call #t~string33.base, #t~string33.offset := #Ultimate.alloc(9);call #t~string34.base, #t~string34.offset := #Ultimate.alloc(21);call #t~string35.base, #t~string35.offset := #Ultimate.alloc(30);call #t~string36.base, #t~string36.offset := #Ultimate.alloc(9);call #t~string37.base, #t~string37.offset := #Ultimate.alloc(21);call #t~string41.base, #t~string41.offset := #Ultimate.alloc(30);call #t~string42.base, #t~string42.offset := #Ultimate.alloc(9);call #t~string43.base, #t~string43.offset := #Ultimate.alloc(25);call #t~string44.base, #t~string44.offset := #Ultimate.alloc(30);call #t~string45.base, #t~string45.offset := #Ultimate.alloc(9);call #t~string46.base, #t~string46.offset := #Ultimate.alloc(25);~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~string103.base, #t~string103.offset := #Ultimate.alloc(10);call #t~string105.base, #t~string105.offset := #Ultimate.alloc(4);call write~init~int(91, #t~string105.base, #t~string105.offset, 1);call write~init~int(95, #t~string105.base, 1 + #t~string105.offset, 1);call write~init~int(93, #t~string105.base, 2 + #t~string105.offset, 1);call write~init~int(0, #t~string105.base, 3 + #t~string105.offset, 1);call #t~string107.base, #t~string107.offset := #Ultimate.alloc(4);call write~init~int(91, #t~string107.base, #t~string107.offset, 1);call write~init~int(93, #t~string107.base, 1 + #t~string107.offset, 1);call write~init~int(32, #t~string107.base, 2 + #t~string107.offset, 1);call write~init~int(0, #t~string107.base, 3 + #t~string107.offset, 1);call #t~string109.base, #t~string109.offset := #Ultimate.alloc(5);call write~init~int(32, #t~string109.base, #t~string109.offset, 1);call write~init~int(97, #t~string109.base, 1 + #t~string109.offset, 1);call write~init~int(116, #t~string109.base, 2 + #t~string109.offset, 1);call write~init~int(32, #t~string109.base, 3 + #t~string109.offset, 1);call write~init~int(0, #t~string109.base, 4 + #t~string109.offset, 1);call #t~string111.base, #t~string111.offset := #Ultimate.alloc(3);call write~init~int(37, #t~string111.base, #t~string111.offset, 1);call write~init~int(105, #t~string111.base, 1 + #t~string111.offset, 1);call write~init~int(0, #t~string111.base, 2 + #t~string111.offset, 1);call #t~string113.base, #t~string113.offset := #Ultimate.alloc(10);call #t~string115.base, #t~string115.offset := #Ultimate.alloc(3);call write~init~int(117, #t~string115.base, #t~string115.offset, 1);call write~init~int(112, #t~string115.base, 1 + #t~string115.offset, 1);call write~init~int(0, #t~string115.base, 2 + #t~string115.offset, 1);call #t~string117.base, #t~string117.offset := #Ultimate.alloc(5);call write~init~int(100, #t~string117.base, #t~string117.offset, 1);call write~init~int(111, #t~string117.base, 1 + #t~string117.offset, 1);call write~init~int(119, #t~string117.base, 2 + #t~string117.offset, 1);call write~init~int(110, #t~string117.base, 3 + #t~string117.offset, 1);call write~init~int(0, #t~string117.base, 4 + #t~string117.offset, 1);call #t~string119.base, #t~string119.offset := #Ultimate.alloc(7);call write~init~int(32, #t~string119.base, #t~string119.offset, 1);call write~init~int(73, #t~string119.base, 1 + #t~string119.offset, 1);call write~init~int(76, #t~string119.base, 2 + #t~string119.offset, 1);call write~init~int(95, #t~string119.base, 3 + #t~string119.offset, 1);call write~init~int(112, #t~string119.base, 4 + #t~string119.offset, 1);call write~init~int(58, #t~string119.base, 5 + #t~string119.offset, 1);call write~init~int(0, #t~string119.base, 6 + #t~string119.offset, 1);call #t~string121.base, #t~string121.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string121.base, #t~string121.offset, 1);call write~init~int(37, #t~string121.base, 1 + #t~string121.offset, 1);call write~init~int(105, #t~string121.base, 2 + #t~string121.offset, 1);call write~init~int(0, #t~string121.base, 3 + #t~string121.offset, 1);call #t~string123.base, #t~string123.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string123.base, #t~string123.offset, 1);call write~init~int(37, #t~string123.base, 1 + #t~string123.offset, 1);call write~init~int(105, #t~string123.base, 2 + #t~string123.offset, 1);call write~init~int(0, #t~string123.base, 3 + #t~string123.offset, 1);call #t~string125.base, #t~string125.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string125.base, #t~string125.offset, 1);call write~init~int(37, #t~string125.base, 1 + #t~string125.offset, 1);call write~init~int(105, #t~string125.base, 2 + #t~string125.offset, 1);call write~init~int(0, #t~string125.base, 3 + #t~string125.offset, 1);call #t~string127.base, #t~string127.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string127.base, #t~string127.offset, 1);call write~init~int(37, #t~string127.base, 1 + #t~string127.offset, 1);call write~init~int(105, #t~string127.base, 2 + #t~string127.offset, 1);call write~init~int(0, #t~string127.base, 3 + #t~string127.offset, 1);call #t~string129.base, #t~string129.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string129.base, #t~string129.offset, 1);call write~init~int(37, #t~string129.base, 1 + #t~string129.offset, 1);call write~init~int(105, #t~string129.base, 2 + #t~string129.offset, 1);call write~init~int(0, #t~string129.base, 3 + #t~string129.offset, 1);call #t~string131.base, #t~string131.offset := #Ultimate.alloc(6);call write~init~int(32, #t~string131.base, #t~string131.offset, 1);call write~init~int(70, #t~string131.base, 1 + #t~string131.offset, 1);call write~init~int(95, #t~string131.base, 2 + #t~string131.offset, 1);call write~init~int(112, #t~string131.base, 3 + #t~string131.offset, 1);call write~init~int(58, #t~string131.base, 4 + #t~string131.offset, 1);call write~init~int(0, #t~string131.base, 5 + #t~string131.offset, 1);call #t~string134.base, #t~string134.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string134.base, #t~string134.offset, 1);call write~init~int(37, #t~string134.base, 1 + #t~string134.offset, 1);call write~init~int(105, #t~string134.base, 2 + #t~string134.offset, 1);call write~init~int(0, #t~string134.base, 3 + #t~string134.offset, 1);call #t~string137.base, #t~string137.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string137.base, #t~string137.offset, 1);call write~init~int(37, #t~string137.base, 1 + #t~string137.offset, 1);call write~init~int(105, #t~string137.base, 2 + #t~string137.offset, 1);call write~init~int(0, #t~string137.base, 3 + #t~string137.offset, 1);call #t~string140.base, #t~string140.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string140.base, #t~string140.offset, 1);call write~init~int(37, #t~string140.base, 1 + #t~string140.offset, 1);call write~init~int(105, #t~string140.base, 2 + #t~string140.offset, 1);call write~init~int(0, #t~string140.base, 3 + #t~string140.offset, 1);call #t~string143.base, #t~string143.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string143.base, #t~string143.offset, 1);call write~init~int(37, #t~string143.base, 1 + #t~string143.offset, 1);call write~init~int(105, #t~string143.base, 2 + #t~string143.offset, 1);call write~init~int(0, #t~string143.base, 3 + #t~string143.offset, 1);call #t~string146.base, #t~string146.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string146.base, #t~string146.offset, 1);call write~init~int(37, #t~string146.base, 1 + #t~string146.offset, 1);call write~init~int(105, #t~string146.base, 2 + #t~string146.offset, 1);call write~init~int(0, #t~string146.base, 3 + #t~string146.offset, 1);call #t~string148.base, #t~string148.offset := #Ultimate.alloc(2);call write~init~int(10, #t~string148.base, #t~string148.offset, 1);call write~init~int(0, #t~string148.base, 1 + #t~string148.offset, 1);call #t~string151.base, #t~string151.offset := #Ultimate.alloc(9);~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; 6307#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; 6521#L1599true havoc valid_product_#res;havoc valid_product_~retValue_acc~12;havoc valid_product_~retValue_acc~12;valid_product_~retValue_acc~12 := 1;valid_product_#res := valid_product_~retValue_acc~12; 5616#L1607true main_#t~ret13 := valid_product_#res;main_~tmp~8 := main_#t~ret13;havoc main_#t~ret13; 883#L398true assume 0 != main_~tmp~8; 6470#L367true ~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; 1528#L3284true havoc bigMacCall_#t~ret6, bigMacCall_~tmp~5;havoc bigMacCall_~tmp~5;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~9;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~9; 2180#L1502true assume 0 == getOrigin_~person;getOrigin_~retValue_acc~9 := 4;getOrigin_#res := getOrigin_~retValue_acc~9; 2152#L1527true 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; 273#L771true assume 0 == initPersonOnFloor_~floor; 125#L772true assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 6358#L879-1true callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 5869#L563true assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 899#L575-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~ret102, timeShift_~tmp~23;havoc timeShift_~tmp~23;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~15;havoc areDoorsOpen_~retValue_acc~15;areDoorsOpen_~retValue_acc~15 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~15; 2178#L1855true timeShift_#t~ret102 := areDoorsOpen_#res;timeShift_~tmp~23 := timeShift_#t~ret102;havoc timeShift_#t~ret102; 4418#L2805true assume 0 != timeShift_~tmp~23; 4072#L2806true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 6469#L2481-11true havoc __utac_acc__Specification2_spec__3_#t~ret159, __utac_acc__Specification2_spec__3_#t~ret160, __utac_acc__Specification2_spec__3_#t~ret161, __utac_acc__Specification2_spec__3_#t~ret162, __utac_acc__Specification2_spec__3_#t~ret163, __utac_acc__Specification2_spec__3_#t~ret164, __utac_acc__Specification2_spec__3_~floor~0, __utac_acc__Specification2_spec__3_~tmp~28, __utac_acc__Specification2_spec__3_~tmp___0~11, __utac_acc__Specification2_spec__3_~tmp___1~8, __utac_acc__Specification2_spec__3_~tmp___2~6, __utac_acc__Specification2_spec__3_~tmp___3~5, __utac_acc__Specification2_spec__3_~tmp___4~3;havoc __utac_acc__Specification2_spec__3_~floor~0;havoc __utac_acc__Specification2_spec__3_~tmp~28;havoc __utac_acc__Specification2_spec__3_~tmp___0~11;havoc __utac_acc__Specification2_spec__3_~tmp___1~8;havoc __utac_acc__Specification2_spec__3_~tmp___2~6;havoc __utac_acc__Specification2_spec__3_~tmp___3~5;havoc __utac_acc__Specification2_spec__3_~tmp___4~3;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~14;havoc getCurrentFloorID_~retValue_acc~14;getCurrentFloorID_~retValue_acc~14 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~14; 2245#L1846-2true __utac_acc__Specification2_spec__3_#t~ret159 := getCurrentFloorID_#res;__utac_acc__Specification2_spec__3_~tmp~28 := __utac_acc__Specification2_spec__3_#t~ret159;havoc __utac_acc__Specification2_spec__3_#t~ret159;__utac_acc__Specification2_spec__3_~floor~0 := __utac_acc__Specification2_spec__3_~tmp~28; 2552#L3329true assume 0 == __utac_acc__Specification2_spec__3_~floor~0; 2714#L3330true assume 0 != ~floorButtons_spc2_0~0;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~15;havoc areDoorsOpen_~retValue_acc~15;areDoorsOpen_~retValue_acc~15 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~15; 2171#L1855-1true __utac_acc__Specification2_spec__3_#t~ret160 := areDoorsOpen_#res;__utac_acc__Specification2_spec__3_~tmp___4~3 := __utac_acc__Specification2_spec__3_#t~ret160;havoc __utac_acc__Specification2_spec__3_#t~ret160; 4135#L3334true assume 0 != __utac_acc__Specification2_spec__3_~tmp___4~3;~floorButtons_spc2_0~0 := 0; 935#L3389true cleanup_~i~0 := 0; 5532#L197-2true [2018-12-08 14:23:24,568 INFO L796 eck$LassoCheckResult]: Loop: 5532#L197-2true assume !false; 5601#L198true cleanup_~__cil_tmp4~0 := ~cleanupTimeShifts~0 - 1; 5504#L201true assume cleanup_~i~0 < cleanup_~__cil_tmp4~0;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~13;havoc isBlocked_~retValue_acc~13;isBlocked_~retValue_acc~13 := ~blocked~0;isBlocked_#res := isBlocked_~retValue_acc~13; 2270#L1688true cleanup_#t~ret7 := isBlocked_#res;cleanup_~tmp___0~0 := cleanup_#t~ret7;havoc cleanup_#t~ret7; 6021#L205true assume 1 != cleanup_~tmp___0~0; 6020#L205-1true havoc isIdle_#res;havoc isIdle_#t~ret57, isIdle_~retValue_acc~20, isIdle_~tmp~15;havoc isIdle_~retValue_acc~20;havoc isIdle_~tmp~15;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret52, anyStopRequested_#t~ret53, anyStopRequested_#t~ret54, anyStopRequested_#t~ret55, anyStopRequested_#t~ret56, anyStopRequested_~retValue_acc~19, anyStopRequested_~tmp~14, anyStopRequested_~tmp___0~2, anyStopRequested_~tmp___1~1, anyStopRequested_~tmp___2~1, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~19;havoc anyStopRequested_~tmp~14;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~2;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~2; 3459#L500-122true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~2 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~2; 6272#L527-122true anyStopRequested_#t~ret52 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret52;havoc anyStopRequested_#t~ret52; 6486#L1954true assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~19 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~19; 557#L2018true isIdle_#t~ret57 := anyStopRequested_#res;isIdle_~tmp~15 := isIdle_#t~ret57;havoc isIdle_#t~ret57;isIdle_~retValue_acc~20 := (if 0 == isIdle_~tmp~15 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~20; 2179#L2031true cleanup_#t~ret8 := isIdle_#res;cleanup_~tmp~6 := cleanup_#t~ret8;havoc cleanup_#t~ret8; 1077#L217true assume !(0 != cleanup_~tmp~6);havoc timeShift_#t~ret102, timeShift_~tmp~23;havoc timeShift_~tmp~23;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~15;havoc areDoorsOpen_~retValue_acc~15;areDoorsOpen_~retValue_acc~15 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~15; 2164#L1855-6true timeShift_#t~ret102 := areDoorsOpen_#res;timeShift_~tmp~23 := timeShift_#t~ret102;havoc timeShift_#t~ret102; 4389#L2805-1true assume 0 != timeShift_~tmp~23; 4051#L2806-2true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 6468#L2481-23true havoc __utac_acc__Specification2_spec__3_#t~ret159, __utac_acc__Specification2_spec__3_#t~ret160, __utac_acc__Specification2_spec__3_#t~ret161, __utac_acc__Specification2_spec__3_#t~ret162, __utac_acc__Specification2_spec__3_#t~ret163, __utac_acc__Specification2_spec__3_#t~ret164, __utac_acc__Specification2_spec__3_~floor~0, __utac_acc__Specification2_spec__3_~tmp~28, __utac_acc__Specification2_spec__3_~tmp___0~11, __utac_acc__Specification2_spec__3_~tmp___1~8, __utac_acc__Specification2_spec__3_~tmp___2~6, __utac_acc__Specification2_spec__3_~tmp___3~5, __utac_acc__Specification2_spec__3_~tmp___4~3;havoc __utac_acc__Specification2_spec__3_~floor~0;havoc __utac_acc__Specification2_spec__3_~tmp~28;havoc __utac_acc__Specification2_spec__3_~tmp___0~11;havoc __utac_acc__Specification2_spec__3_~tmp___1~8;havoc __utac_acc__Specification2_spec__3_~tmp___2~6;havoc __utac_acc__Specification2_spec__3_~tmp___3~5;havoc __utac_acc__Specification2_spec__3_~tmp___4~3;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~14;havoc getCurrentFloorID_~retValue_acc~14;getCurrentFloorID_~retValue_acc~14 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~14; 2248#L1846-5true __utac_acc__Specification2_spec__3_#t~ret159 := getCurrentFloorID_#res;__utac_acc__Specification2_spec__3_~tmp~28 := __utac_acc__Specification2_spec__3_#t~ret159;havoc __utac_acc__Specification2_spec__3_#t~ret159;__utac_acc__Specification2_spec__3_~floor~0 := __utac_acc__Specification2_spec__3_~tmp~28; 2546#L3329-1true assume 0 == __utac_acc__Specification2_spec__3_~floor~0; 2722#L3330-1true assume 0 != ~floorButtons_spc2_0~0;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~15;havoc areDoorsOpen_~retValue_acc~15;areDoorsOpen_~retValue_acc~15 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~15; 2166#L1855-7true __utac_acc__Specification2_spec__3_#t~ret160 := areDoorsOpen_#res;__utac_acc__Specification2_spec__3_~tmp___4~3 := __utac_acc__Specification2_spec__3_#t~ret160;havoc __utac_acc__Specification2_spec__3_#t~ret160; 4103#L3334-2true assume 0 != __utac_acc__Specification2_spec__3_~tmp___4~3;~floorButtons_spc2_0~0 := 0; 940#L3389-1true cleanup_~i~0 := 1 + cleanup_~i~0; 5532#L197-2true [2018-12-08 14:23:24,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:23:24,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1007385687, now seen corresponding path program 1 times [2018-12-08 14:23:24,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:23:24,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:23:24,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:23:24,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:23:24,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:23:24,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:23:24,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:23:24,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 14:23:24,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 14:23:24,723 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 14:23:24,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:23:24,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1624084183, now seen corresponding path program 1 times [2018-12-08 14:23:24,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:23:24,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:23:24,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:23:24,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:23:24,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:23:24,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:23:24,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:23:24,894 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 84 [2018-12-08 14:23:25,049 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2018-12-08 14:23:25,058 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 14:23:25,059 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 14:23:25,059 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 14:23:25,059 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 14:23:25,059 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-08 14:23:25,059 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 14:23:25,060 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 14:23:25,060 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 14:23:25,060 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec2_product22_false-unreach-call_true-termination.cil.c_Iteration1_Loop [2018-12-08 14:23:25,060 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 14:23:25,060 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 14:23:25,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:23:25,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:23:25,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:23:25,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:23:25,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:23:25,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:23:25,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:23:25,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:23:25,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:23:25,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:23:25,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:23:25,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:23:25,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:23:25,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:23:25,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:23:25,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:23:25,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:23:25,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:23:25,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:23:25,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:23:25,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:23:25,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:23:25,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:23:25,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:23:25,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:23:25,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:23:25,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:23:25,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:23:25,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:23:25,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:23:25,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:23:25,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:23:25,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:23:25,370 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 14:23:25,371 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5af4ea3d-9293-44d0-b003-9516b3b9a578/bin-2019/uautomizer/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-12-08 14:23:25,374 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 14:23:25,374 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 14:23:25,380 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 14:23:25,380 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification2_spec__3_~tmp___1~8=0} Honda state: {ULTIMATE.start___utac_acc__Specification2_spec__3_~tmp___1~8=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5af4ea3d-9293-44d0-b003-9516b3b9a578/bin-2019/uautomizer/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-12-08 14:23:25,396 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 14:23:25,396 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 14:23:25,399 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 14:23:25,399 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_isIdle_#t~ret57=0} Honda state: {ULTIMATE.start_isIdle_#t~ret57=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5af4ea3d-9293-44d0-b003-9516b3b9a578/bin-2019/uautomizer/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-12-08 14:23:25,415 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 14:23:25,415 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 14:23:25,417 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 14:23:25,417 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_#t~ret102=0} Honda state: {ULTIMATE.start_timeShift_#t~ret102=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5af4ea3d-9293-44d0-b003-9516b3b9a578/bin-2019/uautomizer/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-12-08 14:23:25,436 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 14:23:25,436 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 14:23:25,438 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 14:23:25,438 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification2_spec__3_#t~ret164=0} Honda state: {ULTIMATE.start___utac_acc__Specification2_spec__3_#t~ret164=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5af4ea3d-9293-44d0-b003-9516b3b9a578/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 14:23:25,455 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 14:23:25,456 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5af4ea3d-9293-44d0-b003-9516b3b9a578/bin-2019/uautomizer/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-12-08 14:23:25,484 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-08 14:23:25,485 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 14:23:37,507 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2018-12-08 14:23:37,510 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 14:23:37,510 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 14:23:37,510 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 14:23:37,510 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 14:23:37,510 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 14:23:37,510 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 14:23:37,510 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 14:23:37,510 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 14:23:37,510 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec2_product22_false-unreach-call_true-termination.cil.c_Iteration1_Loop [2018-12-08 14:23:37,511 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 14:23:37,511 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 14:23:37,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:23:37,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:23:37,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:23:37,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:23:37,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:23:37,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:23: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-12-08 14:23:37,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:23:37,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:23:37,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:23:37,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:23:37,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:23:37,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-12-08 14:23:37,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:23:37,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:23:37,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:23:37,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:23:37,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:23:37,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:23:37,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:23:37,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:23:37,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:23:37,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:23:37,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:23:37,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:23:37,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:23:37,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-12-08 14:23:37,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:23:37,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:23:37,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:23:37,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:23:37,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:23:37,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:23:37,771 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 14:23:37,775 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 14:23:37,776 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-12-08 14:23:37,777 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:23:37,777 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:23:37,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:23:37,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:23:37,777 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:23:37,778 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 14:23:37,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:23:37,780 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:23:37,780 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-12-08 14:23:37,781 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:23:37,781 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:23:37,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:23:37,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:23:37,781 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:23:37,781 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 14:23:37,781 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:23:37,782 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:23:37,782 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-12-08 14:23:37,782 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:23:37,782 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:23:37,783 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:23:37,783 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:23:37,783 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:23:37,783 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 14:23:37,783 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:23:37,784 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:23:37,784 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-12-08 14:23:37,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:23:37,832 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:23:37,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:23:37,833 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 14:23:37,833 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:23:37,835 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 14:23:37,835 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:23:37,846 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:23:37,846 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-12-08 14:23:37,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:23:37,847 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:23:37,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:23:37,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:23:37,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:23:37,848 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 14:23:37,848 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:23:37,848 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:23:37,849 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-12-08 14:23:37,849 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:23:37,849 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:23:37,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:23:37,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:23:37,850 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:23:37,850 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 14:23:37,850 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:23:37,855 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 14:23:37,861 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-08 14:23:37,861 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-08 14:23:37,863 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 14:23:37,863 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-08 14:23:37,863 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 14:23:37,863 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-12-08 14:23:37,865 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-08 14:23:37,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:23:37,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:23:37,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:23:37,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:23:37,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:23:38,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:23:38,018 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-12-08 14:23:38,019 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6747 states. Second operand 5 states. [2018-12-08 14:23:38,327 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6747 states.. Second operand 5 states. Result 10170 states and 19250 transitions. Complement of second has 9 states. [2018-12-08 14:23:38,328 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-12-08 14:23:38,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-08 14:23:38,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12839 transitions. [2018-12-08 14:23:38,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12839 transitions. Stem has 24 letters. Loop has 22 letters. [2018-12-08 14:23:38,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 14:23:38,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12839 transitions. Stem has 46 letters. Loop has 22 letters. [2018-12-08 14:23:38,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 14:23:38,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12839 transitions. Stem has 24 letters. Loop has 44 letters. [2018-12-08 14:23:38,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 14:23:38,342 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10170 states and 19250 transitions. [2018-12-08 14:23:38,401 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 14:23:38,402 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10170 states to 0 states and 0 transitions. [2018-12-08 14:23:38,403 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-08 14:23:38,403 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-08 14:23:38,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-08 14:23:38,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 14:23:38,404 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 14:23:38,404 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 14:23:38,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 14:23:38,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 14:23:38,408 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2018-12-08 14:23:38,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:23:38,410 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-12-08 14:23:38,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-08 14:23:38,411 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-12-08 14:23:38,411 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 14:23:38,411 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-12-08 14:23:38,411 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-08 14:23:38,411 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-08 14:23:38,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-08 14:23:38,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 14:23:38,412 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 14:23:38,412 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 14:23:38,412 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 14:23:38,412 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-08 14:23:38,412 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-08 14:23:38,412 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 14:23:38,412 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-08 14:23:38,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.12 02:23:38 BoogieIcfgContainer [2018-12-08 14:23:38,418 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-08 14:23:38,418 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 14:23:38,418 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 14:23:38,418 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 14:23:38,419 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 02:23:24" (3/4) ... [2018-12-08 14:23:38,421 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-08 14:23:38,421 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 14:23:38,422 INFO L168 Benchmark]: Toolchain (without parser) took 20317.71 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 704.6 MB). Free memory was 950.6 MB in the beginning and 1.3 GB in the end (delta: -384.8 MB). Peak memory consumption was 319.9 MB. Max. memory is 11.5 GB. [2018-12-08 14:23:38,422 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 14:23:38,423 INFO L168 Benchmark]: CACSL2BoogieTranslator took 492.72 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -110.6 MB). Peak memory consumption was 45.3 MB. Max. memory is 11.5 GB. [2018-12-08 14:23:38,423 INFO L168 Benchmark]: Boogie Procedure Inliner took 165.76 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 988.8 MB in the end (delta: 72.5 MB). Peak memory consumption was 72.5 MB. Max. memory is 11.5 GB. [2018-12-08 14:23:38,424 INFO L168 Benchmark]: Boogie Preprocessor took 191.33 ms. Allocated memory is still 1.1 GB. Free memory was 988.8 MB in the beginning and 923.3 MB in the end (delta: 65.5 MB). Peak memory consumption was 65.5 MB. Max. memory is 11.5 GB. [2018-12-08 14:23:38,424 INFO L168 Benchmark]: RCFGBuilder took 5386.30 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 342.4 MB). Free memory was 923.3 MB in the beginning and 1.2 GB in the end (delta: -309.0 MB). Peak memory consumption was 490.8 MB. Max. memory is 11.5 GB. [2018-12-08 14:23:38,425 INFO L168 Benchmark]: BuchiAutomizer took 14075.51 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 260.0 MB). Free memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: -103.1 MB). Peak memory consumption was 157.0 MB. Max. memory is 11.5 GB. [2018-12-08 14:23:38,425 INFO L168 Benchmark]: Witness Printer took 3.38 ms. Allocated memory is still 1.7 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 14:23:38,427 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 492.72 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -110.6 MB). Peak memory consumption was 45.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 165.76 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 988.8 MB in the end (delta: 72.5 MB). Peak memory consumption was 72.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 191.33 ms. Allocated memory is still 1.1 GB. Free memory was 988.8 MB in the beginning and 923.3 MB in the end (delta: 65.5 MB). Peak memory consumption was 65.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 5386.30 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 342.4 MB). Free memory was 923.3 MB in the beginning and 1.2 GB in the end (delta: -309.0 MB). Peak memory consumption was 490.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 14075.51 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 260.0 MB). Free memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: -103.1 MB). Peak memory consumption was 157.0 MB. Max. memory is 11.5 GB. * Witness Printer took 3.38 ms. Allocated memory is still 1.7 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function cleanupTimeShifts + -1 * i and consists of 6 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 14.0s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 13.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.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: 12805 SDtfs, 25576 SDslu, 6419 SDs, 0 SdLazy, 9 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s 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: 62ms VariablesStem: 0 VariablesLoop: 5 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 1 LassoNonterminationAnalysisTime: 12.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...