./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/product-lines/elevator_spec1_product30_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_cd18ddc9-b4a9-4831-9964-f7aa6b251320/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_cd18ddc9-b4a9-4831-9964-f7aa6b251320/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_cd18ddc9-b4a9-4831-9964-f7aa6b251320/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_cd18ddc9-b4a9-4831-9964-f7aa6b251320/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/product-lines/elevator_spec1_product30_false-unreach-call_true-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_cd18ddc9-b4a9-4831-9964-f7aa6b251320/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_cd18ddc9-b4a9-4831-9964-f7aa6b251320/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 b315ebc9aa87bd57f2da57a423e25fac07ed5d29 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 20:57:11,330 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 20:57:11,331 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 20:57:11,337 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 20:57:11,337 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 20:57:11,338 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 20:57:11,338 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 20:57:11,339 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 20:57:11,340 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 20:57:11,340 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 20:57:11,340 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 20:57:11,341 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 20:57:11,341 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 20:57:11,342 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 20:57:11,342 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 20:57:11,342 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 20:57:11,343 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 20:57:11,344 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 20:57:11,344 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 20:57:11,345 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 20:57:11,346 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 20:57:11,346 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 20:57:11,347 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 20:57:11,347 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 20:57:11,347 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 20:57:11,348 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 20:57:11,348 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 20:57:11,349 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 20:57:11,349 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 20:57:11,349 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 20:57:11,350 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 20:57:11,350 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 20:57:11,350 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 20:57:11,350 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 20:57:11,350 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 20:57:11,351 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 20:57:11,351 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_cd18ddc9-b4a9-4831-9964-f7aa6b251320/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-02 20:57:11,358 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 20:57:11,358 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 20:57:11,359 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 20:57:11,359 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 20:57:11,359 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 20:57:11,359 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-02 20:57:11,359 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-02 20:57:11,360 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-02 20:57:11,360 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-02 20:57:11,360 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-02 20:57:11,360 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-02 20:57:11,360 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 20:57:11,360 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 20:57:11,360 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 20:57:11,360 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 20:57:11,360 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 20:57:11,360 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 20:57:11,360 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-02 20:57:11,360 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-02 20:57:11,360 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-02 20:57:11,361 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 20:57:11,361 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 20:57:11,361 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-02 20:57:11,361 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 20:57:11,361 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-02 20:57:11,361 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 20:57:11,361 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 20:57:11,361 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-02 20:57:11,361 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 20:57:11,361 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 20:57:11,361 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-02 20:57:11,362 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-02 20:57:11,362 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_cd18ddc9-b4a9-4831-9964-f7aa6b251320/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 -> b315ebc9aa87bd57f2da57a423e25fac07ed5d29 [2018-12-02 20:57:11,379 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 20:57:11,388 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 20:57:11,390 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 20:57:11,391 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 20:57:11,392 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 20:57:11,392 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_cd18ddc9-b4a9-4831-9964-f7aa6b251320/bin-2019/uautomizer/../../sv-benchmarks/c/product-lines/elevator_spec1_product30_false-unreach-call_true-termination.cil.c [2018-12-02 20:57:11,429 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cd18ddc9-b4a9-4831-9964-f7aa6b251320/bin-2019/uautomizer/data/a0c16092a/e98d97915e0b49b284bebc51aaf358c3/FLAG0eaf9916d [2018-12-02 20:57:11,935 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 20:57:11,936 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_cd18ddc9-b4a9-4831-9964-f7aa6b251320/sv-benchmarks/c/product-lines/elevator_spec1_product30_false-unreach-call_true-termination.cil.c [2018-12-02 20:57:11,945 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cd18ddc9-b4a9-4831-9964-f7aa6b251320/bin-2019/uautomizer/data/a0c16092a/e98d97915e0b49b284bebc51aaf358c3/FLAG0eaf9916d [2018-12-02 20:57:11,953 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_cd18ddc9-b4a9-4831-9964-f7aa6b251320/bin-2019/uautomizer/data/a0c16092a/e98d97915e0b49b284bebc51aaf358c3 [2018-12-02 20:57:11,955 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 20:57:11,956 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 20:57:11,956 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 20:57:11,956 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 20:57:11,958 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 20:57:11,959 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:57:11" (1/1) ... [2018-12-02 20:57:11,960 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64f81737 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:57:11, skipping insertion in model container [2018-12-02 20:57:11,961 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:57:11" (1/1) ... [2018-12-02 20:57:11,965 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 20:57:11,996 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 20:57:12,313 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 20:57:12,323 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 20:57:12,397 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 20:57:12,424 INFO L195 MainTranslator]: Completed translation [2018-12-02 20:57:12,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:57:12 WrapperNode [2018-12-02 20:57:12,424 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 20:57:12,425 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 20:57:12,425 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 20:57:12,425 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 20:57:12,430 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:57:12" (1/1) ... [2018-12-02 20:57:12,445 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:57:12" (1/1) ... [2018-12-02 20:57:12,593 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 20:57:12,593 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 20:57:12,593 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 20:57:12,593 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 20:57:12,600 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:57:12" (1/1) ... [2018-12-02 20:57:12,600 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:57:12" (1/1) ... [2018-12-02 20:57:12,621 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:57:12" (1/1) ... [2018-12-02 20:57:12,621 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:57:12" (1/1) ... [2018-12-02 20:57:12,675 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:57:12" (1/1) ... [2018-12-02 20:57:12,739 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:57:12" (1/1) ... [2018-12-02 20:57:12,765 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:57:12" (1/1) ... [2018-12-02 20:57:12,811 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 20:57:12,811 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 20:57:12,812 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 20:57:12,812 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 20:57:12,812 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:57:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cd18ddc9-b4a9-4831-9964-f7aa6b251320/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 20:57:12,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 20:57:12,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-02 20:57:12,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 20:57:12,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 20:57:18,578 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 20:57:18,579 INFO L280 CfgBuilder]: Removed 1529 assue(true) statements. [2018-12-02 20:57:18,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:57:18 BoogieIcfgContainer [2018-12-02 20:57:18,579 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 20:57:18,580 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-02 20:57:18,580 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-02 20:57:18,583 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-02 20:57:18,584 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 20:57:18,584 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.12 08:57:11" (1/3) ... [2018-12-02 20:57:18,585 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7cf6861d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 08:57:18, skipping insertion in model container [2018-12-02 20:57:18,585 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 20:57:18,585 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:57:12" (2/3) ... [2018-12-02 20:57:18,586 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7cf6861d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 08:57:18, skipping insertion in model container [2018-12-02 20:57:18,586 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 20:57:18,586 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:57:18" (3/3) ... [2018-12-02 20:57:18,587 INFO L375 chiAutomizerObserver]: Analyzing ICFG elevator_spec1_product30_false-unreach-call_true-termination.cil.c [2018-12-02 20:57:18,629 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 20:57:18,629 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-02 20:57:18,630 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-02 20:57:18,630 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-02 20:57:18,630 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 20:57:18,630 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 20:57:18,630 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-02 20:57:18,630 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 20:57:18,630 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-02 20:57:18,684 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6902 states. [2018-12-02 20:57:18,761 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3411 [2018-12-02 20:57:18,761 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 20:57:18,761 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 20:57:18,772 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:57:18,772 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 20:57:18,772 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-02 20:57:18,772 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6902 states. [2018-12-02 20:57:18,810 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3411 [2018-12-02 20:57:18,810 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 20:57:18,810 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 20:57:18,813 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:57:18,813 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 20:57:18,817 INFO L794 eck$LassoCheckResult]: Stem: 1556#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~weight~0 := 0;~maximumWeight~0 := 100;~blocked~0 := 0;~cleanupTimeShifts~0 := 12;~head~0.base, ~head~0.offset := 0, 0;call #t~string24.base, #t~string24.offset := #Ultimate.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);~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0;call #t~string110.base, #t~string110.offset := #Ultimate.alloc(10);call #t~string112.base, #t~string112.offset := #Ultimate.alloc(4);call write~init~int(91, #t~string112.base, #t~string112.offset, 1);call write~init~int(95, #t~string112.base, 1 + #t~string112.offset, 1);call write~init~int(93, #t~string112.base, 2 + #t~string112.offset, 1);call write~init~int(0, #t~string112.base, 3 + #t~string112.offset, 1);call #t~string114.base, #t~string114.offset := #Ultimate.alloc(4);call write~init~int(91, #t~string114.base, #t~string114.offset, 1);call write~init~int(93, #t~string114.base, 1 + #t~string114.offset, 1);call write~init~int(32, #t~string114.base, 2 + #t~string114.offset, 1);call write~init~int(0, #t~string114.base, 3 + #t~string114.offset, 1);call #t~string116.base, #t~string116.offset := #Ultimate.alloc(5);call write~init~int(32, #t~string116.base, #t~string116.offset, 1);call write~init~int(97, #t~string116.base, 1 + #t~string116.offset, 1);call write~init~int(116, #t~string116.base, 2 + #t~string116.offset, 1);call write~init~int(32, #t~string116.base, 3 + #t~string116.offset, 1);call write~init~int(0, #t~string116.base, 4 + #t~string116.offset, 1);call #t~string118.base, #t~string118.offset := #Ultimate.alloc(3);call write~init~int(37, #t~string118.base, #t~string118.offset, 1);call write~init~int(105, #t~string118.base, 1 + #t~string118.offset, 1);call write~init~int(0, #t~string118.base, 2 + #t~string118.offset, 1);call #t~string120.base, #t~string120.offset := #Ultimate.alloc(10);call #t~string122.base, #t~string122.offset := #Ultimate.alloc(3);call write~init~int(117, #t~string122.base, #t~string122.offset, 1);call write~init~int(112, #t~string122.base, 1 + #t~string122.offset, 1);call write~init~int(0, #t~string122.base, 2 + #t~string122.offset, 1);call #t~string124.base, #t~string124.offset := #Ultimate.alloc(5);call write~init~int(100, #t~string124.base, #t~string124.offset, 1);call write~init~int(111, #t~string124.base, 1 + #t~string124.offset, 1);call write~init~int(119, #t~string124.base, 2 + #t~string124.offset, 1);call write~init~int(110, #t~string124.base, 3 + #t~string124.offset, 1);call write~init~int(0, #t~string124.base, 4 + #t~string124.offset, 1);call #t~string126.base, #t~string126.offset := #Ultimate.alloc(7);call write~init~int(32, #t~string126.base, #t~string126.offset, 1);call write~init~int(73, #t~string126.base, 1 + #t~string126.offset, 1);call write~init~int(76, #t~string126.base, 2 + #t~string126.offset, 1);call write~init~int(95, #t~string126.base, 3 + #t~string126.offset, 1);call write~init~int(112, #t~string126.base, 4 + #t~string126.offset, 1);call write~init~int(58, #t~string126.base, 5 + #t~string126.offset, 1);call write~init~int(0, #t~string126.base, 6 + #t~string126.offset, 1);call #t~string128.base, #t~string128.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string128.base, #t~string128.offset, 1);call write~init~int(37, #t~string128.base, 1 + #t~string128.offset, 1);call write~init~int(105, #t~string128.base, 2 + #t~string128.offset, 1);call write~init~int(0, #t~string128.base, 3 + #t~string128.offset, 1);call #t~string130.base, #t~string130.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string130.base, #t~string130.offset, 1);call write~init~int(37, #t~string130.base, 1 + #t~string130.offset, 1);call write~init~int(105, #t~string130.base, 2 + #t~string130.offset, 1);call write~init~int(0, #t~string130.base, 3 + #t~string130.offset, 1);call #t~string132.base, #t~string132.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string132.base, #t~string132.offset, 1);call write~init~int(37, #t~string132.base, 1 + #t~string132.offset, 1);call write~init~int(105, #t~string132.base, 2 + #t~string132.offset, 1);call write~init~int(0, #t~string132.base, 3 + #t~string132.offset, 1);call #t~string134.base, #t~string134.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string134.base, #t~string134.offset, 1);call write~init~int(37, #t~string134.base, 1 + #t~string134.offset, 1);call write~init~int(105, #t~string134.base, 2 + #t~string134.offset, 1);call write~init~int(0, #t~string134.base, 3 + #t~string134.offset, 1);call #t~string136.base, #t~string136.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string136.base, #t~string136.offset, 1);call write~init~int(37, #t~string136.base, 1 + #t~string136.offset, 1);call write~init~int(105, #t~string136.base, 2 + #t~string136.offset, 1);call write~init~int(0, #t~string136.base, 3 + #t~string136.offset, 1);call #t~string138.base, #t~string138.offset := #Ultimate.alloc(6);call write~init~int(32, #t~string138.base, #t~string138.offset, 1);call write~init~int(70, #t~string138.base, 1 + #t~string138.offset, 1);call write~init~int(95, #t~string138.base, 2 + #t~string138.offset, 1);call write~init~int(112, #t~string138.base, 3 + #t~string138.offset, 1);call write~init~int(58, #t~string138.base, 4 + #t~string138.offset, 1);call write~init~int(0, #t~string138.base, 5 + #t~string138.offset, 1);call #t~string141.base, #t~string141.offset := #Ultimate.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~string144.base, #t~string144.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string144.base, #t~string144.offset, 1);call write~init~int(37, #t~string144.base, 1 + #t~string144.offset, 1);call write~init~int(105, #t~string144.base, 2 + #t~string144.offset, 1);call write~init~int(0, #t~string144.base, 3 + #t~string144.offset, 1);call #t~string147.base, #t~string147.offset := #Ultimate.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~string150.base, #t~string150.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string150.base, #t~string150.offset, 1);call write~init~int(37, #t~string150.base, 1 + #t~string150.offset, 1);call write~init~int(105, #t~string150.base, 2 + #t~string150.offset, 1);call write~init~int(0, #t~string150.base, 3 + #t~string150.offset, 1);call #t~string153.base, #t~string153.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string153.base, #t~string153.offset, 1);call write~init~int(37, #t~string153.base, 1 + #t~string153.offset, 1);call write~init~int(105, #t~string153.base, 2 + #t~string153.offset, 1);call write~init~int(0, #t~string153.base, 3 + #t~string153.offset, 1);call #t~string155.base, #t~string155.offset := #Ultimate.alloc(2);call write~init~int(10, #t~string155.base, #t~string155.offset, 1);call write~init~int(0, #t~string155.base, 1 + #t~string155.offset, 1);call #t~string158.base, #t~string158.offset := #Ultimate.alloc(9);~landingButtons_spc1_0~0 := 0;~landingButtons_spc1_1~0 := 0;~landingButtons_spc1_2~0 := 0;~landingButtons_spc1_3~0 := 0;~landingButtons_spc1_4~0 := 0; 6568#L-1true havoc main_#res;havoc main_#t~ret55, main_~retValue_acc~6, main_~tmp~13;havoc main_~retValue_acc~6;havoc main_~tmp~13; 6319#L557true havoc valid_product_#res;havoc valid_product_~retValue_acc~4;havoc valid_product_~retValue_acc~4;valid_product_~retValue_acc~4 := 1;valid_product_#res := valid_product_~retValue_acc~4; 6101#L565true main_#t~ret55 := valid_product_#res;main_~tmp~13 := main_#t~ret55;havoc main_#t~ret55; 6330#L909true assume 0 != main_~tmp~13; 6508#L882true ~landingButtons_spc1_0~0 := 0;~landingButtons_spc1_1~0 := 0;~landingButtons_spc1_2~0 := 0;~landingButtons_spc1_3~0 := 0;~landingButtons_spc1_4~0 := 0; 4246#L3307true havoc bigMacCall_#t~ret48, bigMacCall_~tmp~10;havoc bigMacCall_~tmp~10;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~11;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~11; 1130#L1640true assume 0 == getOrigin_~person;getOrigin_~retValue_acc~11 := 4;getOrigin_#res := getOrigin_~retValue_acc~11; 451#L1665true bigMacCall_#t~ret48 := getOrigin_#res;bigMacCall_~tmp~10 := bigMacCall_#t~ret48;havoc bigMacCall_#t~ret48;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~10;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 1090#L1287true assume 0 == initPersonOnFloor_~floor; 1119#L1288true assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 4146#L1395-1true callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID, callOnFloor_~__utac__ad__arg1~0;callOnFloor_~floorID := callOnFloor_#in~floorID;havoc callOnFloor_~__utac__ad__arg1~0;callOnFloor_~__utac__ad__arg1~0 := callOnFloor_~floorID;__utac_acc__Specification1_spec__2_#in~floor := callOnFloor_~__utac__ad__arg1~0;havoc __utac_acc__Specification1_spec__2_~floor;__utac_acc__Specification1_spec__2_~floor := __utac_acc__Specification1_spec__2_#in~floor; 5495#L3314true assume 0 == __utac_acc__Specification1_spec__2_~floor;~landingButtons_spc1_0~0 := 1; 3224#L3326-2true assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 6138#L1091-2true havoc angelinaCall_#t~ret45, angelinaCall_~tmp~7;havoc angelinaCall_~tmp~7;getOrigin_#in~person := 2;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~11;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~11; 1132#L1640-1true assume 0 == getOrigin_~person;getOrigin_~retValue_acc~11 := 4;getOrigin_#res := getOrigin_~retValue_acc~11; 455#L1665-1true angelinaCall_#t~ret45 := getOrigin_#res;angelinaCall_~tmp~7 := angelinaCall_#t~ret45;havoc angelinaCall_#t~ret45;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 2, angelinaCall_~tmp~7;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 1093#L1287-1true assume 0 == initPersonOnFloor_~floor; 1120#L1288-2true assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 4150#L1395-3true callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID, callOnFloor_~__utac__ad__arg1~0;callOnFloor_~floorID := callOnFloor_#in~floorID;havoc callOnFloor_~__utac__ad__arg1~0;callOnFloor_~__utac__ad__arg1~0 := callOnFloor_~floorID;__utac_acc__Specification1_spec__2_#in~floor := callOnFloor_~__utac__ad__arg1~0;havoc __utac_acc__Specification1_spec__2_~floor;__utac_acc__Specification1_spec__2_~floor := __utac_acc__Specification1_spec__2_#in~floor; 5500#L3314-2true assume 0 == __utac_acc__Specification1_spec__2_~floor;~landingButtons_spc1_0~0 := 1; 3217#L3326-5true assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 6131#L1091-5true havoc cleanup_#t~ret49, cleanup_#t~ret50, cleanup_~i~2, cleanup_~tmp~11, cleanup_~tmp___0~2, cleanup_~__cil_tmp4~2;havoc cleanup_~i~2;havoc cleanup_~tmp~11;havoc cleanup_~tmp___0~2;havoc cleanup_~__cil_tmp4~2;havoc timeShift_#t~ret109, timeShift_~tmp~26;havoc timeShift_~tmp~26;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~15;havoc areDoorsOpen_~retValue_acc~15;areDoorsOpen_~retValue_acc~15 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~15; 6229#L1969true timeShift_#t~ret109 := areDoorsOpen_#res;timeShift_~tmp~26 := timeShift_#t~ret109;havoc timeShift_#t~ret109; 2753#L2919true assume 0 != timeShift_~tmp~26; 2810#L2920true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 4795#L2595-11true havoc __utac_acc__Specification1_spec__3_#t~ret160, __utac_acc__Specification1_spec__3_#t~ret161, __utac_acc__Specification1_spec__3_#t~ret162, __utac_acc__Specification1_spec__3_#t~ret163, __utac_acc__Specification1_spec__3_#t~ret164, __utac_acc__Specification1_spec__3_#t~ret165, __utac_acc__Specification1_spec__3_~floor~0, __utac_acc__Specification1_spec__3_~tmp~29, __utac_acc__Specification1_spec__3_~tmp___0~11, __utac_acc__Specification1_spec__3_~tmp___1~8, __utac_acc__Specification1_spec__3_~tmp___2~6, __utac_acc__Specification1_spec__3_~tmp___3~5, __utac_acc__Specification1_spec__3_~tmp___4~3;havoc __utac_acc__Specification1_spec__3_~floor~0;havoc __utac_acc__Specification1_spec__3_~tmp~29;havoc __utac_acc__Specification1_spec__3_~tmp___0~11;havoc __utac_acc__Specification1_spec__3_~tmp___1~8;havoc __utac_acc__Specification1_spec__3_~tmp___2~6;havoc __utac_acc__Specification1_spec__3_~tmp___3~5;havoc __utac_acc__Specification1_spec__3_~tmp___4~3;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~14;havoc getCurrentFloorID_~retValue_acc~14;getCurrentFloorID_~retValue_acc~14 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~14; 5952#L1960-2true __utac_acc__Specification1_spec__3_#t~ret160 := getCurrentFloorID_#res;__utac_acc__Specification1_spec__3_~tmp~29 := __utac_acc__Specification1_spec__3_#t~ret160;havoc __utac_acc__Specification1_spec__3_#t~ret160;__utac_acc__Specification1_spec__3_~floor~0 := __utac_acc__Specification1_spec__3_~tmp~29; 6467#L3352true assume 0 == __utac_acc__Specification1_spec__3_~floor~0; 6408#L3353true assume 0 != ~landingButtons_spc1_0~0;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~15;havoc areDoorsOpen_~retValue_acc~15;areDoorsOpen_~retValue_acc~15 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~15; 6231#L1969-1true __utac_acc__Specification1_spec__3_#t~ret161 := areDoorsOpen_#res;__utac_acc__Specification1_spec__3_~tmp___4~3 := __utac_acc__Specification1_spec__3_#t~ret161;havoc __utac_acc__Specification1_spec__3_#t~ret161; 6770#L3357true assume 0 != __utac_acc__Specification1_spec__3_~tmp___4~3;~landingButtons_spc1_0~0 := 0; 143#L3412true cleanup_~i~2 := 0; 6773#L714-2true [2018-12-02 20:57:18,817 INFO L796 eck$LassoCheckResult]: Loop: 6773#L714-2true assume !false; 6796#L715true cleanup_~__cil_tmp4~2 := ~cleanupTimeShifts~0 - 1; 6766#L718true assume cleanup_~i~2 < cleanup_~__cil_tmp4~2;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~13;havoc isBlocked_~retValue_acc~13;isBlocked_~retValue_acc~13 := ~blocked~0;isBlocked_#res := isBlocked_~retValue_acc~13; 5755#L1787true cleanup_#t~ret49 := isBlocked_#res;cleanup_~tmp___0~2 := cleanup_#t~ret49;havoc cleanup_#t~ret49; 5980#L722true assume 1 != cleanup_~tmp___0~2; 5981#L722-1true havoc isIdle_#res;havoc isIdle_#t~ret64, isIdle_~retValue_acc~20, isIdle_~tmp~18;havoc isIdle_~retValue_acc~20;havoc isIdle_~tmp~18;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret59, anyStopRequested_#t~ret60, anyStopRequested_#t~ret61, anyStopRequested_#t~ret62, anyStopRequested_#t~ret63, anyStopRequested_~retValue_acc~19, anyStopRequested_~tmp~17, anyStopRequested_~tmp___0~4, anyStopRequested_~tmp___1~3, anyStopRequested_~tmp___2~1, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~19;havoc anyStopRequested_~tmp~17;havoc anyStopRequested_~tmp___0~4;havoc anyStopRequested_~tmp___1~3;havoc anyStopRequested_~tmp___2~1;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~7;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~7; 4670#L1011-122true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~7 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~7; 4030#L1038-122true anyStopRequested_#t~ret59 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret59;havoc anyStopRequested_#t~ret59; 4711#L2068true assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~19 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~19; 5960#L2132true isIdle_#t~ret64 := anyStopRequested_#res;isIdle_~tmp~18 := isIdle_#t~ret64;havoc isIdle_#t~ret64;isIdle_~retValue_acc~20 := (if 0 == isIdle_~tmp~18 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~20; 6234#L2145true cleanup_#t~ret50 := isIdle_#res;cleanup_~tmp~11 := cleanup_#t~ret50;havoc cleanup_#t~ret50; 6361#L734true assume !(0 != cleanup_~tmp~11);havoc timeShift_#t~ret109, timeShift_~tmp~26;havoc timeShift_~tmp~26;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~15;havoc areDoorsOpen_~retValue_acc~15;areDoorsOpen_~retValue_acc~15 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~15; 6222#L1969-6true timeShift_#t~ret109 := areDoorsOpen_#res;timeShift_~tmp~26 := timeShift_#t~ret109;havoc timeShift_#t~ret109; 2756#L2919-1true assume 0 != timeShift_~tmp~26; 2811#L2920-2true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 4787#L2595-23true havoc __utac_acc__Specification1_spec__3_#t~ret160, __utac_acc__Specification1_spec__3_#t~ret161, __utac_acc__Specification1_spec__3_#t~ret162, __utac_acc__Specification1_spec__3_#t~ret163, __utac_acc__Specification1_spec__3_#t~ret164, __utac_acc__Specification1_spec__3_#t~ret165, __utac_acc__Specification1_spec__3_~floor~0, __utac_acc__Specification1_spec__3_~tmp~29, __utac_acc__Specification1_spec__3_~tmp___0~11, __utac_acc__Specification1_spec__3_~tmp___1~8, __utac_acc__Specification1_spec__3_~tmp___2~6, __utac_acc__Specification1_spec__3_~tmp___3~5, __utac_acc__Specification1_spec__3_~tmp___4~3;havoc __utac_acc__Specification1_spec__3_~floor~0;havoc __utac_acc__Specification1_spec__3_~tmp~29;havoc __utac_acc__Specification1_spec__3_~tmp___0~11;havoc __utac_acc__Specification1_spec__3_~tmp___1~8;havoc __utac_acc__Specification1_spec__3_~tmp___2~6;havoc __utac_acc__Specification1_spec__3_~tmp___3~5;havoc __utac_acc__Specification1_spec__3_~tmp___4~3;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~14;havoc getCurrentFloorID_~retValue_acc~14;getCurrentFloorID_~retValue_acc~14 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~14; 5948#L1960-5true __utac_acc__Specification1_spec__3_#t~ret160 := getCurrentFloorID_#res;__utac_acc__Specification1_spec__3_~tmp~29 := __utac_acc__Specification1_spec__3_#t~ret160;havoc __utac_acc__Specification1_spec__3_#t~ret160;__utac_acc__Specification1_spec__3_~floor~0 := __utac_acc__Specification1_spec__3_~tmp~29; 6468#L3352-1true assume 0 == __utac_acc__Specification1_spec__3_~floor~0; 6405#L3353-1true assume 0 != ~landingButtons_spc1_0~0;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~15;havoc areDoorsOpen_~retValue_acc~15;areDoorsOpen_~retValue_acc~15 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~15; 6224#L1969-7true __utac_acc__Specification1_spec__3_#t~ret161 := areDoorsOpen_#res;__utac_acc__Specification1_spec__3_~tmp___4~3 := __utac_acc__Specification1_spec__3_#t~ret161;havoc __utac_acc__Specification1_spec__3_#t~ret161; 6771#L3357-2true assume 0 != __utac_acc__Specification1_spec__3_~tmp___4~3;~landingButtons_spc1_0~0 := 0; 144#L3412-1true cleanup_~i~2 := 1 + cleanup_~i~2; 6773#L714-2true [2018-12-02 20:57:18,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:57:18,821 INFO L82 PathProgramCache]: Analyzing trace with hash -745177872, now seen corresponding path program 1 times [2018-12-02 20:57:18,822 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:57:18,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:57:18,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:57:18,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:57:18,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:57:18,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:57:18,968 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 20:57:18,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:57:18,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 20:57:18,972 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 20:57:18,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:57:18,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1113299661, now seen corresponding path program 1 times [2018-12-02 20:57:18,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:57:18,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:57:18,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:57:18,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:57:18,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:57:18,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 20:57:18,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 20:57:19,143 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 84 [2018-12-02 20:57:19,291 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2018-12-02 20:57:19,298 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 20:57:19,298 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 20:57:19,299 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 20:57:19,299 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 20:57:19,299 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-02 20:57:19,299 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 20:57:19,299 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 20:57:19,299 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 20:57:19,299 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec1_product30_false-unreach-call_true-termination.cil.c_Iteration1_Loop [2018-12-02 20:57:19,299 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 20:57:19,299 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 20:57:19,313 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 20:57:19,316 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 20:57:19,318 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 20:57:19,319 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 20:57:19,320 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 20:57:19,330 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 20:57:19,331 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 20:57:19,333 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 20:57:19,338 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 20:57:19,339 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 20:57:19,340 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 20:57:19,341 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 20:57:19,342 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 20:57:19,343 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 20:57:19,344 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 20:57:19,345 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 20:57:19,347 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 20:57:19,352 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 20:57:19,357 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 20:57:19,363 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 20:57:19,364 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 20:57:19,365 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 20:57:19,366 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 20:57:19,367 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 20:57:19,369 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 20:57:19,372 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 20:57:19,373 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 20:57:19,378 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 20:57:19,384 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 20:57:19,385 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 20:57:19,386 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 20:57:19,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:57:19,393 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 20:57:19,614 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 20:57:19,615 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cd18ddc9-b4a9-4831-9964-f7aa6b251320/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 20:57:19,618 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 20:57:19,618 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 20:57:19,625 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 20:57:19,625 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification1_spec__3_#t~ret162=0} Honda state: {ULTIMATE.start___utac_acc__Specification1_spec__3_#t~ret162=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cd18ddc9-b4a9-4831-9964-f7aa6b251320/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 20:57:19,642 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 20:57:19,643 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 20:57:19,645 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 20:57:19,645 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification1_spec__3_#t~ret161=0} Honda state: {ULTIMATE.start___utac_acc__Specification1_spec__3_#t~ret161=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cd18ddc9-b4a9-4831-9964-f7aa6b251320/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 20:57:19,699 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 20:57:19,699 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 20:57:19,703 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 20:57:19,703 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification1_spec__3_#t~ret160=0} Honda state: {ULTIMATE.start___utac_acc__Specification1_spec__3_#t~ret160=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cd18ddc9-b4a9-4831-9964-f7aa6b251320/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 20:57:19,725 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 20:57:19,725 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 20:57:19,727 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 20:57:19,727 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_~tmp___1~3=0} Honda state: {ULTIMATE.start_anyStopRequested_~tmp___1~3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cd18ddc9-b4a9-4831-9964-f7aa6b251320/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 20:57:19,742 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 20:57:19,742 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cd18ddc9-b4a9-4831-9964-f7aa6b251320/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 20:57:19,764 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 20:57:19,764 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 20:57:31,536 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-02 20:57:31,538 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 20:57:31,539 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 20:57:31,539 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 20:57:31,539 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 20:57:31,539 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 20:57:31,539 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 20:57:31,539 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 20:57:31,539 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 20:57:31,539 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec1_product30_false-unreach-call_true-termination.cil.c_Iteration1_Loop [2018-12-02 20:57:31,539 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 20:57:31,539 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 20:57:31,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:57:31,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:57:31,544 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 20:57:31,545 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 20:57:31,554 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 20:57:31,555 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 20:57:31,556 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 20:57:31,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:57:31,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:57:31,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:57:31,570 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 20:57:31,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:57:31,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:57:31,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:57:31,583 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 20:57:31,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:57:31,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:57:31,587 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 20:57:31,588 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 20:57:31,591 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 20:57:31,597 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 20:57:31,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:57:31,604 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 20:57:31,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:57:31,606 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 20:57:31,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:57:31,619 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 20:57:31,631 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 20:57:31,633 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 20:57:31,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:57:31,640 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 20:57:31,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:57:31,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 20:57:31,868 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 20:57:31,871 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 20:57:31,872 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 20:57:31,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:57:31,873 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 20:57:31,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:57:31,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:57:31,874 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:57:31,875 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 20:57:31,875 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 20:57:31,876 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:57:31,877 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 20:57:31,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:57:31,877 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 20:57:31,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:57:31,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:57:31,877 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:57:31,877 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 20:57:31,877 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 20:57:31,878 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:57:31,878 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 20:57:31,878 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:57:31,879 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 20:57:31,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:57:31,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:57:31,879 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:57:31,879 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 20:57:31,879 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 20:57:31,880 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:57:31,880 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 20:57:31,880 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:57:31,880 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 20:57:31,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:57:31,880 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 20:57:31,881 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:57:31,881 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 20:57:31,882 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 20:57:31,888 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:57:31,889 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 20:57:31,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:57:31,889 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 20:57:31,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:57:31,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:57:31,889 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:57:31,889 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 20:57:31,889 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 20:57:31,890 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:57:31,890 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 20:57:31,890 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:57:31,891 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 20:57:31,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:57:31,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:57:31,891 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:57:31,891 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 20:57:31,891 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 20:57:31,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:57:31,892 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 20:57:31,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:57:31,892 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 20:57:31,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:57:31,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:57:31,892 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:57:31,892 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 20:57:31,893 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 20:57:31,893 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:57:31,893 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 20:57:31,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:57:31,894 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 20:57:31,894 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:57:31,894 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:57:31,894 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:57:31,894 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 20:57:31,894 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 20:57:31,897 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:57:31,897 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 20:57:31,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:57:31,897 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 20:57:31,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:57:31,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:57:31,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:57:31,898 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 20:57:31,898 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 20:57:31,898 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:57:31,898 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 20:57:31,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:57:31,899 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 20:57:31,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:57:31,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:57:31,899 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:57:31,899 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 20:57:31,899 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 20:57:31,900 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:57:31,900 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 20:57:31,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:57:31,901 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 20:57:31,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:57:31,901 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 20:57:31,901 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:57:31,902 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 20:57:31,902 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 20:57:31,906 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:57:31,907 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 20:57:31,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:57:31,907 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 20:57:31,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:57:31,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:57:31,907 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:57:31,908 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 20:57:31,908 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 20:57:31,908 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:57:31,908 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 20:57:31,909 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:57:31,909 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 20:57:31,909 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:57:31,909 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:57:31,909 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:57:31,909 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 20:57:31,909 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 20:57:31,910 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:57:31,910 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 20:57:31,910 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:57:31,910 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 20:57:31,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:57:31,911 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:57:31,911 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:57:31,911 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 20:57:31,911 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 20:57:31,911 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:57:31,912 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 20:57:31,912 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:57:31,912 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 20:57:31,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:57:31,912 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:57:31,912 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:57:31,912 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 20:57:31,912 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 20:57:31,913 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:57:31,913 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 20:57:31,913 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:57:31,913 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 20:57:31,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:57:31,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:57:31,914 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:57:31,914 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 20:57:31,914 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 20:57:31,914 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:57:31,915 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 20:57:31,915 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:57:31,915 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 20:57:31,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:57:31,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:57:31,915 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:57:31,915 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 20:57:31,915 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 20:57:31,916 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:57:31,916 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 20:57:31,916 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:57:31,916 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 20:57:31,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:57:31,917 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:57:31,917 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:57:31,917 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 20:57:31,917 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 20:57:31,917 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:57:31,918 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 20:57:31,918 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:57:31,918 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 20:57:31,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:57:31,918 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 20:57:31,918 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:57:31,919 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 20:57:31,919 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 20:57:31,921 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:57:31,921 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 20:57:31,922 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:57:31,922 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 20:57:31,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:57:31,922 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:57:31,922 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:57:31,922 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 20:57:31,922 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 20:57:31,923 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 20:57:31,924 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 20:57:31,924 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 20:57:31,924 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 20:57:31,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 20:57:31,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 20:57:31,924 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 20:57:31,925 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 20:57:31,925 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 20:57:31,927 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 20:57:31,931 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-02 20:57:31,931 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 20:57:31,932 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 20:57:31,932 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 20:57:31,933 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 20:57:31,933 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 20:57:31,934 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-02 20:57:31,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:57:32,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:57:32,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 20:57:32,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:57:32,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 20:57:32,089 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 20:57:32,099 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 20:57:32,101 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6902 states. Second operand 5 states. [2018-12-02 20:57:32,435 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6902 states.. Second operand 5 states. Result 10373 states and 19581 transitions. Complement of second has 9 states. [2018-12-02 20:57:32,435 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 20:57:32,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-02 20:57:32,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13098 transitions. [2018-12-02 20:57:32,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13098 transitions. Stem has 33 letters. Loop has 22 letters. [2018-12-02 20:57:32,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 20:57:32,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13098 transitions. Stem has 55 letters. Loop has 22 letters. [2018-12-02 20:57:32,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 20:57:32,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13098 transitions. Stem has 33 letters. Loop has 44 letters. [2018-12-02 20:57:32,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 20:57:32,449 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10373 states and 19581 transitions. [2018-12-02 20:57:32,503 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 20:57:32,505 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10373 states to 0 states and 0 transitions. [2018-12-02 20:57:32,506 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-02 20:57:32,506 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-02 20:57:32,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-02 20:57:32,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 20:57:32,507 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 20:57:32,507 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 20:57:32,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 20:57:32,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 20:57:32,510 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2018-12-02 20:57:32,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:57:32,512 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-12-02 20:57:32,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-02 20:57:32,513 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-12-02 20:57:32,513 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 20:57:32,513 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 20:57:32,513 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-02 20:57:32,513 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-02 20:57:32,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-02 20:57:32,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 20:57:32,513 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 20:57:32,513 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 20:57:32,513 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 20:57:32,513 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-02 20:57:32,513 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-02 20:57:32,513 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 20:57:32,513 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-02 20:57:32,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.12 08:57:32 BoogieIcfgContainer [2018-12-02 20:57:32,518 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-02 20:57:32,518 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 20:57:32,518 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 20:57:32,518 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 20:57:32,518 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:57:18" (3/4) ... [2018-12-02 20:57:32,521 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 20:57:32,521 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 20:57:32,522 INFO L168 Benchmark]: Toolchain (without parser) took 20566.11 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 649.6 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -153.5 MB). Peak memory consumption was 496.1 MB. Max. memory is 11.5 GB. [2018-12-02 20:57:32,522 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 20:57:32,522 INFO L168 Benchmark]: CACSL2BoogieTranslator took 467.85 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -118.8 MB). Peak memory consumption was 48.3 MB. Max. memory is 11.5 GB. [2018-12-02 20:57:32,523 INFO L168 Benchmark]: Boogie Procedure Inliner took 168.35 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 993.2 MB in the end (delta: 76.2 MB). Peak memory consumption was 76.2 MB. Max. memory is 11.5 GB. [2018-12-02 20:57:32,523 INFO L168 Benchmark]: Boogie Preprocessor took 218.22 ms. Allocated memory is still 1.1 GB. Free memory was 993.2 MB in the beginning and 931.2 MB in the end (delta: 62.0 MB). Peak memory consumption was 62.0 MB. Max. memory is 11.5 GB. [2018-12-02 20:57:32,523 INFO L168 Benchmark]: RCFGBuilder took 5768.04 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 299.4 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -158.0 MB). Peak memory consumption was 452.3 MB. Max. memory is 11.5 GB. [2018-12-02 20:57:32,524 INFO L168 Benchmark]: BuchiAutomizer took 13937.70 ms. Allocated memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: 242.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -14.9 MB). Peak memory consumption was 227.4 MB. Max. memory is 11.5 GB. [2018-12-02 20:57:32,524 INFO L168 Benchmark]: Witness Printer took 3.28 ms. Allocated memory is still 1.7 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 20:57:32,526 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 467.85 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -118.8 MB). Peak memory consumption was 48.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 168.35 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 993.2 MB in the end (delta: 76.2 MB). Peak memory consumption was 76.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 218.22 ms. Allocated memory is still 1.1 GB. Free memory was 993.2 MB in the beginning and 931.2 MB in the end (delta: 62.0 MB). Peak memory consumption was 62.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 5768.04 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 299.4 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -158.0 MB). Peak memory consumption was 452.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 13937.70 ms. Allocated memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: 242.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -14.9 MB). Peak memory consumption was 227.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.28 ms. Allocated memory is still 1.7 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 13.9s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 13.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 13064 SDtfs, 25979 SDslu, 6491 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: 8ms VariablesStem: 0 VariablesLoop: 5 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 11.8s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...