./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/product-lines/elevator_spec1_product22.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_12c778a2-ec80-402d-bfd0-698097a6fc20/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_12c778a2-ec80-402d-bfd0-698097a6fc20/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_12c778a2-ec80-402d-bfd0-698097a6fc20/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_12c778a2-ec80-402d-bfd0-698097a6fc20/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/product-lines/elevator_spec1_product22.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_12c778a2-ec80-402d-bfd0-698097a6fc20/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_12c778a2-ec80-402d-bfd0-698097a6fc20/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 7de9141af96153b285955ba42fc7413bef264932 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:02:28,440 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:02:28,441 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:02:28,450 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:02:28,450 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:02:28,451 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:02:28,452 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:02:28,453 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:02:28,454 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:02:28,455 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:02:28,455 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:02:28,456 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:02:28,457 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:02:28,457 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:02:28,458 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:02:28,459 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:02:28,460 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:02:28,460 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:02:28,462 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:02:28,463 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:02:28,465 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:02:28,466 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:02:28,467 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:02:28,467 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:02:28,469 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:02:28,469 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:02:28,470 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:02:28,470 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:02:28,471 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:02:28,471 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:02:28,472 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:02:28,472 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:02:28,473 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:02:28,474 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:02:28,475 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:02:28,475 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:02:28,475 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:02:28,476 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:02:28,476 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:02:28,477 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:02:28,477 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:02:28,478 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_12c778a2-ec80-402d-bfd0-698097a6fc20/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 09:02:28,490 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:02:28,491 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:02:28,492 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:02:28,492 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:02:28,492 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:02:28,492 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 09:02:28,492 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 09:02:28,493 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 09:02:28,493 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 09:02:28,493 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 09:02:28,493 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 09:02:28,493 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:02:28,493 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 09:02:28,493 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 09:02:28,494 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:02:28,494 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 09:02:28,494 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:02:28,494 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 09:02:28,494 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 09:02:28,494 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 09:02:28,494 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 09:02:28,495 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:02:28,495 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 09:02:28,495 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:02:28,495 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 09:02:28,495 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:02:28,495 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:02:28,496 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 09:02:28,496 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:02:28,496 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:02:28,496 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 09:02:28,497 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 09:02:28,497 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_12c778a2-ec80-402d-bfd0-698097a6fc20/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 -> 7de9141af96153b285955ba42fc7413bef264932 [2019-10-22 09:02:28,520 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:02:28,530 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:02:28,533 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:02:28,535 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:02:28,535 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:02:28,536 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_12c778a2-ec80-402d-bfd0-698097a6fc20/bin/uautomizer/../../sv-benchmarks/c/product-lines/elevator_spec1_product22.cil.c [2019-10-22 09:02:28,593 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_12c778a2-ec80-402d-bfd0-698097a6fc20/bin/uautomizer/data/4052833e9/03daa0ebf6e04d8eb19988a24a84fac1/FLAG8ef88290c [2019-10-22 09:02:29,111 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:02:29,112 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_12c778a2-ec80-402d-bfd0-698097a6fc20/sv-benchmarks/c/product-lines/elevator_spec1_product22.cil.c [2019-10-22 09:02:29,130 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_12c778a2-ec80-402d-bfd0-698097a6fc20/bin/uautomizer/data/4052833e9/03daa0ebf6e04d8eb19988a24a84fac1/FLAG8ef88290c [2019-10-22 09:02:29,558 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_12c778a2-ec80-402d-bfd0-698097a6fc20/bin/uautomizer/data/4052833e9/03daa0ebf6e04d8eb19988a24a84fac1 [2019-10-22 09:02:29,560 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:02:29,561 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:02:29,562 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:02:29,562 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:02:29,566 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:02:29,567 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:02:29" (1/1) ... [2019-10-22 09:02:29,569 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27fb289e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:29, skipping insertion in model container [2019-10-22 09:02:29,569 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:02:29" (1/1) ... [2019-10-22 09:02:29,576 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:02:29,634 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:02:30,211 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:02:30,227 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:02:30,339 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:02:30,391 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:02:30,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:30 WrapperNode [2019-10-22 09:02:30,392 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:02:30,393 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:02:30,393 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:02:30,393 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:02:30,401 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:02:30" (1/1) ... [2019-10-22 09:02:30,433 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:02:30" (1/1) ... [2019-10-22 09:02:30,678 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:02:30,678 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:02:30,678 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:02:30,678 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:02:30,688 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:30" (1/1) ... [2019-10-22 09:02:30,688 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:30" (1/1) ... [2019-10-22 09:02:30,727 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:30" (1/1) ... [2019-10-22 09:02:30,728 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:30" (1/1) ... [2019-10-22 09:02:30,850 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:30" (1/1) ... [2019-10-22 09:02:30,944 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:30" (1/1) ... [2019-10-22 09:02:30,985 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:30" (1/1) ... [2019-10-22 09:02:31,041 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:02:31,041 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:02:31,041 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:02:31,042 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:02:31,042 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_12c778a2-ec80-402d-bfd0-698097a6fc20/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:02:31,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 09:02:31,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-22 09:02:31,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:02:31,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:02:41,165 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:02:41,166 INFO L284 CfgBuilder]: Removed 1433 assume(true) statements. [2019-10-22 09:02:41,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:41 BoogieIcfgContainer [2019-10-22 09:02:41,170 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:02:41,171 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 09:02:41,171 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 09:02:41,175 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 09:02:41,176 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:02:41,176 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 09:02:29" (1/3) ... [2019-10-22 09:02:41,178 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7ad616d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:02:41, skipping insertion in model container [2019-10-22 09:02:41,179 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:02:41,179 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:30" (2/3) ... [2019-10-22 09:02:41,179 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7ad616d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:02:41, skipping insertion in model container [2019-10-22 09:02:41,179 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:02:41,179 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:41" (3/3) ... [2019-10-22 09:02:41,181 INFO L371 chiAutomizerObserver]: Analyzing ICFG elevator_spec1_product22.cil.c [2019-10-22 09:02:41,238 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 09:02:41,239 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 09:02:41,239 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 09:02:41,239 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:02:41,239 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:02:41,239 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 09:02:41,239 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:02:41,239 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 09:02:41,334 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6686 states. [2019-10-22 09:02:41,475 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3303 [2019-10-22 09:02:41,476 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:41,476 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:41,498 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:41,499 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:02:41,499 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 09:02:41,499 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6686 states. [2019-10-22 09:02:41,568 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3303 [2019-10-22 09:02:41,568 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:41,568 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:41,573 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:41,573 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:02:41,578 INFO L791 eck$LassoCheckResult]: Stem: 1786#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(30);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(9);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(21);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(30);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(9);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(21);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(30);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(9);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(25);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(30);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(9);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(25);~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~weight~0 := 0;~maximumWeight~0 := 100;~blocked~0 := 0;~cleanupTimeShifts~0 := 12;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0;call #t~string109.base, #t~string109.offset := #Ultimate.allocOnStack(10);call #t~string111.base, #t~string111.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string111.base, #t~string111.offset, 1);call write~init~int(95, #t~string111.base, 1 + #t~string111.offset, 1);call write~init~int(93, #t~string111.base, 2 + #t~string111.offset, 1);call write~init~int(0, #t~string111.base, 3 + #t~string111.offset, 1);call #t~string113.base, #t~string113.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string113.base, #t~string113.offset, 1);call write~init~int(93, #t~string113.base, 1 + #t~string113.offset, 1);call write~init~int(32, #t~string113.base, 2 + #t~string113.offset, 1);call write~init~int(0, #t~string113.base, 3 + #t~string113.offset, 1);call #t~string115.base, #t~string115.offset := #Ultimate.allocOnStack(5);call write~init~int(32, #t~string115.base, #t~string115.offset, 1);call write~init~int(97, #t~string115.base, 1 + #t~string115.offset, 1);call write~init~int(116, #t~string115.base, 2 + #t~string115.offset, 1);call write~init~int(32, #t~string115.base, 3 + #t~string115.offset, 1);call write~init~int(0, #t~string115.base, 4 + #t~string115.offset, 1);call #t~string117.base, #t~string117.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string117.base, #t~string117.offset, 1);call write~init~int(105, #t~string117.base, 1 + #t~string117.offset, 1);call write~init~int(0, #t~string117.base, 2 + #t~string117.offset, 1);call #t~string119.base, #t~string119.offset := #Ultimate.allocOnStack(10);call #t~string121.base, #t~string121.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string121.base, #t~string121.offset, 1);call write~init~int(112, #t~string121.base, 1 + #t~string121.offset, 1);call write~init~int(0, #t~string121.base, 2 + #t~string121.offset, 1);call #t~string123.base, #t~string123.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string123.base, #t~string123.offset, 1);call write~init~int(111, #t~string123.base, 1 + #t~string123.offset, 1);call write~init~int(119, #t~string123.base, 2 + #t~string123.offset, 1);call write~init~int(110, #t~string123.base, 3 + #t~string123.offset, 1);call write~init~int(0, #t~string123.base, 4 + #t~string123.offset, 1);call #t~string125.base, #t~string125.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string125.base, #t~string125.offset, 1);call write~init~int(73, #t~string125.base, 1 + #t~string125.offset, 1);call write~init~int(76, #t~string125.base, 2 + #t~string125.offset, 1);call write~init~int(95, #t~string125.base, 3 + #t~string125.offset, 1);call write~init~int(112, #t~string125.base, 4 + #t~string125.offset, 1);call write~init~int(58, #t~string125.base, 5 + #t~string125.offset, 1);call write~init~int(0, #t~string125.base, 6 + #t~string125.offset, 1);call #t~string127.base, #t~string127.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string127.base, #t~string127.offset, 1);call write~init~int(37, #t~string127.base, 1 + #t~string127.offset, 1);call write~init~int(105, #t~string127.base, 2 + #t~string127.offset, 1);call write~init~int(0, #t~string127.base, 3 + #t~string127.offset, 1);call #t~string129.base, #t~string129.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string129.base, #t~string129.offset, 1);call write~init~int(37, #t~string129.base, 1 + #t~string129.offset, 1);call write~init~int(105, #t~string129.base, 2 + #t~string129.offset, 1);call write~init~int(0, #t~string129.base, 3 + #t~string129.offset, 1);call #t~string131.base, #t~string131.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string131.base, #t~string131.offset, 1);call write~init~int(37, #t~string131.base, 1 + #t~string131.offset, 1);call write~init~int(105, #t~string131.base, 2 + #t~string131.offset, 1);call write~init~int(0, #t~string131.base, 3 + #t~string131.offset, 1);call #t~string133.base, #t~string133.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string133.base, #t~string133.offset, 1);call write~init~int(37, #t~string133.base, 1 + #t~string133.offset, 1);call write~init~int(105, #t~string133.base, 2 + #t~string133.offset, 1);call write~init~int(0, #t~string133.base, 3 + #t~string133.offset, 1);call #t~string135.base, #t~string135.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string135.base, #t~string135.offset, 1);call write~init~int(37, #t~string135.base, 1 + #t~string135.offset, 1);call write~init~int(105, #t~string135.base, 2 + #t~string135.offset, 1);call write~init~int(0, #t~string135.base, 3 + #t~string135.offset, 1);call #t~string137.base, #t~string137.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string137.base, #t~string137.offset, 1);call write~init~int(70, #t~string137.base, 1 + #t~string137.offset, 1);call write~init~int(95, #t~string137.base, 2 + #t~string137.offset, 1);call write~init~int(112, #t~string137.base, 3 + #t~string137.offset, 1);call write~init~int(58, #t~string137.base, 4 + #t~string137.offset, 1);call write~init~int(0, #t~string137.base, 5 + #t~string137.offset, 1);call #t~string140.base, #t~string140.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string140.base, #t~string140.offset, 1);call write~init~int(37, #t~string140.base, 1 + #t~string140.offset, 1);call write~init~int(105, #t~string140.base, 2 + #t~string140.offset, 1);call write~init~int(0, #t~string140.base, 3 + #t~string140.offset, 1);call #t~string143.base, #t~string143.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string143.base, #t~string143.offset, 1);call write~init~int(37, #t~string143.base, 1 + #t~string143.offset, 1);call write~init~int(105, #t~string143.base, 2 + #t~string143.offset, 1);call write~init~int(0, #t~string143.base, 3 + #t~string143.offset, 1);call #t~string146.base, #t~string146.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string146.base, #t~string146.offset, 1);call write~init~int(37, #t~string146.base, 1 + #t~string146.offset, 1);call write~init~int(105, #t~string146.base, 2 + #t~string146.offset, 1);call write~init~int(0, #t~string146.base, 3 + #t~string146.offset, 1);call #t~string149.base, #t~string149.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string149.base, #t~string149.offset, 1);call write~init~int(37, #t~string149.base, 1 + #t~string149.offset, 1);call write~init~int(105, #t~string149.base, 2 + #t~string149.offset, 1);call write~init~int(0, #t~string149.base, 3 + #t~string149.offset, 1);call #t~string152.base, #t~string152.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string152.base, #t~string152.offset, 1);call write~init~int(37, #t~string152.base, 1 + #t~string152.offset, 1);call write~init~int(105, #t~string152.base, 2 + #t~string152.offset, 1);call write~init~int(0, #t~string152.base, 3 + #t~string152.offset, 1);call #t~string154.base, #t~string154.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string154.base, #t~string154.offset, 1);call write~init~int(0, #t~string154.base, 1 + #t~string154.offset, 1);call #t~string157.base, #t~string157.offset := #Ultimate.allocOnStack(9);~landingButtons_spc1_0~0 := 0;~landingButtons_spc1_1~0 := 0;~landingButtons_spc1_2~0 := 0;~landingButtons_spc1_3~0 := 0;~landingButtons_spc1_4~0 := 0; 6153#L-1true havoc main_#res;havoc main_#t~ret54, main_~retValue_acc~7, main_~tmp~13;havoc main_~retValue_acc~7;havoc main_~tmp~13; 1566#L1700true havoc valid_product_#res;havoc valid_product_~retValue_acc~12;havoc valid_product_~retValue_acc~12;valid_product_~retValue_acc~12 := 1;valid_product_#res := valid_product_~retValue_acc~12; 1933#L1708true main_#t~ret54 := valid_product_#res;main_~tmp~13 := main_#t~ret54;havoc main_#t~ret54; 1952#L1531true assume 0 != main_~tmp~13; 2148#L1500true ~landingButtons_spc1_0~0 := 0;~landingButtons_spc1_1~0 := 0;~landingButtons_spc1_2~0 := 0;~landingButtons_spc1_3~0 := 0;~landingButtons_spc1_4~0 := 0; 1589#L3285true havoc bigMacCall_#t~ret47, bigMacCall_~tmp~10;havoc bigMacCall_~tmp~10;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~9;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~9; 5572#L1603true assume 0 == getOrigin_~person;getOrigin_~retValue_acc~9 := 4;getOrigin_#res := getOrigin_~retValue_acc~9; 1062#L1628true bigMacCall_#t~ret47 := getOrigin_#res;bigMacCall_~tmp~10 := bigMacCall_#t~ret47;havoc bigMacCall_#t~ret47;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~10;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 305#L770true assume 0 == initPersonOnFloor_~floor; 267#L771true assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 6472#L878-1true callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID, callOnFloor_~__utac__ad__arg1~0;callOnFloor_~floorID := callOnFloor_#in~floorID;havoc callOnFloor_~__utac__ad__arg1~0;callOnFloor_~__utac__ad__arg1~0 := callOnFloor_~floorID;__utac_acc__Specification1_spec__2_#in~floor := callOnFloor_~__utac__ad__arg1~0;havoc __utac_acc__Specification1_spec__2_~floor;__utac_acc__Specification1_spec__2_~floor := __utac_acc__Specification1_spec__2_#in~floor; 2060#L3292true assume 0 == __utac_acc__Specification1_spec__2_~floor;~landingButtons_spc1_0~0 := 1; 4513#L3304-2true assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 964#L574-2true havoc angelinaCall_#t~ret44, angelinaCall_~tmp~7;havoc angelinaCall_~tmp~7;getOrigin_#in~person := 2;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~9;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~9; 5574#L1603-1true assume 0 == getOrigin_~person;getOrigin_~retValue_acc~9 := 4;getOrigin_#res := getOrigin_~retValue_acc~9; 1063#L1628-1true angelinaCall_#t~ret44 := getOrigin_#res;angelinaCall_~tmp~7 := angelinaCall_#t~ret44;havoc angelinaCall_#t~ret44;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 2, angelinaCall_~tmp~7;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 307#L770-1true assume 0 == initPersonOnFloor_~floor; 272#L771-2true assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 6476#L878-3true callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID, callOnFloor_~__utac__ad__arg1~0;callOnFloor_~floorID := callOnFloor_#in~floorID;havoc callOnFloor_~__utac__ad__arg1~0;callOnFloor_~__utac__ad__arg1~0 := callOnFloor_~floorID;__utac_acc__Specification1_spec__2_#in~floor := callOnFloor_~__utac__ad__arg1~0;havoc __utac_acc__Specification1_spec__2_~floor;__utac_acc__Specification1_spec__2_~floor := __utac_acc__Specification1_spec__2_#in~floor; 2059#L3292-2true assume 0 == __utac_acc__Specification1_spec__2_~floor;~landingButtons_spc1_0~0 := 1; 4496#L3304-5true assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 959#L574-5true havoc cleanup_#t~ret48, cleanup_#t~ret49, cleanup_~i~2, cleanup_~tmp~11, cleanup_~tmp___0~2, cleanup_~__cil_tmp4~2;havoc cleanup_~i~2;havoc cleanup_~tmp~11;havoc cleanup_~tmp___0~2;havoc cleanup_~__cil_tmp4~2;havoc timeShift_#t~ret108, timeShift_~tmp~25;havoc timeShift_~tmp~25;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~15;havoc areDoorsOpen_~retValue_acc~15;areDoorsOpen_~retValue_acc~15 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~15; 6629#L1947true timeShift_#t~ret108 := areDoorsOpen_#res;timeShift_~tmp~25 := timeShift_#t~ret108;havoc timeShift_#t~ret108; 579#L2897true assume 0 != timeShift_~tmp~25; 631#L2898true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 1818#L2573-11true havoc __utac_acc__Specification1_spec__3_#t~ret159, __utac_acc__Specification1_spec__3_#t~ret160, __utac_acc__Specification1_spec__3_#t~ret161, __utac_acc__Specification1_spec__3_#t~ret162, __utac_acc__Specification1_spec__3_#t~ret163, __utac_acc__Specification1_spec__3_#t~ret164, __utac_acc__Specification1_spec__3_~floor~0, __utac_acc__Specification1_spec__3_~tmp~28, __utac_acc__Specification1_spec__3_~tmp___0~11, __utac_acc__Specification1_spec__3_~tmp___1~8, __utac_acc__Specification1_spec__3_~tmp___2~6, __utac_acc__Specification1_spec__3_~tmp___3~5, __utac_acc__Specification1_spec__3_~tmp___4~3;havoc __utac_acc__Specification1_spec__3_~floor~0;havoc __utac_acc__Specification1_spec__3_~tmp~28;havoc __utac_acc__Specification1_spec__3_~tmp___0~11;havoc __utac_acc__Specification1_spec__3_~tmp___1~8;havoc __utac_acc__Specification1_spec__3_~tmp___2~6;havoc __utac_acc__Specification1_spec__3_~tmp___3~5;havoc __utac_acc__Specification1_spec__3_~tmp___4~3;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~14;havoc getCurrentFloorID_~retValue_acc~14;getCurrentFloorID_~retValue_acc~14 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~14; 6258#L1938-2true __utac_acc__Specification1_spec__3_#t~ret159 := getCurrentFloorID_#res;__utac_acc__Specification1_spec__3_~tmp~28 := __utac_acc__Specification1_spec__3_#t~ret159;havoc __utac_acc__Specification1_spec__3_#t~ret159;__utac_acc__Specification1_spec__3_~floor~0 := __utac_acc__Specification1_spec__3_~tmp~28; 3027#L3330true assume 0 == __utac_acc__Specification1_spec__3_~floor~0; 2889#L3331true assume 0 != ~landingButtons_spc1_0~0;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~15;havoc areDoorsOpen_~retValue_acc~15;areDoorsOpen_~retValue_acc~15 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~15; 6630#L1947-1true __utac_acc__Specification1_spec__3_#t~ret160 := areDoorsOpen_#res;__utac_acc__Specification1_spec__3_~tmp___4~3 := __utac_acc__Specification1_spec__3_#t~ret160;havoc __utac_acc__Specification1_spec__3_#t~ret160; 4040#L3335true assume 0 != __utac_acc__Specification1_spec__3_~tmp___4~3;~landingButtons_spc1_0~0 := 0; 1052#L3390true cleanup_~i~2 := 0; 2606#L1332-2true [2019-10-22 09:02:41,579 INFO L793 eck$LassoCheckResult]: Loop: 2606#L1332-2true assume !false; 2485#L1333true cleanup_~__cil_tmp4~2 := ~cleanupTimeShifts~0 - 1; 2382#L1336true assume cleanup_~i~2 < cleanup_~__cil_tmp4~2;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~13;havoc isBlocked_~retValue_acc~13;isBlocked_~retValue_acc~13 := ~blocked~0;isBlocked_#res := isBlocked_~retValue_acc~13; 5487#L1785true cleanup_#t~ret48 := isBlocked_#res;cleanup_~tmp___0~2 := cleanup_#t~ret48;havoc cleanup_#t~ret48; 1819#L1340true assume 1 != cleanup_~tmp___0~2; 1820#L1340-1true havoc isIdle_#res;havoc isIdle_#t~ret63, isIdle_~retValue_acc~20, isIdle_~tmp~17;havoc isIdle_~retValue_acc~20;havoc isIdle_~tmp~17;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret58, anyStopRequested_#t~ret59, anyStopRequested_#t~ret60, anyStopRequested_#t~ret61, anyStopRequested_#t~ret62, anyStopRequested_~retValue_acc~19, anyStopRequested_~tmp~16, anyStopRequested_~tmp___0~4, anyStopRequested_~tmp___1~3, anyStopRequested_~tmp___2~1, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~19;havoc anyStopRequested_~tmp~16;havoc anyStopRequested_~tmp___0~4;havoc anyStopRequested_~tmp___1~3;havoc anyStopRequested_~tmp___2~1;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~3;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~3; 5178#L494-122true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~3 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~3; 6514#L521-122true anyStopRequested_#t~ret58 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret58;havoc anyStopRequested_#t~ret58; 1757#L2046true assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~19 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~19; 6333#L2110true isIdle_#t~ret63 := anyStopRequested_#res;isIdle_~tmp~17 := isIdle_#t~ret63;havoc isIdle_#t~ret63;isIdle_~retValue_acc~20 := (if 0 == isIdle_~tmp~17 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~20; 6631#L2123true cleanup_#t~ret49 := isIdle_#res;cleanup_~tmp~11 := cleanup_#t~ret49;havoc cleanup_#t~ret49; 2042#L1352true assume !(0 != cleanup_~tmp~11);havoc timeShift_#t~ret108, timeShift_~tmp~25;havoc timeShift_~tmp~25;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~15;havoc areDoorsOpen_~retValue_acc~15;areDoorsOpen_~retValue_acc~15 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~15; 6628#L1947-6true timeShift_#t~ret108 := areDoorsOpen_#res;timeShift_~tmp~25 := timeShift_#t~ret108;havoc timeShift_#t~ret108; 583#L2897-1true assume 0 != timeShift_~tmp~25; 633#L2898-2true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 1814#L2573-23true havoc __utac_acc__Specification1_spec__3_#t~ret159, __utac_acc__Specification1_spec__3_#t~ret160, __utac_acc__Specification1_spec__3_#t~ret161, __utac_acc__Specification1_spec__3_#t~ret162, __utac_acc__Specification1_spec__3_#t~ret163, __utac_acc__Specification1_spec__3_#t~ret164, __utac_acc__Specification1_spec__3_~floor~0, __utac_acc__Specification1_spec__3_~tmp~28, __utac_acc__Specification1_spec__3_~tmp___0~11, __utac_acc__Specification1_spec__3_~tmp___1~8, __utac_acc__Specification1_spec__3_~tmp___2~6, __utac_acc__Specification1_spec__3_~tmp___3~5, __utac_acc__Specification1_spec__3_~tmp___4~3;havoc __utac_acc__Specification1_spec__3_~floor~0;havoc __utac_acc__Specification1_spec__3_~tmp~28;havoc __utac_acc__Specification1_spec__3_~tmp___0~11;havoc __utac_acc__Specification1_spec__3_~tmp___1~8;havoc __utac_acc__Specification1_spec__3_~tmp___2~6;havoc __utac_acc__Specification1_spec__3_~tmp___3~5;havoc __utac_acc__Specification1_spec__3_~tmp___4~3;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~14;havoc getCurrentFloorID_~retValue_acc~14;getCurrentFloorID_~retValue_acc~14 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~14; 6247#L1938-5true __utac_acc__Specification1_spec__3_#t~ret159 := getCurrentFloorID_#res;__utac_acc__Specification1_spec__3_~tmp~28 := __utac_acc__Specification1_spec__3_#t~ret159;havoc __utac_acc__Specification1_spec__3_#t~ret159;__utac_acc__Specification1_spec__3_~floor~0 := __utac_acc__Specification1_spec__3_~tmp~28; 3041#L3330-1true assume 0 == __utac_acc__Specification1_spec__3_~floor~0; 2883#L3331-1true assume 0 != ~landingButtons_spc1_0~0;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~15;havoc areDoorsOpen_~retValue_acc~15;areDoorsOpen_~retValue_acc~15 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~15; 6615#L1947-7true __utac_acc__Specification1_spec__3_#t~ret160 := areDoorsOpen_#res;__utac_acc__Specification1_spec__3_~tmp___4~3 := __utac_acc__Specification1_spec__3_#t~ret160;havoc __utac_acc__Specification1_spec__3_#t~ret160; 4045#L3335-2true assume 0 != __utac_acc__Specification1_spec__3_~tmp___4~3;~landingButtons_spc1_0~0 := 0; 1051#L3390-1true cleanup_~i~2 := 1 + cleanup_~i~2; 2606#L1332-2true [2019-10-22 09:02:41,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:41,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1434627856, now seen corresponding path program 1 times [2019-10-22 09:02:41,592 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:41,593 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984400988] [2019-10-22 09:02:41,593 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:41,593 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:41,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:41,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:41,820 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:02:41,825 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984400988] [2019-10-22 09:02:41,826 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:41,826 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:41,827 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312477500] [2019-10-22 09:02:41,831 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:02:41,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:41,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1669856429, now seen corresponding path program 1 times [2019-10-22 09:02:41,832 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:41,832 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125521163] [2019-10-22 09:02:41,832 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:41,832 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:41,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:41,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:41,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:41,901 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:42,110 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 84 [2019-10-22 09:02:42,338 WARN L191 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2019-10-22 09:02:42,349 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:02:42,349 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:02:42,350 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:02:42,350 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:02:42,350 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 09:02:42,350 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:42,350 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:02:42,350 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:02:42,350 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec1_product22.cil.c_Iteration1_Loop [2019-10-22 09:02:42,350 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:02:42,351 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:02:42,376 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:02:42,382 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:02:42,384 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:02:42,385 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:02:42,387 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:02:42,398 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:02:42,408 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:02:42,416 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:02:42,423 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:02:42,426 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:02:42,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:02:42,429 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:02:42,431 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:02:42,432 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:02:42,441 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:02:42,443 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:02:42,445 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:02:42,446 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:02:42,448 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:02:42,458 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:02:42,464 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:02:42,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:42,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:42,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:42,479 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:02:42,481 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:02:42,483 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:02:42,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:42,492 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:02:42,494 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:02:42,496 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:02:42,498 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:02:42,500 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:02:42,822 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:02:42,823 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_12c778a2-ec80-402d-bfd0-698097a6fc20/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:02:42,835 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:02:42,835 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:02:42,842 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:02:42,842 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification1_spec__3_#t~ret162=0} Honda state: {ULTIMATE.start___utac_acc__Specification1_spec__3_#t~ret162=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_12c778a2-ec80-402d-bfd0-698097a6fc20/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:42,869 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:02:42,870 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:02:42,874 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:02:42,874 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification1_spec__3_#t~ret161=0} Honda state: {ULTIMATE.start___utac_acc__Specification1_spec__3_#t~ret161=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_12c778a2-ec80-402d-bfd0-698097a6fc20/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:42,885 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:02:42,885 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:02:42,905 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:02:42,905 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification1_spec__3_#t~ret160=0} Honda state: {ULTIMATE.start___utac_acc__Specification1_spec__3_#t~ret160=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_12c778a2-ec80-402d-bfd0-698097a6fc20/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:02:42,930 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:02:42,930 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:02:42,937 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:02:42,937 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_~tmp___1~3=0} Honda state: {ULTIMATE.start_anyStopRequested_~tmp___1~3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_12c778a2-ec80-402d-bfd0-698097a6fc20/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) [2019-10-22 09:02:42,946 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:02:42,946 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_12c778a2-ec80-402d-bfd0-698097a6fc20/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:02:42,965 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 09:02:42,965 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:02:55,009 INFO L442 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-10-22 09:02:55,012 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:02:55,012 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:02:55,012 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:02:55,012 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:02:55,012 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:02:55,012 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:55,012 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:02:55,013 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:02:55,013 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec1_product22.cil.c_Iteration1_Loop [2019-10-22 09:02:55,013 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:02:55,013 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:02:55,015 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:02:55,018 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:02:55,021 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:02:55,023 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:02:55,037 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:02:55,050 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:02:55,053 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:02:55,055 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:02:55,057 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:02:55,059 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:02:55,067 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:02:55,070 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:02:55,072 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:02:55,074 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:02:55,078 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:02:55,089 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:02:55,091 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:02:55,094 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:02:55,096 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:02:55,102 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:02:55,105 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:02:55,113 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:02:55,120 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:02:55,128 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:02:55,129 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:02:55,132 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:02:55,135 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:02:55,139 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:02:55,152 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:02:55,155 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:02:55,157 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:02:55,162 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:02:55,164 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:02:55,544 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:02:55,551 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:02:55,553 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:02:55,554 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:55,555 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:55,555 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:55,555 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:55,556 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:55,557 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:55,558 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:55,560 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:55,563 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:02:55,564 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:55,564 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:55,564 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:55,564 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:55,565 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:55,565 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:55,566 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:55,567 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:55,567 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:02:55,568 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:55,568 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:55,568 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:55,568 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:55,570 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:55,570 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:55,571 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:55,574 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:55,576 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:02:55,578 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:55,579 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:55,579 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:55,579 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:02:55,579 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:55,581 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:02:55,581 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:55,613 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:55,618 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:02:55,619 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:55,619 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:55,619 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:55,619 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:55,620 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:55,620 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:55,621 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:55,623 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:55,623 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:02:55,624 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:55,624 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:55,624 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:55,624 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:55,624 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:55,632 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:55,632 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:55,633 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:55,633 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:02:55,634 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:55,634 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:55,634 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:55,634 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:55,635 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:55,635 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:55,635 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:55,636 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:55,636 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:02:55,638 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:55,639 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:55,639 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:55,639 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:55,639 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:55,639 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:55,640 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:55,640 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:55,641 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:02:55,642 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:55,642 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:55,643 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:55,643 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:55,643 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:55,643 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:55,643 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:55,649 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:55,649 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:02:55,650 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:55,651 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:55,651 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:55,651 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:55,651 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:55,652 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:55,652 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:55,654 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:55,655 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:02:55,655 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:55,656 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:55,656 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:55,656 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:55,656 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:55,656 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:55,661 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:55,662 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:55,663 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:02:55,663 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:55,663 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:55,664 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:55,664 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:55,664 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:55,664 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:55,664 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:55,666 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:55,667 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:02:55,667 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:55,667 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:55,668 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:55,668 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:55,668 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:55,668 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:55,668 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:55,669 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:55,669 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:02:55,670 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:55,670 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:55,670 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:55,670 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:55,670 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:55,671 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:55,671 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:55,672 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:55,672 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:02:55,678 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:55,679 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:55,679 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:55,679 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:02:55,679 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:55,680 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:02:55,681 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:55,687 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:55,690 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:02:55,692 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:55,692 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:55,692 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:55,692 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:55,692 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:55,693 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:55,693 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:55,694 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:55,694 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:02:55,695 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:55,696 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:55,696 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:55,696 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:55,696 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:55,696 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:55,697 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:55,698 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:55,699 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:02:55,699 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:55,699 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:55,700 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:55,700 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:55,700 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:55,700 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:55,700 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:55,701 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:55,701 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:02:55,702 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:55,702 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:55,702 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:55,702 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:02:55,703 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:55,703 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:02:55,703 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:55,709 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:55,710 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:02:55,711 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:55,712 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:55,712 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:55,712 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:55,713 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:55,713 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:55,717 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:55,719 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:55,720 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:02:55,720 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:55,720 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:55,721 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:55,721 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:02:55,721 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:55,722 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:02:55,722 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:55,731 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:55,732 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:02:55,738 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:55,738 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:55,738 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:55,738 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:55,739 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:55,739 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:55,739 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:55,741 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:55,741 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:02:55,742 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:55,742 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:55,742 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:55,742 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:55,742 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:55,743 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:55,743 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:55,749 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:02:55,759 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 09:02:55,764 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 09:02:55,766 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:02:55,766 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 09:02:55,767 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:02:55,767 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~cleanupTimeShifts~0, ULTIMATE.start_cleanup_~i~2) = 1*~cleanupTimeShifts~0 - 1*ULTIMATE.start_cleanup_~i~2 Supporting invariants [] [2019-10-22 09:02:55,770 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 09:02:55,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:55,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:55,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:02:55,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:55,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:55,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 09:02:55,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:55,988 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:02:56,003 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:02:56,005 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6686 states. Second operand 5 states. [2019-10-22 09:02:56,686 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6686 states.. Second operand 5 states. Result 10049 states and 19005 transitions. Complement of second has 9 states. [2019-10-22 09:02:56,687 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:02:56,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 09:02:56,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12714 transitions. [2019-10-22 09:02:56,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12714 transitions. Stem has 33 letters. Loop has 22 letters. [2019-10-22 09:02:56,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:56,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12714 transitions. Stem has 55 letters. Loop has 22 letters. [2019-10-22 09:02:56,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:56,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12714 transitions. Stem has 33 letters. Loop has 44 letters. [2019-10-22 09:02:56,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:56,710 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10049 states and 19005 transitions. [2019-10-22 09:02:56,796 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:02:56,799 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10049 states to 0 states and 0 transitions. [2019-10-22 09:02:56,800 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 09:02:56,800 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 09:02:56,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 09:02:56,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:02:56,801 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:02:56,801 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:02:56,801 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:56,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:56,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:56,806 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2019-10-22 09:02:56,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:56,808 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-10-22 09:02:56,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 09:02:56,809 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-10-22 09:02:56,809 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:02:56,809 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 09:02:56,809 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 09:02:56,809 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 09:02:56,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 09:02:56,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:02:56,810 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:02:56,811 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:02:56,811 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:02:56,811 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 09:02:56,811 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 09:02:56,811 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:02:56,811 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 09:02:56,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 09:02:56 BoogieIcfgContainer [2019-10-22 09:02:56,817 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 09:02:56,817 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:02:56,817 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:02:56,817 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:02:56,818 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:41" (3/4) ... [2019-10-22 09:02:56,821 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 09:02:56,822 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:02:56,823 INFO L168 Benchmark]: Toolchain (without parser) took 27261.35 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 604.5 MB). Free memory was 939.1 MB in the beginning and 1.3 GB in the end (delta: -327.1 MB). Peak memory consumption was 277.4 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:56,824 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:02:56,826 INFO L168 Benchmark]: CACSL2BoogieTranslator took 830.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -138.1 MB). Peak memory consumption was 29.7 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:56,827 INFO L168 Benchmark]: Boogie Procedure Inliner took 285.12 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: 70.6 MB). Peak memory consumption was 70.6 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:56,828 INFO L168 Benchmark]: Boogie Preprocessor took 362.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 943.1 MB in the end (delta: 63.5 MB). Peak memory consumption was 63.5 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:56,830 INFO L168 Benchmark]: RCFGBuilder took 10128.91 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 483.4 MB). Free memory was 943.1 MB in the beginning and 1.3 GB in the end (delta: -375.1 MB). Peak memory consumption was 439.2 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:56,830 INFO L168 Benchmark]: BuchiAutomizer took 15646.16 ms. Allocated memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: -1.6 MB). Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 52.0 MB). Peak memory consumption was 50.4 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:56,831 INFO L168 Benchmark]: Witness Printer took 4.63 ms. Allocated memory is still 1.6 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:02:56,836 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 830.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -138.1 MB). Peak memory consumption was 29.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 285.12 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: 70.6 MB). Peak memory consumption was 70.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 362.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 943.1 MB in the end (delta: 63.5 MB). Peak memory consumption was 63.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 10128.91 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 483.4 MB). Free memory was 943.1 MB in the beginning and 1.3 GB in the end (delta: -375.1 MB). Peak memory consumption was 439.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 15646.16 ms. Allocated memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: -1.6 MB). Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 52.0 MB). Peak memory consumption was 50.4 MB. Max. memory is 11.5 GB. * Witness Printer took 4.63 ms. Allocated memory is still 1.6 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function cleanupTimeShifts + -1 * i and consists of 6 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 15.5s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 14.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 12680 SDtfs, 18938 SDslu, 6299 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: 37ms VariablesStem: 0 VariablesLoop: 5 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 1 LassoNonterminationAnalysisTime: 12.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...