./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 f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-crafted-lit/Urban-WST2013-Fig2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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.25-f470102 [2019-11-28 20:30:09,382 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:30:09,385 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:30:09,404 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:30:09,404 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:30:09,407 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:30:09,409 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:30:09,421 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:30:09,424 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:30:09,425 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:30:09,425 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:30:09,427 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:30:09,427 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:30:09,428 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:30:09,429 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:30:09,431 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:30:09,433 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:30:09,438 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:30:09,440 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:30:09,442 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:30:09,443 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:30:09,445 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:30:09,446 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:30:09,447 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:30:09,450 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:30:09,450 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:30:09,450 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:30:09,451 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:30:09,452 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:30:09,453 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:30:09,453 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:30:09,454 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:30:09,455 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:30:09,456 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:30:09,459 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:30:09,460 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:30:09,461 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:30:09,462 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:30:09,462 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:30:09,464 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:30:09,465 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:30:09,467 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-28 20:30:09,491 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:30:09,491 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:30:09,493 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:30:09,494 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:30:09,494 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:30:09,494 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 20:30:09,494 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 20:30:09,495 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 20:30:09,495 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 20:30:09,495 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 20:30:09,497 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 20:30:09,497 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:30:09,497 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:30:09,498 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:30:09,498 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:30:09,499 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 20:30:09,499 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 20:30:09,499 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 20:30:09,499 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 20:30:09,500 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 20:30:09,500 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:30:09,501 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 20:30:09,501 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:30:09,501 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:30:09,501 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 20:30:09,502 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:30:09,502 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:30:09,502 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:30:09,503 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 20:30:09,504 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 20:30:09,505 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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-11-28 20:30:09,820 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:30:09,833 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:30:09,837 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:30:09,839 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:30:09,839 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:30:09,840 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/Urban-WST2013-Fig2.c [2019-11-28 20:30:09,904 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a020474a0/188bdd204f0040f8be5bfc62203b28bc/FLAGd0c9de30b [2019-11-28 20:30:10,409 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:30:10,410 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/Urban-WST2013-Fig2.c [2019-11-28 20:30:10,418 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a020474a0/188bdd204f0040f8be5bfc62203b28bc/FLAGd0c9de30b [2019-11-28 20:30:10,759 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a020474a0/188bdd204f0040f8be5bfc62203b28bc [2019-11-28 20:30:10,763 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:30:10,766 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 20:30:10,769 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:30:10,769 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:30:10,773 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:30:10,774 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:30:10" (1/1) ... [2019-11-28 20:30:10,777 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28ec0670 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:30:10, skipping insertion in model container [2019-11-28 20:30:10,778 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:30:10" (1/1) ... [2019-11-28 20:30:10,788 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:30:10,805 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:30:10,964 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:30:10,969 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:30:10,985 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:30:10,997 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:30:10,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:30:10 WrapperNode [2019-11-28 20:30:10,998 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:30:10,998 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 20:30:10,999 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 20:30:10,999 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 20:30:11,007 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:30:10" (1/1) ... [2019-11-28 20:30:11,011 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:30:10" (1/1) ... [2019-11-28 20:30:11,027 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 20:30:11,027 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:30:11,027 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:30:11,028 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:30:11,090 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:30:10" (1/1) ... [2019-11-28 20:30:11,090 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:30:10" (1/1) ... [2019-11-28 20:30:11,091 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:30:10" (1/1) ... [2019-11-28 20:30:11,091 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:30:10" (1/1) ... [2019-11-28 20:30:11,094 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:30:10" (1/1) ... [2019-11-28 20:30:11,100 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:30:10" (1/1) ... [2019-11-28 20:30:11,101 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:30:10" (1/1) ... [2019-11-28 20:30:11,102 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:30:11,103 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:30:11,103 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:30:11,103 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:30:11,104 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:30:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 20:30:11,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:30:11,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:30:11,324 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:30:11,325 INFO L287 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-28 20:30:11,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:30:11 BoogieIcfgContainer [2019-11-28 20:30:11,326 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:30:11,327 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 20:30:11,327 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 20:30:11,331 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 20:30:11,332 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:30:11,333 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 08:30:10" (1/3) ... [2019-11-28 20:30:11,334 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2e7c134b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:30:11, skipping insertion in model container [2019-11-28 20:30:11,334 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:30:11,335 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:30:10" (2/3) ... [2019-11-28 20:30:11,335 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2e7c134b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:30:11, skipping insertion in model container [2019-11-28 20:30:11,336 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:30:11,336 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:30:11" (3/3) ... [2019-11-28 20:30:11,338 INFO L371 chiAutomizerObserver]: Analyzing ICFG Urban-WST2013-Fig2.c [2019-11-28 20:30:11,396 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 20:30:11,396 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 20:30:11,396 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 20:30:11,396 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:30:11,396 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:30:11,396 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 20:30:11,397 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:30:11,397 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 20:30:11,416 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2019-11-28 20:30:11,437 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 20:30:11,438 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:30:11,438 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:30:11,445 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 20:30:11,446 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 20:30:11,446 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 20:30:11,446 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2019-11-28 20:30:11,447 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 20:30:11,447 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:30:11,447 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:30:11,448 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 20:30:11,448 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 20:30:11,457 INFO L794 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-11-28 20:30:11,457 INFO L796 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-11-28 20:30:11,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:11,465 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-11-28 20:30:11,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:30:11,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549948721] [2019-11-28 20:30:11,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:30:11,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:11,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:11,573 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:30:11,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:11,575 INFO L82 PathProgramCache]: Analyzing trace with hash 39951, now seen corresponding path program 1 times [2019-11-28 20:30:11,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:30:11,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350353300] [2019-11-28 20:30:11,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:30:11,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:30:11,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:30:11,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350353300] [2019-11-28 20:30:11,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:30:11,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:30:11,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254918463] [2019-11-28 20:30:11,696 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:30:11,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:30:11,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:30:11,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:30:11,725 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 3 states. [2019-11-28 20:30:11,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:30:11,776 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-11-28 20:30:11,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:30:11,779 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2019-11-28 20:30:11,780 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-28 20:30:11,785 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 5 states and 6 transitions. [2019-11-28 20:30:11,786 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2019-11-28 20:30:11,787 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2019-11-28 20:30:11,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 6 transitions. [2019-11-28 20:30:11,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:30:11,794 INFO L688 BuchiCegarLoop]: Abstraction has 5 states and 6 transitions. [2019-11-28 20:30:11,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states and 6 transitions. [2019-11-28 20:30:11,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-11-28 20:30:11,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 20:30:11,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 6 transitions. [2019-11-28 20:30:11,840 INFO L711 BuchiCegarLoop]: Abstraction has 5 states and 6 transitions. [2019-11-28 20:30:11,841 INFO L591 BuchiCegarLoop]: Abstraction has 5 states and 6 transitions. [2019-11-28 20:30:11,841 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 20:30:11,841 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 6 transitions. [2019-11-28 20:30:11,842 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-28 20:30:11,842 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:30:11,842 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:30:11,843 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 20:30:11,843 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 20:30:11,843 INFO L794 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-11-28 20:30:11,844 INFO L796 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-11-28 20:30:11,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:11,844 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2019-11-28 20:30:11,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:30:11,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821830112] [2019-11-28 20:30:11,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:30:11,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:11,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:11,856 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:30:11,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:11,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1240240, now seen corresponding path program 1 times [2019-11-28 20:30:11,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:30:11,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337156979] [2019-11-28 20:30:11,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:30:11,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:30:11,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:30:11,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337156979] [2019-11-28 20:30:11,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668065241] [2019-11-28 20:30:11,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 20:30:11,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:30:11,973 INFO L264 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 20:30:11,974 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:30:11,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:30:11,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:30:11,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-11-28 20:30:11,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131917765] [2019-11-28 20:30:11,996 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:30:11,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:30:11,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:30:11,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:30:11,997 INFO L87 Difference]: Start difference. First operand 5 states and 6 transitions. cyclomatic complexity: 2 Second operand 4 states. [2019-11-28 20:30:12,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:30:12,026 INFO L93 Difference]: Finished difference Result 6 states and 7 transitions. [2019-11-28 20:30:12,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:30:12,028 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6 states and 7 transitions. [2019-11-28 20:30:12,028 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 20:30:12,029 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6 states to 6 states and 7 transitions. [2019-11-28 20:30:12,029 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-28 20:30:12,029 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-28 20:30:12,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 7 transitions. [2019-11-28 20:30:12,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:30:12,029 INFO L688 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-11-28 20:30:12,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states and 7 transitions. [2019-11-28 20:30:12,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-11-28 20:30:12,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-28 20:30:12,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-11-28 20:30:12,031 INFO L711 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-11-28 20:30:12,031 INFO L591 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-11-28 20:30:12,031 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 20:30:12,031 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 7 transitions. [2019-11-28 20:30:12,032 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 20:30:12,032 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:30:12,032 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:30:12,033 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 20:30:12,033 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1] [2019-11-28 20:30:12,033 INFO L794 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-11-28 20:30:12,033 INFO L796 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-11-28 20:30:12,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:12,033 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 3 times [2019-11-28 20:30:12,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:30:12,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136492160] [2019-11-28 20:30:12,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:30:12,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:12,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:12,040 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:30:12,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:12,041 INFO L82 PathProgramCache]: Analyzing trace with hash 38449199, now seen corresponding path program 2 times [2019-11-28 20:30:12,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:30:12,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348015503] [2019-11-28 20:30:12,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:30:12,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:30:12,088 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:30:12,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348015503] [2019-11-28 20:30:12,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451842069] [2019-11-28 20:30:12,089 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-11-28 20:30:12,117 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 20:30:12,118 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:30:12,119 INFO L264 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:30:12,119 INFO L287 TraceCheckSpWp]: Computing forward predicates... Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:30:12,125 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:30:12,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:30:12,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-28 20:30:12,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989352512] [2019-11-28 20:30:12,127 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:30:12,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:30:12,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:30:12,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:30:12,129 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. cyclomatic complexity: 2 Second operand 5 states. [2019-11-28 20:30:12,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:30:12,147 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2019-11-28 20:30:12,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:30:12,148 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7 states and 8 transitions. [2019-11-28 20:30:12,149 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-28 20:30:12,149 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7 states to 7 states and 8 transitions. [2019-11-28 20:30:12,150 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-28 20:30:12,150 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-28 20:30:12,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2019-11-28 20:30:12,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:30:12,150 INFO L688 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-11-28 20:30:12,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2019-11-28 20:30:12,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-11-28 20:30:12,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-28 20:30:12,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-11-28 20:30:12,152 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-11-28 20:30:12,152 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-11-28 20:30:12,152 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 20:30:12,152 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2019-11-28 20:30:12,153 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-28 20:30:12,153 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:30:12,153 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:30:12,153 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 20:30:12,154 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 1, 1, 1] [2019-11-28 20:30:12,154 INFO L794 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-11-28 20:30:12,154 INFO L796 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-11-28 20:30:12,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:12,154 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 4 times [2019-11-28 20:30:12,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:30:12,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437716178] [2019-11-28 20:30:12,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:30:12,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:12,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:12,161 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:30:12,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:12,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1191926928, now seen corresponding path program 3 times [2019-11-28 20:30:12,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:30:12,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020378310] [2019-11-28 20:30:12,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:30:12,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:30:12,203 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:30:12,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020378310] [2019-11-28 20:30:12,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706240653] [2019-11-28 20:30:12,204 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-11-28 20:30:12,240 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-28 20:30:12,241 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:30:12,241 INFO L264 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjunts are in the unsatisfiable core Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:30:12,242 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:30:12,250 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:30:12,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:30:12,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-11-28 20:30:12,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983210530] [2019-11-28 20:30:12,254 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:30:12,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:30:12,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:30:12,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:30:12,256 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand 6 states. [2019-11-28 20:30:12,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:30:12,275 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2019-11-28 20:30:12,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:30:12,276 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8 states and 9 transitions. [2019-11-28 20:30:12,277 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 20:30:12,277 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8 states to 8 states and 9 transitions. [2019-11-28 20:30:12,277 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-28 20:30:12,278 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-11-28 20:30:12,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 9 transitions. [2019-11-28 20:30:12,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:30:12,278 INFO L688 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-11-28 20:30:12,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 9 transitions. [2019-11-28 20:30:12,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-11-28 20:30:12,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-28 20:30:12,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2019-11-28 20:30:12,280 INFO L711 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-11-28 20:30:12,280 INFO L591 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-11-28 20:30:12,280 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 20:30:12,281 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2019-11-28 20:30:12,281 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 20:30:12,282 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:30:12,282 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:30:12,282 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 20:30:12,283 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 1, 1, 1] [2019-11-28 20:30:12,283 INFO L794 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-11-28 20:30:12,283 INFO L796 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-11-28 20:30:12,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:12,284 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 5 times [2019-11-28 20:30:12,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:30:12,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686919218] [2019-11-28 20:30:12,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:30:12,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:12,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:12,291 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:30:12,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:12,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1704969137, now seen corresponding path program 4 times [2019-11-28 20:30:12,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:30:12,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369310393] [2019-11-28 20:30:12,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:30:12,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:30:12,365 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:30:12,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369310393] [2019-11-28 20:30:12,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008664699] [2019-11-28 20:30:12,366 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 20:30:12,403 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 20:30:12,403 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:30:12,404 INFO L264 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 20:30:12,405 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:30:12,412 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:30:12,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:30:12,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-11-28 20:30:12,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243930685] [2019-11-28 20:30:12,415 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:30:12,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:30:12,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 20:30:12,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:30:12,417 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. cyclomatic complexity: 2 Second operand 7 states. [2019-11-28 20:30:12,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:30:12,448 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-11-28 20:30:12,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 20:30:12,450 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2019-11-28 20:30:12,450 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-28 20:30:12,451 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 10 transitions. [2019-11-28 20:30:12,451 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-28 20:30:12,451 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-28 20:30:12,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2019-11-28 20:30:12,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:30:12,452 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-11-28 20:30:12,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2019-11-28 20:30:12,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-11-28 20:30:12,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-28 20:30:12,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-11-28 20:30:12,456 INFO L711 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-11-28 20:30:12,456 INFO L591 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-11-28 20:30:12,457 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 20:30:12,457 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2019-11-28 20:30:12,457 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-28 20:30:12,458 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:30:12,458 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:30:12,458 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 20:30:12,458 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [5, 1, 1, 1] [2019-11-28 20:30:12,458 INFO L794 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-11-28 20:30:12,460 INFO L796 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-11-28 20:30:12,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:12,460 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 6 times [2019-11-28 20:30:12,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:30:12,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668093986] [2019-11-28 20:30:12,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:30:12,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:12,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:12,476 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:30:12,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:12,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1314433936, now seen corresponding path program 5 times [2019-11-28 20:30:12,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:30:12,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844109013] [2019-11-28 20:30:12,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:30:12,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:30:12,614 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:30:12,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844109013] [2019-11-28 20:30:12,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558894306] [2019-11-28 20:30:12,615 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 20:30:12,655 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-11-28 20:30:12,655 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:30:12,656 INFO L264 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 20:30:12,657 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:30:12,674 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:30:12,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:30:12,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-11-28 20:30:12,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257755648] [2019-11-28 20:30:12,680 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:30:12,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:30:12,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 20:30:12,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:30:12,682 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 2 Second operand 8 states. [2019-11-28 20:30:12,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:30:12,720 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2019-11-28 20:30:12,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 20:30:12,722 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 11 transitions. [2019-11-28 20:30:12,723 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-28 20:30:12,723 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 11 transitions. [2019-11-28 20:30:12,723 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-28 20:30:12,724 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-28 20:30:12,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2019-11-28 20:30:12,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:30:12,725 INFO L688 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-11-28 20:30:12,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2019-11-28 20:30:12,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-11-28 20:30:12,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-28 20:30:12,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2019-11-28 20:30:12,729 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-11-28 20:30:12,732 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-11-28 20:30:12,734 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 20:30:12,734 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. [2019-11-28 20:30:12,735 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-28 20:30:12,735 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:30:12,737 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:30:12,737 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 20:30:12,737 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [6, 1, 1, 1] [2019-11-28 20:30:12,738 INFO L794 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-11-28 20:30:12,738 INFO L796 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-11-28 20:30:12,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:12,740 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 7 times [2019-11-28 20:30:12,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:30:12,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548604820] [2019-11-28 20:30:12,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:30:12,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:12,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:12,751 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:30:12,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:12,752 INFO L82 PathProgramCache]: Analyzing trace with hash -2092744593, now seen corresponding path program 6 times [2019-11-28 20:30:12,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:30:12,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487721266] [2019-11-28 20:30:12,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:30:12,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:30:12,857 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:30:12,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487721266] [2019-11-28 20:30:12,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995510877] [2019-11-28 20:30:12,858 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 20:30:12,882 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-11-28 20:30:12,883 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:30:12,884 INFO L264 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 20:30:12,885 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:30:12,896 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:30:12,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:30:12,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-11-28 20:30:12,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448579911] [2019-11-28 20:30:12,901 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:30:12,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:30:12,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 20:30:12,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:30:12,904 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. cyclomatic complexity: 2 Second operand 9 states. [2019-11-28 20:30:12,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:30:12,947 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2019-11-28 20:30:12,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 20:30:12,948 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2019-11-28 20:30:12,949 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-11-28 20:30:12,949 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 12 transitions. [2019-11-28 20:30:12,950 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-28 20:30:12,952 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-28 20:30:12,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. [2019-11-28 20:30:12,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:30:12,952 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-11-28 20:30:12,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. [2019-11-28 20:30:12,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-11-28 20:30:12,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-28 20:30:12,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-11-28 20:30:12,955 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-11-28 20:30:12,956 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-11-28 20:30:12,956 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-28 20:30:12,956 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2019-11-28 20:30:12,957 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-11-28 20:30:12,958 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:30:12,959 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:30:12,959 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 20:30:12,959 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [7, 1, 1, 1] [2019-11-28 20:30:12,960 INFO L794 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-11-28 20:30:12,960 INFO L796 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-11-28 20:30:12,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:12,961 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 8 times [2019-11-28 20:30:12,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:30:12,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625290069] [2019-11-28 20:30:12,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:30:12,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:12,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:12,969 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:30:12,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:12,970 INFO L82 PathProgramCache]: Analyzing trace with hash -450571184, now seen corresponding path program 7 times [2019-11-28 20:30:12,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:30:12,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714379594] [2019-11-28 20:30:12,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:30:12,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:30:13,062 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:30:13,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714379594] [2019-11-28 20:30:13,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891358682] [2019-11-28 20:30:13,063 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-11-28 20:30:13,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:30:13,100 INFO L264 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 20:30:13,101 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:30:13,112 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:30:13,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:30:13,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-11-28 20:30:13,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660748114] [2019-11-28 20:30:13,116 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:30:13,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:30:13,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 20:30:13,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-11-28 20:30:13,118 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. cyclomatic complexity: 2 Second operand 10 states. [2019-11-28 20:30:13,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:30:13,158 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2019-11-28 20:30:13,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 20:30:13,158 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2019-11-28 20:30:13,159 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-11-28 20:30:13,161 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 13 transitions. [2019-11-28 20:30:13,162 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-28 20:30:13,162 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-28 20:30:13,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 13 transitions. [2019-11-28 20:30:13,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:30:13,162 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-11-28 20:30:13,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 13 transitions. [2019-11-28 20:30:13,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-11-28 20:30:13,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-28 20:30:13,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-11-28 20:30:13,167 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-11-28 20:30:13,167 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-11-28 20:30:13,167 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-28 20:30:13,168 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 13 transitions. [2019-11-28 20:30:13,169 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-11-28 20:30:13,170 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:30:13,170 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:30:13,171 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 20:30:13,171 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [8, 1, 1, 1] [2019-11-28 20:30:13,171 INFO L794 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-11-28 20:30:13,172 INFO L796 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-11-28 20:30:13,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:13,172 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 9 times [2019-11-28 20:30:13,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:30:13,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585580484] [2019-11-28 20:30:13,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:30:13,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:13,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:13,191 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:30:13,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:13,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1082803057, now seen corresponding path program 8 times [2019-11-28 20:30:13,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:30:13,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313419960] [2019-11-28 20:30:13,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:30:13,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:30:13,347 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:30:13,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313419960] [2019-11-28 20:30:13,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227850599] [2019-11-28 20:30:13,351 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-11-28 20:30:13,382 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 20:30:13,382 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:30:13,383 INFO L264 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 20:30:13,386 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:30:13,407 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:30:13,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:30:13,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-11-28 20:30:13,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648708351] [2019-11-28 20:30:13,409 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:30:13,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:30:13,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 20:30:13,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-11-28 20:30:13,410 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. cyclomatic complexity: 2 Second operand 11 states. [2019-11-28 20:30:13,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:30:13,448 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2019-11-28 20:30:13,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 20:30:13,449 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2019-11-28 20:30:13,449 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-11-28 20:30:13,450 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 14 transitions. [2019-11-28 20:30:13,450 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-28 20:30:13,450 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-28 20:30:13,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2019-11-28 20:30:13,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:30:13,451 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-11-28 20:30:13,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2019-11-28 20:30:13,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-11-28 20:30:13,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-28 20:30:13,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-11-28 20:30:13,453 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-11-28 20:30:13,454 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-11-28 20:30:13,454 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-28 20:30:13,454 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 14 transitions. [2019-11-28 20:30:13,455 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-11-28 20:30:13,455 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:30:13,455 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:30:13,456 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 20:30:13,456 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [9, 1, 1, 1] [2019-11-28 20:30:13,456 INFO L794 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-11-28 20:30:13,456 INFO L796 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-11-28 20:30:13,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:13,457 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 10 times [2019-11-28 20:30:13,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:30:13,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606607729] [2019-11-28 20:30:13,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:30:13,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:13,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:13,463 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:30:13,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:13,464 INFO L82 PathProgramCache]: Analyzing trace with hash 792845360, now seen corresponding path program 9 times [2019-11-28 20:30:13,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:30:13,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864215935] [2019-11-28 20:30:13,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:30:13,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:13,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:13,481 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:30:13,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:13,482 INFO L82 PathProgramCache]: Analyzing trace with hash 287286735, now seen corresponding path program 1 times [2019-11-28 20:30:13,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:30:13,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613009675] [2019-11-28 20:30:13,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:30:13,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:13,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:13,507 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:30:13,617 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2019-11-28 20:30:13,649 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:30:13,650 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:30:13,651 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:30:13,651 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:30:13,651 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 20:30:13,652 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:13,652 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:30:13,652 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:30:13,652 INFO L133 ssoRankerPreferences]: Filename of dumped script: Urban-WST2013-Fig2.c_Iteration10_Loop [2019-11-28 20:30:13,652 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:30:13,653 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:30:13,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:13,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:13,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:13,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:13,769 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:30:13,770 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 20:30:13,785 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:30:13,785 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 20:30:13,795 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 20:30:13,795 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:30:13,813 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:30:13,813 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:13,820 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 20:30:13,820 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:13,880 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:30:13,881 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:30:13,932 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 20:30:13,932 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 20:30:13,952 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 20:30:13,957 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:30:13,957 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:30:13,957 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:30:13,957 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:30:13,958 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:30:13,958 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:13,958 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:30:13,958 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:30:13,958 INFO L133 ssoRankerPreferences]: Filename of dumped script: Urban-WST2013-Fig2.c_Iteration10_Loop [2019-11-28 20:30:13,958 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:30:13,958 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:30:13,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:13,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:13,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:13,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:14,052 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:30:14,057 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 20:30:14,062 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-11-28 20:30:14,064 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:30:14,065 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:30:14,065 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:30:14,065 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:30:14,070 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:30:14,070 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:30:14,075 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 20:30:14,086 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-11-28 20:30:14,087 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:30:14,088 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:30:14,088 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:30:14,088 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:30:14,091 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:30:14,092 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:30:14,096 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 20:30:14,109 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-11-28 20:30:14,111 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:30:14,111 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:30:14,111 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:30:14,112 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:30:14,112 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:30:14,112 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:30:14,113 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:30:14,115 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:30:14,124 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 20:30:14,124 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:30:14,131 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:30:14,132 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 20:30:14,132 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:30:14,133 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-11-28 20:30:14,140 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:14,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:14,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:30:14,184 INFO L264 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:30:14,184 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:30:14,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:30:14,195 INFO L264 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:30:14,196 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:30:14,210 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-11-28 20:30:14,215 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-11-28 20:30:14,216 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 14 transitions. cyclomatic complexity: 2 Second operand 3 states. [2019-11-28 20:30:14,248 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-11-28 20:30:14,248 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-11-28 20:30:14,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 20:30:14,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-11-28 20:30:14,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 1 letters. Loop has 12 letters. [2019-11-28 20:30:14,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:30:14,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 13 letters. Loop has 12 letters. [2019-11-28 20:30:14,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:30:14,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 1 letters. Loop has 24 letters. [2019-11-28 20:30:14,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:30:14,253 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 28 transitions. [2019-11-28 20:30:14,254 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-28 20:30:14,255 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 24 states and 27 transitions. [2019-11-28 20:30:14,255 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-28 20:30:14,255 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-28 20:30:14,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 27 transitions. [2019-11-28 20:30:14,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:30:14,255 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2019-11-28 20:30:14,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 27 transitions. [2019-11-28 20:30:14,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 15. [2019-11-28 20:30:14,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-28 20:30:14,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2019-11-28 20:30:14,258 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-11-28 20:30:14,258 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-11-28 20:30:14,258 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-28 20:30:14,258 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2019-11-28 20:30:14,259 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-28 20:30:14,259 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:30:14,259 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:30:14,260 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 20:30:14,260 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-28 20:30:14,260 INFO L794 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-11-28 20:30:14,260 INFO L796 eck$LassoCheckResult]: Loop: 510#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 510#L21-2 [2019-11-28 20:30:14,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:14,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1002, now seen corresponding path program 1 times [2019-11-28 20:30:14,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:30:14,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681857262] [2019-11-28 20:30:14,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:30:14,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:14,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:14,267 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:30:14,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:14,268 INFO L82 PathProgramCache]: Analyzing trace with hash 50, now seen corresponding path program 1 times [2019-11-28 20:30:14,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:30:14,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433868495] [2019-11-28 20:30:14,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:30:14,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:14,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:14,274 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:30:14,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:14,275 INFO L82 PathProgramCache]: Analyzing trace with hash 31081, now seen corresponding path program 1 times [2019-11-28 20:30:14,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:30:14,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878829287] [2019-11-28 20:30:14,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:30:14,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:14,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:14,282 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:30:14,297 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:30:14,297 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:30:14,297 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:30:14,297 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:30:14,297 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 20:30:14,298 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:14,298 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:30:14,298 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:30:14,298 INFO L133 ssoRankerPreferences]: Filename of dumped script: Urban-WST2013-Fig2.c_Iteration11_Loop [2019-11-28 20:30:14,298 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:30:14,298 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:30:14,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:14,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:14,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:14,355 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:30:14,355 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 20:30:14,386 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:30:14,386 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 20:30:14,390 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 20:30:14,390 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 20:30:14,403 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:30:14,404 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 20:30:14,408 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 20:30:14,409 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 20:30:14,421 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:30:14,422 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:30:14,449 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 20:30:14,450 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:14,458 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 20:30:14,460 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:30:14,460 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:30:14,461 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:30:14,461 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:30:14,461 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:30:14,461 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:14,461 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:30:14,461 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:30:14,461 INFO L133 ssoRankerPreferences]: Filename of dumped script: Urban-WST2013-Fig2.c_Iteration11_Loop [2019-11-28 20:30:14,461 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:30:14,461 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:30:14,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:14,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:14,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:14,513 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:30:14,513 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:30:14,531 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-11-28 20:30:14,532 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:30:14,533 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:30:14,533 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:30:14,533 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:30:14,535 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:30:14,535 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:14,539 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:30:14,556 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-11-28 20:30:14,557 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:30:14,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:30:14,558 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:30:14,558 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:30:14,560 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:30:14,560 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:14,564 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:30:14,590 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-11-28 20:30:14,592 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:30:14,592 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:30:14,592 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:30:14,592 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:30:14,592 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:30:14,597 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:30:14,597 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:14,602 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:30:14,606 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 20:30:14,607 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:30:14,623 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:30:14,623 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 20:30:14,623 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:30:14,623 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x2~0) = 1*ULTIMATE.start_main_~x2~0 Supporting invariants [] [2019-11-28 20:30:14,628 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:14,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:14,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:30:14,680 INFO L264 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:30:14,681 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:30:14,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:30:14,689 WARN L262 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:30:14,690 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:30:14,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:30:14,690 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-11-28 20:30:14,690 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 18 transitions. cyclomatic complexity: 5 Second operand 2 states. [2019-11-28 20:30:14,707 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-11-28 20:30:14,707 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-11-28 20:30:14,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-11-28 20:30:14,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-11-28 20:30:14,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 2 letters. Loop has 1 letters. [2019-11-28 20:30:14,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:30:14,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 3 letters. Loop has 1 letters. [2019-11-28 20:30:14,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:30:14,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 2 letters. Loop has 2 letters. [2019-11-28 20:30:14,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:30:14,709 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 36 transitions. [2019-11-28 20:30:14,710 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-28 20:30:14,711 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 27 states and 31 transitions. [2019-11-28 20:30:14,711 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-11-28 20:30:14,711 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2019-11-28 20:30:14,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 31 transitions. [2019-11-28 20:30:14,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:30:14,711 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-11-28 20:30:14,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 31 transitions. [2019-11-28 20:30:14,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 15. [2019-11-28 20:30:14,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-28 20:30:14,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-11-28 20:30:14,714 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-11-28 20:30:14,714 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-11-28 20:30:14,714 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-28 20:30:14,714 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2019-11-28 20:30:14,715 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-28 20:30:14,715 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:30:14,715 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:30:14,716 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [9, 2, 1, 1, 1] [2019-11-28 20:30:14,716 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-28 20:30:14,716 INFO L794 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-11-28 20:30:14,716 INFO L796 eck$LassoCheckResult]: Loop: 586#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 586#L21-2 [2019-11-28 20:30:14,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:14,717 INFO L82 PathProgramCache]: Analyzing trace with hash 315954203, now seen corresponding path program 2 times [2019-11-28 20:30:14,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:30:14,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290568163] [2019-11-28 20:30:14,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:30:14,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:14,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:14,739 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:30:14,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:14,740 INFO L82 PathProgramCache]: Analyzing trace with hash 50, now seen corresponding path program 2 times [2019-11-28 20:30:14,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:30:14,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080040997] [2019-11-28 20:30:14,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:30:14,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:14,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:14,750 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:30:14,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:14,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1204645720, now seen corresponding path program 3 times [2019-11-28 20:30:14,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:30:14,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927562148] [2019-11-28 20:30:14,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:30:14,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:14,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:30:14,779 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:30:14,794 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:30:14,794 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:30:14,794 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:30:14,794 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:30:14,794 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 20:30:14,794 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:14,795 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:30:14,795 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:30:14,795 INFO L133 ssoRankerPreferences]: Filename of dumped script: Urban-WST2013-Fig2.c_Iteration12_Loop [2019-11-28 20:30:14,795 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:30:14,795 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:30:14,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:14,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:14,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:14,850 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:30:14,851 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:14,859 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:30:14,859 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 20:30:14,863 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 20:30:14,864 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:30:14,871 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:30:14,871 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:30:14,886 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 20:30:14,886 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:14,898 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 20:30:14,900 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:30:14,900 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:30:14,900 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:30:14,900 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:30:14,900 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:30:14,900 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:14,901 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:30:14,901 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:30:14,901 INFO L133 ssoRankerPreferences]: Filename of dumped script: Urban-WST2013-Fig2.c_Iteration12_Loop [2019-11-28 20:30:14,901 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:30:14,901 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:30:14,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:14,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:14,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:30:14,953 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:30:14,953 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:30:14,959 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-11-28 20:30:14,961 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:30:14,961 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:30:14,961 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:30:14,961 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:14,968 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:30:14,968 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:30:14,982 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:30:14,989 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-11-28 20:30:14,991 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:30:14,991 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:30:14,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:30:14,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:30:14,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:30:14,995 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:30:14,995 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:14,998 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:30:15,002 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 20:30:15,002 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:30:15,007 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:30:15,007 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 20:30:15,007 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:30:15,008 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x2~0) = 1*ULTIMATE.start_main_~x2~0 Supporting invariants [] [2019-11-28 20:30:15,020 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:30:15,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:15,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:30:15,050 INFO L264 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:30:15,051 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:30:15,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:30:15,057 WARN L262 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:30:15,057 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:30:15,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:30:15,058 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-11-28 20:30:15,058 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4 Second operand 2 states. [2019-11-28 20:30:15,069 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-11-28 20:30:15,071 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-11-28 20:30:15,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-11-28 20:30:15,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-11-28 20:30:15,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 14 letters. Loop has 1 letters. [2019-11-28 20:30:15,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:30:15,072 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:30:15,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:15,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:30:15,102 INFO L264 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:30:15,102 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:30:15,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:30:15,108 WARN L262 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:30:15,108 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:30:15,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:30:15,108 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-11-28 20:30:15,109 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4 Second operand 2 states. [2019-11-28 20:30:15,118 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-11-28 20:30:15,119 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-11-28 20:30:15,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-11-28 20:30:15,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-11-28 20:30:15,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 14 letters. Loop has 1 letters. [2019-11-28 20:30:15,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:30:15,120 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:30:15,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:30:15,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:30:15,140 INFO L264 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:30:15,141 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:30:15,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:30:15,146 WARN L262 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:30:15,146 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:30:15,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:30:15,147 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-11-28 20:30:15,147 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4 Second operand 2 states. [2019-11-28 20:30:15,158 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-11-28 20:30:15,159 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-11-28 20:30:15,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-11-28 20:30:15,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2019-11-28 20:30:15,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 14 letters. Loop has 1 letters. [2019-11-28 20:30:15,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:30:15,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 15 letters. Loop has 1 letters. [2019-11-28 20:30:15,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:30:15,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 14 letters. Loop has 2 letters. [2019-11-28 20:30:15,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:30:15,162 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 20 transitions. [2019-11-28 20:30:15,163 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 20:30:15,163 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 0 states and 0 transitions. [2019-11-28 20:30:15,163 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 20:30:15,163 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 20:30:15,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 20:30:15,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:30:15,163 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:30:15,163 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:30:15,164 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:30:15,164 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-28 20:30:15,164 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-28 20:30:15,164 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 20:30:15,164 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-28 20:30:15,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 08:30:15 BoogieIcfgContainer [2019-11-28 20:30:15,178 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 20:30:15,180 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:30:15,180 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:30:15,180 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:30:15,181 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:30:11" (3/4) ... [2019-11-28 20:30:15,185 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 20:30:15,185 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:30:15,188 INFO L168 Benchmark]: Toolchain (without parser) took 4422.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 202.9 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -131.2 MB). Peak memory consumption was 71.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:30:15,189 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:30:15,191 INFO L168 Benchmark]: CACSL2BoogieTranslator took 229.38 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:30:15,192 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.57 ms. Allocated memory is still 1.0 GB. Free memory is still 949.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:30:15,195 INFO L168 Benchmark]: Boogie Preprocessor took 74.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -181.3 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:30:15,195 INFO L168 Benchmark]: RCFGBuilder took 223.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-28 20:30:15,200 INFO L168 Benchmark]: BuchiAutomizer took 3851.59 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.9 MB). Peak memory consumption was 89.6 MB. Max. memory is 11.5 GB. [2019-11-28 20:30:15,200 INFO L168 Benchmark]: Witness Printer took 5.78 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:30:15,207 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.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 229.38 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.57 ms. Allocated memory is still 1.0 GB. Free memory is still 949.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 74.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -181.3 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 223.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3851.59 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.9 MB). Peak memory consumption was 89.6 MB. Max. memory is 11.5 GB. * Witness Printer took 5.78 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 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 3.7s and 13 iterations. TraceHistogramMax:9. Analysis of lassos took 2.8s. Construction of modules took 0.2s. Büchi inclusion checks took 0.4s. 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.2s 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: 17ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...