./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/product-lines/elevator_spec2_product28.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_7ce35412-cf6a-434f-a585-45bfb98082d8/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7ce35412-cf6a-434f-a585-45bfb98082d8/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7ce35412-cf6a-434f-a585-45bfb98082d8/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7ce35412-cf6a-434f-a585-45bfb98082d8/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/product-lines/elevator_spec2_product28.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_7ce35412-cf6a-434f-a585-45bfb98082d8/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7ce35412-cf6a-434f-a585-45bfb98082d8/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 6e14796d00771503bce5d03bbf36395f23607cca ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:03:05,130 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:03:05,132 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:03:05,141 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:03:05,142 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:03:05,143 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:03:05,144 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:03:05,145 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:03:05,146 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:03:05,147 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:03:05,148 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:03:05,149 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:03:05,149 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:03:05,150 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:03:05,151 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:03:05,151 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:03:05,152 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:03:05,153 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:03:05,154 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:03:05,155 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:03:05,157 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:03:05,157 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:03:05,158 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:03:05,159 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:03:05,161 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:03:05,161 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:03:05,161 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:03:05,162 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:03:05,163 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:03:05,163 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:03:05,164 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:03:05,164 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:03:05,165 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:03:05,166 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:03:05,166 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:03:05,167 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:03:05,167 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:03:05,167 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:03:05,168 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:03:05,168 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:03:05,169 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:03:05,169 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7ce35412-cf6a-434f-a585-45bfb98082d8/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 09:03:05,181 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:03:05,182 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:03:05,183 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:03:05,183 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:03:05,183 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:03:05,183 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 09:03:05,184 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 09:03:05,184 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 09:03:05,184 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 09:03:05,184 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 09:03:05,184 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 09:03:05,184 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:03:05,185 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 09:03:05,185 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 09:03:05,185 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:03:05,185 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 09:03:05,185 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:03:05,185 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 09:03:05,186 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 09:03:05,186 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 09:03:05,186 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 09:03:05,186 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:03:05,186 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 09:03:05,186 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:03:05,187 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 09:03:05,187 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:03:05,187 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:03:05,187 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 09:03:05,187 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:03:05,188 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:03:05,188 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 09:03:05,189 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 09:03:05,189 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_7ce35412-cf6a-434f-a585-45bfb98082d8/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 -> 6e14796d00771503bce5d03bbf36395f23607cca [2019-10-22 09:03:05,213 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:03:05,223 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:03:05,226 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:03:05,227 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:03:05,228 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:03:05,228 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7ce35412-cf6a-434f-a585-45bfb98082d8/bin/uautomizer/../../sv-benchmarks/c/product-lines/elevator_spec2_product28.cil.c [2019-10-22 09:03:05,274 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7ce35412-cf6a-434f-a585-45bfb98082d8/bin/uautomizer/data/8f9c4f7d4/5362bb6a5a7046dd9e9146b89d3a53af/FLAGc8391eb52 [2019-10-22 09:03:05,790 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:03:05,797 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7ce35412-cf6a-434f-a585-45bfb98082d8/sv-benchmarks/c/product-lines/elevator_spec2_product28.cil.c [2019-10-22 09:03:05,820 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7ce35412-cf6a-434f-a585-45bfb98082d8/bin/uautomizer/data/8f9c4f7d4/5362bb6a5a7046dd9e9146b89d3a53af/FLAGc8391eb52 [2019-10-22 09:03:06,247 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7ce35412-cf6a-434f-a585-45bfb98082d8/bin/uautomizer/data/8f9c4f7d4/5362bb6a5a7046dd9e9146b89d3a53af [2019-10-22 09:03:06,251 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:03:06,252 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:03:06,253 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:03:06,253 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:03:06,256 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:03:06,257 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:03:06" (1/1) ... [2019-10-22 09:03:06,259 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1eafad64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:03:06, skipping insertion in model container [2019-10-22 09:03:06,259 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:03:06" (1/1) ... [2019-10-22 09:03:06,266 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:03:06,338 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:03:06,872 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:03:06,892 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:03:06,985 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:03:07,033 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:03:07,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:03:07 WrapperNode [2019-10-22 09:03:07,033 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:03:07,034 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:03:07,034 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:03:07,034 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:03:07,042 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:03:07" (1/1) ... [2019-10-22 09:03:07,067 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:03:07" (1/1) ... [2019-10-22 09:03:07,279 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:03:07,279 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:03:07,279 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:03:07,279 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:03:07,293 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:03:07" (1/1) ... [2019-10-22 09:03:07,293 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:03:07" (1/1) ... [2019-10-22 09:03:07,318 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:03:07" (1/1) ... [2019-10-22 09:03:07,319 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:03:07" (1/1) ... [2019-10-22 09:03:07,414 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:03:07" (1/1) ... [2019-10-22 09:03:07,514 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:03:07" (1/1) ... [2019-10-22 09:03:07,537 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:03:07" (1/1) ... [2019-10-22 09:03:07,578 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:03:07,579 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:03:07,579 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:03:07,579 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:03:07,581 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:03:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7ce35412-cf6a-434f-a585-45bfb98082d8/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:03:07,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 09:03:07,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-22 09:03:07,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:03:07,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:03:16,038 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:03:16,039 INFO L284 CfgBuilder]: Removed 1245 assume(true) statements. [2019-10-22 09:03:16,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:03:16 BoogieIcfgContainer [2019-10-22 09:03:16,045 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:03:16,045 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 09:03:16,046 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 09:03:16,050 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 09:03:16,050 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:03:16,051 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 09:03:06" (1/3) ... [2019-10-22 09:03:16,052 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@523fda77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:03:16, skipping insertion in model container [2019-10-22 09:03:16,053 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:03:16,053 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:03:07" (2/3) ... [2019-10-22 09:03:16,054 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@523fda77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:03:16, skipping insertion in model container [2019-10-22 09:03:16,054 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:03:16,054 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:03:16" (3/3) ... [2019-10-22 09:03:16,056 INFO L371 chiAutomizerObserver]: Analyzing ICFG elevator_spec2_product28.cil.c [2019-10-22 09:03:16,109 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 09:03:16,109 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 09:03:16,109 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 09:03:16,109 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:03:16,109 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:03:16,109 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 09:03:16,109 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:03:16,109 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 09:03:16,191 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5039 states. [2019-10-22 09:03:16,338 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2509 [2019-10-22 09:03:16,338 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:03:16,338 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:03:16,357 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:03:16,358 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:03:16,358 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 09:03:16,358 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5039 states. [2019-10-22 09:03:16,411 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2509 [2019-10-22 09:03:16,411 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:03:16,412 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:03:16,414 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:03:16,415 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:03:16,421 INFO L791 eck$LassoCheckResult]: Stem: 2730#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~0 := 0;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0;call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(10);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string56.base, #t~string56.offset, 1);call write~init~int(95, #t~string56.base, 1 + #t~string56.offset, 1);call write~init~int(93, #t~string56.base, 2 + #t~string56.offset, 1);call write~init~int(0, #t~string56.base, 3 + #t~string56.offset, 1);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string58.base, #t~string58.offset, 1);call write~init~int(93, #t~string58.base, 1 + #t~string58.offset, 1);call write~init~int(32, #t~string58.base, 2 + #t~string58.offset, 1);call write~init~int(0, #t~string58.base, 3 + #t~string58.offset, 1);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(5);call write~init~int(32, #t~string60.base, #t~string60.offset, 1);call write~init~int(97, #t~string60.base, 1 + #t~string60.offset, 1);call write~init~int(116, #t~string60.base, 2 + #t~string60.offset, 1);call write~init~int(32, #t~string60.base, 3 + #t~string60.offset, 1);call write~init~int(0, #t~string60.base, 4 + #t~string60.offset, 1);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string62.base, #t~string62.offset, 1);call write~init~int(105, #t~string62.base, 1 + #t~string62.offset, 1);call write~init~int(0, #t~string62.base, 2 + #t~string62.offset, 1);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(10);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string66.base, #t~string66.offset, 1);call write~init~int(112, #t~string66.base, 1 + #t~string66.offset, 1);call write~init~int(0, #t~string66.base, 2 + #t~string66.offset, 1);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string68.base, #t~string68.offset, 1);call write~init~int(111, #t~string68.base, 1 + #t~string68.offset, 1);call write~init~int(119, #t~string68.base, 2 + #t~string68.offset, 1);call write~init~int(110, #t~string68.base, 3 + #t~string68.offset, 1);call write~init~int(0, #t~string68.base, 4 + #t~string68.offset, 1);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string70.base, #t~string70.offset, 1);call write~init~int(73, #t~string70.base, 1 + #t~string70.offset, 1);call write~init~int(76, #t~string70.base, 2 + #t~string70.offset, 1);call write~init~int(95, #t~string70.base, 3 + #t~string70.offset, 1);call write~init~int(112, #t~string70.base, 4 + #t~string70.offset, 1);call write~init~int(58, #t~string70.base, 5 + #t~string70.offset, 1);call write~init~int(0, #t~string70.base, 6 + #t~string70.offset, 1);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string72.base, #t~string72.offset, 1);call write~init~int(37, #t~string72.base, 1 + #t~string72.offset, 1);call write~init~int(105, #t~string72.base, 2 + #t~string72.offset, 1);call write~init~int(0, #t~string72.base, 3 + #t~string72.offset, 1);call #t~string74.base, #t~string74.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string74.base, #t~string74.offset, 1);call write~init~int(37, #t~string74.base, 1 + #t~string74.offset, 1);call write~init~int(105, #t~string74.base, 2 + #t~string74.offset, 1);call write~init~int(0, #t~string74.base, 3 + #t~string74.offset, 1);call #t~string76.base, #t~string76.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string76.base, #t~string76.offset, 1);call write~init~int(37, #t~string76.base, 1 + #t~string76.offset, 1);call write~init~int(105, #t~string76.base, 2 + #t~string76.offset, 1);call write~init~int(0, #t~string76.base, 3 + #t~string76.offset, 1);call #t~string78.base, #t~string78.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string78.base, #t~string78.offset, 1);call write~init~int(37, #t~string78.base, 1 + #t~string78.offset, 1);call write~init~int(105, #t~string78.base, 2 + #t~string78.offset, 1);call write~init~int(0, #t~string78.base, 3 + #t~string78.offset, 1);call #t~string80.base, #t~string80.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string80.base, #t~string80.offset, 1);call write~init~int(37, #t~string80.base, 1 + #t~string80.offset, 1);call write~init~int(105, #t~string80.base, 2 + #t~string80.offset, 1);call write~init~int(0, #t~string80.base, 3 + #t~string80.offset, 1);call #t~string82.base, #t~string82.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string82.base, #t~string82.offset, 1);call write~init~int(70, #t~string82.base, 1 + #t~string82.offset, 1);call write~init~int(95, #t~string82.base, 2 + #t~string82.offset, 1);call write~init~int(112, #t~string82.base, 3 + #t~string82.offset, 1);call write~init~int(58, #t~string82.base, 4 + #t~string82.offset, 1);call write~init~int(0, #t~string82.base, 5 + #t~string82.offset, 1);call #t~string85.base, #t~string85.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string85.base, #t~string85.offset, 1);call write~init~int(37, #t~string85.base, 1 + #t~string85.offset, 1);call write~init~int(105, #t~string85.base, 2 + #t~string85.offset, 1);call write~init~int(0, #t~string85.base, 3 + #t~string85.offset, 1);call #t~string88.base, #t~string88.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string88.base, #t~string88.offset, 1);call write~init~int(37, #t~string88.base, 1 + #t~string88.offset, 1);call write~init~int(105, #t~string88.base, 2 + #t~string88.offset, 1);call write~init~int(0, #t~string88.base, 3 + #t~string88.offset, 1);call #t~string91.base, #t~string91.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string91.base, #t~string91.offset, 1);call write~init~int(37, #t~string91.base, 1 + #t~string91.offset, 1);call write~init~int(105, #t~string91.base, 2 + #t~string91.offset, 1);call write~init~int(0, #t~string91.base, 3 + #t~string91.offset, 1);call #t~string94.base, #t~string94.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string94.base, #t~string94.offset, 1);call write~init~int(37, #t~string94.base, 1 + #t~string94.offset, 1);call write~init~int(105, #t~string94.base, 2 + #t~string94.offset, 1);call write~init~int(0, #t~string94.base, 3 + #t~string94.offset, 1);call #t~string97.base, #t~string97.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string97.base, #t~string97.offset, 1);call write~init~int(37, #t~string97.base, 1 + #t~string97.offset, 1);call write~init~int(105, #t~string97.base, 2 + #t~string97.offset, 1);call write~init~int(0, #t~string97.base, 3 + #t~string97.offset, 1);call #t~string99.base, #t~string99.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string99.base, #t~string99.offset, 1);call write~init~int(0, #t~string99.base, 1 + #t~string99.offset, 1);call #t~string102.base, #t~string102.offset := #Ultimate.allocOnStack(9);~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;~cleanupTimeShifts~0 := 12;~head~0.base, ~head~0.offset := 0, 0;call #t~string138.base, #t~string138.offset := #Ultimate.allocOnStack(30);call #t~string139.base, #t~string139.offset := #Ultimate.allocOnStack(9);call #t~string140.base, #t~string140.offset := #Ultimate.allocOnStack(21);call #t~string141.base, #t~string141.offset := #Ultimate.allocOnStack(30);call #t~string142.base, #t~string142.offset := #Ultimate.allocOnStack(9);call #t~string143.base, #t~string143.offset := #Ultimate.allocOnStack(21);call #t~string147.base, #t~string147.offset := #Ultimate.allocOnStack(30);call #t~string148.base, #t~string148.offset := #Ultimate.allocOnStack(9);call #t~string149.base, #t~string149.offset := #Ultimate.allocOnStack(25);call #t~string150.base, #t~string150.offset := #Ultimate.allocOnStack(30);call #t~string151.base, #t~string151.offset := #Ultimate.allocOnStack(9);call #t~string152.base, #t~string152.offset := #Ultimate.allocOnStack(25);~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; 4050#L-1true havoc main_#res;havoc main_#t~ret119, main_~retValue_acc~26, main_~tmp~23;havoc main_~retValue_acc~26;havoc main_~tmp~23; 4951#L1680true havoc valid_product_#res;havoc valid_product_~retValue_acc~18;havoc valid_product_~retValue_acc~18;valid_product_~retValue_acc~18 := 1;valid_product_#res := valid_product_~retValue_acc~18; 4400#L1688true main_#t~ret119 := valid_product_#res;main_~tmp~23 := main_#t~ret119;havoc main_#t~ret119; 2870#L2836true assume 0 != main_~tmp~23; 718#L2809true ~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; 478#L3321true havoc bigMacCall_#t~ret112, bigMacCall_~tmp~20;havoc bigMacCall_~tmp~20;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~23;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~23; 1407#L2422true assume 0 == getOrigin_~person;getOrigin_~retValue_acc~23 := 4;getOrigin_#res := getOrigin_~retValue_acc~23; 314#L2447true bigMacCall_#t~ret112 := getOrigin_#res;bigMacCall_~tmp~20 := bigMacCall_#t~ret112;havoc bigMacCall_#t~ret112;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~20;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 3673#L2056true assume 0 == initPersonOnFloor_~floor; 3390#L2057true assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 2054#L2164-1true callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 4088#L1848true assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 4885#L1860-2true havoc cleanup_#t~ret113, cleanup_#t~ret114, cleanup_~i~1, cleanup_~tmp~21, cleanup_~tmp___0~8, cleanup_~__cil_tmp4~0;havoc cleanup_~i~1;havoc cleanup_~tmp~21;havoc cleanup_~tmp___0~8;havoc cleanup_~__cil_tmp4~0;havoc timeShift_#t~ret53, timeShift_~tmp~12;havoc timeShift_~tmp~12;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~2;havoc areDoorsOpen_~retValue_acc~2;areDoorsOpen_~retValue_acc~2 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~2; 1886#L318true timeShift_#t~ret53 := areDoorsOpen_#res;timeShift_~tmp~12 := timeShift_#t~ret53;havoc timeShift_#t~ret53; 2301#L1261true assume 0 != timeShift_~tmp~12; 3561#L1262true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 1910#L934-11true havoc __utac_acc__Specification2_spec__3_#t~ret161, __utac_acc__Specification2_spec__3_#t~ret162, __utac_acc__Specification2_spec__3_#t~ret163, __utac_acc__Specification2_spec__3_#t~ret164, __utac_acc__Specification2_spec__3_#t~ret165, __utac_acc__Specification2_spec__3_#t~ret166, __utac_acc__Specification2_spec__3_~floor~0, __utac_acc__Specification2_spec__3_~tmp~29, __utac_acc__Specification2_spec__3_~tmp___0~12, __utac_acc__Specification2_spec__3_~tmp___1~8, __utac_acc__Specification2_spec__3_~tmp___2~6, __utac_acc__Specification2_spec__3_~tmp___3~5, __utac_acc__Specification2_spec__3_~tmp___4~3;havoc __utac_acc__Specification2_spec__3_~floor~0;havoc __utac_acc__Specification2_spec__3_~tmp~29;havoc __utac_acc__Specification2_spec__3_~tmp___0~12;havoc __utac_acc__Specification2_spec__3_~tmp___1~8;havoc __utac_acc__Specification2_spec__3_~tmp___2~6;havoc __utac_acc__Specification2_spec__3_~tmp___3~5;havoc __utac_acc__Specification2_spec__3_~tmp___4~3;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~1;havoc getCurrentFloorID_~retValue_acc~1;getCurrentFloorID_~retValue_acc~1 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~1; 1205#L309-6true __utac_acc__Specification2_spec__3_#t~ret161 := getCurrentFloorID_#res;__utac_acc__Specification2_spec__3_~tmp~29 := __utac_acc__Specification2_spec__3_#t~ret161;havoc __utac_acc__Specification2_spec__3_#t~ret161;__utac_acc__Specification2_spec__3_~floor~0 := __utac_acc__Specification2_spec__3_~tmp~29; 2954#L3366true assume 0 == __utac_acc__Specification2_spec__3_~floor~0; 2678#L3367true assume 0 != ~floorButtons_spc2_0~0;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~2;havoc areDoorsOpen_~retValue_acc~2;areDoorsOpen_~retValue_acc~2 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~2; 1888#L318-1true __utac_acc__Specification2_spec__3_#t~ret162 := areDoorsOpen_#res;__utac_acc__Specification2_spec__3_~tmp___4~3 := __utac_acc__Specification2_spec__3_#t~ret162;havoc __utac_acc__Specification2_spec__3_#t~ret162; 2415#L3371true assume 0 != __utac_acc__Specification2_spec__3_~tmp___4~3;~floorButtons_spc2_0~0 := 0; 711#L3426true cleanup_~i~1 := 0; 4080#L2641-2true [2019-10-22 09:03:16,428 INFO L793 eck$LassoCheckResult]: Loop: 4080#L2641-2true assume !false; 4186#L2642true cleanup_~__cil_tmp4~0 := ~cleanupTimeShifts~0 - 1; 4027#L2645true assume cleanup_~i~1 < cleanup_~__cil_tmp4~0;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~0;havoc isBlocked_~retValue_acc~0;isBlocked_~retValue_acc~0 := ~blocked~0;isBlocked_#res := isBlocked_~retValue_acc~0; 1277#L131true cleanup_#t~ret113 := isBlocked_#res;cleanup_~tmp___0~8 := cleanup_#t~ret113;havoc cleanup_#t~ret113; 4944#L2649true assume 1 != cleanup_~tmp___0~8; 4945#L2649-1true havoc isIdle_#res;havoc isIdle_#t~ret8, isIdle_~retValue_acc~7, isIdle_~tmp~4;havoc isIdle_~retValue_acc~7;havoc isIdle_~tmp~4;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret3, anyStopRequested_#t~ret4, anyStopRequested_#t~ret5, anyStopRequested_#t~ret6, anyStopRequested_#t~ret7, anyStopRequested_~retValue_acc~6, anyStopRequested_~tmp~3, anyStopRequested_~tmp___0~0, anyStopRequested_~tmp___1~0, anyStopRequested_~tmp___2~0, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~6;havoc anyStopRequested_~tmp~3;havoc anyStopRequested_~tmp___0~0;havoc anyStopRequested_~tmp___1~0;havoc anyStopRequested_~tmp___2~0;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~19;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~19; 2525#L1785-50true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~19 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~19; 2089#L1812-50true anyStopRequested_#t~ret3 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret3;havoc anyStopRequested_#t~ret3; 374#L417true assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~6 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~6; 1604#L481true isIdle_#t~ret8 := anyStopRequested_#res;isIdle_~tmp~4 := isIdle_#t~ret8;havoc isIdle_#t~ret8;isIdle_~retValue_acc~7 := (if 0 == isIdle_~tmp~4 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~7; 1898#L494true cleanup_#t~ret114 := isIdle_#res;cleanup_~tmp~21 := cleanup_#t~ret114;havoc cleanup_#t~ret114; 2962#L2661true assume !(0 != cleanup_~tmp~21);havoc timeShift_#t~ret53, timeShift_~tmp~12;havoc timeShift_~tmp~12;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~2;havoc areDoorsOpen_~retValue_acc~2;areDoorsOpen_~retValue_acc~2 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~2; 1880#L318-6true timeShift_#t~ret53 := areDoorsOpen_#res;timeShift_~tmp~12 := timeShift_#t~ret53;havoc timeShift_#t~ret53; 2304#L1261-1true assume 0 != timeShift_~tmp~12; 3567#L1262-2true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 1895#L934-23true havoc __utac_acc__Specification2_spec__3_#t~ret161, __utac_acc__Specification2_spec__3_#t~ret162, __utac_acc__Specification2_spec__3_#t~ret163, __utac_acc__Specification2_spec__3_#t~ret164, __utac_acc__Specification2_spec__3_#t~ret165, __utac_acc__Specification2_spec__3_#t~ret166, __utac_acc__Specification2_spec__3_~floor~0, __utac_acc__Specification2_spec__3_~tmp~29, __utac_acc__Specification2_spec__3_~tmp___0~12, __utac_acc__Specification2_spec__3_~tmp___1~8, __utac_acc__Specification2_spec__3_~tmp___2~6, __utac_acc__Specification2_spec__3_~tmp___3~5, __utac_acc__Specification2_spec__3_~tmp___4~3;havoc __utac_acc__Specification2_spec__3_~floor~0;havoc __utac_acc__Specification2_spec__3_~tmp~29;havoc __utac_acc__Specification2_spec__3_~tmp___0~12;havoc __utac_acc__Specification2_spec__3_~tmp___1~8;havoc __utac_acc__Specification2_spec__3_~tmp___2~6;havoc __utac_acc__Specification2_spec__3_~tmp___3~5;havoc __utac_acc__Specification2_spec__3_~tmp___4~3;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~1;havoc getCurrentFloorID_~retValue_acc~1;getCurrentFloorID_~retValue_acc~1 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~1; 1188#L309-13true __utac_acc__Specification2_spec__3_#t~ret161 := getCurrentFloorID_#res;__utac_acc__Specification2_spec__3_~tmp~29 := __utac_acc__Specification2_spec__3_#t~ret161;havoc __utac_acc__Specification2_spec__3_#t~ret161;__utac_acc__Specification2_spec__3_~floor~0 := __utac_acc__Specification2_spec__3_~tmp~29; 2952#L3366-1true assume 0 == __utac_acc__Specification2_spec__3_~floor~0; 2685#L3367-1true assume 0 != ~floorButtons_spc2_0~0;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~2;havoc areDoorsOpen_~retValue_acc~2;areDoorsOpen_~retValue_acc~2 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~2; 1882#L318-7true __utac_acc__Specification2_spec__3_#t~ret162 := areDoorsOpen_#res;__utac_acc__Specification2_spec__3_~tmp___4~3 := __utac_acc__Specification2_spec__3_#t~ret162;havoc __utac_acc__Specification2_spec__3_#t~ret162; 2596#L3371-2true assume 0 != __utac_acc__Specification2_spec__3_~tmp___4~3;~floorButtons_spc2_0~0 := 0; 712#L3426-1true cleanup_~i~1 := 1 + cleanup_~i~1; 4080#L2641-2true [2019-10-22 09:03:16,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:16,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1303888161, now seen corresponding path program 1 times [2019-10-22 09:03:16,444 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:16,444 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326392567] [2019-10-22 09:03:16,444 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:16,445 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:16,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:16,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:16,831 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:03:16,834 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326392567] [2019-10-22 09:03:16,835 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:16,836 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:03:16,836 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968503697] [2019-10-22 09:03:16,841 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:03:16,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:16,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1119830963, now seen corresponding path program 1 times [2019-10-22 09:03:16,842 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:16,842 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527148273] [2019-10-22 09:03:16,842 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:16,842 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:16,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:16,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:16,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:16,908 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:03:17,145 WARN L191 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 82 [2019-10-22 09:03:17,257 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-10-22 09:03:17,269 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:03:17,270 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:03:17,270 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:03:17,270 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:03:17,270 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 09:03:17,271 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:03:17,271 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:03:17,271 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:03:17,271 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec2_product28.cil.c_Iteration1_Loop [2019-10-22 09:03:17,271 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:03:17,272 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:03:17,296 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:03:17,302 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:03:17,304 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:03:17,306 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:03:17,308 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:03:17,310 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:03:17,312 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:03:17,314 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:03:17,320 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:03:17,331 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:03:17,334 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:03:17,336 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:03:17,339 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:03:17,344 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:03:17,346 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:03:17,348 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:03:17,350 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:03:17,359 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:03:17,361 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:03:17,363 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:03:17,365 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:03:17,367 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:03:17,368 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:03:17,370 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:03:17,381 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:03:17,391 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:03:17,393 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:03:17,395 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:03:17,397 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:03:17,403 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:03:17,405 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:03:17,412 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:03:17,420 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:03:17,802 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:03:17,808 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7ce35412-cf6a-434f-a585-45bfb98082d8/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:03:17,817 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:03:17,817 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:03:17,825 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:03:17,825 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification2_spec__3_#t~ret166=0} Honda state: {ULTIMATE.start___utac_acc__Specification2_spec__3_#t~ret166=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7ce35412-cf6a-434f-a585-45bfb98082d8/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) [2019-10-22 09:03:17,836 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:03:17,836 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:03:17,849 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:03:17,849 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification2_spec__3_~tmp___1~8=0} Honda state: {ULTIMATE.start___utac_acc__Specification2_spec__3_~tmp___1~8=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7ce35412-cf6a-434f-a585-45bfb98082d8/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) [2019-10-22 09:03:17,873 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:03:17,873 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:03:17,880 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:03:17,880 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification2_spec__3_#t~ret164=0} Honda state: {ULTIMATE.start___utac_acc__Specification2_spec__3_#t~ret164=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7ce35412-cf6a-434f-a585-45bfb98082d8/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:03:17,976 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:03:17,976 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:03:17,980 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:03:17,980 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_cleanup_#t~ret113=0} Honda state: {ULTIMATE.start_cleanup_#t~ret113=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7ce35412-cf6a-434f-a585-45bfb98082d8/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:03:17,991 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:03:17,991 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:03:17,996 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:03:17,997 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification2_spec__3_#t~ret165=0} Honda state: {ULTIMATE.start___utac_acc__Specification2_spec__3_#t~ret165=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7ce35412-cf6a-434f-a585-45bfb98082d8/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) [2019-10-22 09:03:18,006 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:03:18,007 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:03:18,011 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:03:18,011 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_cleanup_#t~ret114=0} Honda state: {ULTIMATE.start_cleanup_#t~ret114=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7ce35412-cf6a-434f-a585-45bfb98082d8/bin/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:03:18,018 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:03:18,018 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:03:18,023 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:03:18,023 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_~tmp___1~0=0} Honda state: {ULTIMATE.start_anyStopRequested_~tmp___1~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7ce35412-cf6a-434f-a585-45bfb98082d8/bin/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:03:18,031 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:03:18,032 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:03:18,037 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:03:18,038 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_isFloorCalling_#in~floorID=0, ULTIMATE.start_isFloorCalling_~floorID=0} Honda state: {ULTIMATE.start_isFloorCalling_#in~floorID=0, ULTIMATE.start_isFloorCalling_~floorID=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7ce35412-cf6a-434f-a585-45bfb98082d8/bin/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:03:18,050 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:03:18,050 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:03:18,060 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:03:18,060 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_areDoorsOpen_#res=-8, ~doorState~0=-8, ULTIMATE.start_timeShift_~tmp~12=-8, ULTIMATE.start___utac_acc__Specification2_spec__3_~tmp___4~3=-8, ULTIMATE.start_areDoorsOpen_~retValue_acc~2=-8} Honda state: {ULTIMATE.start_areDoorsOpen_#res=-8, ~doorState~0=-8, ULTIMATE.start_timeShift_~tmp~12=-8, ULTIMATE.start___utac_acc__Specification2_spec__3_~tmp___4~3=-8, ULTIMATE.start_areDoorsOpen_~retValue_acc~2=-8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7ce35412-cf6a-434f-a585-45bfb98082d8/bin/uautomizer/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:03:18,259 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:03:18,259 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:03:18,268 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:03:18,268 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification2_spec__3_#t~ret162=0} Honda state: {ULTIMATE.start___utac_acc__Specification2_spec__3_#t~ret162=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7ce35412-cf6a-434f-a585-45bfb98082d8/bin/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:03:18,278 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:03:18,278 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:03:18,282 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:03:18,282 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification2_spec__3_#t~ret163=0} Honda state: {ULTIMATE.start___utac_acc__Specification2_spec__3_#t~ret163=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7ce35412-cf6a-434f-a585-45bfb98082d8/bin/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:03:18,294 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:03:18,294 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:03:18,298 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:03:18,298 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~weight~0=1, ~maximumWeight~0=0} Honda state: {~weight~0=1, ~maximumWeight~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7ce35412-cf6a-434f-a585-45bfb98082d8/bin/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:03:18,308 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:03:18,308 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7ce35412-cf6a-434f-a585-45bfb98082d8/bin/uautomizer/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:03:18,324 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 09:03:18,325 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:03:18,341 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 09:03:18,343 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:03:18,343 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:03:18,343 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:03:18,343 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:03:18,343 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:03:18,344 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:03:18,344 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:03:18,344 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:03:18,344 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec2_product28.cil.c_Iteration1_Loop [2019-10-22 09:03:18,344 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:03:18,344 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:03:18,347 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:03:18,352 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:03:18,354 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:03:18,356 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:03:18,358 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:03:18,360 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:03:18,362 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:03:18,364 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:03:18,366 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:03:18,367 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:03:18,370 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:03:18,372 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:03:18,375 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:03:18,379 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:03:18,381 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:03:18,386 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:03:18,388 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:03:18,391 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:03:18,393 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:03:18,402 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:03:18,404 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:03:18,406 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:03:18,409 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:03:18,418 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:03:18,427 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:03:18,430 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:03:18,440 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:03:18,447 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:03:18,453 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:03:18,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:03:18,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:03:18,472 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:03:18,474 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:03:18,807 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:03:18,814 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:03:18,815 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:03:18,817 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:18,817 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:18,818 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:18,818 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:18,818 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:18,820 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:03:18,821 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:18,822 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:18,823 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:03:18,823 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:18,823 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:18,823 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:18,823 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:18,824 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:18,824 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:03:18,826 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:18,826 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:18,827 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:03:18,827 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:18,827 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:18,827 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:18,828 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:18,828 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:18,828 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:03:18,828 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:18,829 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:18,829 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:03:18,829 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:18,830 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:18,830 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:18,830 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:18,830 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:18,830 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:03:18,830 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:18,831 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:18,831 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:03:18,832 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:18,836 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:18,836 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:18,836 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:18,836 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:18,837 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:03:18,838 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:18,838 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:18,840 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:03:18,841 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:18,841 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:18,841 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:18,841 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:18,841 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:18,842 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:03:18,842 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:18,842 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:18,843 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:03:18,843 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:18,843 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:18,843 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:18,843 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:18,844 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:18,849 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:03:18,849 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:18,850 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:18,850 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:03:18,851 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:18,851 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:18,851 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:18,851 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:18,851 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:18,852 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:03:18,852 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:18,853 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:18,853 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:03:18,853 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:18,853 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:18,854 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:18,854 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:18,854 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:18,854 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:03:18,854 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:18,855 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:18,855 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:03:18,856 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:18,860 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:18,860 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:18,860 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:18,860 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:18,861 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:03:18,862 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:18,863 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:18,863 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:03:18,864 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:18,864 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:18,864 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:18,864 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:18,864 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:18,865 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:03:18,865 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:18,865 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:18,866 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:03:18,866 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:18,866 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:18,866 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:18,866 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:18,867 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:18,867 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:03:18,867 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:18,871 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:18,871 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:03:18,872 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:18,872 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:18,872 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:18,873 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:03:18,873 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:18,874 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:03:18,874 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:18,878 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:18,882 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:03:18,883 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:18,883 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:18,883 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:18,883 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:18,887 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:18,887 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:03:18,888 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:18,888 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:18,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:03:18,889 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:18,889 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:18,890 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:18,890 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:18,890 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:18,890 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:03:18,890 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:18,891 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:18,898 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:03:18,899 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:18,899 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:18,899 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:18,899 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:18,899 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:18,900 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:03:18,900 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:18,901 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:18,901 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:03:18,901 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:18,901 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:18,902 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:18,902 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:18,902 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:18,902 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:03:18,902 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:18,903 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:18,903 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:03:18,903 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:18,904 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:18,905 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:18,905 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:18,906 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:18,906 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:03:18,906 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:18,907 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:18,907 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:03:18,908 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:18,909 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:18,909 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:18,910 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:03:18,910 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:18,911 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:03:18,911 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:18,920 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:18,922 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:03:18,923 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:18,928 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:18,928 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:18,928 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:18,928 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:18,929 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:03:18,929 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:18,929 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:18,930 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:03:18,930 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:18,930 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:18,930 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:18,931 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:18,931 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:18,931 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:03:18,931 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:18,934 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:18,934 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:03:18,935 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:18,935 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:18,935 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:18,935 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:18,935 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:18,936 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:03:18,936 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:18,937 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:18,937 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:03:18,937 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:18,937 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:18,938 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:18,938 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:03:18,938 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:18,939 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:03:18,939 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:18,953 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:18,956 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:03:18,957 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:18,958 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:18,958 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:18,958 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:18,958 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:18,959 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:03:18,961 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:18,963 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:18,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:03:18,964 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:18,964 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:18,964 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:18,964 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:18,964 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:18,965 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:03:18,965 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:18,965 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:18,966 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:03:18,966 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:18,966 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:18,966 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:18,966 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:03:18,966 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:18,967 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:03:18,967 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:18,982 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:18,982 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:03:18,983 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:18,983 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:18,983 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:18,983 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:18,983 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:18,987 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:03:18,987 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:18,990 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:18,992 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:03:18,993 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:18,994 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:18,994 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:18,994 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:18,994 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:18,995 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:03:18,995 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:18,995 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:18,998 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:03:18,999 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:18,999 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:18,999 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:18,999 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:18,999 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:19,000 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:03:19,000 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:19,000 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:19,002 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:03:19,002 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:19,003 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:19,003 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:19,003 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:19,003 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:19,004 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:03:19,005 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:19,005 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:19,006 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:03:19,006 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:19,006 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:19,006 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:19,007 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:19,007 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:19,007 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:03:19,007 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:19,010 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:03:19,015 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 09:03:19,018 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 09:03:19,020 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:03:19,021 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 09:03:19,022 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:03:19,022 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~cleanupTimeShifts~0, ULTIMATE.start_cleanup_~i~1) = 1*~cleanupTimeShifts~0 - 1*ULTIMATE.start_cleanup_~i~1 Supporting invariants [] [2019-10-22 09:03:19,025 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 09:03:19,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:19,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:19,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:03:19,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:03:19,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:19,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 09:03:19,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:03:19,295 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:03:19,313 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:03:19,315 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 5039 states. Second operand 5 states. [2019-10-22 09:03:19,837 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 5039 states.. Second operand 5 states. Result 7608 states and 14294 transitions. Complement of second has 9 states. [2019-10-22 09:03:19,838 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:03:19,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 09:03:19,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9535 transitions. [2019-10-22 09:03:19,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 9535 transitions. Stem has 24 letters. Loop has 22 letters. [2019-10-22 09:03:19,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:03:19,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 9535 transitions. Stem has 46 letters. Loop has 22 letters. [2019-10-22 09:03:19,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:03:19,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 9535 transitions. Stem has 24 letters. Loop has 44 letters. [2019-10-22 09:03:19,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:03:19,860 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7608 states and 14294 transitions. [2019-10-22 09:03:19,927 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:03:19,930 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7608 states to 0 states and 0 transitions. [2019-10-22 09:03:19,931 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 09:03:19,931 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 09:03:19,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 09:03:19,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:03:19,932 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:03:19,933 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:03:19,933 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:19,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:03:19,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:03:19,938 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2019-10-22 09:03:19,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:19,941 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-10-22 09:03:19,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 09:03:19,942 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-10-22 09:03:19,942 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:03:19,942 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 09:03:19,942 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 09:03:19,942 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 09:03:19,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 09:03:19,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:03:19,942 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:03:19,942 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:03:19,943 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:03:19,943 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 09:03:19,943 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 09:03:19,943 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:03:19,943 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 09:03:19,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 09:03:19 BoogieIcfgContainer [2019-10-22 09:03:19,950 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 09:03:19,950 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:03:19,950 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:03:19,950 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:03:19,951 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:03:16" (3/4) ... [2019-10-22 09:03:19,955 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 09:03:19,955 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:03:19,956 INFO L168 Benchmark]: Toolchain (without parser) took 13704.46 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 645.4 MB). Free memory was 937.8 MB in the beginning and 1.2 GB in the end (delta: -220.7 MB). Peak memory consumption was 424.7 MB. Max. memory is 11.5 GB. [2019-10-22 09:03:19,957 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:03:19,957 INFO L168 Benchmark]: CACSL2BoogieTranslator took 780.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 937.8 MB in the beginning and 1.1 GB in the end (delta: -144.5 MB). Peak memory consumption was 29.6 MB. Max. memory is 11.5 GB. [2019-10-22 09:03:19,958 INFO L168 Benchmark]: Boogie Procedure Inliner took 244.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 54.9 MB). Peak memory consumption was 54.9 MB. Max. memory is 11.5 GB. [2019-10-22 09:03:19,958 INFO L168 Benchmark]: Boogie Preprocessor took 299.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 978.9 MB in the end (delta: 48.5 MB). Peak memory consumption was 48.5 MB. Max. memory is 11.5 GB. [2019-10-22 09:03:19,959 INFO L168 Benchmark]: RCFGBuilder took 8466.10 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 210.2 MB). Free memory was 978.9 MB in the beginning and 1.1 GB in the end (delta: -91.2 MB). Peak memory consumption was 434.3 MB. Max. memory is 11.5 GB. [2019-10-22 09:03:19,960 INFO L168 Benchmark]: BuchiAutomizer took 3904.40 ms. Allocated memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: 300.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -88.4 MB). Peak memory consumption was 212.0 MB. Max. memory is 11.5 GB. [2019-10-22 09:03:19,960 INFO L168 Benchmark]: Witness Printer took 4.64 ms. Allocated memory is still 1.7 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:03:19,963 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 780.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 937.8 MB in the beginning and 1.1 GB in the end (delta: -144.5 MB). Peak memory consumption was 29.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 244.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 54.9 MB). Peak memory consumption was 54.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 299.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 978.9 MB in the end (delta: 48.5 MB). Peak memory consumption was 48.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 8466.10 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 210.2 MB). Free memory was 978.9 MB in the beginning and 1.1 GB in the end (delta: -91.2 MB). Peak memory consumption was 434.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3904.40 ms. Allocated memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: 300.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -88.4 MB). Peak memory consumption was 212.0 MB. Max. memory is 11.5 GB. * Witness Printer took 4.64 ms. Allocated memory is still 1.7 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function cleanupTimeShifts + -1 * i and consists of 6 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.8s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 2.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.8s. 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: 9501 SDtfs, 14242 SDslu, 4767 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: 6ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 12 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...