./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/product-lines/elevator_spec2_product32.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_eacb1ede-2f9b-4186-8fe7-6f577edd3785/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_eacb1ede-2f9b-4186-8fe7-6f577edd3785/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_eacb1ede-2f9b-4186-8fe7-6f577edd3785/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_eacb1ede-2f9b-4186-8fe7-6f577edd3785/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/product-lines/elevator_spec2_product32.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_eacb1ede-2f9b-4186-8fe7-6f577edd3785/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_eacb1ede-2f9b-4186-8fe7-6f577edd3785/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1ce3ea2e188fd0be186a6acc6b1f5b17e2df2a3a ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 09:01:28,777 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:01:28,779 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:01:28,788 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:01:28,788 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:01:28,789 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:01:28,790 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:01:28,791 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:01:28,792 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:01:28,793 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:01:28,794 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:01:28,795 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:01:28,795 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:01:28,796 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:01:28,796 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:01:28,797 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:01:28,798 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:01:28,799 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:01:28,800 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:01:28,801 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:01:28,802 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:01:28,803 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:01:28,804 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:01:28,804 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:01:28,806 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:01:28,806 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:01:28,807 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:01:28,807 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:01:28,808 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:01:28,808 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:01:28,809 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:01:28,809 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:01:28,810 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:01:28,810 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:01:28,811 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:01:28,811 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:01:28,812 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:01:28,812 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:01:28,812 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:01:28,813 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:01:28,813 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:01:28,814 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_eacb1ede-2f9b-4186-8fe7-6f577edd3785/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 09:01:28,826 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:01:28,826 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:01:28,827 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:01:28,827 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:01:28,827 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:01:28,828 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 09:01:28,828 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 09:01:28,828 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 09:01:28,828 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 09:01:28,828 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 09:01:28,828 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 09:01:28,829 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:01:28,829 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 09:01:28,829 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 09:01:28,829 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:01:28,829 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 09:01:28,829 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:01:28,830 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 09:01:28,830 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 09:01:28,830 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 09:01:28,830 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 09:01:28,831 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:01:28,831 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 09:01:28,831 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:01:28,831 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 09:01:28,831 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:01:28,831 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:01:28,832 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 09:01:28,832 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:01:28,832 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:01:28,832 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 09:01:28,833 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 09:01:28,833 INFO L138 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_eacb1ede-2f9b-4186-8fe7-6f577edd3785/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1ce3ea2e188fd0be186a6acc6b1f5b17e2df2a3a [2019-10-22 09:01:28,858 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:01:28,868 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:01:28,871 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:01:28,872 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:01:28,872 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:01:28,873 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_eacb1ede-2f9b-4186-8fe7-6f577edd3785/bin/uautomizer/../../sv-benchmarks/c/product-lines/elevator_spec2_product32.cil.c [2019-10-22 09:01:28,928 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_eacb1ede-2f9b-4186-8fe7-6f577edd3785/bin/uautomizer/data/1d67fd235/41c49054105244af8c11ef731c562190/FLAG5ec0a6125 [2019-10-22 09:01:29,418 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:01:29,418 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_eacb1ede-2f9b-4186-8fe7-6f577edd3785/sv-benchmarks/c/product-lines/elevator_spec2_product32.cil.c [2019-10-22 09:01:29,435 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_eacb1ede-2f9b-4186-8fe7-6f577edd3785/bin/uautomizer/data/1d67fd235/41c49054105244af8c11ef731c562190/FLAG5ec0a6125 [2019-10-22 09:01:29,708 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_eacb1ede-2f9b-4186-8fe7-6f577edd3785/bin/uautomizer/data/1d67fd235/41c49054105244af8c11ef731c562190 [2019-10-22 09:01:29,711 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:01:29,712 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:01:29,713 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:01:29,713 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:01:29,722 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:01:29,723 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:01:29" (1/1) ... [2019-10-22 09:01:29,725 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3653fd4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:29, skipping insertion in model container [2019-10-22 09:01:29,725 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:01:29" (1/1) ... [2019-10-22 09:01:29,732 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:01:29,784 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:01:30,355 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:01:30,367 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:01:30,512 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:01:30,570 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:01:30,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:30 WrapperNode [2019-10-22 09:01:30,571 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:01:30,572 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:01:30,572 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:01:30,572 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:01:30,584 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:30" (1/1) ... [2019-10-22 09:01:30,613 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:30" (1/1) ... [2019-10-22 09:01:30,961 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:01:30,962 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:01:30,962 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:01:30,962 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:01:30,972 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:30" (1/1) ... [2019-10-22 09:01:30,973 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:30" (1/1) ... [2019-10-22 09:01:31,020 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:30" (1/1) ... [2019-10-22 09:01:31,020 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:30" (1/1) ... [2019-10-22 09:01:31,132 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:30" (1/1) ... [2019-10-22 09:01:31,284 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:30" (1/1) ... [2019-10-22 09:01:31,329 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:30" (1/1) ... [2019-10-22 09:01:31,387 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:01:31,388 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:01:31,389 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:01:31,389 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:01:31,390 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eacb1ede-2f9b-4186-8fe7-6f577edd3785/bin/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 [2019-10-22 09:01:31,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 09:01:31,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-22 09:01:31,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:01:31,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:01:41,624 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:01:41,624 INFO L284 CfgBuilder]: Removed 1709 assume(true) statements. [2019-10-22 09:01:41,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:41 BoogieIcfgContainer [2019-10-22 09:01:41,628 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:01:41,628 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 09:01:41,628 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 09:01:41,632 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 09:01:41,633 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:01:41,633 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 09:01:29" (1/3) ... [2019-10-22 09:01:41,634 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7685ebe0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:01:41, skipping insertion in model container [2019-10-22 09:01:41,634 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:01:41,634 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:30" (2/3) ... [2019-10-22 09:01:41,634 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7685ebe0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:01:41, skipping insertion in model container [2019-10-22 09:01:41,634 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:01:41,635 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:41" (3/3) ... [2019-10-22 09:01:41,636 INFO L371 chiAutomizerObserver]: Analyzing ICFG elevator_spec2_product32.cil.c [2019-10-22 09:01:41,678 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 09:01:41,678 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 09:01:41,678 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 09:01:41,678 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:01:41,678 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:01:41,679 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 09:01:41,679 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:01:41,679 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 09:01:41,778 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7183 states. [2019-10-22 09:01:41,894 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3581 [2019-10-22 09:01:41,894 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:41,894 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:41,911 INFO L849 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] [2019-10-22 09:01:41,911 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:41,911 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 09:01:41,911 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7183 states. [2019-10-22 09:01:41,973 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3581 [2019-10-22 09:01:41,974 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:41,974 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:41,978 INFO L849 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] [2019-10-22 09:01:41,978 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:41,983 INFO L791 eck$LassoCheckResult]: Stem: 1624#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~0 := 0;~floorButtons_spc2_0~0 := 0;~floorButtons_spc2_1~0 := 0;~floorButtons_spc2_2~0 := 0;~floorButtons_spc2_3~0 := 0;~floorButtons_spc2_4~0 := 0;~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~head~0.base, ~head~0.offset := 0, 0;call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(30);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(9);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(21);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(30);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(9);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(21);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(30);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(9);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(25);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(30);call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(9);call #t~string38.base, #t~string38.offset := #Ultimate.allocOnStack(25);~cleanupTimeShifts~0 := 12;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0;call #t~string123.base, #t~string123.offset := #Ultimate.allocOnStack(10);call #t~string125.base, #t~string125.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string125.base, #t~string125.offset, 1);call write~init~int(95, #t~string125.base, 1 + #t~string125.offset, 1);call write~init~int(93, #t~string125.base, 2 + #t~string125.offset, 1);call write~init~int(0, #t~string125.base, 3 + #t~string125.offset, 1);call #t~string127.base, #t~string127.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string127.base, #t~string127.offset, 1);call write~init~int(93, #t~string127.base, 1 + #t~string127.offset, 1);call write~init~int(32, #t~string127.base, 2 + #t~string127.offset, 1);call write~init~int(0, #t~string127.base, 3 + #t~string127.offset, 1);call #t~string129.base, #t~string129.offset := #Ultimate.allocOnStack(5);call write~init~int(32, #t~string129.base, #t~string129.offset, 1);call write~init~int(97, #t~string129.base, 1 + #t~string129.offset, 1);call write~init~int(116, #t~string129.base, 2 + #t~string129.offset, 1);call write~init~int(32, #t~string129.base, 3 + #t~string129.offset, 1);call write~init~int(0, #t~string129.base, 4 + #t~string129.offset, 1);call #t~string131.base, #t~string131.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string131.base, #t~string131.offset, 1);call write~init~int(105, #t~string131.base, 1 + #t~string131.offset, 1);call write~init~int(0, #t~string131.base, 2 + #t~string131.offset, 1);call #t~string133.base, #t~string133.offset := #Ultimate.allocOnStack(10);call #t~string135.base, #t~string135.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string135.base, #t~string135.offset, 1);call write~init~int(112, #t~string135.base, 1 + #t~string135.offset, 1);call write~init~int(0, #t~string135.base, 2 + #t~string135.offset, 1);call #t~string137.base, #t~string137.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string137.base, #t~string137.offset, 1);call write~init~int(111, #t~string137.base, 1 + #t~string137.offset, 1);call write~init~int(119, #t~string137.base, 2 + #t~string137.offset, 1);call write~init~int(110, #t~string137.base, 3 + #t~string137.offset, 1);call write~init~int(0, #t~string137.base, 4 + #t~string137.offset, 1);call #t~string139.base, #t~string139.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string139.base, #t~string139.offset, 1);call write~init~int(73, #t~string139.base, 1 + #t~string139.offset, 1);call write~init~int(76, #t~string139.base, 2 + #t~string139.offset, 1);call write~init~int(95, #t~string139.base, 3 + #t~string139.offset, 1);call write~init~int(112, #t~string139.base, 4 + #t~string139.offset, 1);call write~init~int(58, #t~string139.base, 5 + #t~string139.offset, 1);call write~init~int(0, #t~string139.base, 6 + #t~string139.offset, 1);call #t~string141.base, #t~string141.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string141.base, #t~string141.offset, 1);call write~init~int(37, #t~string141.base, 1 + #t~string141.offset, 1);call write~init~int(105, #t~string141.base, 2 + #t~string141.offset, 1);call write~init~int(0, #t~string141.base, 3 + #t~string141.offset, 1);call #t~string143.base, #t~string143.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string143.base, #t~string143.offset, 1);call write~init~int(37, #t~string143.base, 1 + #t~string143.offset, 1);call write~init~int(105, #t~string143.base, 2 + #t~string143.offset, 1);call write~init~int(0, #t~string143.base, 3 + #t~string143.offset, 1);call #t~string145.base, #t~string145.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string145.base, #t~string145.offset, 1);call write~init~int(37, #t~string145.base, 1 + #t~string145.offset, 1);call write~init~int(105, #t~string145.base, 2 + #t~string145.offset, 1);call write~init~int(0, #t~string145.base, 3 + #t~string145.offset, 1);call #t~string147.base, #t~string147.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string147.base, #t~string147.offset, 1);call write~init~int(37, #t~string147.base, 1 + #t~string147.offset, 1);call write~init~int(105, #t~string147.base, 2 + #t~string147.offset, 1);call write~init~int(0, #t~string147.base, 3 + #t~string147.offset, 1);call #t~string149.base, #t~string149.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string149.base, #t~string149.offset, 1);call write~init~int(37, #t~string149.base, 1 + #t~string149.offset, 1);call write~init~int(105, #t~string149.base, 2 + #t~string149.offset, 1);call write~init~int(0, #t~string149.base, 3 + #t~string149.offset, 1);call #t~string151.base, #t~string151.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string151.base, #t~string151.offset, 1);call write~init~int(70, #t~string151.base, 1 + #t~string151.offset, 1);call write~init~int(95, #t~string151.base, 2 + #t~string151.offset, 1);call write~init~int(112, #t~string151.base, 3 + #t~string151.offset, 1);call write~init~int(58, #t~string151.base, 4 + #t~string151.offset, 1);call write~init~int(0, #t~string151.base, 5 + #t~string151.offset, 1);call #t~string154.base, #t~string154.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string154.base, #t~string154.offset, 1);call write~init~int(37, #t~string154.base, 1 + #t~string154.offset, 1);call write~init~int(105, #t~string154.base, 2 + #t~string154.offset, 1);call write~init~int(0, #t~string154.base, 3 + #t~string154.offset, 1);call #t~string157.base, #t~string157.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string157.base, #t~string157.offset, 1);call write~init~int(37, #t~string157.base, 1 + #t~string157.offset, 1);call write~init~int(105, #t~string157.base, 2 + #t~string157.offset, 1);call write~init~int(0, #t~string157.base, 3 + #t~string157.offset, 1);call #t~string160.base, #t~string160.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string160.base, #t~string160.offset, 1);call write~init~int(37, #t~string160.base, 1 + #t~string160.offset, 1);call write~init~int(105, #t~string160.base, 2 + #t~string160.offset, 1);call write~init~int(0, #t~string160.base, 3 + #t~string160.offset, 1);call #t~string163.base, #t~string163.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string163.base, #t~string163.offset, 1);call write~init~int(37, #t~string163.base, 1 + #t~string163.offset, 1);call write~init~int(105, #t~string163.base, 2 + #t~string163.offset, 1);call write~init~int(0, #t~string163.base, 3 + #t~string163.offset, 1);call #t~string166.base, #t~string166.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string166.base, #t~string166.offset, 1);call write~init~int(37, #t~string166.base, 1 + #t~string166.offset, 1);call write~init~int(105, #t~string166.base, 2 + #t~string166.offset, 1);call write~init~int(0, #t~string166.base, 3 + #t~string166.offset, 1);call #t~string168.base, #t~string168.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string168.base, #t~string168.offset, 1);call write~init~int(0, #t~string168.base, 1 + #t~string168.offset, 1);call #t~string171.base, #t~string171.offset := #Ultimate.allocOnStack(9); 6476#L-1true havoc main_#res;havoc main_#t~ret61, main_~retValue_acc~12, main_~tmp~14;havoc main_~retValue_acc~12;havoc main_~tmp~14; 1219#L1286true havoc valid_product_#res;havoc valid_product_~retValue_acc~7;havoc valid_product_~retValue_acc~7;valid_product_~retValue_acc~7 := 1;valid_product_#res := valid_product_~retValue_acc~7; 1047#L1294true main_#t~ret61 := valid_product_#res;main_~tmp~14 := main_#t~ret61;havoc main_#t~ret61; 1661#L1868true assume 0 != main_~tmp~14; 396#L1843true ~floorButtons_spc2_0~0 := 0;~floorButtons_spc2_1~0 := 0;~floorButtons_spc2_2~0 := 0;~floorButtons_spc2_3~0 := 0;~floorButtons_spc2_4~0 := 0; 1074#L60true havoc bigMacCall_#t~ret54, bigMacCall_~tmp~11;havoc bigMacCall_~tmp~11;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~9;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~9; 873#L1456true assume 0 == getOrigin_~person;getOrigin_~retValue_acc~9 := 4;getOrigin_#res := getOrigin_~retValue_acc~9; 58#L1481true bigMacCall_#t~ret54 := getOrigin_#res;bigMacCall_~tmp~11 := bigMacCall_#t~ret54;havoc bigMacCall_#t~ret54;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~11;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 1030#L587true assume 0 == initPersonOnFloor_~floor; 1009#L588true assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 4450#L695-1true callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 5809#L379true assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 6096#L391-2true havoc cleanup_#t~ret55, cleanup_#t~ret56, cleanup_~i~2, cleanup_~tmp~12, cleanup_~tmp___0~3, cleanup_~__cil_tmp4~2;havoc cleanup_~i~2;havoc cleanup_~tmp~12;havoc cleanup_~tmp___0~3;havoc cleanup_~__cil_tmp4~2;havoc timeShift_#t~ret122, timeShift_~tmp~29;havoc timeShift_~tmp~29;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~15;havoc areDoorsOpen_~retValue_acc~15;areDoorsOpen_~retValue_acc~15 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~15; 6222#L2149true timeShift_#t~ret122 := areDoorsOpen_#res;timeShift_~tmp~29 := timeShift_#t~ret122;havoc timeShift_#t~ret122; 4574#L3159true assume 0 != timeShift_~tmp~29; 4640#L3160true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 4719#L2805-11true havoc __utac_acc__Specification2_spec__3_#t~ret0, __utac_acc__Specification2_spec__3_#t~ret1, __utac_acc__Specification2_spec__3_#t~ret2, __utac_acc__Specification2_spec__3_#t~ret3, __utac_acc__Specification2_spec__3_#t~ret4, __utac_acc__Specification2_spec__3_#t~ret5, __utac_acc__Specification2_spec__3_~floor~0, __utac_acc__Specification2_spec__3_~tmp~0, __utac_acc__Specification2_spec__3_~tmp___0~0, __utac_acc__Specification2_spec__3_~tmp___1~0, __utac_acc__Specification2_spec__3_~tmp___2~0, __utac_acc__Specification2_spec__3_~tmp___3~0, __utac_acc__Specification2_spec__3_~tmp___4~0;havoc __utac_acc__Specification2_spec__3_~floor~0;havoc __utac_acc__Specification2_spec__3_~tmp~0;havoc __utac_acc__Specification2_spec__3_~tmp___0~0;havoc __utac_acc__Specification2_spec__3_~tmp___1~0;havoc __utac_acc__Specification2_spec__3_~tmp___2~0;havoc __utac_acc__Specification2_spec__3_~tmp___3~0;havoc __utac_acc__Specification2_spec__3_~tmp___4~0;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~14;havoc getCurrentFloorID_~retValue_acc~14;getCurrentFloorID_~retValue_acc~14 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~14; 5770#L2140-10true __utac_acc__Specification2_spec__3_#t~ret0 := getCurrentFloorID_#res;__utac_acc__Specification2_spec__3_~tmp~0 := __utac_acc__Specification2_spec__3_#t~ret0;havoc __utac_acc__Specification2_spec__3_#t~ret0;__utac_acc__Specification2_spec__3_~floor~0 := __utac_acc__Specification2_spec__3_~tmp~0; 1712#L105true assume 0 == __utac_acc__Specification2_spec__3_~floor~0; 1692#L106true assume 0 != ~floorButtons_spc2_0~0;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~15;havoc areDoorsOpen_~retValue_acc~15;areDoorsOpen_~retValue_acc~15 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~15; 6213#L2149-1true __utac_acc__Specification2_spec__3_#t~ret1 := areDoorsOpen_#res;__utac_acc__Specification2_spec__3_~tmp___4~0 := __utac_acc__Specification2_spec__3_#t~ret1;havoc __utac_acc__Specification2_spec__3_#t~ret1; 1633#L110true assume 0 != __utac_acc__Specification2_spec__3_~tmp___4~0;~floorButtons_spc2_0~0 := 0; 4641#L165true cleanup_~i~2 := 0; 2242#L1675-2true [2019-10-22 09:01:41,984 INFO L793 eck$LassoCheckResult]: Loop: 2242#L1675-2true assume !false; 2357#L1676true cleanup_~__cil_tmp4~2 := ~cleanupTimeShifts~0 - 1; 2192#L1679true assume cleanup_~i~2 < cleanup_~__cil_tmp4~2;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~13;havoc isBlocked_~retValue_acc~13;isBlocked_~retValue_acc~13 := ~blocked~0;isBlocked_#res := isBlocked_~retValue_acc~13; 5839#L1963true cleanup_#t~ret55 := isBlocked_#res;cleanup_~tmp___0~3 := cleanup_#t~ret55;havoc cleanup_#t~ret55; 2831#L1683true assume 1 != cleanup_~tmp___0~3; 2833#L1683-1true havoc isIdle_#res;havoc isIdle_#t~ret70, isIdle_~retValue_acc~20, isIdle_~tmp~19;havoc isIdle_~retValue_acc~20;havoc isIdle_~tmp~19;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret65, anyStopRequested_#t~ret66, anyStopRequested_#t~ret67, anyStopRequested_#t~ret68, anyStopRequested_#t~ret69, anyStopRequested_~retValue_acc~19, anyStopRequested_~tmp~18, anyStopRequested_~tmp___0~5, anyStopRequested_~tmp___1~4, anyStopRequested_~tmp___2~2, anyStopRequested_~tmp___3~1;havoc anyStopRequested_~retValue_acc~19;havoc anyStopRequested_~tmp~18;havoc anyStopRequested_~tmp___0~5;havoc anyStopRequested_~tmp___1~4;havoc anyStopRequested_~tmp___2~2;havoc anyStopRequested_~tmp___3~1;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~0;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~0; 5298#L316-130true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~0 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~0; 4364#L343-130true anyStopRequested_#t~ret65 := isFloorCalling_#res;anyStopRequested_~tmp___3~1 := anyStopRequested_#t~ret65;havoc anyStopRequested_#t~ret65; 4831#L2248true assume 0 != anyStopRequested_~tmp___3~1;anyStopRequested_~retValue_acc~19 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~19; 6000#L2312true isIdle_#t~ret70 := anyStopRequested_#res;isIdle_~tmp~19 := isIdle_#t~ret70;havoc isIdle_#t~ret70;isIdle_~retValue_acc~20 := (if 0 == isIdle_~tmp~19 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~20; 6118#L2325true cleanup_#t~ret56 := isIdle_#res;cleanup_~tmp~12 := cleanup_#t~ret56;havoc cleanup_#t~ret56; 1648#L1695true assume !(0 != cleanup_~tmp~12);havoc timeShift_#t~ret122, timeShift_~tmp~29;havoc timeShift_~tmp~29;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~15;havoc areDoorsOpen_~retValue_acc~15;areDoorsOpen_~retValue_acc~15 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~15; 6218#L2149-6true timeShift_#t~ret122 := areDoorsOpen_#res;timeShift_~tmp~29 := timeShift_#t~ret122;havoc timeShift_#t~ret122; 4578#L3159-1true assume 0 != timeShift_~tmp~29; 4642#L3160-2true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 4608#L2805-23true havoc __utac_acc__Specification2_spec__3_#t~ret0, __utac_acc__Specification2_spec__3_#t~ret1, __utac_acc__Specification2_spec__3_#t~ret2, __utac_acc__Specification2_spec__3_#t~ret3, __utac_acc__Specification2_spec__3_#t~ret4, __utac_acc__Specification2_spec__3_#t~ret5, __utac_acc__Specification2_spec__3_~floor~0, __utac_acc__Specification2_spec__3_~tmp~0, __utac_acc__Specification2_spec__3_~tmp___0~0, __utac_acc__Specification2_spec__3_~tmp___1~0, __utac_acc__Specification2_spec__3_~tmp___2~0, __utac_acc__Specification2_spec__3_~tmp___3~0, __utac_acc__Specification2_spec__3_~tmp___4~0;havoc __utac_acc__Specification2_spec__3_~floor~0;havoc __utac_acc__Specification2_spec__3_~tmp~0;havoc __utac_acc__Specification2_spec__3_~tmp___0~0;havoc __utac_acc__Specification2_spec__3_~tmp___1~0;havoc __utac_acc__Specification2_spec__3_~tmp___2~0;havoc __utac_acc__Specification2_spec__3_~tmp___3~0;havoc __utac_acc__Specification2_spec__3_~tmp___4~0;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~14;havoc getCurrentFloorID_~retValue_acc~14;getCurrentFloorID_~retValue_acc~14 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~14; 5807#L2140-21true __utac_acc__Specification2_spec__3_#t~ret0 := getCurrentFloorID_#res;__utac_acc__Specification2_spec__3_~tmp~0 := __utac_acc__Specification2_spec__3_#t~ret0;havoc __utac_acc__Specification2_spec__3_#t~ret0;__utac_acc__Specification2_spec__3_~floor~0 := __utac_acc__Specification2_spec__3_~tmp~0; 1710#L105-1true assume 0 == __utac_acc__Specification2_spec__3_~floor~0; 1666#L106-1true assume 0 != ~floorButtons_spc2_0~0;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~15;havoc areDoorsOpen_~retValue_acc~15;areDoorsOpen_~retValue_acc~15 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~15; 6204#L2149-7true __utac_acc__Specification2_spec__3_#t~ret1 := areDoorsOpen_#res;__utac_acc__Specification2_spec__3_~tmp___4~0 := __utac_acc__Specification2_spec__3_#t~ret1;havoc __utac_acc__Specification2_spec__3_#t~ret1; 1627#L110-2true assume 0 != __utac_acc__Specification2_spec__3_~tmp___4~0;~floorButtons_spc2_0~0 := 0; 4643#L165-1true cleanup_~i~2 := 1 + cleanup_~i~2; 2242#L1675-2true [2019-10-22 09:01:41,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:41,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1561602685, now seen corresponding path program 1 times [2019-10-22 09:01:41,998 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:41,998 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663664459] [2019-10-22 09:01:41,999 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:41,999 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:41,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:42,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:42,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:42,279 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663664459] [2019-10-22 09:01:42,280 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:42,280 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:42,281 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023304274] [2019-10-22 09:01:42,285 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:01:42,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:42,285 INFO L82 PathProgramCache]: Analyzing trace with hash -760732559, now seen corresponding path program 1 times [2019-10-22 09:01:42,285 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:42,285 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525094860] [2019-10-22 09:01:42,286 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:42,286 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:42,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:42,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:42,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:42,338 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:42,542 WARN L191 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 82 [2019-10-22 09:01:42,642 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:01:42,642 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:01:42,643 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:01:42,643 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:01:42,643 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 09:01:42,643 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:42,643 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:01:42,643 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:01:42,643 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec2_product32.cil.c_Iteration1_Loop [2019-10-22 09:01:42,644 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:01:42,644 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:01:42,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:42,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:42,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:42,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:42,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:42,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:42,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:42,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:42,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:42,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:42,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:42,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:42,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:42,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:42,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:42,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:42,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:42,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:42,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:42,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:42,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:42,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:42,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:42,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:42,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:42,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:42,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:42,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:42,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:42,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:42,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:42,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:42,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:43,093 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:01:43,094 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eacb1ede-2f9b-4186-8fe7-6f577edd3785/bin/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 [2019-10-22 09:01:43,104 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:43,105 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:01:43,114 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:01:43,114 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_~tmp___1~4=0} Honda state: {ULTIMATE.start_anyStopRequested_~tmp___1~4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eacb1ede-2f9b-4186-8fe7-6f577edd3785/bin/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 [2019-10-22 09:01:43,131 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:43,131 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:01:43,151 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:01:43,151 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_areDoorsOpen_#res=-2, ULTIMATE.start_timeShift_~tmp~29=-2, ULTIMATE.start___utac_acc__Specification2_spec__3_~tmp___4~0=-2, ~doorState~0=-2, ULTIMATE.start_areDoorsOpen_~retValue_acc~15=-2} Honda state: {ULTIMATE.start_areDoorsOpen_#res=-2, ULTIMATE.start_timeShift_~tmp~29=-2, ULTIMATE.start___utac_acc__Specification2_spec__3_~tmp___4~0=-2, ~doorState~0=-2, ULTIMATE.start_areDoorsOpen_~retValue_acc~15=-2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eacb1ede-2f9b-4186-8fe7-6f577edd3785/bin/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 [2019-10-22 09:01:43,172 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:43,172 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:01:43,175 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:01:43,175 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_#t~ret122=0} Honda state: {ULTIMATE.start_timeShift_#t~ret122=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eacb1ede-2f9b-4186-8fe7-6f577edd3785/bin/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 [2019-10-22 09:01:43,367 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:43,367 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:01:43,371 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:01:43,371 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification2_spec__3_~tmp___2~0=0} Honda state: {ULTIMATE.start___utac_acc__Specification2_spec__3_~tmp___2~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eacb1ede-2f9b-4186-8fe7-6f577edd3785/bin/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 [2019-10-22 09:01:43,384 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:43,384 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eacb1ede-2f9b-4186-8fe7-6f577edd3785/bin/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 [2019-10-22 09:01:43,397 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 09:01:43,397 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:01:55,417 INFO L442 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-10-22 09:01:55,419 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:01:55,420 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:01:55,420 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:01:55,420 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:01:55,420 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:01:55,420 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:55,420 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:01:55,420 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:01:55,420 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec2_product32.cil.c_Iteration1_Loop [2019-10-22 09:01:55,420 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:01:55,421 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:01:55,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:55,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:55,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:55,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:55,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:55,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:55,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:55,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:55,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:55,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:55,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:55,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:55,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:55,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:55,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:55,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:55,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:55,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:55,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:55,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:55,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:55,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:55,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:55,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:55,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:55,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:55,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:55,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:55,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:55,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:55,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:55,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:55,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:55,882 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:01:55,887 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:01:55,889 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:55,890 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:55,891 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:55,891 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:55,891 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:01:55,891 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:55,894 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:01:55,894 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:55,917 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:55,917 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:55,918 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:55,918 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:55,918 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:55,918 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:01:55,918 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:55,920 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:01:55,920 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:55,946 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:55,946 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:55,947 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:55,947 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:55,947 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:55,947 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:55,947 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:55,947 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:55,948 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:55,948 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:55,949 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:55,949 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:55,949 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:55,949 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:55,950 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:55,950 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:55,950 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:55,954 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:55,954 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:55,955 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:55,955 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:55,955 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:55,956 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:55,956 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:55,956 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:55,956 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:55,956 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:55,957 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:55,957 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:55,958 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:55,959 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:55,960 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:55,960 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:55,960 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:55,960 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:55,961 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:55,963 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:55,963 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:55,964 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:55,964 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:55,964 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:55,964 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:55,964 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:55,964 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:55,965 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:55,969 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:55,970 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:55,970 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:55,971 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:55,971 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:55,971 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:55,971 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:55,971 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:55,971 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:55,972 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:55,973 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:55,973 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:55,973 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:55,973 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:55,974 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:55,974 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:55,974 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:55,976 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:55,977 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:55,977 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:55,983 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:55,983 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:55,983 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:55,983 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:55,983 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:55,984 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:55,984 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:55,987 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:55,988 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:55,988 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:55,988 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:55,989 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:55,989 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:55,989 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:55,989 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:55,989 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:55,990 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:55,994 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:55,995 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:55,995 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:55,995 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:55,995 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:55,995 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:55,995 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:55,996 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:55,996 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:55,997 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:55,997 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:55,997 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:55,998 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:55,998 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:55,998 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:56,002 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:56,003 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:56,004 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:56,004 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:56,005 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:56,005 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:56,005 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:56,005 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:56,005 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:56,006 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:56,006 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:56,011 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:56,011 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:56,012 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:56,012 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:56,012 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:56,012 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:56,012 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:56,013 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:56,013 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:56,014 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:56,014 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:56,015 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:56,015 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:56,016 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:56,016 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:56,016 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:56,016 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:56,016 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:56,017 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:56,017 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:56,018 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:56,018 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:56,018 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:56,020 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:01:56,020 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:56,021 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:01:56,021 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:56,024 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:56,024 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:56,025 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:56,025 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:56,025 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:56,025 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:56,025 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:56,026 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:56,026 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:56,033 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:56,034 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:56,034 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:56,035 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:56,035 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:56,035 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:56,035 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:56,035 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:56,035 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:56,036 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:56,036 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:56,037 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:56,037 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:56,037 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:56,037 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:56,037 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:56,038 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:56,038 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:56,043 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:56,044 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:56,044 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:56,044 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:56,045 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:56,045 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:56,045 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:56,045 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:56,045 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:56,046 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:56,048 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:56,048 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:56,048 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:56,048 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:56,049 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:56,049 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:56,049 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:56,049 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:56,050 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:56,050 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:56,051 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:56,051 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:56,051 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:56,051 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:56,051 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:56,052 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:56,052 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:56,052 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:56,053 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:56,053 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:56,053 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:56,054 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:56,054 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:56,054 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:56,056 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:56,056 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:56,057 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:56,057 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:56,058 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:56,058 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:56,058 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:56,058 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:56,058 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:56,059 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:56,059 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:56,059 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:56,060 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:56,063 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:56,063 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:56,063 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:56,063 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:56,063 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:56,064 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:56,064 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:56,065 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:56,065 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:56,066 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:56,066 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:56,066 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:56,066 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:56,067 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:56,068 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:56,068 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:56,069 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:56,069 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:56,070 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:56,070 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:56,070 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:56,070 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:56,071 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:56,071 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:56,071 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:56,074 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:01:56,087 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 09:01:56,087 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 09:01:56,088 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:01:56,089 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 09:01:56,089 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:01:56,089 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~cleanupTimeShifts~0, ULTIMATE.start_cleanup_~i~2) = 1*~cleanupTimeShifts~0 - 1*ULTIMATE.start_cleanup_~i~2 Supporting invariants [] [2019-10-22 09:01:56,095 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 09:01:56,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:56,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:56,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:56,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:56,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:56,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 09:01:56,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:56,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:56,328 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-10-22 09:01:56,330 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7183 states. Second operand 5 states. [2019-10-22 09:01:56,989 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7183 states.. Second operand 5 states. Result 10824 states and 20378 transitions. Complement of second has 9 states. [2019-10-22 09:01:56,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-10-22 09:01:56,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 09:01:57,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13591 transitions. [2019-10-22 09:01:57,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13591 transitions. Stem has 24 letters. Loop has 22 letters. [2019-10-22 09:01:57,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:57,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13591 transitions. Stem has 46 letters. Loop has 22 letters. [2019-10-22 09:01:57,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:57,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13591 transitions. Stem has 24 letters. Loop has 44 letters. [2019-10-22 09:01:57,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:57,016 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10824 states and 20378 transitions. [2019-10-22 09:01:57,105 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:01:57,108 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10824 states to 0 states and 0 transitions. [2019-10-22 09:01:57,111 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 09:01:57,111 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 09:01:57,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 09:01:57,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:01:57,112 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:01:57,112 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:01:57,112 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:57,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:57,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:57,117 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2019-10-22 09:01:57,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:57,120 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-10-22 09:01:57,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 09:01:57,121 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-10-22 09:01:57,121 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:01:57,121 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 09:01:57,121 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 09:01:57,121 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 09:01:57,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 09:01:57,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:01:57,121 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:01:57,122 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:01:57,122 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:01:57,122 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 09:01:57,122 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 09:01:57,122 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:01:57,123 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 09:01:57,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 09:01:57 BoogieIcfgContainer [2019-10-22 09:01:57,129 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 09:01:57,130 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:01:57,130 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:01:57,130 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:01:57,131 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:41" (3/4) ... [2019-10-22 09:01:57,134 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 09:01:57,135 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:01:57,136 INFO L168 Benchmark]: Toolchain (without parser) took 27423.94 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 847.8 MB). Free memory was 939.0 MB in the beginning and 1.3 GB in the end (delta: -320.4 MB). Peak memory consumption was 527.4 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:57,137 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:01:57,139 INFO L168 Benchmark]: CACSL2BoogieTranslator took 858.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 939.0 MB in the beginning and 1.1 GB in the end (delta: -139.0 MB). Peak memory consumption was 32.5 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:57,140 INFO L168 Benchmark]: Boogie Procedure Inliner took 389.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 998.2 MB in the end (delta: 79.7 MB). Peak memory consumption was 79.7 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:57,141 INFO L168 Benchmark]: Boogie Preprocessor took 425.73 ms. Allocated memory is still 1.2 GB. Free memory was 998.2 MB in the beginning and 928.8 MB in the end (delta: 69.4 MB). Peak memory consumption was 69.4 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:57,142 INFO L168 Benchmark]: RCFGBuilder took 10239.92 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 372.8 MB). Free memory was 928.8 MB in the beginning and 1.1 GB in the end (delta: -167.3 MB). Peak memory consumption was 507.8 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:57,143 INFO L168 Benchmark]: BuchiAutomizer took 15501.24 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 348.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -163.3 MB). Peak memory consumption was 184.8 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:57,144 INFO L168 Benchmark]: Witness Printer took 4.78 ms. Allocated memory is still 1.9 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:01:57,147 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 858.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 939.0 MB in the beginning and 1.1 GB in the end (delta: -139.0 MB). Peak memory consumption was 32.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 389.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 998.2 MB in the end (delta: 79.7 MB). Peak memory consumption was 79.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 425.73 ms. Allocated memory is still 1.2 GB. Free memory was 998.2 MB in the beginning and 928.8 MB in the end (delta: 69.4 MB). Peak memory consumption was 69.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 10239.92 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 372.8 MB). Free memory was 928.8 MB in the beginning and 1.1 GB in the end (delta: -167.3 MB). Peak memory consumption was 507.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 15501.24 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 348.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -163.3 MB). Peak memory consumption was 184.8 MB. Max. memory is 11.5 GB. * Witness Printer took 4.78 ms. Allocated memory is still 1.9 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function cleanupTimeShifts + -1 * i and consists of 6 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 15.4s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 14.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 13557 SDtfs, 20326 SDslu, 6795 SDs, 0 SdLazy, 9 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital109 mio100 ax100 hnf100 lsp16 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq211 hnf89 smp100 dnf176 smp100 tf103 neg96 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 22ms VariablesStem: 0 VariablesLoop: 5 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 1 LassoNonterminationAnalysisTime: 12.3s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...