./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/product-lines/elevator_spec2_product32_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_6e8cf9e8-6379-4613-afac-e8266d8428f8/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6e8cf9e8-6379-4613-afac-e8266d8428f8/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6e8cf9e8-6379-4613-afac-e8266d8428f8/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6e8cf9e8-6379-4613-afac-e8266d8428f8/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/product-lines/elevator_spec2_product32_false-unreach-call_true-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_6e8cf9e8-6379-4613-afac-e8266d8428f8/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6e8cf9e8-6379-4613-afac-e8266d8428f8/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 1ce3ea2e188fd0be186a6acc6b1f5b17e2df2a3a ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 13:29:39,008 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 13:29:39,009 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 13:29:39,014 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 13:29:39,015 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 13:29:39,015 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 13:29:39,016 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 13:29:39,016 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 13:29:39,017 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 13:29:39,018 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 13:29:39,018 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 13:29:39,018 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 13:29:39,019 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 13:29:39,019 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 13:29:39,020 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 13:29:39,020 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 13:29:39,020 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 13:29:39,021 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 13:29:39,022 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 13:29:39,023 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 13:29:39,023 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 13:29:39,024 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 13:29:39,025 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 13:29:39,025 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 13:29:39,025 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 13:29:39,026 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 13:29:39,026 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 13:29:39,027 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 13:29:39,027 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 13:29:39,027 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 13:29:39,028 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 13:29:39,028 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 13:29:39,028 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 13:29:39,028 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 13:29:39,028 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 13:29:39,029 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 13:29:39,029 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6e8cf9e8-6379-4613-afac-e8266d8428f8/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-02 13:29:39,036 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 13:29:39,037 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 13:29:39,037 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 13:29:39,037 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 13:29:39,038 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 13:29:39,038 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-02 13:29:39,038 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-02 13:29:39,038 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-02 13:29:39,038 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-02 13:29:39,038 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-02 13:29:39,038 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-02 13:29:39,038 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 13:29:39,038 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 13:29:39,038 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 13:29:39,038 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 13:29:39,039 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 13:29:39,039 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 13:29:39,039 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-02 13:29:39,039 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-02 13:29:39,039 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-02 13:29:39,039 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 13:29:39,039 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 13:29:39,039 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-02 13:29:39,039 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 13:29:39,039 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-02 13:29:39,039 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 13:29:39,039 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 13:29:39,040 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-02 13:29:39,040 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 13:29:39,040 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 13:29:39,040 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-02 13:29:39,040 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-02 13:29:39,040 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_6e8cf9e8-6379-4613-afac-e8266d8428f8/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 -> 1ce3ea2e188fd0be186a6acc6b1f5b17e2df2a3a [2018-12-02 13:29:39,057 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 13:29:39,064 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 13:29:39,066 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 13:29:39,067 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 13:29:39,067 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 13:29:39,067 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6e8cf9e8-6379-4613-afac-e8266d8428f8/bin-2019/uautomizer/../../sv-benchmarks/c/product-lines/elevator_spec2_product32_false-unreach-call_true-termination.cil.c [2018-12-02 13:29:39,100 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6e8cf9e8-6379-4613-afac-e8266d8428f8/bin-2019/uautomizer/data/694ffe90f/5455312299d344c2986de3078301bd55/FLAGc34d76be2 [2018-12-02 13:29:39,577 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 13:29:39,577 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6e8cf9e8-6379-4613-afac-e8266d8428f8/sv-benchmarks/c/product-lines/elevator_spec2_product32_false-unreach-call_true-termination.cil.c [2018-12-02 13:29:39,587 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6e8cf9e8-6379-4613-afac-e8266d8428f8/bin-2019/uautomizer/data/694ffe90f/5455312299d344c2986de3078301bd55/FLAGc34d76be2 [2018-12-02 13:29:39,595 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6e8cf9e8-6379-4613-afac-e8266d8428f8/bin-2019/uautomizer/data/694ffe90f/5455312299d344c2986de3078301bd55 [2018-12-02 13:29:39,597 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 13:29:39,598 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 13:29:39,598 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 13:29:39,598 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 13:29:39,600 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 13:29:39,601 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:29:39" (1/1) ... [2018-12-02 13:29:39,602 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21f103c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:29:39, skipping insertion in model container [2018-12-02 13:29:39,603 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:29:39" (1/1) ... [2018-12-02 13:29:39,607 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 13:29:39,636 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 13:29:39,954 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 13:29:39,966 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 13:29:40,057 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 13:29:40,101 INFO L195 MainTranslator]: Completed translation [2018-12-02 13:29:40,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:29:40 WrapperNode [2018-12-02 13:29:40,102 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 13:29:40,102 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 13:29:40,103 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 13:29:40,103 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 13:29:40,110 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:29:40" (1/1) ... [2018-12-02 13:29:40,129 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:29:40" (1/1) ... [2018-12-02 13:29:40,307 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 13:29:40,307 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 13:29:40,307 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 13:29:40,307 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 13:29:40,314 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:29:40" (1/1) ... [2018-12-02 13:29:40,314 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:29:40" (1/1) ... [2018-12-02 13:29:40,338 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:29:40" (1/1) ... [2018-12-02 13:29:40,338 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:29:40" (1/1) ... [2018-12-02 13:29:40,398 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:29:40" (1/1) ... [2018-12-02 13:29:40,464 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:29:40" (1/1) ... [2018-12-02 13:29:40,493 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:29:40" (1/1) ... [2018-12-02 13:29:40,536 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 13:29:40,537 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 13:29:40,537 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 13:29:40,537 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 13:29:40,537 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:29:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6e8cf9e8-6379-4613-afac-e8266d8428f8/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-02 13:29:40,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 13:29:40,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-02 13:29:40,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 13:29:40,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 13:29:46,277 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 13:29:46,277 INFO L280 CfgBuilder]: Removed 1709 assue(true) statements. [2018-12-02 13:29:46,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:29:46 BoogieIcfgContainer [2018-12-02 13:29:46,277 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 13:29:46,278 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-02 13:29:46,278 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-02 13:29:46,280 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-02 13:29:46,280 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 13:29:46,280 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.12 01:29:39" (1/3) ... [2018-12-02 13:29:46,281 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1c633cc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 01:29:46, skipping insertion in model container [2018-12-02 13:29:46,281 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 13:29:46,281 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:29:40" (2/3) ... [2018-12-02 13:29:46,281 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1c633cc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 01:29:46, skipping insertion in model container [2018-12-02 13:29:46,281 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 13:29:46,282 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:29:46" (3/3) ... [2018-12-02 13:29:46,283 INFO L375 chiAutomizerObserver]: Analyzing ICFG elevator_spec2_product32_false-unreach-call_true-termination.cil.c [2018-12-02 13:29:46,319 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 13:29:46,319 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-02 13:29:46,319 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-02 13:29:46,319 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-02 13:29:46,320 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 13:29:46,320 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 13:29:46,320 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-02 13:29:46,320 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 13:29:46,320 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-02 13:29:46,382 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7183 states. [2018-12-02 13:29:46,460 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3581 [2018-12-02 13:29:46,460 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 13:29:46,460 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 13:29:46,470 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-02 13:29:46,470 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-02 13:29:46,470 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-02 13:29:46,470 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7183 states. [2018-12-02 13:29:46,508 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3581 [2018-12-02 13:29:46,508 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 13:29:46,508 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 13:29:46,510 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-02 13:29:46,510 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-02 13:29:46,514 INFO L794 eck$LassoCheckResult]: Stem: 1624#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~0 := 0;~floorButtons_spc2_0~0 := 0;~floorButtons_spc2_1~0 := 0;~floorButtons_spc2_2~0 := 0;~floorButtons_spc2_3~0 := 0;~floorButtons_spc2_4~0 := 0;~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~string24.base, #t~string24.offset := #Ultimate.alloc(30);call #t~string25.base, #t~string25.offset := #Ultimate.alloc(9);call #t~string26.base, #t~string26.offset := #Ultimate.alloc(21);call #t~string27.base, #t~string27.offset := #Ultimate.alloc(30);call #t~string28.base, #t~string28.offset := #Ultimate.alloc(9);call #t~string29.base, #t~string29.offset := #Ultimate.alloc(21);call #t~string33.base, #t~string33.offset := #Ultimate.alloc(30);call #t~string34.base, #t~string34.offset := #Ultimate.alloc(9);call #t~string35.base, #t~string35.offset := #Ultimate.alloc(25);call #t~string36.base, #t~string36.offset := #Ultimate.alloc(30);call #t~string37.base, #t~string37.offset := #Ultimate.alloc(9);call #t~string38.base, #t~string38.offset := #Ultimate.alloc(25);~cleanupTimeShifts~0 := 12;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0;call #t~string123.base, #t~string123.offset := #Ultimate.alloc(10);call #t~string125.base, #t~string125.offset := #Ultimate.alloc(4);call write~init~int(91, #t~string125.base, #t~string125.offset, 1);call write~init~int(95, #t~string125.base, 1 + #t~string125.offset, 1);call write~init~int(93, #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(91, #t~string127.base, #t~string127.offset, 1);call write~init~int(93, #t~string127.base, 1 + #t~string127.offset, 1);call write~init~int(32, #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(5);call write~init~int(32, #t~string129.base, #t~string129.offset, 1);call write~init~int(97, #t~string129.base, 1 + #t~string129.offset, 1);call write~init~int(116, #t~string129.base, 2 + #t~string129.offset, 1);call write~init~int(32, #t~string129.base, 3 + #t~string129.offset, 1);call write~init~int(0, #t~string129.base, 4 + #t~string129.offset, 1);call #t~string131.base, #t~string131.offset := #Ultimate.alloc(3);call write~init~int(37, #t~string131.base, #t~string131.offset, 1);call write~init~int(105, #t~string131.base, 1 + #t~string131.offset, 1);call write~init~int(0, #t~string131.base, 2 + #t~string131.offset, 1);call #t~string133.base, #t~string133.offset := #Ultimate.alloc(10);call #t~string135.base, #t~string135.offset := #Ultimate.alloc(3);call write~init~int(117, #t~string135.base, #t~string135.offset, 1);call write~init~int(112, #t~string135.base, 1 + #t~string135.offset, 1);call write~init~int(0, #t~string135.base, 2 + #t~string135.offset, 1);call #t~string137.base, #t~string137.offset := #Ultimate.alloc(5);call write~init~int(100, #t~string137.base, #t~string137.offset, 1);call write~init~int(111, #t~string137.base, 1 + #t~string137.offset, 1);call write~init~int(119, #t~string137.base, 2 + #t~string137.offset, 1);call write~init~int(110, #t~string137.base, 3 + #t~string137.offset, 1);call write~init~int(0, #t~string137.base, 4 + #t~string137.offset, 1);call #t~string139.base, #t~string139.offset := #Ultimate.alloc(7);call write~init~int(32, #t~string139.base, #t~string139.offset, 1);call write~init~int(73, #t~string139.base, 1 + #t~string139.offset, 1);call write~init~int(76, #t~string139.base, 2 + #t~string139.offset, 1);call write~init~int(95, #t~string139.base, 3 + #t~string139.offset, 1);call write~init~int(112, #t~string139.base, 4 + #t~string139.offset, 1);call write~init~int(58, #t~string139.base, 5 + #t~string139.offset, 1);call write~init~int(0, #t~string139.base, 6 + #t~string139.offset, 1);call #t~string141.base, #t~string141.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string141.base, #t~string141.offset, 1);call write~init~int(37, #t~string141.base, 1 + #t~string141.offset, 1);call write~init~int(105, #t~string141.base, 2 + #t~string141.offset, 1);call write~init~int(0, #t~string141.base, 3 + #t~string141.offset, 1);call #t~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~string145.base, #t~string145.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string145.base, #t~string145.offset, 1);call write~init~int(37, #t~string145.base, 1 + #t~string145.offset, 1);call write~init~int(105, #t~string145.base, 2 + #t~string145.offset, 1);call write~init~int(0, #t~string145.base, 3 + #t~string145.offset, 1);call #t~string147.base, #t~string147.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string147.base, #t~string147.offset, 1);call write~init~int(37, #t~string147.base, 1 + #t~string147.offset, 1);call write~init~int(105, #t~string147.base, 2 + #t~string147.offset, 1);call write~init~int(0, #t~string147.base, 3 + #t~string147.offset, 1);call #t~string149.base, #t~string149.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string149.base, #t~string149.offset, 1);call write~init~int(37, #t~string149.base, 1 + #t~string149.offset, 1);call write~init~int(105, #t~string149.base, 2 + #t~string149.offset, 1);call write~init~int(0, #t~string149.base, 3 + #t~string149.offset, 1);call #t~string151.base, #t~string151.offset := #Ultimate.alloc(6);call write~init~int(32, #t~string151.base, #t~string151.offset, 1);call write~init~int(70, #t~string151.base, 1 + #t~string151.offset, 1);call write~init~int(95, #t~string151.base, 2 + #t~string151.offset, 1);call write~init~int(112, #t~string151.base, 3 + #t~string151.offset, 1);call write~init~int(58, #t~string151.base, 4 + #t~string151.offset, 1);call write~init~int(0, #t~string151.base, 5 + #t~string151.offset, 1);call #t~string154.base, #t~string154.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string154.base, #t~string154.offset, 1);call write~init~int(37, #t~string154.base, 1 + #t~string154.offset, 1);call write~init~int(105, #t~string154.base, 2 + #t~string154.offset, 1);call write~init~int(0, #t~string154.base, 3 + #t~string154.offset, 1);call #t~string157.base, #t~string157.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string157.base, #t~string157.offset, 1);call write~init~int(37, #t~string157.base, 1 + #t~string157.offset, 1);call write~init~int(105, #t~string157.base, 2 + #t~string157.offset, 1);call write~init~int(0, #t~string157.base, 3 + #t~string157.offset, 1);call #t~string160.base, #t~string160.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string160.base, #t~string160.offset, 1);call write~init~int(37, #t~string160.base, 1 + #t~string160.offset, 1);call write~init~int(105, #t~string160.base, 2 + #t~string160.offset, 1);call write~init~int(0, #t~string160.base, 3 + #t~string160.offset, 1);call #t~string163.base, #t~string163.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string163.base, #t~string163.offset, 1);call write~init~int(37, #t~string163.base, 1 + #t~string163.offset, 1);call write~init~int(105, #t~string163.base, 2 + #t~string163.offset, 1);call write~init~int(0, #t~string163.base, 3 + #t~string163.offset, 1);call #t~string166.base, #t~string166.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string166.base, #t~string166.offset, 1);call write~init~int(37, #t~string166.base, 1 + #t~string166.offset, 1);call write~init~int(105, #t~string166.base, 2 + #t~string166.offset, 1);call write~init~int(0, #t~string166.base, 3 + #t~string166.offset, 1);call #t~string168.base, #t~string168.offset := #Ultimate.alloc(2);call write~init~int(10, #t~string168.base, #t~string168.offset, 1);call write~init~int(0, #t~string168.base, 1 + #t~string168.offset, 1);call #t~string171.base, #t~string171.offset := #Ultimate.alloc(9); 6476#L-1true havoc main_#res;havoc main_#t~ret61, main_~retValue_acc~12, main_~tmp~14;havoc main_~retValue_acc~12;havoc main_~tmp~14; 1219#L1286true havoc valid_product_#res;havoc valid_product_~retValue_acc~7;havoc valid_product_~retValue_acc~7;valid_product_~retValue_acc~7 := 1;valid_product_#res := valid_product_~retValue_acc~7; 1047#L1294true main_#t~ret61 := valid_product_#res;main_~tmp~14 := main_#t~ret61;havoc main_#t~ret61; 1661#L1868true assume 0 != main_~tmp~14; 396#L1843true ~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; 1074#L60true havoc bigMacCall_#t~ret54, bigMacCall_~tmp~11;havoc bigMacCall_~tmp~11;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~9;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~9; 873#L1456true assume 0 == getOrigin_~person;getOrigin_~retValue_acc~9 := 4;getOrigin_#res := getOrigin_~retValue_acc~9; 58#L1481true bigMacCall_#t~ret54 := getOrigin_#res;bigMacCall_~tmp~11 := bigMacCall_#t~ret54;havoc bigMacCall_#t~ret54;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~11;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 1030#L587true assume 0 == initPersonOnFloor_~floor; 1009#L588true assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 4450#L695-1true callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 5809#L379true assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 6096#L391-2true havoc cleanup_#t~ret55, cleanup_#t~ret56, cleanup_~i~2, cleanup_~tmp~12, cleanup_~tmp___0~3, cleanup_~__cil_tmp4~2;havoc cleanup_~i~2;havoc cleanup_~tmp~12;havoc cleanup_~tmp___0~3;havoc cleanup_~__cil_tmp4~2;havoc timeShift_#t~ret122, timeShift_~tmp~29;havoc timeShift_~tmp~29;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~15;havoc areDoorsOpen_~retValue_acc~15;areDoorsOpen_~retValue_acc~15 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~15; 6222#L2149true timeShift_#t~ret122 := areDoorsOpen_#res;timeShift_~tmp~29 := timeShift_#t~ret122;havoc timeShift_#t~ret122; 4574#L3159true assume 0 != timeShift_~tmp~29; 4640#L3160true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 4719#L2805-11true havoc __utac_acc__Specification2_spec__3_#t~ret0, __utac_acc__Specification2_spec__3_#t~ret1, __utac_acc__Specification2_spec__3_#t~ret2, __utac_acc__Specification2_spec__3_#t~ret3, __utac_acc__Specification2_spec__3_#t~ret4, __utac_acc__Specification2_spec__3_#t~ret5, __utac_acc__Specification2_spec__3_~floor~0, __utac_acc__Specification2_spec__3_~tmp~0, __utac_acc__Specification2_spec__3_~tmp___0~0, __utac_acc__Specification2_spec__3_~tmp___1~0, __utac_acc__Specification2_spec__3_~tmp___2~0, __utac_acc__Specification2_spec__3_~tmp___3~0, __utac_acc__Specification2_spec__3_~tmp___4~0;havoc __utac_acc__Specification2_spec__3_~floor~0;havoc __utac_acc__Specification2_spec__3_~tmp~0;havoc __utac_acc__Specification2_spec__3_~tmp___0~0;havoc __utac_acc__Specification2_spec__3_~tmp___1~0;havoc __utac_acc__Specification2_spec__3_~tmp___2~0;havoc __utac_acc__Specification2_spec__3_~tmp___3~0;havoc __utac_acc__Specification2_spec__3_~tmp___4~0;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; 5770#L2140-10true __utac_acc__Specification2_spec__3_#t~ret0 := getCurrentFloorID_#res;__utac_acc__Specification2_spec__3_~tmp~0 := __utac_acc__Specification2_spec__3_#t~ret0;havoc __utac_acc__Specification2_spec__3_#t~ret0;__utac_acc__Specification2_spec__3_~floor~0 := __utac_acc__Specification2_spec__3_~tmp~0; 1712#L105true assume 0 == __utac_acc__Specification2_spec__3_~floor~0; 1692#L106true 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; 6213#L2149-1true __utac_acc__Specification2_spec__3_#t~ret1 := areDoorsOpen_#res;__utac_acc__Specification2_spec__3_~tmp___4~0 := __utac_acc__Specification2_spec__3_#t~ret1;havoc __utac_acc__Specification2_spec__3_#t~ret1; 1633#L110true assume 0 != __utac_acc__Specification2_spec__3_~tmp___4~0;~floorButtons_spc2_0~0 := 0; 4641#L165true cleanup_~i~2 := 0; 2242#L1675-2true [2018-12-02 13:29:46,514 INFO L796 eck$LassoCheckResult]: Loop: 2242#L1675-2true assume !false; 2357#L1676true cleanup_~__cil_tmp4~2 := ~cleanupTimeShifts~0 - 1; 2192#L1679true assume cleanup_~i~2 < cleanup_~__cil_tmp4~2;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~13;havoc isBlocked_~retValue_acc~13;isBlocked_~retValue_acc~13 := ~blocked~0;isBlocked_#res := isBlocked_~retValue_acc~13; 5839#L1963true cleanup_#t~ret55 := isBlocked_#res;cleanup_~tmp___0~3 := cleanup_#t~ret55;havoc cleanup_#t~ret55; 2831#L1683true assume 1 != cleanup_~tmp___0~3; 2833#L1683-1true havoc isIdle_#res;havoc isIdle_#t~ret70, isIdle_~retValue_acc~20, isIdle_~tmp~19;havoc isIdle_~retValue_acc~20;havoc isIdle_~tmp~19;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret65, anyStopRequested_#t~ret66, anyStopRequested_#t~ret67, anyStopRequested_#t~ret68, anyStopRequested_#t~ret69, anyStopRequested_~retValue_acc~19, anyStopRequested_~tmp~18, anyStopRequested_~tmp___0~5, anyStopRequested_~tmp___1~4, anyStopRequested_~tmp___2~2, anyStopRequested_~tmp___3~1;havoc anyStopRequested_~retValue_acc~19;havoc anyStopRequested_~tmp~18;havoc anyStopRequested_~tmp___0~5;havoc anyStopRequested_~tmp___1~4;havoc anyStopRequested_~tmp___2~2;havoc anyStopRequested_~tmp___3~1;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~0;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~0; 5298#L316-130true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~0 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~0; 4364#L343-130true anyStopRequested_#t~ret65 := isFloorCalling_#res;anyStopRequested_~tmp___3~1 := anyStopRequested_#t~ret65;havoc anyStopRequested_#t~ret65; 4831#L2248true assume 0 != anyStopRequested_~tmp___3~1;anyStopRequested_~retValue_acc~19 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~19; 6000#L2312true isIdle_#t~ret70 := anyStopRequested_#res;isIdle_~tmp~19 := isIdle_#t~ret70;havoc isIdle_#t~ret70;isIdle_~retValue_acc~20 := (if 0 == isIdle_~tmp~19 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~20; 6118#L2325true cleanup_#t~ret56 := isIdle_#res;cleanup_~tmp~12 := cleanup_#t~ret56;havoc cleanup_#t~ret56; 1648#L1695true assume !(0 != cleanup_~tmp~12);havoc timeShift_#t~ret122, timeShift_~tmp~29;havoc timeShift_~tmp~29;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; 6218#L2149-6true timeShift_#t~ret122 := areDoorsOpen_#res;timeShift_~tmp~29 := timeShift_#t~ret122;havoc timeShift_#t~ret122; 4578#L3159-1true assume 0 != timeShift_~tmp~29; 4642#L3160-2true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 4608#L2805-23true havoc __utac_acc__Specification2_spec__3_#t~ret0, __utac_acc__Specification2_spec__3_#t~ret1, __utac_acc__Specification2_spec__3_#t~ret2, __utac_acc__Specification2_spec__3_#t~ret3, __utac_acc__Specification2_spec__3_#t~ret4, __utac_acc__Specification2_spec__3_#t~ret5, __utac_acc__Specification2_spec__3_~floor~0, __utac_acc__Specification2_spec__3_~tmp~0, __utac_acc__Specification2_spec__3_~tmp___0~0, __utac_acc__Specification2_spec__3_~tmp___1~0, __utac_acc__Specification2_spec__3_~tmp___2~0, __utac_acc__Specification2_spec__3_~tmp___3~0, __utac_acc__Specification2_spec__3_~tmp___4~0;havoc __utac_acc__Specification2_spec__3_~floor~0;havoc __utac_acc__Specification2_spec__3_~tmp~0;havoc __utac_acc__Specification2_spec__3_~tmp___0~0;havoc __utac_acc__Specification2_spec__3_~tmp___1~0;havoc __utac_acc__Specification2_spec__3_~tmp___2~0;havoc __utac_acc__Specification2_spec__3_~tmp___3~0;havoc __utac_acc__Specification2_spec__3_~tmp___4~0;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; 5807#L2140-21true __utac_acc__Specification2_spec__3_#t~ret0 := getCurrentFloorID_#res;__utac_acc__Specification2_spec__3_~tmp~0 := __utac_acc__Specification2_spec__3_#t~ret0;havoc __utac_acc__Specification2_spec__3_#t~ret0;__utac_acc__Specification2_spec__3_~floor~0 := __utac_acc__Specification2_spec__3_~tmp~0; 1710#L105-1true assume 0 == __utac_acc__Specification2_spec__3_~floor~0; 1666#L106-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; 6204#L2149-7true __utac_acc__Specification2_spec__3_#t~ret1 := areDoorsOpen_#res;__utac_acc__Specification2_spec__3_~tmp___4~0 := __utac_acc__Specification2_spec__3_#t~ret1;havoc __utac_acc__Specification2_spec__3_#t~ret1; 1627#L110-2true assume 0 != __utac_acc__Specification2_spec__3_~tmp___4~0;~floorButtons_spc2_0~0 := 0; 4643#L165-1true cleanup_~i~2 := 1 + cleanup_~i~2; 2242#L1675-2true [2018-12-02 13:29:46,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:29:46,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1561602685, now seen corresponding path program 1 times [2018-12-02 13:29:46,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:29:46,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:29:46,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:29:46,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:29:46,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:29:46,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:29:46,663 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-02 13:29:46,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:29:46,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 13:29:46,668 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 13:29:46,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:29:46,669 INFO L82 PathProgramCache]: Analyzing trace with hash -760732559, now seen corresponding path program 1 times [2018-12-02 13:29:46,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:29:46,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:29:46,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:29:46,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:29:46,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:29:46,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:29:46,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:29:46,849 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 82 [2018-12-02 13:29:46,915 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 13:29:46,916 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 13:29:46,916 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 13:29:46,916 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 13:29:46,916 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-02 13:29:46,917 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 13:29:46,917 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 13:29:46,917 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 13:29:46,917 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec2_product32_false-unreach-call_true-termination.cil.c_Iteration1_Loop [2018-12-02 13:29:46,917 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 13:29:46,917 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 13:29:46,933 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-02 13:29:46,936 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-02 13:29:46,950 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-02 13:29:46,951 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-02 13:29:46,952 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-02 13:29:46,957 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-02 13:29:46,958 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-02 13:29:46,959 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-02 13:29:46,962 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-02 13:29:46,966 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-02 13:29:46,967 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-02 13:29:46,969 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-02 13:29:46,970 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-02 13:29:46,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:29:46,972 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-02 13:29:46,973 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-02 13:29:46,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:29:46,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:29:46,978 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-02 13:29:46,979 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-02 13:29:46,980 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-02 13:29:46,981 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-02 13:29:46,983 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-02 13:29:46,984 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-02 13:29:46,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:29:46,989 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-02 13:29:46,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:29:46,999 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-02 13:29:47,003 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-02 13:29:47,004 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-02 13:29:47,010 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-02 13:29:47,012 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-02 13:29:47,013 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-02 13:29:47,228 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 13:29:47,228 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6e8cf9e8-6379-4613-afac-e8266d8428f8/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-02 13:29:47,234 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 13:29:47,234 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 13:29:47,240 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 13:29:47,240 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_~tmp___1~4=0} Honda state: {ULTIMATE.start_anyStopRequested_~tmp___1~4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6e8cf9e8-6379-4613-afac-e8266d8428f8/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-02 13:29:47,257 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 13:29:47,257 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 13:29:47,264 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 13:29:47,264 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_areDoorsOpen_#res=-5, ULTIMATE.start_timeShift_~tmp~29=-5, ULTIMATE.start___utac_acc__Specification2_spec__3_~tmp___4~0=-5, ~doorState~0=-5, ULTIMATE.start_areDoorsOpen_~retValue_acc~15=-5} Honda state: {ULTIMATE.start_areDoorsOpen_#res=-5, ULTIMATE.start_timeShift_~tmp~29=-5, ULTIMATE.start___utac_acc__Specification2_spec__3_~tmp___4~0=-5, ~doorState~0=-5, ULTIMATE.start_areDoorsOpen_~retValue_acc~15=-5} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6e8cf9e8-6379-4613-afac-e8266d8428f8/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-02 13:29:47,289 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 13:29:47,289 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 13:29:47,292 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 13:29:47,292 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_#t~ret122=0} Honda state: {ULTIMATE.start_timeShift_#t~ret122=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6e8cf9e8-6379-4613-afac-e8266d8428f8/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-02 13:29:47,318 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 13:29:47,318 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 13:29:47,320 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 13:29:47,320 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification2_spec__3_~tmp___2~0=0} Honda state: {ULTIMATE.start___utac_acc__Specification2_spec__3_~tmp___2~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6e8cf9e8-6379-4613-afac-e8266d8428f8/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-02 13:29:47,344 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 13:29:47,344 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6e8cf9e8-6379-4613-afac-e8266d8428f8/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-02 13:29:47,365 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 13:29:47,365 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 13:29:57,148 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-02 13:29:57,151 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 13:29:57,151 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 13:29:57,151 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 13:29:57,151 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 13:29:57,151 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 13:29:57,151 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 13:29:57,151 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 13:29:57,151 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 13:29:57,151 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec2_product32_false-unreach-call_true-termination.cil.c_Iteration1_Loop [2018-12-02 13:29:57,151 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 13:29:57,152 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 13:29:57,153 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-02 13:29:57,159 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-02 13:29:57,165 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-02 13:29:57,166 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-02 13:29:57,167 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-02 13:29:57,168 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-02 13:29:57,176 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-02 13:29:57,178 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-02 13:29:57,179 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-02 13:29:57,180 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-02 13:29:57,185 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-02 13:29:57,186 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-02 13:29:57,187 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-02 13:29:57,189 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-02 13:29:57,190 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-02 13:29:57,191 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-02 13:29:57,192 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-02 13:29:57,195 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-02 13:29:57,197 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-02 13:29:57,198 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-02 13:29:57,199 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-02 13:29:57,200 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-02 13:29:57,202 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-02 13:29:57,205 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-02 13:29:57,209 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-02 13:29:57,211 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-02 13:29:57,214 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-02 13:29:57,220 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-02 13:29:57,230 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-02 13:29:57,231 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-02 13:29:57,232 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-02 13:29:57,238 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-02 13:29:57,239 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-02 13:29:57,502 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 13:29:57,505 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 13:29:57,506 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 13:29:57,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:29:57,507 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:29:57,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:29:57,508 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 13:29:57,508 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:29:57,510 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 13:29:57,510 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:29:57,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:29:57,518 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 13:29:57,518 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:29:57,518 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:29:57,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:29:57,519 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 13:29:57,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:29:57,519 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 13:29:57,519 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:29:57,527 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:29:57,527 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-02 13:29:57,527 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:29:57,527 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:29:57,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:29:57,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:29:57,527 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:29:57,528 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:29:57,528 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:29:57,528 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:29:57,528 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-02 13:29:57,529 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:29:57,529 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:29:57,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:29:57,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:29:57,529 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:29:57,529 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:29:57,529 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:29:57,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:29:57,530 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-02 13:29:57,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:29:57,530 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:29:57,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:29:57,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:29:57,530 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:29:57,531 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:29:57,531 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:29:57,532 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:29:57,532 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 13:29:57,532 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:29:57,532 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:29:57,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:29:57,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:29:57,532 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:29:57,533 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:29:57,533 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:29:57,534 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:29:57,535 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-02 13:29:57,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:29:57,535 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:29:57,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:29:57,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:29:57,535 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:29:57,536 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:29:57,536 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:29:57,536 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:29:57,536 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-02 13:29:57,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:29:57,537 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:29:57,537 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:29:57,537 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:29:57,537 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:29:57,537 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:29:57,537 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:29:57,538 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:29:57,538 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-02 13:29:57,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:29:57,538 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:29:57,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:29:57,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:29:57,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:29:57,539 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:29:57,539 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:29:57,539 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:29:57,539 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-02 13:29:57,540 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:29:57,540 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:29:57,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:29:57,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:29:57,540 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:29:57,540 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:29:57,540 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:29:57,543 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:29:57,543 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-02 13:29:57,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:29:57,544 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:29:57,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:29:57,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:29:57,544 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:29:57,544 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:29:57,544 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:29:57,545 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:29:57,545 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-02 13:29:57,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:29:57,545 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:29:57,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:29:57,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:29:57,546 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:29:57,546 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:29:57,546 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:29:57,546 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:29:57,546 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-02 13:29:57,547 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:29:57,547 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:29:57,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:29:57,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:29:57,547 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:29:57,547 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:29:57,547 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:29:57,548 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:29:57,548 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-02 13:29:57,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:29:57,549 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:29:57,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:29:57,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:29:57,549 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:29:57,549 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:29:57,549 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:29:57,550 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:29:57,550 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-02 13:29:57,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:29:57,550 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:29:57,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:29:57,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:29:57,550 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:29:57,551 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:29:57,551 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:29:57,551 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:29:57,551 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-02 13:29:57,552 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:29:57,552 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:29:57,552 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:29:57,552 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:29:57,552 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:29:57,552 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:29:57,552 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:29:57,553 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:29:57,553 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-02 13:29:57,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:29:57,553 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:29:57,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:29:57,553 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 13:29:57,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:29:57,554 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 13:29:57,554 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:29:57,556 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:29:57,557 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-02 13:29:57,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:29:57,557 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:29:57,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:29:57,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:29:57,557 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:29:57,558 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:29:57,558 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:29:57,558 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:29:57,559 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-02 13:29:57,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:29:57,559 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:29:57,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:29:57,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:29:57,559 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:29:57,559 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:29:57,559 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:29:57,560 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:29:57,560 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-02 13:29:57,560 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:29:57,560 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:29:57,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:29:57,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:29:57,561 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:29:57,561 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:29:57,561 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:29:57,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:29:57,562 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-02 13:29:57,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:29:57,562 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:29:57,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:29:57,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:29:57,562 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:29:57,562 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:29:57,563 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:29:57,563 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:29:57,563 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-02 13:29:57,563 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:29:57,564 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:29:57,564 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:29:57,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:29:57,564 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:29:57,564 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:29:57,564 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:29:57,565 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:29:57,565 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-02 13:29:57,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:29:57,565 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:29:57,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:29:57,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:29:57,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:29:57,566 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:29:57,566 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:29:57,566 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:29:57,566 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-02 13:29:57,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:29:57,567 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:29:57,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:29:57,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:29:57,567 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:29:57,567 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:29:57,567 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:29:57,568 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:29:57,568 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-02 13:29:57,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:29:57,568 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:29:57,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:29:57,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:29:57,569 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:29:57,569 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:29:57,569 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:29:57,569 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:29:57,569 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-02 13:29:57,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:29:57,570 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:29:57,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:29:57,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:29:57,570 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:29:57,570 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:29:57,570 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:29:57,571 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:29:57,571 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-02 13:29:57,572 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:29:57,572 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:29:57,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:29:57,572 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:29:57,572 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:29:57,572 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:29:57,572 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:29:57,573 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:29:57,573 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-02 13:29:57,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:29:57,574 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:29:57,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:29:57,574 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:29:57,574 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:29:57,574 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:29:57,574 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:29:57,577 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 13:29:57,581 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-02 13:29:57,581 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 13:29:57,582 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 13:29:57,582 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 13:29:57,582 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 13:29:57,583 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~cleanupTimeShifts~0, ULTIMATE.start_cleanup_~i~2) = 1*~cleanupTimeShifts~0 - 1*ULTIMATE.start_cleanup_~i~2 Supporting invariants [] [2018-12-02 13:29:57,584 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-02 13:29:57,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:29:57,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:29:57,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 13:29:57,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:29:57,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 13:29:57,709 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-02 13:29:57,723 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-02 13:29:57,724 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7183 states. Second operand 5 states. [2018-12-02 13:29:58,111 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7183 states.. Second operand 5 states. Result 10824 states and 20378 transitions. Complement of second has 9 states. [2018-12-02 13:29:58,112 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-02 13:29:58,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-02 13:29:58,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13591 transitions. [2018-12-02 13:29:58,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13591 transitions. Stem has 24 letters. Loop has 22 letters. [2018-12-02 13:29:58,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 13:29:58,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13591 transitions. Stem has 46 letters. Loop has 22 letters. [2018-12-02 13:29:58,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 13:29:58,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13591 transitions. Stem has 24 letters. Loop has 44 letters. [2018-12-02 13:29:58,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 13:29:58,126 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10824 states and 20378 transitions. [2018-12-02 13:29:58,178 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 13:29:58,179 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10824 states to 0 states and 0 transitions. [2018-12-02 13:29:58,180 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-02 13:29:58,180 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-02 13:29:58,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-02 13:29:58,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 13:29:58,181 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 13:29:58,181 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 13:29:58,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 13:29:58,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 13:29:58,185 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2018-12-02 13:29:58,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:29:58,186 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-12-02 13:29:58,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-02 13:29:58,187 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-12-02 13:29:58,187 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 13:29:58,187 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 13:29:58,187 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-02 13:29:58,187 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-02 13:29:58,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-02 13:29:58,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 13:29:58,187 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 13:29:58,187 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 13:29:58,187 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 13:29:58,188 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-02 13:29:58,188 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-02 13:29:58,188 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 13:29:58,188 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-02 13:29:58,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.12 01:29:58 BoogieIcfgContainer [2018-12-02 13:29:58,192 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-02 13:29:58,192 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 13:29:58,192 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 13:29:58,192 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 13:29:58,193 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:29:46" (3/4) ... [2018-12-02 13:29:58,195 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 13:29:58,195 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 13:29:58,196 INFO L168 Benchmark]: Toolchain (without parser) took 18598.06 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 584.6 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -169.3 MB). Peak memory consumption was 415.3 MB. Max. memory is 11.5 GB. [2018-12-02 13:29:58,196 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 13:29:58,197 INFO L168 Benchmark]: CACSL2BoogieTranslator took 503.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -141.3 MB). Peak memory consumption was 48.1 MB. Max. memory is 11.5 GB. [2018-12-02 13:29:58,197 INFO L168 Benchmark]: Boogie Procedure Inliner took 204.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 83.5 MB). Peak memory consumption was 83.5 MB. Max. memory is 11.5 GB. [2018-12-02 13:29:58,198 INFO L168 Benchmark]: Boogie Preprocessor took 229.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 948.8 MB in the end (delta: 64.9 MB). Peak memory consumption was 64.9 MB. Max. memory is 11.5 GB. [2018-12-02 13:29:58,198 INFO L168 Benchmark]: RCFGBuilder took 5740.75 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 438.8 MB). Free memory was 948.8 MB in the beginning and 1.2 GB in the end (delta: -223.7 MB). Peak memory consumption was 410.8 MB. Max. memory is 11.5 GB. [2018-12-02 13:29:58,199 INFO L168 Benchmark]: BuchiAutomizer took 11914.36 ms. Allocated memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: -2.1 MB). Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 47.3 MB). Peak memory consumption was 45.2 MB. Max. memory is 11.5 GB. [2018-12-02 13:29:58,199 INFO L168 Benchmark]: Witness Printer took 2.79 ms. Allocated memory is still 1.6 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 13:29:58,202 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 503.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -141.3 MB). Peak memory consumption was 48.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 204.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 83.5 MB). Peak memory consumption was 83.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 229.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 948.8 MB in the end (delta: 64.9 MB). Peak memory consumption was 64.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 5740.75 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 438.8 MB). Free memory was 948.8 MB in the beginning and 1.2 GB in the end (delta: -223.7 MB). Peak memory consumption was 410.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 11914.36 ms. Allocated memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: -2.1 MB). Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 47.3 MB). Peak memory consumption was 45.2 MB. Max. memory is 11.5 GB. * Witness Printer took 2.79 ms. Allocated memory is still 1.6 GB. Free memory is still 1.1 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 11.8s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 11.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. 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: 13557 SDtfs, 20326 SDslu, 6795 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: 12ms VariablesStem: 0 VariablesLoop: 5 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 9.8s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...