./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-crafted-lit/Urban-WST2013-Fig2.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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_fe860b0d-b309-4589-9e21-dd050825e2ff/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_fe860b0d-b309-4589-9e21-dd050825e2ff/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_fe860b0d-b309-4589-9e21-dd050825e2ff/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_fe860b0d-b309-4589-9e21-dd050825e2ff/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted-lit/Urban-WST2013-Fig2.c -s /tmp/vcloud-vcloud-master/worker/working_dir_fe860b0d-b309-4589-9e21-dd050825e2ff/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_fe860b0d-b309-4589-9e21-dd050825e2ff/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 64bit --witnessprinter.graph.data.programhash 31d0c4253184c01eb9f9573658b07bed7aa94585 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:00:13,032 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:00:13,035 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:00:13,045 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:00:13,046 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:00:13,047 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:00:13,048 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:00:13,050 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:00:13,052 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:00:13,054 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:00:13,056 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:00:13,057 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:00:13,057 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:00:13,059 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:00:13,060 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:00:13,064 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:00:13,065 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:00:13,066 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:00:13,067 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:00:13,068 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:00:13,069 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:00:13,070 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:00:13,071 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:00:13,071 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:00:13,073 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:00:13,073 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:00:13,073 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:00:13,074 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:00:13,074 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:00:13,075 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:00:13,075 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:00:13,075 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:00:13,076 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:00:13,077 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:00:13,080 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:00:13,080 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:00:13,081 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:00:13,081 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:00:13,081 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:00:13,082 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:00:13,082 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:00:13,083 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_fe860b0d-b309-4589-9e21-dd050825e2ff/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 09:00:13,098 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:00:13,098 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:00:13,099 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:00:13,100 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:00:13,100 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:00:13,100 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 09:00:13,100 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 09:00:13,100 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 09:00:13,101 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 09:00:13,101 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 09:00:13,101 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 09:00:13,101 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:00:13,101 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 09:00:13,101 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:00:13,102 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:00:13,102 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 09:00:13,102 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 09:00:13,102 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 09:00:13,102 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:00:13,102 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 09:00:13,112 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:00:13,112 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 09:00:13,112 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:00:13,112 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:00:13,112 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 09:00:13,113 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:00:13,113 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:00:13,113 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 09:00:13,114 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 09:00:13,114 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_fe860b0d-b309-4589-9e21-dd050825e2ff/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 31d0c4253184c01eb9f9573658b07bed7aa94585 [2019-10-22 09:00:13,144 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:00:13,154 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:00:13,161 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:00:13,162 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:00:13,163 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:00:13,163 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_fe860b0d-b309-4589-9e21-dd050825e2ff/bin/uautomizer/../../sv-benchmarks/c/termination-crafted-lit/Urban-WST2013-Fig2.c [2019-10-22 09:00:13,211 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fe860b0d-b309-4589-9e21-dd050825e2ff/bin/uautomizer/data/38c98b4fd/a6799fc69d624e5283744295a3a13f10/FLAG7cd9655f8 [2019-10-22 09:00:13,584 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:00:13,585 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_fe860b0d-b309-4589-9e21-dd050825e2ff/sv-benchmarks/c/termination-crafted-lit/Urban-WST2013-Fig2.c [2019-10-22 09:00:13,590 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fe860b0d-b309-4589-9e21-dd050825e2ff/bin/uautomizer/data/38c98b4fd/a6799fc69d624e5283744295a3a13f10/FLAG7cd9655f8 [2019-10-22 09:00:14,011 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_fe860b0d-b309-4589-9e21-dd050825e2ff/bin/uautomizer/data/38c98b4fd/a6799fc69d624e5283744295a3a13f10 [2019-10-22 09:00:14,013 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:00:14,014 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:00:14,015 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:00:14,015 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:00:14,018 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:00:14,019 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:00:14" (1/1) ... [2019-10-22 09:00:14,021 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f006943 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:14, skipping insertion in model container [2019-10-22 09:00:14,021 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:00:14" (1/1) ... [2019-10-22 09:00:14,028 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:00:14,045 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:00:14,198 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:00:14,209 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:00:14,308 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:00:14,322 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:00:14,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:14 WrapperNode [2019-10-22 09:00:14,322 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:00:14,323 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:00:14,323 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:00:14,323 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:00:14,331 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:00:14" (1/1) ... [2019-10-22 09:00:14,337 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:00:14" (1/1) ... [2019-10-22 09:00:14,352 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:00:14,353 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:00:14,353 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:00:14,353 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:00:14,359 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:14" (1/1) ... [2019-10-22 09:00:14,359 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:14" (1/1) ... [2019-10-22 09:00:14,360 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:14" (1/1) ... [2019-10-22 09:00:14,360 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:14" (1/1) ... [2019-10-22 09:00:14,361 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:14" (1/1) ... [2019-10-22 09:00:14,364 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:14" (1/1) ... [2019-10-22 09:00:14,365 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:14" (1/1) ... [2019-10-22 09:00:14,365 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:00:14,366 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:00:14,366 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:00:14,366 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:00:14,366 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe860b0d-b309-4589-9e21-dd050825e2ff/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:00:14,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:00:14,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:00:14,524 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:00:14,524 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-10-22 09:00:14,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:14 BoogieIcfgContainer [2019-10-22 09:00:14,525 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:00:14,526 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 09:00:14,526 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 09:00:14,529 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 09:00:14,532 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:00:14,532 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 09:00:14" (1/3) ... [2019-10-22 09:00:14,533 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@d0aa1f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:00:14, skipping insertion in model container [2019-10-22 09:00:14,533 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:00:14,533 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:14" (2/3) ... [2019-10-22 09:00:14,534 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@d0aa1f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:00:14, skipping insertion in model container [2019-10-22 09:00:14,534 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:00:14,534 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:14" (3/3) ... [2019-10-22 09:00:14,536 INFO L371 chiAutomizerObserver]: Analyzing ICFG Urban-WST2013-Fig2.c [2019-10-22 09:00:14,581 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 09:00:14,582 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 09:00:14,582 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 09:00:14,582 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:00:14,582 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:00:14,582 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 09:00:14,582 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:00:14,583 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 09:00:14,596 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2019-10-22 09:00:14,619 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 09:00:14,620 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:14,620 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:14,625 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-10-22 09:00:14,625 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 09:00:14,625 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 09:00:14,626 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2019-10-22 09:00:14,626 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 09:00:14,627 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:14,627 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:14,627 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-10-22 09:00:14,628 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 09:00:14,635 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 6#L19-2true [2019-10-22 09:00:14,635 INFO L793 eck$LassoCheckResult]: Loop: 6#L19-2true assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 9#L21-2true assume !(main_~x2~0 > 1); 8#L21-3true main_~x1~0 := 1 + main_~x1~0; 6#L19-2true [2019-10-22 09:00:14,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:14,642 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-10-22 09:00:14,649 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:14,650 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874029118] [2019-10-22 09:00:14,650 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:14,650 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:14,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:14,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:14,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:14,740 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:14,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:14,741 INFO L82 PathProgramCache]: Analyzing trace with hash 39951, now seen corresponding path program 1 times [2019-10-22 09:00:14,741 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:14,741 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093145361] [2019-10-22 09:00:14,742 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:14,742 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:14,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:14,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:14,810 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:00:14,810 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093145361] [2019-10-22 09:00:14,811 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:14,811 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:00:14,811 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871130876] [2019-10-22 09:00:14,816 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:00:14,816 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:14,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:14,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:14,833 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 3 states. [2019-10-22 09:00:14,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:14,850 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-10-22 09:00:14,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:14,853 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2019-10-22 09:00:14,853 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 09:00:14,856 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 5 states and 6 transitions. [2019-10-22 09:00:14,858 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2019-10-22 09:00:14,858 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2019-10-22 09:00:14,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 6 transitions. [2019-10-22 09:00:14,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:14,859 INFO L688 BuchiCegarLoop]: Abstraction has 5 states and 6 transitions. [2019-10-22 09:00:14,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states and 6 transitions. [2019-10-22 09:00:14,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-10-22 09:00:14,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 09:00:14,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 6 transitions. [2019-10-22 09:00:14,898 INFO L711 BuchiCegarLoop]: Abstraction has 5 states and 6 transitions. [2019-10-22 09:00:14,898 INFO L591 BuchiCegarLoop]: Abstraction has 5 states and 6 transitions. [2019-10-22 09:00:14,898 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 09:00:14,898 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 6 transitions. [2019-10-22 09:00:14,899 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 09:00:14,899 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:14,900 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:14,900 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-10-22 09:00:14,900 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:00:14,900 INFO L791 eck$LassoCheckResult]: Stem: 26#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 27#L19-2 [2019-10-22 09:00:14,900 INFO L793 eck$LassoCheckResult]: Loop: 27#L19-2 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 28#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 30#L21-2 assume !(main_~x2~0 > 1); 29#L21-3 main_~x1~0 := 1 + main_~x1~0; 27#L19-2 [2019-10-22 09:00:14,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:14,901 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2019-10-22 09:00:14,901 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:14,901 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889696889] [2019-10-22 09:00:14,901 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:14,901 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:14,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:14,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:14,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:14,911 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:14,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:14,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1240240, now seen corresponding path program 1 times [2019-10-22 09:00:14,912 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:14,912 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504754391] [2019-10-22 09:00:14,912 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:14,912 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:14,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:14,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:14,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:14,948 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504754391] [2019-10-22 09:00:14,948 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218952756] [2019-10-22 09:00:14,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe860b0d-b309-4589-9e21-dd050825e2ff/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:14,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:14,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 09:00:14,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:14,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:14,989 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:00:14,989 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-10-22 09:00:14,990 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567249454] [2019-10-22 09:00:14,990 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:00:14,990 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:14,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:00:14,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:00:14,991 INFO L87 Difference]: Start difference. First operand 5 states and 6 transitions. cyclomatic complexity: 2 Second operand 4 states. [2019-10-22 09:00:15,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:15,006 INFO L93 Difference]: Finished difference Result 6 states and 7 transitions. [2019-10-22 09:00:15,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:00:15,007 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6 states and 7 transitions. [2019-10-22 09:00:15,007 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 09:00:15,008 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6 states to 6 states and 7 transitions. [2019-10-22 09:00:15,008 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-10-22 09:00:15,008 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-10-22 09:00:15,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 7 transitions. [2019-10-22 09:00:15,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:15,009 INFO L688 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-10-22 09:00:15,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states and 7 transitions. [2019-10-22 09:00:15,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-10-22 09:00:15,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-10-22 09:00:15,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-10-22 09:00:15,011 INFO L711 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-10-22 09:00:15,011 INFO L591 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-10-22 09:00:15,011 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 09:00:15,011 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 7 transitions. [2019-10-22 09:00:15,011 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 09:00:15,011 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:15,012 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:15,012 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-10-22 09:00:15,012 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1] [2019-10-22 09:00:15,012 INFO L791 eck$LassoCheckResult]: Stem: 53#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 54#L19-2 [2019-10-22 09:00:15,012 INFO L793 eck$LassoCheckResult]: Loop: 54#L19-2 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 55#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 57#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 58#L21-2 assume !(main_~x2~0 > 1); 56#L21-3 main_~x1~0 := 1 + main_~x1~0; 54#L19-2 [2019-10-22 09:00:15,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:15,013 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 3 times [2019-10-22 09:00:15,013 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:15,013 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224849507] [2019-10-22 09:00:15,013 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:15,014 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:15,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:15,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:15,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:15,027 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:15,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:15,028 INFO L82 PathProgramCache]: Analyzing trace with hash 38449199, now seen corresponding path program 2 times [2019-10-22 09:00:15,028 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:15,028 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181739706] [2019-10-22 09:00:15,028 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:15,028 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:15,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:15,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:15,065 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:15,065 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181739706] [2019-10-22 09:00:15,065 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015517393] [2019-10-22 09:00:15,065 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe860b0d-b309-4589-9e21-dd050825e2ff/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:15,085 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 09:00:15,085 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 09:00:15,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:00:15,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:15,089 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:15,090 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:00:15,090 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-22 09:00:15,090 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710030030] [2019-10-22 09:00:15,090 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:00:15,091 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:15,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:00:15,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:00:15,091 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. cyclomatic complexity: 2 Second operand 5 states. [2019-10-22 09:00:15,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:15,105 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2019-10-22 09:00:15,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:00:15,106 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7 states and 8 transitions. [2019-10-22 09:00:15,106 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-10-22 09:00:15,107 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7 states to 7 states and 8 transitions. [2019-10-22 09:00:15,107 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-10-22 09:00:15,107 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-10-22 09:00:15,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2019-10-22 09:00:15,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:15,107 INFO L688 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-10-22 09:00:15,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2019-10-22 09:00:15,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-10-22 09:00:15,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-10-22 09:00:15,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-10-22 09:00:15,108 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-10-22 09:00:15,109 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-10-22 09:00:15,109 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 09:00:15,109 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2019-10-22 09:00:15,109 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-10-22 09:00:15,109 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:15,109 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:15,110 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-10-22 09:00:15,110 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 1, 1, 1] [2019-10-22 09:00:15,110 INFO L791 eck$LassoCheckResult]: Stem: 86#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 87#L19-2 [2019-10-22 09:00:15,110 INFO L793 eck$LassoCheckResult]: Loop: 87#L19-2 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 88#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 90#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 92#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 91#L21-2 assume !(main_~x2~0 > 1); 89#L21-3 main_~x1~0 := 1 + main_~x1~0; 87#L19-2 [2019-10-22 09:00:15,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:15,110 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 4 times [2019-10-22 09:00:15,110 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:15,111 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856486142] [2019-10-22 09:00:15,111 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:15,111 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:15,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:15,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:15,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:15,116 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:15,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:15,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1191926928, now seen corresponding path program 3 times [2019-10-22 09:00:15,116 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:15,117 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153502427] [2019-10-22 09:00:15,117 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:15,117 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:15,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:15,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:15,162 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:15,162 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153502427] [2019-10-22 09:00:15,162 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784087622] [2019-10-22 09:00:15,163 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe860b0d-b309-4589-9e21-dd050825e2ff/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:15,188 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-22 09:00:15,188 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 09:00:15,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 09:00:15,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:15,194 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:15,194 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:00:15,194 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-10-22 09:00:15,194 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070748607] [2019-10-22 09:00:15,195 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:00:15,195 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:15,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 09:00:15,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-22 09:00:15,196 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand 6 states. [2019-10-22 09:00:15,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:15,210 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2019-10-22 09:00:15,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 09:00:15,211 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8 states and 9 transitions. [2019-10-22 09:00:15,211 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-10-22 09:00:15,212 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8 states to 8 states and 9 transitions. [2019-10-22 09:00:15,212 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-10-22 09:00:15,212 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-10-22 09:00:15,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 9 transitions. [2019-10-22 09:00:15,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:15,212 INFO L688 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-10-22 09:00:15,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 9 transitions. [2019-10-22 09:00:15,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-10-22 09:00:15,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-10-22 09:00:15,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2019-10-22 09:00:15,214 INFO L711 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-10-22 09:00:15,214 INFO L591 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-10-22 09:00:15,214 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 09:00:15,214 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2019-10-22 09:00:15,214 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-10-22 09:00:15,214 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:15,215 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:15,215 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-10-22 09:00:15,215 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 1, 1, 1] [2019-10-22 09:00:15,215 INFO L791 eck$LassoCheckResult]: Stem: 125#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 126#L19-2 [2019-10-22 09:00:15,215 INFO L793 eck$LassoCheckResult]: Loop: 126#L19-2 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 127#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 129#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 132#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 131#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 130#L21-2 assume !(main_~x2~0 > 1); 128#L21-3 main_~x1~0 := 1 + main_~x1~0; 126#L19-2 [2019-10-22 09:00:15,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:15,216 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 5 times [2019-10-22 09:00:15,216 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:15,216 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072883803] [2019-10-22 09:00:15,216 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:15,216 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:15,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:15,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:15,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:15,222 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:15,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:15,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1704969137, now seen corresponding path program 4 times [2019-10-22 09:00:15,222 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:15,223 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044322426] [2019-10-22 09:00:15,223 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:15,223 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:15,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:15,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:15,290 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:15,290 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044322426] [2019-10-22 09:00:15,290 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162267380] [2019-10-22 09:00:15,290 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe860b0d-b309-4589-9e21-dd050825e2ff/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:15,319 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-22 09:00:15,319 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 09:00:15,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 09:00:15,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:15,325 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:15,326 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:00:15,326 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-10-22 09:00:15,326 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7520438] [2019-10-22 09:00:15,326 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:00:15,326 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:15,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 09:00:15,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-10-22 09:00:15,330 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. cyclomatic complexity: 2 Second operand 7 states. [2019-10-22 09:00:15,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:15,357 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-10-22 09:00:15,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 09:00:15,357 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2019-10-22 09:00:15,358 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-10-22 09:00:15,358 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 10 transitions. [2019-10-22 09:00:15,358 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-10-22 09:00:15,358 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-10-22 09:00:15,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2019-10-22 09:00:15,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:15,359 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-10-22 09:00:15,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2019-10-22 09:00:15,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-10-22 09:00:15,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-10-22 09:00:15,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-10-22 09:00:15,360 INFO L711 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-10-22 09:00:15,360 INFO L591 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-10-22 09:00:15,360 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 09:00:15,360 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2019-10-22 09:00:15,361 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-10-22 09:00:15,361 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:15,361 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:15,361 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-10-22 09:00:15,361 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [5, 1, 1, 1] [2019-10-22 09:00:15,361 INFO L791 eck$LassoCheckResult]: Stem: 170#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 171#L19-2 [2019-10-22 09:00:15,362 INFO L793 eck$LassoCheckResult]: Loop: 171#L19-2 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 172#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 174#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 178#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 177#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 176#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 175#L21-2 assume !(main_~x2~0 > 1); 173#L21-3 main_~x1~0 := 1 + main_~x1~0; 171#L19-2 [2019-10-22 09:00:15,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:15,362 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 6 times [2019-10-22 09:00:15,362 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:15,362 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132535319] [2019-10-22 09:00:15,362 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:15,362 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:15,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:15,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:15,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:15,367 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:15,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:15,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1314433936, now seen corresponding path program 5 times [2019-10-22 09:00:15,367 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:15,367 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701166940] [2019-10-22 09:00:15,368 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:15,368 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:15,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:15,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:15,416 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:15,416 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701166940] [2019-10-22 09:00:15,416 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299982846] [2019-10-22 09:00:15,416 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe860b0d-b309-4589-9e21-dd050825e2ff/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:15,442 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-10-22 09:00:15,442 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 09:00:15,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 09:00:15,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:15,447 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:15,447 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:00:15,447 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-10-22 09:00:15,447 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062469974] [2019-10-22 09:00:15,448 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:00:15,448 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:15,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 09:00:15,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-22 09:00:15,449 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 2 Second operand 8 states. [2019-10-22 09:00:15,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:15,471 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2019-10-22 09:00:15,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 09:00:15,472 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 11 transitions. [2019-10-22 09:00:15,473 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-10-22 09:00:15,473 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 11 transitions. [2019-10-22 09:00:15,473 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-10-22 09:00:15,473 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-10-22 09:00:15,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2019-10-22 09:00:15,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:15,474 INFO L688 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-10-22 09:00:15,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2019-10-22 09:00:15,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-10-22 09:00:15,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-10-22 09:00:15,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2019-10-22 09:00:15,475 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-10-22 09:00:15,475 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-10-22 09:00:15,475 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 09:00:15,475 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. [2019-10-22 09:00:15,476 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-10-22 09:00:15,476 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:15,476 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:15,476 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-10-22 09:00:15,476 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [6, 1, 1, 1] [2019-10-22 09:00:15,476 INFO L791 eck$LassoCheckResult]: Stem: 221#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 222#L19-2 [2019-10-22 09:00:15,477 INFO L793 eck$LassoCheckResult]: Loop: 222#L19-2 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 223#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 225#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 230#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 229#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 228#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 227#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 226#L21-2 assume !(main_~x2~0 > 1); 224#L21-3 main_~x1~0 := 1 + main_~x1~0; 222#L19-2 [2019-10-22 09:00:15,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:15,477 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 7 times [2019-10-22 09:00:15,477 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:15,477 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136903162] [2019-10-22 09:00:15,477 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:15,477 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:15,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:15,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:15,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:15,482 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:15,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:15,482 INFO L82 PathProgramCache]: Analyzing trace with hash -2092744593, now seen corresponding path program 6 times [2019-10-22 09:00:15,482 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:15,483 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720533660] [2019-10-22 09:00:15,483 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:15,483 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:15,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:15,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:15,541 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:15,541 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720533660] [2019-10-22 09:00:15,541 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49764688] [2019-10-22 09:00:15,542 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe860b0d-b309-4589-9e21-dd050825e2ff/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:15,563 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-10-22 09:00:15,563 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 09:00:15,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 09:00:15,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:15,570 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:15,570 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:00:15,570 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-10-22 09:00:15,571 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503858286] [2019-10-22 09:00:15,571 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:00:15,571 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:15,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 09:00:15,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-10-22 09:00:15,572 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. cyclomatic complexity: 2 Second operand 9 states. [2019-10-22 09:00:15,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:15,594 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2019-10-22 09:00:15,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 09:00:15,594 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2019-10-22 09:00:15,595 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-10-22 09:00:15,595 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 12 transitions. [2019-10-22 09:00:15,595 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-10-22 09:00:15,595 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-10-22 09:00:15,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. [2019-10-22 09:00:15,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:15,596 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-10-22 09:00:15,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. [2019-10-22 09:00:15,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-10-22 09:00:15,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-10-22 09:00:15,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-10-22 09:00:15,597 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-10-22 09:00:15,597 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-10-22 09:00:15,597 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-10-22 09:00:15,597 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2019-10-22 09:00:15,597 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-10-22 09:00:15,597 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:15,598 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:15,598 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-10-22 09:00:15,598 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [7, 1, 1, 1] [2019-10-22 09:00:15,598 INFO L791 eck$LassoCheckResult]: Stem: 278#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 279#L19-2 [2019-10-22 09:00:15,598 INFO L793 eck$LassoCheckResult]: Loop: 279#L19-2 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 280#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 282#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 288#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 287#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 286#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 285#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 284#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 283#L21-2 assume !(main_~x2~0 > 1); 281#L21-3 main_~x1~0 := 1 + main_~x1~0; 279#L19-2 [2019-10-22 09:00:15,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:15,600 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 8 times [2019-10-22 09:00:15,601 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:15,601 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24728206] [2019-10-22 09:00:15,601 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:15,601 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:15,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:15,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:15,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:15,605 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:15,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:15,605 INFO L82 PathProgramCache]: Analyzing trace with hash -450571184, now seen corresponding path program 7 times [2019-10-22 09:00:15,605 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:15,605 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24879281] [2019-10-22 09:00:15,605 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:15,606 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:15,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:15,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:15,679 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:15,679 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24879281] [2019-10-22 09:00:15,679 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212702136] [2019-10-22 09:00:15,679 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe860b0d-b309-4589-9e21-dd050825e2ff/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:15,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:15,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-22 09:00:15,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:15,707 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:15,707 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:00:15,707 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-10-22 09:00:15,708 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884147289] [2019-10-22 09:00:15,708 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:00:15,708 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:15,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 09:00:15,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-10-22 09:00:15,709 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. cyclomatic complexity: 2 Second operand 10 states. [2019-10-22 09:00:15,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:15,744 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2019-10-22 09:00:15,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 09:00:15,744 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2019-10-22 09:00:15,745 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-10-22 09:00:15,745 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 13 transitions. [2019-10-22 09:00:15,745 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-10-22 09:00:15,746 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-10-22 09:00:15,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 13 transitions. [2019-10-22 09:00:15,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:15,746 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-10-22 09:00:15,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 13 transitions. [2019-10-22 09:00:15,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-10-22 09:00:15,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-10-22 09:00:15,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-10-22 09:00:15,747 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-10-22 09:00:15,748 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-10-22 09:00:15,748 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-10-22 09:00:15,748 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 13 transitions. [2019-10-22 09:00:15,748 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-10-22 09:00:15,748 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:15,748 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:15,749 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-10-22 09:00:15,749 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [8, 1, 1, 1] [2019-10-22 09:00:15,749 INFO L791 eck$LassoCheckResult]: Stem: 341#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 342#L19-2 [2019-10-22 09:00:15,749 INFO L793 eck$LassoCheckResult]: Loop: 342#L19-2 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 343#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 345#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 352#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 351#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 350#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 349#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 348#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 347#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 346#L21-2 assume !(main_~x2~0 > 1); 344#L21-3 main_~x1~0 := 1 + main_~x1~0; 342#L19-2 [2019-10-22 09:00:15,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:15,750 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 9 times [2019-10-22 09:00:15,750 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:15,750 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354891616] [2019-10-22 09:00:15,750 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:15,750 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:15,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:15,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:15,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:15,754 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:15,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:15,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1082803057, now seen corresponding path program 8 times [2019-10-22 09:00:15,755 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:15,755 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178215743] [2019-10-22 09:00:15,755 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:15,755 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:15,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:15,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:15,832 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:15,833 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178215743] [2019-10-22 09:00:15,833 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054868327] [2019-10-22 09:00:15,833 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe860b0d-b309-4589-9e21-dd050825e2ff/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:15,859 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 09:00:15,859 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 09:00:15,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-22 09:00:15,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:15,868 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:15,868 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:00:15,868 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-10-22 09:00:15,869 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381257266] [2019-10-22 09:00:15,869 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:00:15,869 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:15,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-22 09:00:15,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-22 09:00:15,870 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. cyclomatic complexity: 2 Second operand 11 states. [2019-10-22 09:00:15,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:15,894 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2019-10-22 09:00:15,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 09:00:15,894 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2019-10-22 09:00:15,895 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-10-22 09:00:15,895 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 14 transitions. [2019-10-22 09:00:15,895 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-10-22 09:00:15,895 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-10-22 09:00:15,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2019-10-22 09:00:15,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:15,896 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-10-22 09:00:15,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2019-10-22 09:00:15,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-10-22 09:00:15,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-10-22 09:00:15,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-10-22 09:00:15,897 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-10-22 09:00:15,897 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-10-22 09:00:15,897 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-10-22 09:00:15,898 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 14 transitions. [2019-10-22 09:00:15,898 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-10-22 09:00:15,898 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:15,898 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:15,898 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-10-22 09:00:15,899 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [9, 1, 1, 1] [2019-10-22 09:00:15,899 INFO L791 eck$LassoCheckResult]: Stem: 410#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 411#L19-2 [2019-10-22 09:00:15,899 INFO L793 eck$LassoCheckResult]: Loop: 411#L19-2 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 412#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 414#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 422#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 421#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 420#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 419#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 418#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 417#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 416#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 415#L21-2 assume !(main_~x2~0 > 1); 413#L21-3 main_~x1~0 := 1 + main_~x1~0; 411#L19-2 [2019-10-22 09:00:15,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:15,900 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 10 times [2019-10-22 09:00:15,900 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:15,900 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043295461] [2019-10-22 09:00:15,900 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:15,900 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:15,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:15,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:15,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:15,904 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:15,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:15,905 INFO L82 PathProgramCache]: Analyzing trace with hash 792845360, now seen corresponding path program 9 times [2019-10-22 09:00:15,905 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:15,905 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939944131] [2019-10-22 09:00:15,905 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:15,905 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:15,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:15,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:15,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:15,919 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:15,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:15,919 INFO L82 PathProgramCache]: Analyzing trace with hash 287286735, now seen corresponding path program 1 times [2019-10-22 09:00:15,919 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:15,919 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020744761] [2019-10-22 09:00:15,920 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:15,920 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:15,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:15,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:15,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:15,948 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:16,062 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:16,063 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:16,067 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:16,067 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:16,068 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 09:00:16,068 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:16,068 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:16,068 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:16,068 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-WST2013-Fig2.c_Iteration10_Loop [2019-10-22 09:00:16,068 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:16,069 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:16,084 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:00:16,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:00:16,095 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:00:16,100 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:00:16,152 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:16,153 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe860b0d-b309-4589-9e21-dd050825e2ff/bin/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:16,161 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:16,162 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:16,170 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:16,170 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe860b0d-b309-4589-9e21-dd050825e2ff/bin/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:16,184 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:16,184 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:16,187 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:16,188 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe860b0d-b309-4589-9e21-dd050825e2ff/bin/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:00:16,197 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:16,197 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe860b0d-b309-4589-9e21-dd050825e2ff/bin/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:16,220 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 09:00:16,220 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:16,249 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 09:00:16,251 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:16,251 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:16,251 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:16,251 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:16,252 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:00:16,252 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:16,252 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:16,252 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:16,252 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-WST2013-Fig2.c_Iteration10_Loop [2019-10-22 09:00:16,252 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:16,252 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:16,253 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:00:16,257 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:00:16,283 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:00:16,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:16,368 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:16,373 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:00:16,374 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:00:16,376 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:16,376 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:16,376 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:16,376 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:16,379 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:16,379 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:16,382 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:16,383 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:00:16,383 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:16,383 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:16,384 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:16,384 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:16,385 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:16,385 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:16,388 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:16,388 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:00:16,389 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:16,389 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:16,389 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:16,390 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:16,390 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:16,390 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:16,390 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:16,393 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:00:16,395 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:00:16,396 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-10-22 09:00:16,397 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:00:16,398 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 09:00:16,398 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:00:16,398 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x1~0) = -2*ULTIMATE.start_main_~x1~0 + 21 Supporting invariants [] [2019-10-22 09:00:16,401 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 09:00:16,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:16,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:16,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:00:16,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:16,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:16,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:00:16,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:16,456 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-22 09:00:16,459 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 09:00:16,460 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 14 transitions. cyclomatic complexity: 2 Second operand 3 states. [2019-10-22 09:00:16,490 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 14 transitions. cyclomatic complexity: 2. Second operand 3 states. Result 25 states and 28 transitions. Complement of second has 4 states. [2019-10-22 09:00:16,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 09:00:16,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:00:16,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-10-22 09:00:16,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 1 letters. Loop has 12 letters. [2019-10-22 09:00:16,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:16,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 13 letters. Loop has 12 letters. [2019-10-22 09:00:16,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:16,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 1 letters. Loop has 24 letters. [2019-10-22 09:00:16,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:16,493 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 28 transitions. [2019-10-22 09:00:16,494 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-10-22 09:00:16,494 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 24 states and 27 transitions. [2019-10-22 09:00:16,494 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-10-22 09:00:16,494 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-10-22 09:00:16,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 27 transitions. [2019-10-22 09:00:16,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:16,494 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2019-10-22 09:00:16,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 27 transitions. [2019-10-22 09:00:16,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 15. [2019-10-22 09:00:16,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-10-22 09:00:16,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2019-10-22 09:00:16,496 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-10-22 09:00:16,496 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-10-22 09:00:16,496 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-10-22 09:00:16,496 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2019-10-22 09:00:16,496 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-10-22 09:00:16,496 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:16,497 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:16,497 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 09:00:16,497 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-10-22 09:00:16,497 INFO L791 eck$LassoCheckResult]: Stem: 507#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 508#L19-2 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 510#L21-2 [2019-10-22 09:00:16,497 INFO L793 eck$LassoCheckResult]: Loop: 510#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 510#L21-2 [2019-10-22 09:00:16,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:16,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1002, now seen corresponding path program 1 times [2019-10-22 09:00:16,498 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:16,498 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719466286] [2019-10-22 09:00:16,498 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:16,498 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:16,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:16,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:16,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:16,503 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:16,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:16,504 INFO L82 PathProgramCache]: Analyzing trace with hash 50, now seen corresponding path program 1 times [2019-10-22 09:00:16,504 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:16,504 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149557348] [2019-10-22 09:00:16,504 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:16,504 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:16,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:16,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:16,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:16,508 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:16,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:16,509 INFO L82 PathProgramCache]: Analyzing trace with hash 31081, now seen corresponding path program 1 times [2019-10-22 09:00:16,509 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:16,509 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581500571] [2019-10-22 09:00:16,509 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:16,509 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:16,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:16,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:16,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:16,514 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:16,523 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:16,523 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:16,523 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:16,523 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:16,523 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 09:00:16,524 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:16,524 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:16,524 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:16,524 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-WST2013-Fig2.c_Iteration11_Loop [2019-10-22 09:00:16,524 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:16,524 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:16,525 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:00:16,528 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:00:16,530 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:00:16,564 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:16,564 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe860b0d-b309-4589-9e21-dd050825e2ff/bin/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:16,568 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:16,568 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:16,571 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:16,571 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe860b0d-b309-4589-9e21-dd050825e2ff/bin/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:16,576 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:16,576 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:16,581 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:16,581 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe860b0d-b309-4589-9e21-dd050825e2ff/bin/uautomizer/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:16,586 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:16,586 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe860b0d-b309-4589-9e21-dd050825e2ff/bin/uautomizer/z3 Starting monitored process 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:16,594 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 09:00:16,594 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:16,599 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 09:00:16,601 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:16,601 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:16,601 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:16,601 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:16,601 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:00:16,601 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:16,601 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:16,602 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:16,602 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-WST2013-Fig2.c_Iteration11_Loop [2019-10-22 09:00:16,602 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:16,602 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:16,603 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:00:16,605 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:00:16,607 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:00:16,643 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:16,644 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:00:16,644 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:00:16,645 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:16,645 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:16,645 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:16,645 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:16,646 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:16,646 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:16,649 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:16,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:00:16,650 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:16,650 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:16,650 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:16,650 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:16,652 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:16,652 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:16,677 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:16,678 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:00:16,681 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:16,681 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:16,682 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:16,682 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:16,682 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:16,683 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:16,683 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:16,685 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:00:16,695 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:00:16,695 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 09:00:16,695 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:00:16,695 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 09:00:16,696 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:00:16,696 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x2~0) = 1*ULTIMATE.start_main_~x2~0 Supporting invariants [] [2019-10-22 09:00:16,696 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 09:00:16,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:16,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:16,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:00:16,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:16,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:16,724 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:00:16,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:16,724 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:00:16,725 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-10-22 09:00:16,725 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 18 transitions. cyclomatic complexity: 5 Second operand 2 states. [2019-10-22 09:00:16,733 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 18 transitions. cyclomatic complexity: 5. Second operand 2 states. Result 31 states and 36 transitions. Complement of second has 5 states. [2019-10-22 09:00:16,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 09:00:16,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-10-22 09:00:16,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-10-22 09:00:16,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 2 letters. Loop has 1 letters. [2019-10-22 09:00:16,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:16,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 3 letters. Loop has 1 letters. [2019-10-22 09:00:16,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:16,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 2 letters. Loop has 2 letters. [2019-10-22 09:00:16,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:16,735 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 36 transitions. [2019-10-22 09:00:16,736 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-10-22 09:00:16,736 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 27 states and 31 transitions. [2019-10-22 09:00:16,736 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-10-22 09:00:16,737 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2019-10-22 09:00:16,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 31 transitions. [2019-10-22 09:00:16,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:16,737 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-10-22 09:00:16,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 31 transitions. [2019-10-22 09:00:16,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 15. [2019-10-22 09:00:16,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-10-22 09:00:16,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-10-22 09:00:16,739 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-10-22 09:00:16,739 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-10-22 09:00:16,739 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-10-22 09:00:16,739 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2019-10-22 09:00:16,739 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-10-22 09:00:16,739 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:16,740 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:16,740 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [9, 2, 1, 1, 1] [2019-10-22 09:00:16,740 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-10-22 09:00:16,740 INFO L791 eck$LassoCheckResult]: Stem: 582#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 583#L19-2 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 584#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 588#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 596#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 595#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 594#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 593#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 592#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 591#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 590#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 589#L21-2 assume !(main_~x2~0 > 1); 587#L21-3 main_~x1~0 := 1 + main_~x1~0; 585#L19-2 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 586#L21-2 [2019-10-22 09:00:16,740 INFO L793 eck$LassoCheckResult]: Loop: 586#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 586#L21-2 [2019-10-22 09:00:16,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:16,740 INFO L82 PathProgramCache]: Analyzing trace with hash 315954203, now seen corresponding path program 2 times [2019-10-22 09:00:16,741 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:16,741 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135047679] [2019-10-22 09:00:16,741 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:16,741 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:16,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:16,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:16,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:16,752 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:16,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:16,752 INFO L82 PathProgramCache]: Analyzing trace with hash 50, now seen corresponding path program 2 times [2019-10-22 09:00:16,752 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:16,753 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462685747] [2019-10-22 09:00:16,753 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:16,753 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:16,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:16,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:16,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:16,756 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:16,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:16,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1204645720, now seen corresponding path program 3 times [2019-10-22 09:00:16,757 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:16,757 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142592108] [2019-10-22 09:00:16,757 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:16,757 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:16,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:16,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:16,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:16,768 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:16,787 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:16,787 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:16,787 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:16,787 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:16,787 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 09:00:16,787 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:16,788 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:16,788 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:16,788 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-WST2013-Fig2.c_Iteration12_Loop [2019-10-22 09:00:16,788 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:16,788 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:16,789 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:00:16,791 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:00:16,796 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:00:16,823 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:16,823 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe860b0d-b309-4589-9e21-dd050825e2ff/bin/uautomizer/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:16,828 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:16,828 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:16,832 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:16,832 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe860b0d-b309-4589-9e21-dd050825e2ff/bin/uautomizer/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:16,842 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:16,842 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe860b0d-b309-4589-9e21-dd050825e2ff/bin/uautomizer/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:16,853 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 09:00:16,853 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:16,858 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 09:00:16,859 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:16,860 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:16,860 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:16,860 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:16,860 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:00:16,860 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:16,860 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:16,860 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:16,860 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-WST2013-Fig2.c_Iteration12_Loop [2019-10-22 09:00:16,860 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:16,860 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:16,861 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:00:16,865 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:00:16,871 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:00:16,901 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:16,901 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:00:16,901 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:16,902 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:16,902 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:16,902 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:16,902 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:16,903 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:16,903 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:16,906 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:16,906 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:00:16,907 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:16,907 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:16,907 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:16,907 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:16,907 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:16,908 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:16,908 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:16,909 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:00:16,911 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:00:16,911 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 09:00:16,912 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:00:16,912 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 09:00:16,912 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:00:16,912 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x2~0) = 1*ULTIMATE.start_main_~x2~0 Supporting invariants [] [2019-10-22 09:00:16,912 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 09:00:16,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:16,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:16,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:00:16,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:16,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:16,935 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:00:16,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:16,936 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:00:16,936 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-10-22 09:00:16,936 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4 Second operand 2 states. [2019-10-22 09:00:16,944 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4. Second operand 2 states. Result 29 states and 33 transitions. Complement of second has 5 states. [2019-10-22 09:00:16,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 09:00:16,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-10-22 09:00:16,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-10-22 09:00:16,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 14 letters. Loop has 1 letters. [2019-10-22 09:00:16,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:16,945 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 09:00:16,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:16,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:16,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:00:16,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:16,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:16,966 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:00:16,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:16,967 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:00:16,967 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2019-10-22 09:00:16,967 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4 Second operand 2 states. [2019-10-22 09:00:16,973 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4. Second operand 2 states. Result 29 states and 33 transitions. Complement of second has 5 states. [2019-10-22 09:00:16,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 09:00:16,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-10-22 09:00:16,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-10-22 09:00:16,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 14 letters. Loop has 1 letters. [2019-10-22 09:00:16,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:16,974 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 09:00:16,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:16,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:16,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:00:16,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:16,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:16,999 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:00:16,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:16,999 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:00:17,000 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-10-22 09:00:17,000 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4 Second operand 2 states. [2019-10-22 09:00:17,007 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4. Second operand 2 states. Result 18 states and 20 transitions. Complement of second has 4 states. [2019-10-22 09:00:17,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 09:00:17,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-10-22 09:00:17,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2019-10-22 09:00:17,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 14 letters. Loop has 1 letters. [2019-10-22 09:00:17,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:17,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 15 letters. Loop has 1 letters. [2019-10-22 09:00:17,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:17,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 14 letters. Loop has 2 letters. [2019-10-22 09:00:17,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:17,010 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 20 transitions. [2019-10-22 09:00:17,010 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:00:17,010 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 0 states and 0 transitions. [2019-10-22 09:00:17,011 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 09:00:17,011 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 09:00:17,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 09:00:17,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:17,011 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:00:17,011 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:00:17,011 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:00:17,011 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-10-22 09:00:17,011 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 09:00:17,011 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:00:17,011 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 09:00:17,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 09:00:17 BoogieIcfgContainer [2019-10-22 09:00:17,017 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 09:00:17,018 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:00:17,018 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:00:17,018 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:00:17,018 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:14" (3/4) ... [2019-10-22 09:00:17,021 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 09:00:17,022 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:00:17,023 INFO L168 Benchmark]: Toolchain (without parser) took 3008.81 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 247.5 MB). Free memory was 949.9 MB in the beginning and 1.2 GB in the end (delta: -222.2 MB). Peak memory consumption was 25.3 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:17,024 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:00:17,024 INFO L168 Benchmark]: CACSL2BoogieTranslator took 307.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 183.5 MB). Free memory was 949.9 MB in the beginning and 1.2 GB in the end (delta: -223.6 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:17,024 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.37 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:00:17,025 INFO L168 Benchmark]: Boogie Preprocessor took 12.92 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:00:17,025 INFO L168 Benchmark]: RCFGBuilder took 159.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 14.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:17,025 INFO L168 Benchmark]: BuchiAutomizer took 2491.33 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 64.0 MB). Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -13.0 MB). Peak memory consumption was 50.9 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:17,026 INFO L168 Benchmark]: Witness Printer took 4.11 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:00:17,028 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 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 307.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 183.5 MB). Free memory was 949.9 MB in the beginning and 1.2 GB in the end (delta: -223.6 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.37 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 12.92 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 159.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 14.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2491.33 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 64.0 MB). Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -13.0 MB). Peak memory consumption was 50.9 MB. Max. memory is 11.5 GB. * Witness Printer took 4.11 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (9 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -2 * x1 + 21 and consists of 3 locations. One deterministic module has affine ranking function x2 and consists of 3 locations. One nondeterministic module has affine ranking function x2 and consists of 3 locations. 9 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.4s and 13 iterations. TraceHistogramMax:9. Analysis of lassos took 1.8s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 10. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 21 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 15 states and ocurred in iteration 10. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 45/45 HoareTripleCheckerStatistics: 62 SDtfs, 21 SDslu, 50 SDs, 0 SdLazy, 157 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI9 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax203 hnf98 lsp42 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...