./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/UpAndDownIneq.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 30f4e4ab 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-restricted-15/UpAndDownIneq.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 2b329fcd1c2ada34efa1c491c6d8d75d6e8a1856 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 02:58:59,328 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 02:58:59,330 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 02:58:59,342 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 02:58:59,342 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 02:58:59,344 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 02:58:59,345 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 02:58:59,347 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 02:58:59,349 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 02:58:59,350 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 02:58:59,353 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 02:58:59,356 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 02:58:59,357 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 02:58:59,359 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 02:58:59,361 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 02:58:59,363 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 02:58:59,364 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 02:58:59,367 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 02:58:59,371 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 02:58:59,375 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 02:58:59,377 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 02:58:59,380 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 02:58:59,382 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 02:58:59,383 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 02:58:59,386 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 02:58:59,388 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 02:58:59,388 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 02:58:59,389 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 02:58:59,390 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 02:58:59,391 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 02:58:59,392 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 02:58:59,393 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 02:58:59,394 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 02:58:59,395 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 02:58:59,397 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 02:58:59,397 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 02:58:59,398 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 02:58:59,399 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 02:58:59,399 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 02:58:59,401 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 02:58:59,402 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 02:58:59,403 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-28 02:58:59,427 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 02:58:59,428 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 02:58:59,431 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 02:58:59,431 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 02:58:59,431 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 02:58:59,431 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 02:58:59,432 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 02:58:59,432 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 02:58:59,432 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 02:58:59,433 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 02:58:59,433 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 02:58:59,434 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 02:58:59,434 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 02:58:59,435 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 02:58:59,435 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 02:58:59,435 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 02:58:59,435 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 02:58:59,436 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 02:58:59,436 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 02:58:59,436 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 02:58:59,436 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 02:58:59,437 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 02:58:59,437 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 02:58:59,437 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 02:58:59,437 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 02:58:59,438 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 02:58:59,438 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 02:58:59,438 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 02:58:59,439 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 02:58:59,440 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 -> 2b329fcd1c2ada34efa1c491c6d8d75d6e8a1856 [2019-11-28 02:58:59,741 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 02:58:59,754 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 02:58:59,758 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 02:58:59,759 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 02:58:59,760 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 02:58:59,761 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/UpAndDownIneq.c [2019-11-28 02:58:59,824 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc6028b6e/593aa582488742eb91d784da6f363559/FLAGf3196e0cd [2019-11-28 02:59:00,271 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 02:59:00,271 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/UpAndDownIneq.c [2019-11-28 02:59:00,277 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc6028b6e/593aa582488742eb91d784da6f363559/FLAGf3196e0cd [2019-11-28 02:59:00,691 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc6028b6e/593aa582488742eb91d784da6f363559 [2019-11-28 02:59:00,695 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 02:59:00,696 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 02:59:00,697 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 02:59:00,698 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 02:59:00,701 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 02:59:00,702 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:59:00" (1/1) ... [2019-11-28 02:59:00,705 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bf01ec9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:59:00, skipping insertion in model container [2019-11-28 02:59:00,705 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:59:00" (1/1) ... [2019-11-28 02:59:00,713 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 02:59:00,729 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 02:59:00,915 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:59:00,919 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 02:59:00,940 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:59:00,954 INFO L208 MainTranslator]: Completed translation [2019-11-28 02:59:00,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:59:00 WrapperNode [2019-11-28 02:59:00,956 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 02:59:00,956 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 02:59:00,957 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 02:59:00,957 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 02:59:00,965 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:59:00" (1/1) ... [2019-11-28 02:59:00,973 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:59:00" (1/1) ... [2019-11-28 02:59:01,043 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 02:59:01,044 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 02:59:01,044 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 02:59:01,044 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 02:59:01,053 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:59:00" (1/1) ... [2019-11-28 02:59:01,053 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:59:00" (1/1) ... [2019-11-28 02:59:01,054 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:59:00" (1/1) ... [2019-11-28 02:59:01,054 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:59:00" (1/1) ... [2019-11-28 02:59:01,057 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:59:00" (1/1) ... [2019-11-28 02:59:01,062 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:59:00" (1/1) ... [2019-11-28 02:59:01,063 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:59:00" (1/1) ... [2019-11-28 02:59:01,064 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 02:59:01,064 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 02:59:01,064 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 02:59:01,065 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 02:59:01,065 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:59:00" (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 02:59:01,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 02:59:01,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 02:59:01,269 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 02:59:01,270 INFO L297 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-28 02:59:01,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:59:01 BoogieIcfgContainer [2019-11-28 02:59:01,271 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 02:59:01,272 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 02:59:01,272 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 02:59:01,275 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 02:59:01,276 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 02:59:01,276 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 02:59:00" (1/3) ... [2019-11-28 02:59:01,277 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@200390bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 02:59:01, skipping insertion in model container [2019-11-28 02:59:01,277 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 02:59:01,278 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:59:00" (2/3) ... [2019-11-28 02:59:01,278 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@200390bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 02:59:01, skipping insertion in model container [2019-11-28 02:59:01,278 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 02:59:01,278 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:59:01" (3/3) ... [2019-11-28 02:59:01,280 INFO L371 chiAutomizerObserver]: Analyzing ICFG UpAndDownIneq.c [2019-11-28 02:59:01,324 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 02:59:01,324 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 02:59:01,324 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 02:59:01,324 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 02:59:01,324 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 02:59:01,325 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 02:59:01,325 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 02:59:01,325 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 02:59:01,337 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2019-11-28 02:59:01,354 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-28 02:59:01,355 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:59:01,355 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:59:01,361 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 02:59:01,361 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 02:59:01,362 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 02:59:01,362 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2019-11-28 02:59:01,363 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-28 02:59:01,363 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:59:01,363 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:59:01,364 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 02:59:01,364 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 02:59:01,369 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 5#L18-1true [2019-11-28 02:59:01,370 INFO L796 eck$LassoCheckResult]: Loop: 5#L18-1true assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6#L12true assume main_~i~0 >= 10;main_~up~0 := 0; 3#L12-2true assume main_~i~0 <= 0;main_~up~0 := 1; 9#L15-1true assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 5#L18-1true [2019-11-28 02:59:01,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:01,375 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-11-28 02:59:01,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:01,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432491688] [2019-11-28 02:59:01,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:01,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:01,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:01,467 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:01,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:01,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1234538, now seen corresponding path program 1 times [2019-11-28 02:59:01,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:01,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750120691] [2019-11-28 02:59:01,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:01,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:01,540 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 02:59:01,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750120691] [2019-11-28 02:59:01,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:59:01,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:59:01,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325983949] [2019-11-28 02:59:01,548 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 02:59:01,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:59:01,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:59:01,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:59:01,564 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2019-11-28 02:59:01,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:59:01,632 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2019-11-28 02:59:01,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:59:01,637 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 21 transitions. [2019-11-28 02:59:01,639 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-28 02:59:01,658 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 9 states and 13 transitions. [2019-11-28 02:59:01,660 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-28 02:59:01,660 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-28 02:59:01,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 13 transitions. [2019-11-28 02:59:01,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 02:59:01,662 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2019-11-28 02:59:01,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 13 transitions. [2019-11-28 02:59:01,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-11-28 02:59:01,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-28 02:59:01,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 13 transitions. [2019-11-28 02:59:01,696 INFO L711 BuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2019-11-28 02:59:01,696 INFO L591 BuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2019-11-28 02:59:01,696 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 02:59:01,697 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 13 transitions. [2019-11-28 02:59:01,697 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-28 02:59:01,698 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:59:01,698 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:59:01,698 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 02:59:01,698 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 02:59:01,699 INFO L794 eck$LassoCheckResult]: Stem: 37#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 38#L18-1 [2019-11-28 02:59:01,699 INFO L796 eck$LassoCheckResult]: Loop: 38#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 43#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 35#L12-2 assume !(main_~i~0 <= 0); 36#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 38#L18-1 [2019-11-28 02:59:01,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:01,708 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2019-11-28 02:59:01,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:01,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862925460] [2019-11-28 02:59:01,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:01,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:01,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:01,716 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:01,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:01,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1234602, now seen corresponding path program 1 times [2019-11-28 02:59:01,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:01,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221878353] [2019-11-28 02:59:01,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:01,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:01,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:01,733 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:01,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:01,734 INFO L82 PathProgramCache]: Analyzing trace with hash 29863753, now seen corresponding path program 1 times [2019-11-28 02:59:01,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:01,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641380319] [2019-11-28 02:59:01,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:01,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:01,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:01,747 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:01,817 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:01,818 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:01,818 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:01,818 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:01,818 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:59:01,819 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:01,819 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:01,819 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:01,819 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration2_Loop [2019-11-28 02:59:01,819 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:01,820 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:01,837 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 02:59:01,846 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 02:59:01,850 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 02:59:01,856 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 02:59:01,968 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:01,969 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:01,981 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:01,981 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:01,992 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:59:01,993 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:02,006 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:02,006 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:02,011 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:59:02,012 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:02,025 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:02,025 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:02,030 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:59:02,031 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=0} Honda state: {ULTIMATE.start_main_~up~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:02,046 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:02,047 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:02,066 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:59:02,067 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:02,074 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:59:02,077 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:02,077 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:02,078 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:02,078 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:02,078 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:59:02,078 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:02,079 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:02,079 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:02,079 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration2_Loop [2019-11-28 02:59:02,079 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:02,079 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:02,082 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 02:59:02,086 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 02:59:02,093 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 02:59:02,097 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 02:59:02,172 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:02,177 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:02,196 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 Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:02,198 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:02,199 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:02,199 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:02,199 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:02,205 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:59:02,206 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:59:02,212 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 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:02,220 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 02:59:02,222 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:02,223 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:02,223 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:02,223 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:02,227 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:59:02,227 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:59:02,233 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 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:02,251 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 02:59:02,253 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:02,253 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:59:02,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:02,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:02,254 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:02,256 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:59:02,256 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:59:02,258 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:02,274 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 02:59:02,276 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:02,276 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:59:02,276 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:02,276 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:02,277 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:02,278 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:59:02,279 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:02,283 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:59:02,289 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 02:59:02,289 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:02,308 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:59:02,309 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:59:02,309 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:59:02,310 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:02,315 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 02:59:02,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:02,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:02,346 INFO L255 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:59:02,347 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:02,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:02,357 INFO L255 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:59:02,357 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:02,370 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 02:59:02,374 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 02:59:02,375 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 13 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-11-28 02:59:02,421 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 13 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 21 states and 31 transitions. Complement of second has 5 states. [2019-11-28 02:59:02,422 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 02:59:02,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 02:59:02,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-11-28 02:59:02,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 1 letters. Loop has 4 letters. [2019-11-28 02:59:02,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:02,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-28 02:59:02,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:02,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 1 letters. Loop has 8 letters. [2019-11-28 02:59:02,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:02,428 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 31 transitions. [2019-11-28 02:59:02,430 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-28 02:59:02,431 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 31 transitions. [2019-11-28 02:59:02,431 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-28 02:59:02,432 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-28 02:59:02,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 31 transitions. [2019-11-28 02:59:02,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:02,433 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 31 transitions. [2019-11-28 02:59:02,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 31 transitions. [2019-11-28 02:59:02,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-11-28 02:59:02,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-28 02:59:02,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 30 transitions. [2019-11-28 02:59:02,437 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 30 transitions. [2019-11-28 02:59:02,437 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 30 transitions. [2019-11-28 02:59:02,437 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 02:59:02,437 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 30 transitions. [2019-11-28 02:59:02,439 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-28 02:59:02,439 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:59:02,439 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:59:02,440 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 02:59:02,440 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 02:59:02,440 INFO L794 eck$LassoCheckResult]: Stem: 105#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 106#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 110#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 112#L12-2 assume !(main_~i~0 <= 0); 120#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 107#L18-1 [2019-11-28 02:59:02,440 INFO L796 eck$LassoCheckResult]: Loop: 107#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 108#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 117#L12-2 assume !(main_~i~0 <= 0); 118#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 107#L18-1 [2019-11-28 02:59:02,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:02,441 INFO L82 PathProgramCache]: Analyzing trace with hash 29863751, now seen corresponding path program 1 times [2019-11-28 02:59:02,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:02,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594157449] [2019-11-28 02:59:02,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:02,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:02,460 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 02:59:02,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594157449] [2019-11-28 02:59:02,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:59:02,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:59:02,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755864783] [2019-11-28 02:59:02,461 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 02:59:02,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:02,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1234600, now seen corresponding path program 1 times [2019-11-28 02:59:02,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:02,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330263083] [2019-11-28 02:59:02,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:02,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:02,489 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 02:59:02,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330263083] [2019-11-28 02:59:02,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:59:02,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:59:02,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492459673] [2019-11-28 02:59:02,491 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 02:59:02,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:59:02,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:59:02,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:59:02,492 INFO L87 Difference]: Start difference. First operand 20 states and 30 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-11-28 02:59:02,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:59:02,503 INFO L93 Difference]: Finished difference Result 24 states and 33 transitions. [2019-11-28 02:59:02,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:59:02,504 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 33 transitions. [2019-11-28 02:59:02,505 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-11-28 02:59:02,508 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 21 states and 30 transitions. [2019-11-28 02:59:02,509 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-11-28 02:59:02,509 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-28 02:59:02,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 30 transitions. [2019-11-28 02:59:02,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:02,509 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2019-11-28 02:59:02,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 30 transitions. [2019-11-28 02:59:02,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2019-11-28 02:59:02,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-28 02:59:02,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 28 transitions. [2019-11-28 02:59:02,514 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 28 transitions. [2019-11-28 02:59:02,515 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 28 transitions. [2019-11-28 02:59:02,515 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 02:59:02,515 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 28 transitions. [2019-11-28 02:59:02,516 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-28 02:59:02,516 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:59:02,517 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:59:02,517 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 02:59:02,517 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 02:59:02,517 INFO L794 eck$LassoCheckResult]: Stem: 156#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 157#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 161#L12 assume !(main_~i~0 >= 10); 169#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 165#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 166#L18-1 [2019-11-28 02:59:02,518 INFO L796 eck$LassoCheckResult]: Loop: 166#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 170#L12 assume !(main_~i~0 >= 10); 168#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 167#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 166#L18-1 [2019-11-28 02:59:02,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:02,519 INFO L82 PathProgramCache]: Analyzing trace with hash 29865611, now seen corresponding path program 1 times [2019-11-28 02:59:02,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:02,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587381532] [2019-11-28 02:59:02,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:02,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:02,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:02,544 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:02,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:02,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1236460, now seen corresponding path program 1 times [2019-11-28 02:59:02,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:02,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367382524] [2019-11-28 02:59:02,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:02,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:02,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:02,565 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:02,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:02,566 INFO L82 PathProgramCache]: Analyzing trace with hash -760725642, now seen corresponding path program 2 times [2019-11-28 02:59:02,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:02,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665366113] [2019-11-28 02:59:02,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:02,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:02,616 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:02,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665366113] [2019-11-28 02:59:02,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:59:02,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 02:59:02,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389285902] [2019-11-28 02:59:02,647 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:02,647 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:02,647 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:02,647 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:02,648 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:59:02,648 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:02,648 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:02,648 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:02,648 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration4_Loop [2019-11-28 02:59:02,648 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:02,649 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:02,650 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 02:59:02,654 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 02:59:02,657 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 02:59:02,660 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 02:59:02,725 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:02,725 INFO L404 LassoAnalysis]: Checking for nontermination... 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) [2019-11-28 02:59:02,730 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:02,731 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:02,736 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:59:02,736 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:02,748 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:02,748 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:02,754 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:59:02,754 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:02,772 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:02,772 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:02,777 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:59:02,777 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=1} Honda state: {ULTIMATE.start_main_~up~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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 02:59:02,784 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:02,785 INFO L160 nArgumentSynthesizer]: Using integer mode. 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 02:59:02,801 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:59:02,801 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:59:02,809 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:59:02,811 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:02,812 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:02,812 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:02,812 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:02,812 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:59:02,812 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:02,812 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:02,813 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:02,813 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration4_Loop [2019-11-28 02:59:02,813 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:02,813 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:02,815 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 02:59:02,827 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 02:59:02,832 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 02:59:02,839 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 02:59:02,896 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:02,896 INFO L489 LassoAnalysis]: Using template 'affine'. 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) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:02,904 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 02:59:02,906 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:02,906 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:02,906 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:02,906 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:02,912 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:59:02,912 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:59:02,918 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 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 02:59:02,932 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 02:59:02,933 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:02,934 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:02,934 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:02,934 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:02,944 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:59:02,945 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:59:02,954 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:02,971 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 02:59:02,973 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:02,973 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:59:02,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:02,974 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:02,974 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:02,977 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:59:02,977 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:02,980 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:59:02,983 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 02:59:02,983 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:02,995 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:59:02,995 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:59:02,996 INFO L510 LassoAnalysis]: Proved termination. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:02,996 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 1 Supporting invariants [] [2019-11-28 02:59:03,000 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 02:59:03,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:03,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:03,029 INFO L255 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:59:03,029 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:03,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:03,039 INFO L255 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:59:03,040 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:03,054 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 02:59:03,055 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 02:59:03,055 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 28 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-11-28 02:59:03,108 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 28 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 36 states and 52 transitions. Complement of second has 7 states. [2019-11-28 02:59:03,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 02:59:03,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 02:59:03,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-11-28 02:59:03,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-28 02:59:03,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:03,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 9 letters. Loop has 4 letters. [2019-11-28 02:59:03,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:03,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 8 letters. [2019-11-28 02:59:03,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:03,112 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 52 transitions. [2019-11-28 02:59:03,115 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2019-11-28 02:59:03,116 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 34 states and 50 transitions. [2019-11-28 02:59:03,116 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-11-28 02:59:03,119 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-11-28 02:59:03,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 50 transitions. [2019-11-28 02:59:03,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:03,119 INFO L688 BuchiCegarLoop]: Abstraction has 34 states and 50 transitions. [2019-11-28 02:59:03,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 50 transitions. [2019-11-28 02:59:03,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2019-11-28 02:59:03,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-28 02:59:03,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 45 transitions. [2019-11-28 02:59:03,128 INFO L711 BuchiCegarLoop]: Abstraction has 30 states and 45 transitions. [2019-11-28 02:59:03,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:59:03,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:59:03,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:59:03,130 INFO L87 Difference]: Start difference. First operand 30 states and 45 transitions. Second operand 4 states. [2019-11-28 02:59:03,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:59:03,158 INFO L93 Difference]: Finished difference Result 32 states and 45 transitions. [2019-11-28 02:59:03,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:59:03,159 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 45 transitions. [2019-11-28 02:59:03,160 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2019-11-28 02:59:03,161 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 28 states and 40 transitions. [2019-11-28 02:59:03,161 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2019-11-28 02:59:03,161 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-11-28 02:59:03,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 40 transitions. [2019-11-28 02:59:03,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:03,162 INFO L688 BuchiCegarLoop]: Abstraction has 28 states and 40 transitions. [2019-11-28 02:59:03,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 40 transitions. [2019-11-28 02:59:03,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 19. [2019-11-28 02:59:03,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-28 02:59:03,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 27 transitions. [2019-11-28 02:59:03,168 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2019-11-28 02:59:03,168 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2019-11-28 02:59:03,168 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 02:59:03,168 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 27 transitions. [2019-11-28 02:59:03,169 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-28 02:59:03,169 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:59:03,169 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:59:03,169 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 02:59:03,169 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 02:59:03,171 INFO L794 eck$LassoCheckResult]: Stem: 326#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 327#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 331#L12 assume !(main_~i~0 >= 10); 338#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 337#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 328#L18-1 [2019-11-28 02:59:03,171 INFO L796 eck$LassoCheckResult]: Loop: 328#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 329#L12 assume !(main_~i~0 >= 10); 322#L12-2 assume !(main_~i~0 <= 0); 323#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 328#L18-1 [2019-11-28 02:59:03,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:03,171 INFO L82 PathProgramCache]: Analyzing trace with hash 29865611, now seen corresponding path program 3 times [2019-11-28 02:59:03,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:03,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664268907] [2019-11-28 02:59:03,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:03,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:03,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:03,181 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:03,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:03,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1236522, now seen corresponding path program 1 times [2019-11-28 02:59:03,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:03,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238618738] [2019-11-28 02:59:03,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:03,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:03,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:03,188 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:03,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:03,189 INFO L82 PathProgramCache]: Analyzing trace with hash -760725580, now seen corresponding path program 1 times [2019-11-28 02:59:03,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:03,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19106249] [2019-11-28 02:59:03,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:03,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:03,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:03,200 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:03,227 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:03,227 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:03,227 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:03,227 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:03,227 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:59:03,227 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:03,228 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:03,228 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:03,228 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration5_Loop [2019-11-28 02:59:03,228 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:03,228 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:03,229 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 02:59:03,234 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 02:59:03,237 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 02:59:03,240 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 02:59:03,306 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:03,307 INFO L404 LassoAnalysis]: Checking for nontermination... 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) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:03,325 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:03,325 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:59:03,330 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:59:03,330 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 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:03,344 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:03,344 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:59:03,348 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:59:03,348 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=1} Honda state: {ULTIMATE.start_main_~up~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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 02:59:03,366 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:03,366 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:03,370 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:59:03,370 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_5=0} Honda state: {v_rep~unnamed0~0~false_5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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 02:59:03,378 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:03,379 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 24 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:03,389 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:59:03,389 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:03,397 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:59:03,399 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:03,400 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:03,400 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:03,400 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:03,400 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:59:03,400 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:03,400 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:03,400 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:03,401 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration5_Loop [2019-11-28 02:59:03,401 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:03,401 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:03,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:03,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:03,413 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 02:59:03,421 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 02:59:03,492 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:03,492 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2019-11-28 02:59:03,500 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 02:59:03,502 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:03,502 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:59:03,502 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:03,503 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:03,503 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:03,503 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:59:03,503 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:03,505 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:03,515 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 02:59:03,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:03,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:03,517 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:03,517 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:03,519 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:59:03,519 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:03,523 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:03,529 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 02:59:03,531 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:03,531 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:59:03,531 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:03,531 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:03,532 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:03,533 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:59:03,533 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:03,535 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:59:03,538 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 02:59:03,538 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:03,542 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:59:03,543 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:59:03,543 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:59:03,543 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 19 Supporting invariants [] [2019-11-28 02:59:03,545 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:03,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:03,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:03,565 INFO L255 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:59:03,565 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:03,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:03,570 INFO L255 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:59:03,571 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:03,583 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 02:59:03,583 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 02:59:03,583 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 27 transitions. cyclomatic complexity: 10 Second operand 4 states. [2019-11-28 02:59:03,613 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 27 transitions. cyclomatic complexity: 10. Second operand 4 states. Result 31 states and 42 transitions. Complement of second has 7 states. [2019-11-28 02:59:03,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 02:59:03,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 02:59:03,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2019-11-28 02:59:03,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-28 02:59:03,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:03,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 4 letters. [2019-11-28 02:59:03,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:03,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 5 letters. Loop has 8 letters. [2019-11-28 02:59:03,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:03,616 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 42 transitions. [2019-11-28 02:59:03,617 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-28 02:59:03,617 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 29 states and 40 transitions. [2019-11-28 02:59:03,617 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-11-28 02:59:03,618 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-28 02:59:03,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 40 transitions. [2019-11-28 02:59:03,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:03,618 INFO L688 BuchiCegarLoop]: Abstraction has 29 states and 40 transitions. [2019-11-28 02:59:03,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 40 transitions. [2019-11-28 02:59:03,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2019-11-28 02:59:03,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-28 02:59:03,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 36 transitions. [2019-11-28 02:59:03,621 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 36 transitions. [2019-11-28 02:59:03,621 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 36 transitions. [2019-11-28 02:59:03,621 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 02:59:03,621 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 36 transitions. [2019-11-28 02:59:03,622 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-28 02:59:03,622 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:59:03,622 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:59:03,622 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1] [2019-11-28 02:59:03,622 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 02:59:03,623 INFO L794 eck$LassoCheckResult]: Stem: 427#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 428#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 440#L12 assume !(main_~i~0 >= 10); 443#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 442#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 441#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 433#L12 assume !(main_~i~0 >= 10); 423#L12-2 [2019-11-28 02:59:03,623 INFO L796 eck$LassoCheckResult]: Loop: 423#L12-2 assume !(main_~i~0 <= 0); 424#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 434#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 447#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 423#L12-2 [2019-11-28 02:59:03,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:03,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1363918576, now seen corresponding path program 4 times [2019-11-28 02:59:03,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:03,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339451919] [2019-11-28 02:59:03,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:03,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:03,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:03,633 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:03,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:03,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1575402, now seen corresponding path program 2 times [2019-11-28 02:59:03,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:03,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900999687] [2019-11-28 02:59:03,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:03,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:03,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:03,641 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:03,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:03,641 INFO L82 PathProgramCache]: Analyzing trace with hash -912839815, now seen corresponding path program 1 times [2019-11-28 02:59:03,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:03,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094264222] [2019-11-28 02:59:03,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:03,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:03,670 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 02:59:03,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094264222] [2019-11-28 02:59:03,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:59:03,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:59:03,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001519827] [2019-11-28 02:59:03,703 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:03,703 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:03,703 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:03,703 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:03,703 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:59:03,703 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:03,704 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:03,704 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:03,704 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration6_Loop [2019-11-28 02:59:03,704 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:03,704 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:03,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:03,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:03,715 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 02:59:03,722 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 02:59:03,778 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:03,778 INFO L404 LassoAnalysis]: Checking for nontermination... 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) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:03,785 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:03,785 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:59:03,790 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:59:03,790 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=0} Honda state: {ULTIMATE.start_main_~up~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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 02:59:03,799 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:03,800 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:03,806 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:59:03,807 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:03,822 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:03,822 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 32 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:03,836 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:59:03,837 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:03,979 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:59:03,980 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:03,981 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:03,981 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:03,981 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:03,981 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:59:03,981 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:03,981 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:03,981 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:03,981 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration6_Loop [2019-11-28 02:59:03,982 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:03,982 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:03,983 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 02:59:03,989 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 02:59:03,999 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 02:59:04,002 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 02:59:04,053 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:04,053 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:04,058 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 02:59:04,060 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:04,060 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:59:04,060 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:04,060 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:04,060 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:04,061 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:59:04,061 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:04,064 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:04,073 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 02:59:04,074 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:04,075 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:59:04,075 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:04,075 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:04,075 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:04,077 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:59:04,077 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:04,080 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:59:04,083 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-11-28 02:59:04,083 INFO L444 ModelExtractionUtils]: 1 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:04,088 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:59:04,088 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:59:04,088 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:59:04,088 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-11-28 02:59:04,091 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:04,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:04,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:04,123 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:59:04,123 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:04,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:04,130 INFO L255 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:59:04,131 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:04,167 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 02:59:04,167 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-28 02:59:04,167 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 36 transitions. cyclomatic complexity: 14 Second operand 5 states. [2019-11-28 02:59:04,207 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 36 transitions. cyclomatic complexity: 14. Second operand 5 states. Result 39 states and 58 transitions. Complement of second has 7 states. [2019-11-28 02:59:04,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 02:59:04,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 02:59:04,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2019-11-28 02:59:04,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 7 letters. Loop has 4 letters. [2019-11-28 02:59:04,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:04,209 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:59:04,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:04,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:04,228 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:59:04,228 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:04,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:04,234 INFO L255 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:59:04,234 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:04,256 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 02:59:04,256 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-28 02:59:04,256 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 36 transitions. cyclomatic complexity: 14 Second operand 5 states. [2019-11-28 02:59:04,307 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 36 transitions. cyclomatic complexity: 14. Second operand 5 states. Result 77 states and 108 transitions. Complement of second has 9 states. [2019-11-28 02:59:04,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-28 02:59:04,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 02:59:04,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2019-11-28 02:59:04,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 7 letters. Loop has 4 letters. [2019-11-28 02:59:04,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:04,309 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:59:04,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:04,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:04,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:59:04,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:04,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:04,337 INFO L255 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:59:04,337 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:04,359 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 02:59:04,360 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 3 loop predicates [2019-11-28 02:59:04,360 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 36 transitions. cyclomatic complexity: 14 Second operand 5 states. [2019-11-28 02:59:04,398 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 36 transitions. cyclomatic complexity: 14. Second operand 5 states. Result 53 states and 81 transitions. Complement of second has 8 states. [2019-11-28 02:59:04,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 02:59:04,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 02:59:04,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2019-11-28 02:59:04,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 7 letters. Loop has 4 letters. [2019-11-28 02:59:04,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:04,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 11 letters. Loop has 4 letters. [2019-11-28 02:59:04,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:04,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 7 letters. Loop has 8 letters. [2019-11-28 02:59:04,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:04,405 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 81 transitions. [2019-11-28 02:59:04,412 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2019-11-28 02:59:04,412 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 42 states and 60 transitions. [2019-11-28 02:59:04,413 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-11-28 02:59:04,413 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-11-28 02:59:04,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 60 transitions. [2019-11-28 02:59:04,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:04,414 INFO L688 BuchiCegarLoop]: Abstraction has 42 states and 60 transitions. [2019-11-28 02:59:04,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 60 transitions. [2019-11-28 02:59:04,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2019-11-28 02:59:04,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-28 02:59:04,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 47 transitions. [2019-11-28 02:59:04,422 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 47 transitions. [2019-11-28 02:59:04,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:59:04,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:59:04,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:59:04,423 INFO L87 Difference]: Start difference. First operand 32 states and 47 transitions. Second operand 3 states. [2019-11-28 02:59:04,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:59:04,436 INFO L93 Difference]: Finished difference Result 34 states and 47 transitions. [2019-11-28 02:59:04,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:59:04,438 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 47 transitions. [2019-11-28 02:59:04,439 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2019-11-28 02:59:04,441 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 31 states and 41 transitions. [2019-11-28 02:59:04,441 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-11-28 02:59:04,442 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-28 02:59:04,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 41 transitions. [2019-11-28 02:59:04,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:04,442 INFO L688 BuchiCegarLoop]: Abstraction has 31 states and 41 transitions. [2019-11-28 02:59:04,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 41 transitions. [2019-11-28 02:59:04,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2019-11-28 02:59:04,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-28 02:59:04,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2019-11-28 02:59:04,447 INFO L711 BuchiCegarLoop]: Abstraction has 29 states and 39 transitions. [2019-11-28 02:59:04,447 INFO L591 BuchiCegarLoop]: Abstraction has 29 states and 39 transitions. [2019-11-28 02:59:04,448 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 02:59:04,450 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 39 transitions. [2019-11-28 02:59:04,450 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-11-28 02:59:04,450 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:59:04,450 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:59:04,454 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2019-11-28 02:59:04,454 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 02:59:04,454 INFO L794 eck$LassoCheckResult]: Stem: 836#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 837#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 842#L12 assume !(main_~i~0 >= 10); 843#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 857#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 856#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 851#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 848#L12-2 [2019-11-28 02:59:04,454 INFO L796 eck$LassoCheckResult]: Loop: 848#L12-2 assume !(main_~i~0 <= 0); 850#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 849#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 847#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 848#L12-2 [2019-11-28 02:59:04,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:04,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1363918578, now seen corresponding path program 1 times [2019-11-28 02:59:04,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:04,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050183973] [2019-11-28 02:59:04,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:04,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:04,501 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:04,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050183973] [2019-11-28 02:59:04,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:59:04,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:59:04,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448513014] [2019-11-28 02:59:04,503 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 02:59:04,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:04,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1575402, now seen corresponding path program 3 times [2019-11-28 02:59:04,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:04,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519391860] [2019-11-28 02:59:04,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:04,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:04,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:04,517 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:04,553 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:04,553 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:04,553 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:04,554 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:04,554 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:59:04,554 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:04,554 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:04,554 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:04,554 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration7_Loop [2019-11-28 02:59:04,554 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:04,554 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:04,555 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 02:59:04,561 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 02:59:04,563 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 02:59:04,565 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 02:59:04,612 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:04,614 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:04,624 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:04,625 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:59:04,628 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:59:04,628 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=0} Honda state: {ULTIMATE.start_main_~up~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:04,635 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:04,635 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:59:04,638 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:59:04,638 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_9=0} Honda state: {v_rep~unnamed0~0~false_9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:04,645 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:04,646 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:59:04,648 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:59:04,648 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_9=1} Honda state: {v_rep~unnamed0~0~true_9=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:04,655 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:04,655 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:04,672 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:59:04,673 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:04,795 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:59:04,798 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:04,798 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:04,798 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:04,798 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:04,798 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:59:04,798 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:04,798 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:04,798 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:04,798 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration7_Loop [2019-11-28 02:59:04,798 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:04,798 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:04,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 02:59:04,804 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 02:59:04,810 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 02:59:04,812 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 02:59:04,868 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:04,870 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:04,876 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 02:59:04,880 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:04,880 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:04,880 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:04,880 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:04,884 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:59:04,884 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:59:04,896 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 42 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 43 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:04,903 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 02:59:04,906 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:04,906 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:59:04,906 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:04,906 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:04,907 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:04,908 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:59:04,908 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:59:04,910 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 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:04,915 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 02:59:04,916 INFO L338 nArgumentSynthesizer]: Template has degree 0. Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:04,917 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:04,917 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:04,917 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:04,922 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:59:04,922 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:59:04,927 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 45 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 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:04,933 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 02:59:04,934 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:04,934 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:59:04,934 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:04,934 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:04,934 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:04,936 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:59:04,936 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:59:04,943 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:59:04,946 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 02:59:04,947 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 46 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 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:04,951 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:59:04,951 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:59:04,951 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:59:04,951 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-11-28 02:59:04,953 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 02:59:04,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:04,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:04,967 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:59:04,967 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:04,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:04,978 INFO L255 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:59:04,979 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:04,995 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 02:59:04,995 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-28 02:59:04,995 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 39 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-11-28 02:59:05,034 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 39 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 70 states and 94 transitions. Complement of second has 7 states. [2019-11-28 02:59:05,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 02:59:05,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 02:59:05,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-11-28 02:59:05,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 4 letters. [2019-11-28 02:59:05,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:05,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 4 letters. [2019-11-28 02:59:05,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:05,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 8 letters. [2019-11-28 02:59:05,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:05,037 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 94 transitions. [2019-11-28 02:59:05,039 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-11-28 02:59:05,040 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 56 states and 74 transitions. [2019-11-28 02:59:05,040 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-11-28 02:59:05,040 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-11-28 02:59:05,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 74 transitions. [2019-11-28 02:59:05,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:05,041 INFO L688 BuchiCegarLoop]: Abstraction has 56 states and 74 transitions. [2019-11-28 02:59:05,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 74 transitions. [2019-11-28 02:59:05,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 43. [2019-11-28 02:59:05,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-28 02:59:05,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 57 transitions. [2019-11-28 02:59:05,045 INFO L711 BuchiCegarLoop]: Abstraction has 43 states and 57 transitions. [2019-11-28 02:59:05,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:59:05,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:59:05,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:59:05,047 INFO L87 Difference]: Start difference. First operand 43 states and 57 transitions. Second operand 4 states. [2019-11-28 02:59:05,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:59:05,074 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2019-11-28 02:59:05,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:59:05,075 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 68 transitions. [2019-11-28 02:59:05,076 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2019-11-28 02:59:05,076 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 54 states and 66 transitions. [2019-11-28 02:59:05,077 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-11-28 02:59:05,077 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-11-28 02:59:05,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 66 transitions. [2019-11-28 02:59:05,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:05,077 INFO L688 BuchiCegarLoop]: Abstraction has 54 states and 66 transitions. [2019-11-28 02:59:05,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 66 transitions. [2019-11-28 02:59:05,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 46. [2019-11-28 02:59:05,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-28 02:59:05,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2019-11-28 02:59:05,089 INFO L711 BuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2019-11-28 02:59:05,089 INFO L591 BuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2019-11-28 02:59:05,090 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-28 02:59:05,090 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 58 transitions. [2019-11-28 02:59:05,091 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2019-11-28 02:59:05,091 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:59:05,091 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:59:05,092 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 2, 2, 2, 1, 1, 1] [2019-11-28 02:59:05,092 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 02:59:05,092 INFO L794 eck$LassoCheckResult]: Stem: 1092#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 1093#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1112#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 1113#L12-2 assume !(main_~i~0 <= 0); 1103#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 1104#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1098#L12 assume !(main_~i~0 >= 10); 1099#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 1106#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 1094#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1095#L12 assume !(main_~i~0 >= 10); 1100#L12-2 assume !(main_~i~0 <= 0); 1105#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 1096#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1097#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 1107#L12-2 [2019-11-28 02:59:05,093 INFO L796 eck$LassoCheckResult]: Loop: 1107#L12-2 assume !(main_~i~0 <= 0); 1108#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 1129#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1127#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 1107#L12-2 [2019-11-28 02:59:05,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:05,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1385122848, now seen corresponding path program 2 times [2019-11-28 02:59:05,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:05,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382547337] [2019-11-28 02:59:05,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:05,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:05,147 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-28 02:59:05,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382547337] [2019-11-28 02:59:05,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380430186] [2019-11-28 02:59:05,148 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 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:59:05,174 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 02:59:05,174 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:59:05,175 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 02:59:05,175 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:05,179 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-28 02:59:05,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:59:05,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-28 02:59:05,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938847443] [2019-11-28 02:59:05,180 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 02:59:05,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:05,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1575402, now seen corresponding path program 4 times [2019-11-28 02:59:05,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:05,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481888613] [2019-11-28 02:59:05,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:05,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:05,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:05,186 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:05,217 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:05,217 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:05,217 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:05,217 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:05,217 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:59:05,218 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:05,218 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:05,218 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:05,218 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration8_Loop [2019-11-28 02:59:05,218 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:05,218 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:05,220 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 02:59:05,222 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 02:59:05,225 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 02:59:05,230 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 02:59:05,288 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:05,289 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:05,294 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:05,294 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:05,298 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:59:05,298 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_11=0} Honda state: {v_rep~unnamed0~0~false_11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:05,306 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:05,306 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:05,311 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:59:05,311 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_11=1} Honda state: {v_rep~unnamed0~0~true_11=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:05,320 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:05,320 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:05,325 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:59:05,325 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=0} Honda state: {ULTIMATE.start_main_~up~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:05,331 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:05,331 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 51 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 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:05,341 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:59:05,341 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:05,448 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:59:05,449 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:05,449 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:05,450 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:05,450 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:05,450 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:59:05,450 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:05,450 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:05,450 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:05,450 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration8_Loop [2019-11-28 02:59:05,450 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:05,450 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:05,451 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 02:59:05,454 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 02:59:05,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:05,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:05,516 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:05,517 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:05,533 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 02:59:05,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:05,536 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:05,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:05,536 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:05,538 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:59:05,538 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:59:05,541 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Exception during sending of exit command (exit): Broken pipe No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 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 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:05,546 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 02:59:05,547 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:05,548 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:59:05,548 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:05,548 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:05,548 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:05,549 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:59:05,549 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:59:05,550 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 55 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 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:05,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 02:59:05,557 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:05,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:05,558 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:05,558 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:05,560 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:59:05,560 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:59:05,568 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 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:05,577 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 02:59:05,579 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:05,579 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:59:05,579 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:05,579 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:05,579 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:05,581 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:59:05,581 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:05,584 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:59:05,587 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 02:59:05,587 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 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:05,594 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:59:05,594 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:59:05,594 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:59:05,595 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:05,596 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 02:59:05,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:05,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:05,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:59:05,629 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:05,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:05,635 INFO L255 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:59:05,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:05,651 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 02:59:05,652 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-28 02:59:05,652 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 58 transitions. cyclomatic complexity: 17 Second operand 5 states. [2019-11-28 02:59:05,678 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 58 transitions. cyclomatic complexity: 17. Second operand 5 states. Result 64 states and 82 transitions. Complement of second has 7 states. [2019-11-28 02:59:05,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 02:59:05,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 02:59:05,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-11-28 02:59:05,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 15 letters. Loop has 4 letters. [2019-11-28 02:59:05,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:05,681 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:59:05,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:05,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:05,700 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:59:05,701 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:05,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:05,706 INFO L255 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:59:05,707 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:05,726 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 02:59:05,726 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-28 02:59:05,727 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 58 transitions. cyclomatic complexity: 17 Second operand 5 states. [2019-11-28 02:59:05,772 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 58 transitions. cyclomatic complexity: 17. Second operand 5 states. Result 86 states and 103 transitions. Complement of second has 9 states. [2019-11-28 02:59:05,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-28 02:59:05,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 02:59:05,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2019-11-28 02:59:05,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 15 letters. Loop has 4 letters. [2019-11-28 02:59:05,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:05,774 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:59:05,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:05,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:05,792 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:59:05,793 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:05,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:05,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:59:05,799 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:05,814 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 02:59:05,814 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 3 loop predicates [2019-11-28 02:59:05,814 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 58 transitions. cyclomatic complexity: 17 Second operand 5 states. [2019-11-28 02:59:05,845 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 58 transitions. cyclomatic complexity: 17. Second operand 5 states. Result 68 states and 87 transitions. Complement of second has 8 states. [2019-11-28 02:59:05,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 02:59:05,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 02:59:05,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-11-28 02:59:05,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 15 letters. Loop has 4 letters. [2019-11-28 02:59:05,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:05,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 19 letters. Loop has 4 letters. [2019-11-28 02:59:05,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:05,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 15 letters. Loop has 8 letters. [2019-11-28 02:59:05,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:05,850 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 87 transitions. [2019-11-28 02:59:05,851 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2019-11-28 02:59:05,852 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 51 states and 63 transitions. [2019-11-28 02:59:05,852 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-28 02:59:05,852 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-11-28 02:59:05,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 63 transitions. [2019-11-28 02:59:05,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:05,853 INFO L688 BuchiCegarLoop]: Abstraction has 51 states and 63 transitions. [2019-11-28 02:59:05,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 63 transitions. [2019-11-28 02:59:05,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 28. [2019-11-28 02:59:05,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-28 02:59:05,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2019-11-28 02:59:05,855 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-11-28 02:59:05,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:59:05,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:59:05,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:59:05,856 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 4 states. [2019-11-28 02:59:05,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:59:05,883 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2019-11-28 02:59:05,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:59:05,884 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 52 transitions. [2019-11-28 02:59:05,884 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2019-11-28 02:59:05,885 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 40 states and 49 transitions. [2019-11-28 02:59:05,885 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-28 02:59:05,885 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-11-28 02:59:05,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 49 transitions. [2019-11-28 02:59:05,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:05,886 INFO L688 BuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2019-11-28 02:59:05,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 49 transitions. [2019-11-28 02:59:05,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2019-11-28 02:59:05,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-28 02:59:05,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2019-11-28 02:59:05,888 INFO L711 BuchiCegarLoop]: Abstraction has 35 states and 43 transitions. [2019-11-28 02:59:05,888 INFO L591 BuchiCegarLoop]: Abstraction has 35 states and 43 transitions. [2019-11-28 02:59:05,888 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-28 02:59:05,888 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 43 transitions. [2019-11-28 02:59:05,889 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2019-11-28 02:59:05,889 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:59:05,889 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:59:05,890 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1] [2019-11-28 02:59:05,890 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 2, 2, 1, 1] [2019-11-28 02:59:05,890 INFO L794 eck$LassoCheckResult]: Stem: 1689#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 1690#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1691#L12 assume !(main_~i~0 >= 10); 1694#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 1696#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 1697#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1713#L12 assume !(main_~i~0 >= 10); 1716#L12-2 assume !(main_~i~0 <= 0); 1715#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 1712#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1702#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 1685#L12-2 [2019-11-28 02:59:05,890 INFO L796 eck$LassoCheckResult]: Loop: 1685#L12-2 assume !(main_~i~0 <= 0); 1686#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 1698#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1719#L12 assume !(main_~i~0 >= 10); 1706#L12-2 assume !(main_~i~0 <= 0); 1711#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 1709#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1704#L12 assume !(main_~i~0 >= 10); 1707#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 1710#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 1708#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1701#L12 assume !(main_~i~0 >= 10); 1699#L12-2 assume !(main_~i~0 <= 0); 1700#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 1714#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1703#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 1685#L12-2 [2019-11-28 02:59:05,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:05,891 INFO L82 PathProgramCache]: Analyzing trace with hash -912841737, now seen corresponding path program 1 times [2019-11-28 02:59:05,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:05,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855217898] [2019-11-28 02:59:05,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:05,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:05,922 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:05,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855217898] [2019-11-28 02:59:05,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818437285] [2019-11-28 02:59:05,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 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:59:05,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:05,939 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:59:05,940 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:05,942 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:05,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:59:05,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-28 02:59:05,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523487930] [2019-11-28 02:59:05,944 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 02:59:05,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:05,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1697726743, now seen corresponding path program 1 times [2019-11-28 02:59:05,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:05,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146958380] [2019-11-28 02:59:05,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:05,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:05,981 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 02:59:05,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146958380] [2019-11-28 02:59:05,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834835196] [2019-11-28 02:59:05,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:59:05,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:06,000 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:59:06,001 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:06,004 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 02:59:06,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:59:06,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-28 02:59:06,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083827585] [2019-11-28 02:59:06,005 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 02:59:06,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:59:06,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:59:06,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:59:06,006 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. cyclomatic complexity: 11 Second operand 5 states. [2019-11-28 02:59:06,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:59:06,039 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2019-11-28 02:59:06,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:59:06,040 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 57 transitions. [2019-11-28 02:59:06,041 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-11-28 02:59:06,042 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 48 states and 56 transitions. [2019-11-28 02:59:06,042 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-11-28 02:59:06,043 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-11-28 02:59:06,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 56 transitions. [2019-11-28 02:59:06,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:06,044 INFO L688 BuchiCegarLoop]: Abstraction has 48 states and 56 transitions. [2019-11-28 02:59:06,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 56 transitions. [2019-11-28 02:59:06,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 43. [2019-11-28 02:59:06,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-28 02:59:06,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2019-11-28 02:59:06,051 INFO L711 BuchiCegarLoop]: Abstraction has 43 states and 51 transitions. [2019-11-28 02:59:06,051 INFO L591 BuchiCegarLoop]: Abstraction has 43 states and 51 transitions. [2019-11-28 02:59:06,051 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-28 02:59:06,052 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 51 transitions. [2019-11-28 02:59:06,052 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2019-11-28 02:59:06,052 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:59:06,052 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:59:06,054 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 1, 1, 1] [2019-11-28 02:59:06,054 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [5, 4, 4, 3, 2, 1, 1] [2019-11-28 02:59:06,054 INFO L794 eck$LassoCheckResult]: Stem: 1859#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 1860#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1876#L12 assume !(main_~i~0 >= 10); 1877#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 1892#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 1889#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1890#L12 assume !(main_~i~0 >= 10); 1896#L12-2 assume !(main_~i~0 <= 0); 1895#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 1863#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1864#L12 assume !(main_~i~0 >= 10); 1857#L12-2 assume !(main_~i~0 <= 0); 1858#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 1869#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1891#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 1855#L12-2 [2019-11-28 02:59:06,054 INFO L796 eck$LassoCheckResult]: Loop: 1855#L12-2 assume !(main_~i~0 <= 0); 1856#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 1886#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1884#L12 assume !(main_~i~0 >= 10); 1875#L12-2 assume !(main_~i~0 <= 0); 1881#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 1878#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1873#L12 assume !(main_~i~0 >= 10); 1870#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 1871#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 1861#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1862#L12 assume !(main_~i~0 >= 10); 1897#L12-2 assume !(main_~i~0 <= 0); 1867#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 1868#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1865#L12 assume !(main_~i~0 >= 10); 1866#L12-2 assume !(main_~i~0 <= 0); 1872#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 1893#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1894#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 1855#L12-2 [2019-11-28 02:59:06,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:06,055 INFO L82 PathProgramCache]: Analyzing trace with hash 554461792, now seen corresponding path program 2 times [2019-11-28 02:59:06,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:06,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944538509] [2019-11-28 02:59:06,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:06,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Exception during sending of exit command (exit): Broken pipe [2019-11-28 02:59:06,121 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:06,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944538509] [2019-11-28 02:59:06,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578598955] [2019-11-28 02:59:06,122 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 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-11-28 02:59:06,151 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 02:59:06,151 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:59:06,152 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 02:59:06,153 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:06,157 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:06,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:59:06,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-11-28 02:59:06,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157282640] [2019-11-28 02:59:06,158 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 02:59:06,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:06,159 INFO L82 PathProgramCache]: Analyzing trace with hash 104414290, now seen corresponding path program 2 times [2019-11-28 02:59:06,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:06,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270115848] [2019-11-28 02:59:06,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:06,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:06,205 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 24 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 02:59:06,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270115848] [2019-11-28 02:59:06,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316965692] [2019-11-28 02:59:06,206 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 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-11-28 02:59:06,228 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 02:59:06,228 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:59:06,229 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 02:59:06,232 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:06,244 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 24 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 02:59:06,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:59:06,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-11-28 02:59:06,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320529355] [2019-11-28 02:59:06,246 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 02:59:06,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:59:06,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:59:06,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:59:06,247 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. cyclomatic complexity: 11 Second operand 6 states. Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:59:06,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:59:06,278 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2019-11-28 02:59:06,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:59:06,279 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 65 transitions. [2019-11-28 02:59:06,280 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2019-11-28 02:59:06,280 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 56 states and 64 transitions. [2019-11-28 02:59:06,280 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-11-28 02:59:06,281 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-11-28 02:59:06,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 64 transitions. [2019-11-28 02:59:06,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:06,281 INFO L688 BuchiCegarLoop]: Abstraction has 56 states and 64 transitions. [2019-11-28 02:59:06,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 64 transitions. [2019-11-28 02:59:06,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2019-11-28 02:59:06,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-28 02:59:06,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2019-11-28 02:59:06,283 INFO L711 BuchiCegarLoop]: Abstraction has 51 states and 59 transitions. [2019-11-28 02:59:06,283 INFO L591 BuchiCegarLoop]: Abstraction has 51 states and 59 transitions. [2019-11-28 02:59:06,284 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-28 02:59:06,284 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 59 transitions. [2019-11-28 02:59:06,284 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-11-28 02:59:06,284 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:59:06,284 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:59:06,285 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 3, 1, 1, 1] [2019-11-28 02:59:06,285 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 5, 4, 2, 1, 1] [2019-11-28 02:59:06,285 INFO L794 eck$LassoCheckResult]: Stem: 2071#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 2072#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2085#L12 assume !(main_~i~0 >= 10); 2086#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 2101#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2098#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2099#L12 assume !(main_~i~0 >= 10); 2106#L12-2 assume !(main_~i~0 <= 0); 2107#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2111#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2109#L12 assume !(main_~i~0 >= 10); 2110#L12-2 assume !(main_~i~0 <= 0); 2079#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2075#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2076#L12 assume !(main_~i~0 >= 10); 2069#L12-2 assume !(main_~i~0 <= 0); 2070#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2102#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2100#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 2067#L12-2 [2019-11-28 02:59:06,286 INFO L796 eck$LassoCheckResult]: Loop: 2067#L12-2 assume !(main_~i~0 <= 0); 2068#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 2095#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2093#L12 assume !(main_~i~0 >= 10); 2084#L12-2 assume !(main_~i~0 <= 0); 2090#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 2087#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2082#L12 assume !(main_~i~0 >= 10); 2080#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 2078#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2073#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2074#L12 assume !(main_~i~0 >= 10); 2077#L12-2 assume !(main_~i~0 <= 0); 2081#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2117#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2116#L12 assume !(main_~i~0 >= 10); 2115#L12-2 assume !(main_~i~0 <= 0); 2114#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2113#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2112#L12 assume !(main_~i~0 >= 10); 2108#L12-2 assume !(main_~i~0 <= 0); 2105#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2103#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2104#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 2067#L12-2 [2019-11-28 02:59:06,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:06,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1774824375, now seen corresponding path program 3 times [2019-11-28 02:59:06,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:06,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845518595] [2019-11-28 02:59:06,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:06,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:06,318 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:06,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845518595] [2019-11-28 02:59:06,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037378591] [2019-11-28 02:59:06,319 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 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:59:06,338 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-28 02:59:06,338 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:59:06,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 02:59:06,340 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:06,347 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:06,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:59:06,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-11-28 02:59:06,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367304967] [2019-11-28 02:59:06,348 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 02:59:06,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:06,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1813717701, now seen corresponding path program 3 times [2019-11-28 02:59:06,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:06,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018192157] [2019-11-28 02:59:06,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:06,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:06,388 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 33 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 02:59:06,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018192157] [2019-11-28 02:59:06,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950002512] [2019-11-28 02:59:06,388 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 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:59:06,409 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-28 02:59:06,409 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:59:06,410 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 02:59:06,411 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:06,415 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 33 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 02:59:06,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:59:06,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-11-28 02:59:06,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498686091] [2019-11-28 02:59:06,416 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 02:59:06,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:59:06,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:59:06,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:59:06,417 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. cyclomatic complexity: 11 Second operand 7 states. [2019-11-28 02:59:06,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:59:06,484 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2019-11-28 02:59:06,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 02:59:06,485 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 73 transitions. [2019-11-28 02:59:06,486 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 31 [2019-11-28 02:59:06,486 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 64 states and 72 transitions. [2019-11-28 02:59:06,486 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-11-28 02:59:06,487 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-11-28 02:59:06,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 72 transitions. [2019-11-28 02:59:06,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:06,487 INFO L688 BuchiCegarLoop]: Abstraction has 64 states and 72 transitions. [2019-11-28 02:59:06,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 72 transitions. [2019-11-28 02:59:06,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 59. [2019-11-28 02:59:06,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-28 02:59:06,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2019-11-28 02:59:06,490 INFO L711 BuchiCegarLoop]: Abstraction has 59 states and 67 transitions. [2019-11-28 02:59:06,490 INFO L591 BuchiCegarLoop]: Abstraction has 59 states and 67 transitions. [2019-11-28 02:59:06,490 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-28 02:59:06,490 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 67 transitions. [2019-11-28 02:59:06,491 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2019-11-28 02:59:06,491 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:59:06,491 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:59:06,492 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 4, 1, 1, 1] [2019-11-28 02:59:06,492 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [7, 6, 6, 5, 2, 1, 1] [2019-11-28 02:59:06,492 INFO L794 eck$LassoCheckResult]: Stem: 2325#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 2326#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2337#L12 assume !(main_~i~0 >= 10); 2338#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 2356#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2353#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2354#L12 assume !(main_~i~0 >= 10); 2379#L12-2 assume !(main_~i~0 <= 0); 2378#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2329#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2330#L12 assume !(main_~i~0 >= 10); 2323#L12-2 assume !(main_~i~0 <= 0); 2324#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2334#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2377#L12 assume !(main_~i~0 >= 10); 2376#L12-2 assume !(main_~i~0 <= 0); 2375#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2374#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2358#L12 assume !(main_~i~0 >= 10); 2363#L12-2 assume !(main_~i~0 <= 0); 2361#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2357#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2355#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 2321#L12-2 [2019-11-28 02:59:06,493 INFO L796 eck$LassoCheckResult]: Loop: 2321#L12-2 assume !(main_~i~0 <= 0); 2322#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 2351#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2349#L12 assume !(main_~i~0 >= 10); 2341#L12-2 assume !(main_~i~0 <= 0); 2346#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 2344#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2339#L12 assume !(main_~i~0 >= 10); 2335#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 2336#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2327#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2328#L12 assume !(main_~i~0 >= 10); 2331#L12-2 assume !(main_~i~0 <= 0); 2332#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2333#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2373#L12 assume !(main_~i~0 >= 10); 2372#L12-2 assume !(main_~i~0 <= 0); 2371#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2370#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2369#L12 assume !(main_~i~0 >= 10); 2368#L12-2 assume !(main_~i~0 <= 0); 2367#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2366#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2365#L12 assume !(main_~i~0 >= 10); 2364#L12-2 assume !(main_~i~0 <= 0); 2362#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2359#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2360#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 2321#L12-2 [2019-11-28 02:59:06,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:06,493 INFO L82 PathProgramCache]: Analyzing trace with hash 790045106, now seen corresponding path program 4 times [2019-11-28 02:59:06,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:06,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958732732] [2019-11-28 02:59:06,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:06,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:06,528 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 14 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:06,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958732732] [2019-11-28 02:59:06,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107448252] [2019-11-28 02:59:06,529 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 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:59:06,553 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 02:59:06,554 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:59:06,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 02:59:06,556 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:06,561 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 14 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:06,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:59:06,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-11-28 02:59:06,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483943350] [2019-11-28 02:59:06,563 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 02:59:06,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:06,563 INFO L82 PathProgramCache]: Analyzing trace with hash 798220708, now seen corresponding path program 4 times [2019-11-28 02:59:06,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:06,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857762848] [2019-11-28 02:59:06,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:06,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:06,612 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 42 proven. 36 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 02:59:06,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857762848] [2019-11-28 02:59:06,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41843139] [2019-11-28 02:59:06,613 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 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-11-28 02:59:06,644 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 02:59:06,644 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:59:06,645 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 02:59:06,646 INFO L278 TraceCheckSpWp]: Computing forward predicates... Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:59:06,653 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 42 proven. 36 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 02:59:06,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:59:06,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-11-28 02:59:06,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76440148] [2019-11-28 02:59:06,654 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 02:59:06,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:59:06,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 02:59:06,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:59:06,655 INFO L87 Difference]: Start difference. First operand 59 states and 67 transitions. cyclomatic complexity: 11 Second operand 8 states. [2019-11-28 02:59:06,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:59:06,705 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2019-11-28 02:59:06,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 02:59:06,705 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 81 transitions. [2019-11-28 02:59:06,706 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2019-11-28 02:59:06,706 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 72 states and 80 transitions. [2019-11-28 02:59:06,707 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2019-11-28 02:59:06,707 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2019-11-28 02:59:06,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 80 transitions. [2019-11-28 02:59:06,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:06,707 INFO L688 BuchiCegarLoop]: Abstraction has 72 states and 80 transitions. [2019-11-28 02:59:06,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 80 transitions. [2019-11-28 02:59:06,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 67. [2019-11-28 02:59:06,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-28 02:59:06,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2019-11-28 02:59:06,711 INFO L711 BuchiCegarLoop]: Abstraction has 67 states and 75 transitions. [2019-11-28 02:59:06,711 INFO L591 BuchiCegarLoop]: Abstraction has 67 states and 75 transitions. [2019-11-28 02:59:06,711 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-28 02:59:06,711 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 75 transitions. [2019-11-28 02:59:06,711 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2019-11-28 02:59:06,712 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:59:06,712 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:59:06,713 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [7, 6, 6, 5, 1, 1, 1] [2019-11-28 02:59:06,713 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [8, 7, 7, 6, 2, 1, 1] [2019-11-28 02:59:06,713 INFO L794 eck$LassoCheckResult]: Stem: 2621#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 2622#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2633#L12 assume !(main_~i~0 >= 10); 2634#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 2651#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2649#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2628#L12 assume !(main_~i~0 >= 10); 2619#L12-2 assume !(main_~i~0 <= 0); 2620#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2625#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2626#L12 assume !(main_~i~0 >= 10); 2683#L12-2 assume !(main_~i~0 <= 0); 2682#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2681#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2680#L12 assume !(main_~i~0 >= 10); 2679#L12-2 assume !(main_~i~0 <= 0); 2678#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2677#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2676#L12 assume !(main_~i~0 >= 10); 2675#L12-2 assume !(main_~i~0 <= 0); 2674#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2673#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2653#L12 assume !(main_~i~0 >= 10); 2658#L12-2 assume !(main_~i~0 <= 0); 2656#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2652#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2650#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 2617#L12-2 [2019-11-28 02:59:06,713 INFO L796 eck$LassoCheckResult]: Loop: 2617#L12-2 assume !(main_~i~0 <= 0); 2618#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 2647#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2645#L12 assume !(main_~i~0 >= 10); 2637#L12-2 assume !(main_~i~0 <= 0); 2642#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 2640#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2635#L12 assume !(main_~i~0 >= 10); 2631#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 2632#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2623#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2624#L12 assume !(main_~i~0 >= 10); 2627#L12-2 assume !(main_~i~0 <= 0); 2629#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2630#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2672#L12 assume !(main_~i~0 >= 10); 2671#L12-2 assume !(main_~i~0 <= 0); 2670#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2669#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2668#L12 assume !(main_~i~0 >= 10); 2667#L12-2 assume !(main_~i~0 <= 0); 2666#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2665#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2664#L12 assume !(main_~i~0 >= 10); 2663#L12-2 assume !(main_~i~0 <= 0); 2662#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2661#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2660#L12 assume !(main_~i~0 >= 10); 2659#L12-2 assume !(main_~i~0 <= 0); 2657#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2654#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2655#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 2617#L12-2 [2019-11-28 02:59:06,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:06,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1500441957, now seen corresponding path program 5 times [2019-11-28 02:59:06,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:06,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790099515] [2019-11-28 02:59:06,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:06,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:06,768 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 17 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:06,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790099515] [2019-11-28 02:59:06,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579588899] [2019-11-28 02:59:06,768 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 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:59:06,791 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-11-28 02:59:06,792 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:59:06,792 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 02:59:06,793 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:06,799 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 17 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:06,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:59:06,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-11-28 02:59:06,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979800345] [2019-11-28 02:59:06,800 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 02:59:06,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:06,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1712813683, now seen corresponding path program 5 times [2019-11-28 02:59:06,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:06,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666864428] [2019-11-28 02:59:06,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:06,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:06,862 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 51 proven. 55 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 02:59:06,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666864428] [2019-11-28 02:59:06,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014362217] [2019-11-28 02:59:06,863 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 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:59:06,891 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-11-28 02:59:06,891 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:59:06,891 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 02:59:06,893 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:06,899 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 51 proven. 55 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 02:59:06,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:59:06,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-11-28 02:59:06,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574209453] [2019-11-28 02:59:06,900 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 02:59:06,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:59:06,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 02:59:06,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:59:06,901 INFO L87 Difference]: Start difference. First operand 67 states and 75 transitions. cyclomatic complexity: 11 Second operand 9 states. [2019-11-28 02:59:06,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:59:06,983 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2019-11-28 02:59:06,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 02:59:06,983 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 89 transitions. [2019-11-28 02:59:06,984 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 39 [2019-11-28 02:59:06,985 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 80 states and 88 transitions. [2019-11-28 02:59:06,985 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2019-11-28 02:59:06,985 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2019-11-28 02:59:06,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 88 transitions. [2019-11-28 02:59:06,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:06,985 INFO L688 BuchiCegarLoop]: Abstraction has 80 states and 88 transitions. [2019-11-28 02:59:06,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states and 88 transitions. [2019-11-28 02:59:06,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 75. [2019-11-28 02:59:06,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-28 02:59:06,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2019-11-28 02:59:06,987 INFO L711 BuchiCegarLoop]: Abstraction has 75 states and 83 transitions. [2019-11-28 02:59:06,987 INFO L591 BuchiCegarLoop]: Abstraction has 75 states and 83 transitions. [2019-11-28 02:59:06,988 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-11-28 02:59:06,988 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 83 transitions. [2019-11-28 02:59:06,988 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 37 [2019-11-28 02:59:06,988 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:59:06,988 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:59:06,990 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 7, 7, 6, 1, 1, 1] [2019-11-28 02:59:06,990 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [9, 8, 8, 7, 2, 1, 1] [2019-11-28 02:59:06,990 INFO L794 eck$LassoCheckResult]: Stem: 2959#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 2960#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2975#L12 assume !(main_~i~0 >= 10); 2976#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 2991#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2988#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2989#L12 assume !(main_~i~0 >= 10); 3029#L12-2 assume !(main_~i~0 <= 0); 3028#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2963#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2964#L12 assume !(main_~i~0 >= 10); 2957#L12-2 assume !(main_~i~0 <= 0); 2958#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2968#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3027#L12 assume !(main_~i~0 >= 10); 3026#L12-2 assume !(main_~i~0 <= 0); 3025#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3024#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3023#L12 assume !(main_~i~0 >= 10); 3022#L12-2 assume !(main_~i~0 <= 0); 3021#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3020#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3019#L12 assume !(main_~i~0 >= 10); 3018#L12-2 assume !(main_~i~0 <= 0); 3017#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3016#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2995#L12 assume !(main_~i~0 >= 10); 2999#L12-2 assume !(main_~i~0 <= 0); 2997#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2994#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2990#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 2955#L12-2 [2019-11-28 02:59:06,990 INFO L796 eck$LassoCheckResult]: Loop: 2955#L12-2 assume !(main_~i~0 <= 0); 2956#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 2985#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2983#L12 assume !(main_~i~0 >= 10); 2974#L12-2 assume !(main_~i~0 <= 0); 2980#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 2977#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2972#L12 assume !(main_~i~0 >= 10); 2969#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 2966#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2967#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3015#L12 assume !(main_~i~0 >= 10); 2970#L12-2 assume !(main_~i~0 <= 0); 2971#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2961#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2962#L12 assume !(main_~i~0 >= 10); 2965#L12-2 assume !(main_~i~0 <= 0); 3014#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3013#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3012#L12 assume !(main_~i~0 >= 10); 3011#L12-2 assume !(main_~i~0 <= 0); 3010#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3009#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3008#L12 assume !(main_~i~0 >= 10); 3007#L12-2 assume !(main_~i~0 <= 0); 3006#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3005#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3004#L12 assume !(main_~i~0 >= 10); 3003#L12-2 assume !(main_~i~0 <= 0); 3002#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3001#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3000#L12 assume !(main_~i~0 >= 10); 2998#L12-2 assume !(main_~i~0 <= 0); 2996#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2992#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2993#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 2955#L12-2 [2019-11-28 02:59:06,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:06,990 INFO L82 PathProgramCache]: Analyzing trace with hash -60397820, now seen corresponding path program 6 times [2019-11-28 02:59:06,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:06,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734438131] [2019-11-28 02:59:06,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:06,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:07,048 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 20 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:07,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734438131] [2019-11-28 02:59:07,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060086973] [2019-11-28 02:59:07,049 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 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:59:07,073 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-11-28 02:59:07,073 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:59:07,074 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 02:59:07,075 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:07,081 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 20 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:07,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:59:07,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-11-28 02:59:07,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182234109] [2019-11-28 02:59:07,082 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 02:59:07,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:07,083 INFO L82 PathProgramCache]: Analyzing trace with hash -127593226, now seen corresponding path program 6 times [2019-11-28 02:59:07,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:07,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110370241] [2019-11-28 02:59:07,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:07,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:07,144 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 60 proven. 78 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 02:59:07,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110370241] [2019-11-28 02:59:07,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517028397] [2019-11-28 02:59:07,145 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 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:59:07,174 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-11-28 02:59:07,175 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:59:07,175 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 02:59:07,177 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:07,185 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 60 proven. 78 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 02:59:07,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:59:07,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-11-28 02:59:07,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70250537] [2019-11-28 02:59:07,186 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 02:59:07,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:59:07,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 02:59:07,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:59:07,187 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. cyclomatic complexity: 11 Second operand 10 states. [2019-11-28 02:59:07,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:59:07,251 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2019-11-28 02:59:07,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 02:59:07,252 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 97 transitions. [2019-11-28 02:59:07,253 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2019-11-28 02:59:07,254 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 88 states and 96 transitions. [2019-11-28 02:59:07,254 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2019-11-28 02:59:07,254 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2019-11-28 02:59:07,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 88 states and 96 transitions. [2019-11-28 02:59:07,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:07,255 INFO L688 BuchiCegarLoop]: Abstraction has 88 states and 96 transitions. [2019-11-28 02:59:07,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states and 96 transitions. [2019-11-28 02:59:07,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 83. [2019-11-28 02:59:07,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-28 02:59:07,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2019-11-28 02:59:07,257 INFO L711 BuchiCegarLoop]: Abstraction has 83 states and 91 transitions. [2019-11-28 02:59:07,258 INFO L591 BuchiCegarLoop]: Abstraction has 83 states and 91 transitions. [2019-11-28 02:59:07,258 INFO L424 BuchiCegarLoop]: ======== Iteration 15============ [2019-11-28 02:59:07,258 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 91 transitions. [2019-11-28 02:59:07,259 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 41 [2019-11-28 02:59:07,259 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:59:07,259 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:59:07,260 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [9, 8, 8, 7, 1, 1, 1] [2019-11-28 02:59:07,260 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [10, 9, 9, 8, 2, 1, 1] [2019-11-28 02:59:07,261 INFO L794 eck$LassoCheckResult]: Stem: 3339#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 3340#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3352#L12 assume !(main_~i~0 >= 10); 3353#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 3371#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3368#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3369#L12 assume !(main_~i~0 >= 10); 3417#L12-2 assume !(main_~i~0 <= 0); 3416#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3343#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3344#L12 assume !(main_~i~0 >= 10); 3337#L12-2 assume !(main_~i~0 <= 0); 3338#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3348#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3415#L12 assume !(main_~i~0 >= 10); 3414#L12-2 assume !(main_~i~0 <= 0); 3413#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3412#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3411#L12 assume !(main_~i~0 >= 10); 3410#L12-2 assume !(main_~i~0 <= 0); 3409#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3408#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3407#L12 assume !(main_~i~0 >= 10); 3406#L12-2 assume !(main_~i~0 <= 0); 3405#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3404#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3403#L12 assume !(main_~i~0 >= 10); 3402#L12-2 assume !(main_~i~0 <= 0); 3401#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3400#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3375#L12 assume !(main_~i~0 >= 10); 3379#L12-2 assume !(main_~i~0 <= 0); 3377#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3374#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3370#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 3335#L12-2 [2019-11-28 02:59:07,261 INFO L796 eck$LassoCheckResult]: Loop: 3335#L12-2 assume !(main_~i~0 <= 0); 3336#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 3366#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3364#L12 assume !(main_~i~0 >= 10); 3356#L12-2 assume !(main_~i~0 <= 0); 3361#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 3359#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3354#L12 assume !(main_~i~0 >= 10); 3349#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 3346#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3347#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3399#L12 assume !(main_~i~0 >= 10); 3350#L12-2 assume !(main_~i~0 <= 0); 3351#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3341#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3342#L12 assume !(main_~i~0 >= 10); 3345#L12-2 assume !(main_~i~0 <= 0); 3398#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3397#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3396#L12 assume !(main_~i~0 >= 10); 3395#L12-2 assume !(main_~i~0 <= 0); 3394#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3393#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3392#L12 assume !(main_~i~0 >= 10); 3391#L12-2 assume !(main_~i~0 <= 0); 3390#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3389#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3388#L12 assume !(main_~i~0 >= 10); 3387#L12-2 assume !(main_~i~0 <= 0); 3386#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3385#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3384#L12 assume !(main_~i~0 >= 10); 3383#L12-2 assume !(main_~i~0 <= 0); 3382#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3381#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3380#L12 assume !(main_~i~0 >= 10); 3378#L12-2 assume !(main_~i~0 <= 0); 3376#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3372#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3373#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 3335#L12-2 [2019-11-28 02:59:07,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:07,261 INFO L82 PathProgramCache]: Analyzing trace with hash 87645933, now seen corresponding path program 7 times [2019-11-28 02:59:07,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:07,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821291763] [2019-11-28 02:59:07,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:07,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:07,326 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 23 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:07,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821291763] [2019-11-28 02:59:07,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582976791] [2019-11-28 02:59:07,327 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 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:59:07,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:07,349 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 02:59:07,350 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:07,361 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 23 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:07,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:59:07,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-11-28 02:59:07,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637075312] [2019-11-28 02:59:07,363 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 02:59:07,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:07,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1701561311, now seen corresponding path program 7 times [2019-11-28 02:59:07,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:07,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627278380] [2019-11-28 02:59:07,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:07,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:07,442 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 69 proven. 105 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 02:59:07,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627278380] [2019-11-28 02:59:07,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360317282] [2019-11-28 02:59:07,443 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 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:59:07,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:07,468 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 02:59:07,469 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:07,476 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 69 proven. 105 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 02:59:07,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:59:07,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-11-28 02:59:07,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279338188] [2019-11-28 02:59:07,477 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 02:59:07,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:59:07,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 02:59:07,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-11-28 02:59:07,478 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. cyclomatic complexity: 11 Second operand 11 states. [2019-11-28 02:59:07,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:59:07,577 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2019-11-28 02:59:07,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 02:59:07,577 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 97 states and 105 transitions. [2019-11-28 02:59:07,578 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2019-11-28 02:59:07,579 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 97 states to 96 states and 104 transitions. [2019-11-28 02:59:07,579 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2019-11-28 02:59:07,579 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2019-11-28 02:59:07,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 96 states and 104 transitions. [2019-11-28 02:59:07,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:07,580 INFO L688 BuchiCegarLoop]: Abstraction has 96 states and 104 transitions. [2019-11-28 02:59:07,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states and 104 transitions. [2019-11-28 02:59:07,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 91. [2019-11-28 02:59:07,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-28 02:59:07,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2019-11-28 02:59:07,582 INFO L711 BuchiCegarLoop]: Abstraction has 91 states and 99 transitions. [2019-11-28 02:59:07,582 INFO L591 BuchiCegarLoop]: Abstraction has 91 states and 99 transitions. [2019-11-28 02:59:07,582 INFO L424 BuchiCegarLoop]: ======== Iteration 16============ [2019-11-28 02:59:07,583 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 99 transitions. [2019-11-28 02:59:07,584 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 45 [2019-11-28 02:59:07,584 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:59:07,584 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:59:07,585 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 9, 8, 1, 1, 1] [2019-11-28 02:59:07,585 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [11, 10, 10, 9, 2, 1, 1] [2019-11-28 02:59:07,585 INFO L794 eck$LassoCheckResult]: Stem: 3761#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 3762#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3776#L12 assume !(main_~i~0 >= 10); 3777#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 3791#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3789#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3768#L12 assume !(main_~i~0 >= 10); 3759#L12-2 assume !(main_~i~0 <= 0); 3760#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3765#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3766#L12 assume !(main_~i~0 >= 10); 3847#L12-2 assume !(main_~i~0 <= 0); 3846#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3845#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3844#L12 assume !(main_~i~0 >= 10); 3843#L12-2 assume !(main_~i~0 <= 0); 3842#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3841#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3840#L12 assume !(main_~i~0 >= 10); 3839#L12-2 assume !(main_~i~0 <= 0); 3838#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3837#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3836#L12 assume !(main_~i~0 >= 10); 3835#L12-2 assume !(main_~i~0 <= 0); 3834#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3833#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3832#L12 assume !(main_~i~0 >= 10); 3831#L12-2 assume !(main_~i~0 <= 0); 3830#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3829#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3828#L12 assume !(main_~i~0 >= 10); 3827#L12-2 assume !(main_~i~0 <= 0); 3826#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3825#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3793#L12 assume !(main_~i~0 >= 10); 3798#L12-2 assume !(main_~i~0 <= 0); 3796#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3792#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3790#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 3757#L12-2 [2019-11-28 02:59:07,586 INFO L796 eck$LassoCheckResult]: Loop: 3757#L12-2 assume !(main_~i~0 <= 0); 3758#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 3786#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3784#L12 assume !(main_~i~0 >= 10); 3775#L12-2 assume !(main_~i~0 <= 0); 3781#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 3778#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3773#L12 assume !(main_~i~0 >= 10); 3771#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 3772#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3763#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3764#L12 assume !(main_~i~0 >= 10); 3767#L12-2 assume !(main_~i~0 <= 0); 3769#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3770#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3824#L12 assume !(main_~i~0 >= 10); 3823#L12-2 assume !(main_~i~0 <= 0); 3822#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3821#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3820#L12 assume !(main_~i~0 >= 10); 3819#L12-2 assume !(main_~i~0 <= 0); 3818#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3817#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3816#L12 assume !(main_~i~0 >= 10); 3815#L12-2 assume !(main_~i~0 <= 0); 3814#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3813#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3812#L12 assume !(main_~i~0 >= 10); 3811#L12-2 assume !(main_~i~0 <= 0); 3810#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3809#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3808#L12 assume !(main_~i~0 >= 10); 3807#L12-2 assume !(main_~i~0 <= 0); 3806#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3805#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3804#L12 assume !(main_~i~0 >= 10); 3803#L12-2 assume !(main_~i~0 <= 0); 3802#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3801#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3800#L12 assume !(main_~i~0 >= 10); 3799#L12-2 assume !(main_~i~0 <= 0); 3797#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3794#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3795#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 3757#L12-2 [2019-11-28 02:59:07,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:07,586 INFO L82 PathProgramCache]: Analyzing trace with hash -91473322, now seen corresponding path program 8 times [2019-11-28 02:59:07,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:07,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200685994] [2019-11-28 02:59:07,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:07,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:07,672 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 26 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:07,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200685994] [2019-11-28 02:59:07,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719187308] [2019-11-28 02:59:07,672 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 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-11-28 02:59:07,703 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 02:59:07,703 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:59:07,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 02:59:07,705 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:07,712 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 26 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:07,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:59:07,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2019-11-28 02:59:07,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958646214] [2019-11-28 02:59:07,714 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 02:59:07,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:07,714 INFO L82 PathProgramCache]: Analyzing trace with hash -2143365560, now seen corresponding path program 8 times [2019-11-28 02:59:07,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:07,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515037968] [2019-11-28 02:59:07,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:07,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:07,808 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 78 proven. 136 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 02:59:07,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515037968] [2019-11-28 02:59:07,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691272285] [2019-11-28 02:59:07,809 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 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:59:07,834 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 02:59:07,835 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:59:07,835 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 02:59:07,836 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:07,844 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 78 proven. 136 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 02:59:07,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:59:07,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2019-11-28 02:59:07,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771132137] [2019-11-28 02:59:07,846 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 02:59:07,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:59:07,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 02:59:07,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-11-28 02:59:07,847 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. cyclomatic complexity: 11 Second operand 12 states. [2019-11-28 02:59:07,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:59:07,995 INFO L93 Difference]: Finished difference Result 194 states and 215 transitions. [2019-11-28 02:59:08,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 02:59:08,000 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 194 states and 215 transitions. [2019-11-28 02:59:08,002 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2019-11-28 02:59:08,003 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 194 states to 190 states and 211 transitions. [2019-11-28 02:59:08,003 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 74 [2019-11-28 02:59:08,004 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 145 [2019-11-28 02:59:08,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 190 states and 211 transitions. [2019-11-28 02:59:08,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:08,004 INFO L688 BuchiCegarLoop]: Abstraction has 190 states and 211 transitions. [2019-11-28 02:59:08,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states and 211 transitions. [2019-11-28 02:59:08,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 163. [2019-11-28 02:59:08,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-28 02:59:08,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 184 transitions. [2019-11-28 02:59:08,008 INFO L711 BuchiCegarLoop]: Abstraction has 163 states and 184 transitions. [2019-11-28 02:59:08,008 INFO L591 BuchiCegarLoop]: Abstraction has 163 states and 184 transitions. [2019-11-28 02:59:08,008 INFO L424 BuchiCegarLoop]: ======== Iteration 17============ [2019-11-28 02:59:08,009 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 163 states and 184 transitions. [2019-11-28 02:59:08,010 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2019-11-28 02:59:08,010 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:59:08,010 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:59:08,011 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2019-11-28 02:59:08,011 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [12, 11, 11, 10, 2, 1, 1] [2019-11-28 02:59:08,012 INFO L794 eck$LassoCheckResult]: Stem: 4314#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 4315#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4317#L12 assume !(main_~i~0 >= 10); 4409#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 4408#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4407#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4322#L12 assume !(main_~i~0 >= 10); 4323#L12-2 assume !(main_~i~0 <= 0); 4406#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4318#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4319#L12 assume !(main_~i~0 >= 10); 4312#L12-2 assume !(main_~i~0 <= 0); 4313#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4328#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4405#L12 assume !(main_~i~0 >= 10); 4404#L12-2 assume !(main_~i~0 <= 0); 4403#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4402#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4401#L12 assume !(main_~i~0 >= 10); 4400#L12-2 assume !(main_~i~0 <= 0); 4399#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4398#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4397#L12 assume !(main_~i~0 >= 10); 4396#L12-2 assume !(main_~i~0 <= 0); 4395#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4394#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4393#L12 assume !(main_~i~0 >= 10); 4392#L12-2 assume !(main_~i~0 <= 0); 4391#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4390#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4389#L12 assume !(main_~i~0 >= 10); 4388#L12-2 assume !(main_~i~0 <= 0); 4387#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4386#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4385#L12 assume !(main_~i~0 >= 10); 4384#L12-2 assume !(main_~i~0 <= 0); 4383#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4382#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4339#L12 assume !(main_~i~0 >= 10); 4343#L12-2 assume !(main_~i~0 <= 0); 4341#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4338#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4332#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 4331#L12-2 [2019-11-28 02:59:08,012 INFO L796 eck$LassoCheckResult]: Loop: 4331#L12-2 assume !(main_~i~0 <= 0); 4326#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 4327#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4333#L12 assume !(main_~i~0 >= 10); 4335#L12-2 assume !(main_~i~0 <= 0); 4472#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 4411#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4412#L12 assume !(main_~i~0 >= 10); 4379#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 4378#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4377#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4376#L12 assume !(main_~i~0 >= 10); 4375#L12-2 assume !(main_~i~0 <= 0); 4374#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4373#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4372#L12 assume !(main_~i~0 >= 10); 4371#L12-2 assume !(main_~i~0 <= 0); 4370#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4369#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4368#L12 assume !(main_~i~0 >= 10); 4367#L12-2 assume !(main_~i~0 <= 0); 4366#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4365#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4364#L12 assume !(main_~i~0 >= 10); 4363#L12-2 assume !(main_~i~0 <= 0); 4362#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4361#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4360#L12 assume !(main_~i~0 >= 10); 4359#L12-2 assume !(main_~i~0 <= 0); 4358#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4357#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4356#L12 assume !(main_~i~0 >= 10); 4355#L12-2 assume !(main_~i~0 <= 0); 4354#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4353#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4352#L12 assume !(main_~i~0 >= 10); 4351#L12-2 assume !(main_~i~0 <= 0); 4350#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4349#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4348#L12 assume !(main_~i~0 >= 10); 4347#L12-2 assume !(main_~i~0 <= 0); 4346#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4345#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4344#L12 assume !(main_~i~0 >= 10); 4342#L12-2 assume !(main_~i~0 <= 0); 4340#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4336#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4337#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 4331#L12-2 [2019-11-28 02:59:08,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:08,012 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 9 times [2019-11-28 02:59:08,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:08,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070138305] [2019-11-28 02:59:08,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:08,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:08,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:08,026 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:08,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:08,027 INFO L82 PathProgramCache]: Analyzing trace with hash -50295759, now seen corresponding path program 9 times [2019-11-28 02:59:08,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:08,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874018504] [2019-11-28 02:59:08,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:08,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:08,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:08,040 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:08,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:08,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1470164625, now seen corresponding path program 3 times [2019-11-28 02:59:08,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:08,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485218849] [2019-11-28 02:59:08,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:08,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:08,103 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 591 proven. 6 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2019-11-28 02:59:08,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485218849] [2019-11-28 02:59:08,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485941371] [2019-11-28 02:59:08,104 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 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:59:08,139 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-11-28 02:59:08,139 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:59:08,140 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-28 02:59:08,142 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:08,217 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 752 proven. 10 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-11-28 02:59:08,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:59:08,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 13] total 13 [2019-11-28 02:59:08,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090787289] [2019-11-28 02:59:08,487 WARN L192 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 52 [2019-11-28 02:59:08,500 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:08,501 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:08,501 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:08,501 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:08,501 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:59:08,501 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:08,502 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:08,502 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:08,502 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration17_Loop [2019-11-28 02:59:08,502 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:08,502 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:08,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:08,509 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 02:59:08,513 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 02:59:08,518 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 02:59:08,596 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:08,596 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 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 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:08,617 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:08,617 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:59:08,620 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:59:08,620 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_13=1} Honda state: {v_rep~unnamed0~0~true_13=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 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 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:08,625 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:08,625 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:59:08,628 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:59:08,628 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_13=0} Honda state: {v_rep~unnamed0~0~false_13=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 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 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:08,633 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:08,633 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 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 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:08,641 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:59:08,641 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:59:08,648 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:59:08,650 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:08,650 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:08,650 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:08,650 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:08,650 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:59:08,650 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:08,650 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:08,650 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:08,650 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration17_Loop [2019-11-28 02:59:08,651 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:08,651 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:08,652 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 02:59:08,654 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 02:59:08,655 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 02:59:08,663 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 02:59:08,715 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:08,715 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:08,726 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 02:59:08,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:08,728 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:08,728 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:08,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:08,730 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:59:08,730 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:08,735 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 80 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 80 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:08,740 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 02:59:08,741 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:08,741 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:08,742 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:08,742 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:08,743 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:59:08,743 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:59:08,752 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 81 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:08,764 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 Waiting until toolchain timeout for monitored process 81 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:08,765 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:08,766 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:59:08,766 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:08,766 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:08,766 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:08,767 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:59:08,767 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:59:08,769 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:59:08,770 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 02:59:08,770 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 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:08,775 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:59:08,775 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:59:08,775 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:59:08,775 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 6 Supporting invariants [] Waiting until toolchain timeout for monitored process 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:08,780 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 02:59:08,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:08,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:08,803 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:59:08,803 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:08,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:08,816 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 02:59:08,817 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:08,840 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-11-28 02:59:08,841 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-11-28 02:59:08,841 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 163 states and 184 transitions. cyclomatic complexity: 24 Second operand 6 states. [2019-11-28 02:59:08,958 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 163 states and 184 transitions. cyclomatic complexity: 24. Second operand 6 states. Result 473 states and 516 transitions. Complement of second has 15 states. [2019-11-28 02:59:08,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2019-11-28 02:59:08,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-28 02:59:08,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2019-11-28 02:59:08,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 35 transitions. Stem has 43 letters. Loop has 48 letters. [2019-11-28 02:59:08,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:08,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 35 transitions. Stem has 91 letters. Loop has 48 letters. [2019-11-28 02:59:08,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:08,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 35 transitions. Stem has 43 letters. Loop has 96 letters. [2019-11-28 02:59:08,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:08,962 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 473 states and 516 transitions. [2019-11-28 02:59:08,966 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 85 [2019-11-28 02:59:08,969 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 473 states to 431 states and 474 transitions. [2019-11-28 02:59:08,969 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 207 [2019-11-28 02:59:08,969 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 211 [2019-11-28 02:59:08,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 431 states and 474 transitions. [2019-11-28 02:59:08,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:08,970 INFO L688 BuchiCegarLoop]: Abstraction has 431 states and 474 transitions. [2019-11-28 02:59:08,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states and 474 transitions. [2019-11-28 02:59:08,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 409. [2019-11-28 02:59:08,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2019-11-28 02:59:08,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 450 transitions. [2019-11-28 02:59:08,978 INFO L711 BuchiCegarLoop]: Abstraction has 409 states and 450 transitions. [2019-11-28 02:59:08,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:59:08,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 02:59:08,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-11-28 02:59:08,979 INFO L87 Difference]: Start difference. First operand 409 states and 450 transitions. Second operand 13 states. [2019-11-28 02:59:09,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:59:09,020 INFO L93 Difference]: Finished difference Result 274 states and 305 transitions. [2019-11-28 02:59:09,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:59:09,021 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 274 states and 305 transitions. [2019-11-28 02:59:09,024 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2019-11-28 02:59:09,026 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 274 states to 255 states and 286 transitions. [2019-11-28 02:59:09,026 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 167 [2019-11-28 02:59:09,026 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 167 [2019-11-28 02:59:09,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 255 states and 286 transitions. [2019-11-28 02:59:09,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:09,027 INFO L688 BuchiCegarLoop]: Abstraction has 255 states and 286 transitions. [2019-11-28 02:59:09,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states and 286 transitions. [2019-11-28 02:59:09,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 167. [2019-11-28 02:59:09,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-11-28 02:59:09,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 188 transitions. [2019-11-28 02:59:09,033 INFO L711 BuchiCegarLoop]: Abstraction has 167 states and 188 transitions. [2019-11-28 02:59:09,033 INFO L591 BuchiCegarLoop]: Abstraction has 167 states and 188 transitions. [2019-11-28 02:59:09,033 INFO L424 BuchiCegarLoop]: ======== Iteration 18============ [2019-11-28 02:59:09,033 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 167 states and 188 transitions. [2019-11-28 02:59:09,034 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2019-11-28 02:59:09,035 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:59:09,035 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:59:09,036 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2019-11-28 02:59:09,036 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [13, 12, 12, 10, 3, 1, 1] [2019-11-28 02:59:09,036 INFO L794 eck$LassoCheckResult]: Stem: 6228#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 6229#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6243#L12 assume !(main_~i~0 >= 10); 6320#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 6319#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6318#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6234#L12 assume !(main_~i~0 >= 10); 6226#L12-2 assume !(main_~i~0 <= 0); 6227#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6232#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6233#L12 assume !(main_~i~0 >= 10); 6317#L12-2 assume !(main_~i~0 <= 0); 6236#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6237#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6316#L12 assume !(main_~i~0 >= 10); 6315#L12-2 assume !(main_~i~0 <= 0); 6314#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6313#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6312#L12 assume !(main_~i~0 >= 10); 6311#L12-2 assume !(main_~i~0 <= 0); 6310#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6309#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6308#L12 assume !(main_~i~0 >= 10); 6307#L12-2 assume !(main_~i~0 <= 0); 6306#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6305#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6304#L12 assume !(main_~i~0 >= 10); 6303#L12-2 assume !(main_~i~0 <= 0); 6302#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6301#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6300#L12 assume !(main_~i~0 >= 10); 6299#L12-2 assume !(main_~i~0 <= 0); 6298#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6297#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6296#L12 assume !(main_~i~0 >= 10); 6295#L12-2 assume !(main_~i~0 <= 0); 6294#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6293#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6249#L12 assume !(main_~i~0 >= 10); 6292#L12-2 assume !(main_~i~0 <= 0); 6291#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6248#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6247#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 6246#L12-2 [2019-11-28 02:59:09,037 INFO L796 eck$LassoCheckResult]: Loop: 6246#L12-2 assume !(main_~i~0 <= 0); 6244#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 6241#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6242#L12 assume !(main_~i~0 >= 10); 6326#L12-2 assume !(main_~i~0 <= 0); 6324#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 6325#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6330#L12 assume !(main_~i~0 >= 10); 6331#L12-2 assume !(main_~i~0 <= 0); 6327#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 6322#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6323#L12 assume !(main_~i~0 >= 10); 6289#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 6288#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6287#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6286#L12 assume !(main_~i~0 >= 10); 6285#L12-2 assume !(main_~i~0 <= 0); 6284#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6283#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6282#L12 assume !(main_~i~0 >= 10); 6281#L12-2 assume !(main_~i~0 <= 0); 6280#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6279#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6278#L12 assume !(main_~i~0 >= 10); 6277#L12-2 assume !(main_~i~0 <= 0); 6276#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6275#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6274#L12 assume !(main_~i~0 >= 10); 6273#L12-2 assume !(main_~i~0 <= 0); 6272#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6271#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6270#L12 assume !(main_~i~0 >= 10); 6269#L12-2 assume !(main_~i~0 <= 0); 6268#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6267#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6266#L12 assume !(main_~i~0 >= 10); 6265#L12-2 assume !(main_~i~0 <= 0); 6264#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6263#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6262#L12 assume !(main_~i~0 >= 10); 6261#L12-2 assume !(main_~i~0 <= 0); 6260#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6259#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6258#L12 assume !(main_~i~0 >= 10); 6257#L12-2 assume !(main_~i~0 <= 0); 6256#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6255#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6254#L12 assume !(main_~i~0 >= 10); 6253#L12-2 assume !(main_~i~0 <= 0); 6252#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6250#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6251#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 6246#L12-2 [2019-11-28 02:59:09,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:09,037 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 10 times [2019-11-28 02:59:09,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:09,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269775968] [2019-11-28 02:59:09,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:09,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:09,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:09,049 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:09,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:09,050 INFO L82 PathProgramCache]: Analyzing trace with hash -690818020, now seen corresponding path program 10 times [2019-11-28 02:59:09,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:09,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457976611] [2019-11-28 02:59:09,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:09,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:09,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:09,063 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:09,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:09,064 INFO L82 PathProgramCache]: Analyzing trace with hash -120542630, now seen corresponding path program 4 times [2019-11-28 02:59:09,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:09,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750808881] [2019-11-28 02:59:09,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:09,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:09,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 672 proven. 15 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2019-11-28 02:59:09,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750808881] [2019-11-28 02:59:09,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116012719] [2019-11-28 02:59:09,110 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 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:59:09,156 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 02:59:09,157 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:59:09,158 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 02:59:09,159 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:09,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 672 proven. 15 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2019-11-28 02:59:09,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:59:09,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-11-28 02:59:09,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387050643] [2019-11-28 02:59:09,457 WARN L192 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 55 [2019-11-28 02:59:09,473 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:09,473 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:09,473 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:09,474 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:09,474 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:59:09,474 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:09,474 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:09,474 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:09,474 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration18_Loop [2019-11-28 02:59:09,475 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:09,475 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:09,476 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 02:59:09,482 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 02:59:09,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:09,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:09,543 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:09,543 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:09,556 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:09,556 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 84 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:09,561 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:59:09,561 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_15=1} Honda state: {v_rep~unnamed0~0~true_15=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:09,569 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:09,569 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 85 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 86 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:09,586 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:59:09,586 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 86 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:09,595 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:59:09,597 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:09,597 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:09,597 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:09,597 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:09,598 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:59:09,598 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:09,598 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:09,598 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:09,598 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration18_Loop [2019-11-28 02:59:09,598 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:09,598 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:09,599 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 02:59:09,604 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 02:59:09,611 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 02:59:09,617 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 02:59:09,668 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:09,671 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:09,677 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 02:59:09,679 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:09,679 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:09,679 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:09,679 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:09,681 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:59:09,681 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 87 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:09,684 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 88 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:09,691 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 02:59:09,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:09,693 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:59:09,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:09,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:09,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:09,694 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:59:09,694 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 88 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:09,697 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:59:09,699 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 02:59:09,699 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 89 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:09,704 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:59:09,704 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:59:09,704 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:59:09,704 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 13 Supporting invariants [] [2019-11-28 02:59:09,706 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 89 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:09,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:09,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:09,737 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:59:09,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:09,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:09,752 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 02:59:09,753 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:09,789 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-11-28 02:59:09,790 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2019-11-28 02:59:09,790 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 167 states and 188 transitions. cyclomatic complexity: 24 Second operand 7 states. [2019-11-28 02:59:09,987 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 167 states and 188 transitions. cyclomatic complexity: 24. Second operand 7 states. Result 529 states and 572 transitions. Complement of second has 19 states. [2019-11-28 02:59:09,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 8 non-accepting loop states 1 accepting loop states [2019-11-28 02:59:09,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-28 02:59:09,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 44 transitions. [2019-11-28 02:59:09,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 44 transitions. Stem has 43 letters. Loop has 52 letters. [2019-11-28 02:59:09,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:09,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 44 transitions. Stem has 95 letters. Loop has 52 letters. [2019-11-28 02:59:09,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:09,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 44 transitions. Stem has 43 letters. Loop has 104 letters. [2019-11-28 02:59:09,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:09,992 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 529 states and 572 transitions. [2019-11-28 02:59:09,996 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 85 [2019-11-28 02:59:09,998 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 529 states to 459 states and 502 transitions. [2019-11-28 02:59:09,999 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 223 [2019-11-28 02:59:09,999 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 227 [2019-11-28 02:59:09,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 459 states and 502 transitions. [2019-11-28 02:59:09,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:10,000 INFO L688 BuchiCegarLoop]: Abstraction has 459 states and 502 transitions. [2019-11-28 02:59:10,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states and 502 transitions. [2019-11-28 02:59:10,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 417. [2019-11-28 02:59:10,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-11-28 02:59:10,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 456 transitions. [2019-11-28 02:59:10,007 INFO L711 BuchiCegarLoop]: Abstraction has 417 states and 456 transitions. [2019-11-28 02:59:10,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:59:10,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:59:10,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:59:10,008 INFO L87 Difference]: Start difference. First operand 417 states and 456 transitions. Second operand 6 states. [2019-11-28 02:59:10,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:59:10,042 INFO L93 Difference]: Finished difference Result 290 states and 319 transitions. [2019-11-28 02:59:10,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:59:10,043 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 290 states and 319 transitions. [2019-11-28 02:59:10,045 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2019-11-28 02:59:10,046 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 290 states to 263 states and 292 transitions. [2019-11-28 02:59:10,046 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 175 [2019-11-28 02:59:10,046 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 175 [2019-11-28 02:59:10,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 263 states and 292 transitions. [2019-11-28 02:59:10,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:10,047 INFO L688 BuchiCegarLoop]: Abstraction has 263 states and 292 transitions. [2019-11-28 02:59:10,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states and 292 transitions. [2019-11-28 02:59:10,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 171. [2019-11-28 02:59:10,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-11-28 02:59:10,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 191 transitions. [2019-11-28 02:59:10,051 INFO L711 BuchiCegarLoop]: Abstraction has 171 states and 191 transitions. [2019-11-28 02:59:10,051 INFO L591 BuchiCegarLoop]: Abstraction has 171 states and 191 transitions. [2019-11-28 02:59:10,051 INFO L424 BuchiCegarLoop]: ======== Iteration 19============ [2019-11-28 02:59:10,052 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 171 states and 191 transitions. [2019-11-28 02:59:10,053 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2019-11-28 02:59:10,053 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:59:10,053 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:59:10,054 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2019-11-28 02:59:10,054 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [14, 13, 13, 10, 4, 1, 1] [2019-11-28 02:59:10,054 INFO L794 eck$LassoCheckResult]: Stem: 8251#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 8252#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8266#L12 assume !(main_~i~0 >= 10); 8344#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 8343#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8342#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8257#L12 assume !(main_~i~0 >= 10); 8249#L12-2 assume !(main_~i~0 <= 0); 8250#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8255#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8256#L12 assume !(main_~i~0 >= 10); 8341#L12-2 assume !(main_~i~0 <= 0); 8259#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8260#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8340#L12 assume !(main_~i~0 >= 10); 8339#L12-2 assume !(main_~i~0 <= 0); 8338#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8337#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8336#L12 assume !(main_~i~0 >= 10); 8335#L12-2 assume !(main_~i~0 <= 0); 8334#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8333#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8332#L12 assume !(main_~i~0 >= 10); 8331#L12-2 assume !(main_~i~0 <= 0); 8330#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8329#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8328#L12 assume !(main_~i~0 >= 10); 8327#L12-2 assume !(main_~i~0 <= 0); 8326#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8325#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8324#L12 assume !(main_~i~0 >= 10); 8323#L12-2 assume !(main_~i~0 <= 0); 8322#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8321#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8320#L12 assume !(main_~i~0 >= 10); 8319#L12-2 assume !(main_~i~0 <= 0); 8318#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8317#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8275#L12 assume !(main_~i~0 >= 10); 8316#L12-2 assume !(main_~i~0 <= 0); 8315#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8274#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8271#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 8269#L12-2 [2019-11-28 02:59:10,055 INFO L796 eck$LassoCheckResult]: Loop: 8269#L12-2 assume !(main_~i~0 <= 0); 8267#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 8268#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8381#L12 assume !(main_~i~0 >= 10); 8380#L12-2 assume !(main_~i~0 <= 0); 8379#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 8378#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8377#L12 assume !(main_~i~0 >= 10); 8376#L12-2 assume !(main_~i~0 <= 0); 8375#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 8374#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8351#L12 assume !(main_~i~0 >= 10); 8350#L12-2 assume !(main_~i~0 <= 0); 8348#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 8349#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8352#L12 assume !(main_~i~0 >= 10); 8313#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 8312#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8311#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8310#L12 assume !(main_~i~0 >= 10); 8309#L12-2 assume !(main_~i~0 <= 0); 8308#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8307#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8306#L12 assume !(main_~i~0 >= 10); 8305#L12-2 assume !(main_~i~0 <= 0); 8304#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8303#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8302#L12 assume !(main_~i~0 >= 10); 8301#L12-2 assume !(main_~i~0 <= 0); 8300#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8299#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8298#L12 assume !(main_~i~0 >= 10); 8297#L12-2 assume !(main_~i~0 <= 0); 8296#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8295#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8294#L12 assume !(main_~i~0 >= 10); 8293#L12-2 assume !(main_~i~0 <= 0); 8292#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8291#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8290#L12 assume !(main_~i~0 >= 10); 8289#L12-2 assume !(main_~i~0 <= 0); 8288#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8287#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8286#L12 assume !(main_~i~0 >= 10); 8285#L12-2 assume !(main_~i~0 <= 0); 8284#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8283#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8282#L12 assume !(main_~i~0 >= 10); 8281#L12-2 assume !(main_~i~0 <= 0); 8280#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8279#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8278#L12 assume !(main_~i~0 >= 10); 8277#L12-2 assume !(main_~i~0 <= 0); 8276#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8272#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8273#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 8269#L12-2 [2019-11-28 02:59:10,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:10,055 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 11 times [2019-11-28 02:59:10,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:10,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244287708] [2019-11-28 02:59:10,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:10,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:10,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:10,067 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:10,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:10,068 INFO L82 PathProgramCache]: Analyzing trace with hash 805924487, now seen corresponding path program 11 times [2019-11-28 02:59:10,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:10,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926336396] [2019-11-28 02:59:10,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:10,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:10,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:10,080 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:10,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:10,081 INFO L82 PathProgramCache]: Analyzing trace with hash 329635269, now seen corresponding path program 5 times [2019-11-28 02:59:10,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:10,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653076532] [2019-11-28 02:59:10,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:10,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:10,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1152 backedges. 753 proven. 28 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2019-11-28 02:59:10,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653076532] [2019-11-28 02:59:10,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759935415] [2019-11-28 02:59:10,134 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 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:59:10,165 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-11-28 02:59:10,165 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:59:10,166 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 02:59:10,168 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:10,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1152 backedges. 753 proven. 28 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2019-11-28 02:59:10,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:59:10,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-11-28 02:59:10,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744452519] [2019-11-28 02:59:10,460 WARN L192 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 58 [2019-11-28 02:59:10,474 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:10,474 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:10,474 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:10,474 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:10,475 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:59:10,475 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:10,475 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:10,475 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:10,475 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration19_Loop [2019-11-28 02:59:10,475 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:10,476 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:10,476 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 02:59:10,482 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 02:59:10,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:10,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:10,539 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:10,539 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 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 91 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:10,544 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:10,544 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:59:10,547 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:59:10,547 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_17=1} Honda state: {v_rep~unnamed0~0~true_17=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 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 92 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:10,556 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:10,556 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 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 93 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:10,563 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:59:10,563 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:59:10,566 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:59:10,568 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:10,568 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:10,568 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:10,568 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:10,568 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:59:10,568 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:10,568 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:10,568 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:10,568 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration19_Loop [2019-11-28 02:59:10,568 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:10,568 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:10,569 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 02:59:10,582 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 02:59:10,585 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 02:59:10,588 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 02:59:10,633 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:10,634 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 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 94 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:10,638 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 02:59:10,640 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:10,640 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:59:10,640 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:10,640 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:10,640 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:10,641 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:59:10,641 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:59:10,643 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:59:10,644 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 02:59:10,644 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 95 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 95 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:10,648 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:59:10,648 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:59:10,648 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:59:10,649 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 7 Supporting invariants [] [2019-11-28 02:59:10,650 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 02:59:10,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:10,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:10,671 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:59:10,672 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:10,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:10,688 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 02:59:10,689 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:10,738 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 193 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-11-28 02:59:10,739 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2019-11-28 02:59:10,739 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 171 states and 191 transitions. cyclomatic complexity: 23 Second operand 8 states. [2019-11-28 02:59:10,990 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 171 states and 191 transitions. cyclomatic complexity: 23. Second operand 8 states. Result 601 states and 644 transitions. Complement of second has 23 states. [2019-11-28 02:59:10,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 10 non-accepting loop states 1 accepting loop states [2019-11-28 02:59:10,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-28 02:59:10,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 53 transitions. [2019-11-28 02:59:10,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 53 transitions. Stem has 43 letters. Loop has 56 letters. [2019-11-28 02:59:10,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:10,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 53 transitions. Stem has 99 letters. Loop has 56 letters. [2019-11-28 02:59:10,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:10,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 53 transitions. Stem has 43 letters. Loop has 112 letters. [2019-11-28 02:59:10,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:10,994 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 601 states and 644 transitions. [2019-11-28 02:59:10,997 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 85 [2019-11-28 02:59:11,000 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 601 states to 495 states and 538 transitions. [2019-11-28 02:59:11,000 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 247 [2019-11-28 02:59:11,001 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 251 [2019-11-28 02:59:11,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 495 states and 538 transitions. [2019-11-28 02:59:11,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:11,001 INFO L688 BuchiCegarLoop]: Abstraction has 495 states and 538 transitions. [2019-11-28 02:59:11,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states and 538 transitions. [2019-11-28 02:59:11,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 425. [2019-11-28 02:59:11,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2019-11-28 02:59:11,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 462 transitions. [2019-11-28 02:59:11,009 INFO L711 BuchiCegarLoop]: Abstraction has 425 states and 462 transitions. [2019-11-28 02:59:11,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:59:11,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:59:11,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:59:11,010 INFO L87 Difference]: Start difference. First operand 425 states and 462 transitions. Second operand 7 states. [2019-11-28 02:59:11,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:59:11,058 INFO L93 Difference]: Finished difference Result 306 states and 333 transitions. [2019-11-28 02:59:11,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 02:59:11,058 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 306 states and 333 transitions. [2019-11-28 02:59:11,061 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2019-11-28 02:59:11,063 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 306 states to 271 states and 298 transitions. [2019-11-28 02:59:11,063 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 183 [2019-11-28 02:59:11,063 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 183 [2019-11-28 02:59:11,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 271 states and 298 transitions. [2019-11-28 02:59:11,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:11,063 INFO L688 BuchiCegarLoop]: Abstraction has 271 states and 298 transitions. [2019-11-28 02:59:11,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states and 298 transitions. [2019-11-28 02:59:11,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 175. [2019-11-28 02:59:11,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-11-28 02:59:11,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 194 transitions. [2019-11-28 02:59:11,068 INFO L711 BuchiCegarLoop]: Abstraction has 175 states and 194 transitions. [2019-11-28 02:59:11,068 INFO L591 BuchiCegarLoop]: Abstraction has 175 states and 194 transitions. [2019-11-28 02:59:11,069 INFO L424 BuchiCegarLoop]: ======== Iteration 20============ [2019-11-28 02:59:11,069 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 175 states and 194 transitions. [2019-11-28 02:59:11,070 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2019-11-28 02:59:11,070 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:59:11,070 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:59:11,071 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2019-11-28 02:59:11,071 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [15, 14, 14, 10, 5, 1, 1] [2019-11-28 02:59:11,071 INFO L794 eck$LassoCheckResult]: Stem: 10407#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 10408#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10421#L12 assume !(main_~i~0 >= 10); 10501#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 10500#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10499#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10498#L12 assume !(main_~i~0 >= 10); 10405#L12-2 assume !(main_~i~0 <= 0); 10406#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10411#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10412#L12 assume !(main_~i~0 >= 10); 10415#L12-2 assume !(main_~i~0 <= 0); 10417#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10418#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10497#L12 assume !(main_~i~0 >= 10); 10496#L12-2 assume !(main_~i~0 <= 0); 10495#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10494#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10493#L12 assume !(main_~i~0 >= 10); 10492#L12-2 assume !(main_~i~0 <= 0); 10491#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10490#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10489#L12 assume !(main_~i~0 >= 10); 10488#L12-2 assume !(main_~i~0 <= 0); 10487#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10486#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10485#L12 assume !(main_~i~0 >= 10); 10484#L12-2 assume !(main_~i~0 <= 0); 10483#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10482#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10481#L12 assume !(main_~i~0 >= 10); 10480#L12-2 assume !(main_~i~0 <= 0); 10479#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10478#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10477#L12 assume !(main_~i~0 >= 10); 10476#L12-2 assume !(main_~i~0 <= 0); 10475#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10474#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10432#L12 assume !(main_~i~0 >= 10); 10473#L12-2 assume !(main_~i~0 <= 0); 10472#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10431#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10428#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 10427#L12-2 [2019-11-28 02:59:11,072 INFO L796 eck$LassoCheckResult]: Loop: 10427#L12-2 assume !(main_~i~0 <= 0); 10424#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 10425#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10538#L12 assume !(main_~i~0 >= 10); 10537#L12-2 assume !(main_~i~0 <= 0); 10536#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 10535#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10534#L12 assume !(main_~i~0 >= 10); 10533#L12-2 assume !(main_~i~0 <= 0); 10532#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 10531#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10530#L12 assume !(main_~i~0 >= 10); 10529#L12-2 assume !(main_~i~0 <= 0); 10528#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 10527#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10508#L12 assume !(main_~i~0 >= 10); 10507#L12-2 assume !(main_~i~0 <= 0); 10505#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 10506#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10509#L12 assume !(main_~i~0 >= 10); 10470#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 10469#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10468#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10467#L12 assume !(main_~i~0 >= 10); 10466#L12-2 assume !(main_~i~0 <= 0); 10465#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10464#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10463#L12 assume !(main_~i~0 >= 10); 10462#L12-2 assume !(main_~i~0 <= 0); 10461#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10460#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10459#L12 assume !(main_~i~0 >= 10); 10458#L12-2 assume !(main_~i~0 <= 0); 10457#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10456#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10455#L12 assume !(main_~i~0 >= 10); 10454#L12-2 assume !(main_~i~0 <= 0); 10453#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10452#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10451#L12 assume !(main_~i~0 >= 10); 10450#L12-2 assume !(main_~i~0 <= 0); 10449#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10448#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10447#L12 assume !(main_~i~0 >= 10); 10446#L12-2 assume !(main_~i~0 <= 0); 10445#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10444#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10443#L12 assume !(main_~i~0 >= 10); 10442#L12-2 assume !(main_~i~0 <= 0); 10441#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10440#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10439#L12 assume !(main_~i~0 >= 10); 10438#L12-2 assume !(main_~i~0 <= 0); 10437#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10436#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10435#L12 assume !(main_~i~0 >= 10); 10434#L12-2 assume !(main_~i~0 <= 0); 10433#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10429#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10430#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 10427#L12-2 [2019-11-28 02:59:11,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:11,072 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 12 times [2019-11-28 02:59:11,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:11,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476070595] [2019-11-28 02:59:11,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:11,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:11,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:11,083 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:11,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:11,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1151943822, now seen corresponding path program 12 times [2019-11-28 02:59:11,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:11,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890807285] [2019-11-28 02:59:11,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:11,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:11,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:11,096 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:11,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:11,097 INFO L82 PathProgramCache]: Analyzing trace with hash 533812144, now seen corresponding path program 6 times [2019-11-28 02:59:11,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:11,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438626933] [2019-11-28 02:59:11,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:11,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:11,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1250 backedges. 834 proven. 45 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2019-11-28 02:59:11,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438626933] [2019-11-28 02:59:11,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499714526] [2019-11-28 02:59:11,154 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 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:59:11,208 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 26 check-sat command(s) [2019-11-28 02:59:11,208 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:59:11,209 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 02:59:11,210 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:11,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1250 backedges. 834 proven. 45 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2019-11-28 02:59:11,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:59:11,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-11-28 02:59:11,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41327881] [2019-11-28 02:59:11,536 WARN L192 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 60 [2019-11-28 02:59:11,553 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:11,553 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:11,554 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:11,554 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:11,554 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:59:11,554 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:11,554 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:11,554 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:11,555 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration20_Loop [2019-11-28 02:59:11,555 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:11,555 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:11,556 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 02:59:11,560 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 02:59:11,566 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 02:59:11,569 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 02:59:11,631 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:11,632 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 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 97 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:11,641 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:11,641 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:59:11,644 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:59:11,644 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=0} Honda state: {ULTIMATE.start_main_~up~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 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 98 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:11,649 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:11,649 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 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 99 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:11,657 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:59:11,657 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:59:11,668 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:59:11,669 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:11,669 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:11,670 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:11,670 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:11,670 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:59:11,670 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:11,670 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:11,670 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:11,670 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration20_Loop [2019-11-28 02:59:11,670 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:11,670 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:11,671 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 02:59:11,674 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 02:59:11,677 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 02:59:11,683 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 02:59:11,729 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:11,729 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 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 100 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:11,733 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 02:59:11,735 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:11,735 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:11,735 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:11,735 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:11,736 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:59:11,736 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:59:11,739 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 101 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 101 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:11,744 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 02:59:11,746 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:11,746 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:59:11,746 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:11,746 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:11,746 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:11,747 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:59:11,747 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:59:11,748 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 102 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 102 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:11,753 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 02:59:11,754 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:11,754 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:59:11,755 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:11,755 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:11,755 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:11,755 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:59:11,755 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:59:11,757 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:59:11,759 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 02:59:11,759 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 103 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:11,763 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:59:11,763 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:59:11,763 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:59:11,763 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 15 Supporting invariants [] [2019-11-28 02:59:11,766 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 103 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:11,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:11,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:11,796 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:59:11,797 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:11,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:11,812 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 02:59:11,813 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:11,861 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 249 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-11-28 02:59:11,861 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2019-11-28 02:59:11,861 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 175 states and 194 transitions. cyclomatic complexity: 22 Second operand 9 states. [2019-11-28 02:59:12,194 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 175 states and 194 transitions. cyclomatic complexity: 22. Second operand 9 states. Result 689 states and 732 transitions. Complement of second has 27 states. [2019-11-28 02:59:12,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 1 stem states 12 non-accepting loop states 1 accepting loop states [2019-11-28 02:59:12,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-28 02:59:12,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 62 transitions. [2019-11-28 02:59:12,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 62 transitions. Stem has 43 letters. Loop has 60 letters. [2019-11-28 02:59:12,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:12,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 62 transitions. Stem has 103 letters. Loop has 60 letters. [2019-11-28 02:59:12,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:12,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 62 transitions. Stem has 43 letters. Loop has 120 letters. [2019-11-28 02:59:12,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:12,199 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 689 states and 732 transitions. [2019-11-28 02:59:12,204 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 85 [2019-11-28 02:59:12,206 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 689 states to 539 states and 582 transitions. [2019-11-28 02:59:12,206 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 279 [2019-11-28 02:59:12,207 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 283 [2019-11-28 02:59:12,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 539 states and 582 transitions. [2019-11-28 02:59:12,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:12,207 INFO L688 BuchiCegarLoop]: Abstraction has 539 states and 582 transitions. [2019-11-28 02:59:12,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states and 582 transitions. [2019-11-28 02:59:12,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 433. [2019-11-28 02:59:12,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2019-11-28 02:59:12,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 468 transitions. [2019-11-28 02:59:12,215 INFO L711 BuchiCegarLoop]: Abstraction has 433 states and 468 transitions. [2019-11-28 02:59:12,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:59:12,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 02:59:12,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:59:12,216 INFO L87 Difference]: Start difference. First operand 433 states and 468 transitions. Second operand 8 states. [2019-11-28 02:59:12,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:59:12,289 INFO L93 Difference]: Finished difference Result 322 states and 347 transitions. [2019-11-28 02:59:12,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 02:59:12,290 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 322 states and 347 transitions. [2019-11-28 02:59:12,292 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2019-11-28 02:59:12,293 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 322 states to 279 states and 304 transitions. [2019-11-28 02:59:12,294 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 191 [2019-11-28 02:59:12,294 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 191 [2019-11-28 02:59:12,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 279 states and 304 transitions. [2019-11-28 02:59:12,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:12,295 INFO L688 BuchiCegarLoop]: Abstraction has 279 states and 304 transitions. [2019-11-28 02:59:12,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states and 304 transitions. [2019-11-28 02:59:12,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 179. [2019-11-28 02:59:12,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-11-28 02:59:12,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 197 transitions. [2019-11-28 02:59:12,299 INFO L711 BuchiCegarLoop]: Abstraction has 179 states and 197 transitions. [2019-11-28 02:59:12,299 INFO L591 BuchiCegarLoop]: Abstraction has 179 states and 197 transitions. [2019-11-28 02:59:12,299 INFO L424 BuchiCegarLoop]: ======== Iteration 21============ [2019-11-28 02:59:12,299 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 179 states and 197 transitions. [2019-11-28 02:59:12,300 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2019-11-28 02:59:12,300 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:59:12,300 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:59:12,301 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2019-11-28 02:59:12,302 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [16, 15, 15, 10, 6, 1, 1] [2019-11-28 02:59:12,302 INFO L794 eck$LassoCheckResult]: Stem: 12712#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 12713#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12728#L12 assume !(main_~i~0 >= 10); 12806#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 12805#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12804#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12720#L12 assume !(main_~i~0 >= 10); 12721#L12-2 assume !(main_~i~0 <= 0); 12803#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12716#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12717#L12 assume !(main_~i~0 >= 10); 12710#L12-2 assume !(main_~i~0 <= 0); 12711#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12723#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12802#L12 assume !(main_~i~0 >= 10); 12801#L12-2 assume !(main_~i~0 <= 0); 12800#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12799#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12798#L12 assume !(main_~i~0 >= 10); 12797#L12-2 assume !(main_~i~0 <= 0); 12796#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12795#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12794#L12 assume !(main_~i~0 >= 10); 12793#L12-2 assume !(main_~i~0 <= 0); 12792#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12791#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12790#L12 assume !(main_~i~0 >= 10); 12789#L12-2 assume !(main_~i~0 <= 0); 12788#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12787#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12786#L12 assume !(main_~i~0 >= 10); 12785#L12-2 assume !(main_~i~0 <= 0); 12784#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12783#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12782#L12 assume !(main_~i~0 >= 10); 12781#L12-2 assume !(main_~i~0 <= 0); 12780#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12779#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12737#L12 assume !(main_~i~0 >= 10); 12778#L12-2 assume !(main_~i~0 <= 0); 12777#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12736#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12733#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 12731#L12-2 [2019-11-28 02:59:12,302 INFO L796 eck$LassoCheckResult]: Loop: 12731#L12-2 assume !(main_~i~0 <= 0); 12729#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 12730#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12843#L12 assume !(main_~i~0 >= 10); 12842#L12-2 assume !(main_~i~0 <= 0); 12841#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 12840#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12839#L12 assume !(main_~i~0 >= 10); 12838#L12-2 assume !(main_~i~0 <= 0); 12837#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 12836#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12835#L12 assume !(main_~i~0 >= 10); 12834#L12-2 assume !(main_~i~0 <= 0); 12833#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 12832#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12831#L12 assume !(main_~i~0 >= 10); 12830#L12-2 assume !(main_~i~0 <= 0); 12829#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 12828#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12813#L12 assume !(main_~i~0 >= 10); 12814#L12-2 assume !(main_~i~0 <= 0); 12810#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 12808#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12809#L12 assume !(main_~i~0 >= 10); 12775#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 12774#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12773#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12772#L12 assume !(main_~i~0 >= 10); 12771#L12-2 assume !(main_~i~0 <= 0); 12770#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12769#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12768#L12 assume !(main_~i~0 >= 10); 12767#L12-2 assume !(main_~i~0 <= 0); 12766#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12765#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12764#L12 assume !(main_~i~0 >= 10); 12763#L12-2 assume !(main_~i~0 <= 0); 12762#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12761#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12760#L12 assume !(main_~i~0 >= 10); 12759#L12-2 assume !(main_~i~0 <= 0); 12758#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12757#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12756#L12 assume !(main_~i~0 >= 10); 12755#L12-2 assume !(main_~i~0 <= 0); 12754#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12753#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12752#L12 assume !(main_~i~0 >= 10); 12751#L12-2 assume !(main_~i~0 <= 0); 12750#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12749#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12748#L12 assume !(main_~i~0 >= 10); 12747#L12-2 assume !(main_~i~0 <= 0); 12746#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12745#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12744#L12 assume !(main_~i~0 >= 10); 12743#L12-2 assume !(main_~i~0 <= 0); 12742#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12741#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12740#L12 assume !(main_~i~0 >= 10); 12739#L12-2 assume !(main_~i~0 <= 0); 12738#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12734#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12735#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 12731#L12-2 [2019-11-28 02:59:12,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:12,303 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 13 times [2019-11-28 02:59:12,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:12,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901197629] [2019-11-28 02:59:12,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:12,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:12,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:12,314 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:12,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:12,315 INFO L82 PathProgramCache]: Analyzing trace with hash 336435933, now seen corresponding path program 13 times [2019-11-28 02:59:12,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:12,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868898545] [2019-11-28 02:59:12,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:12,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:12,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:12,329 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:12,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:12,329 INFO L82 PathProgramCache]: Analyzing trace with hash 216392731, now seen corresponding path program 7 times [2019-11-28 02:59:12,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:12,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649573906] [2019-11-28 02:59:12,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:12,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:12,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 915 proven. 66 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2019-11-28 02:59:12,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649573906] [2019-11-28 02:59:12,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981783530] [2019-11-28 02:59:12,394 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 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:59:12,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:12,435 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 02:59:12,436 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:12,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 915 proven. 66 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2019-11-28 02:59:12,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:59:12,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-11-28 02:59:12,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423756088] [2019-11-28 02:59:12,794 WARN L192 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 65 [2019-11-28 02:59:12,809 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:12,809 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:12,810 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:12,810 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:12,810 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:59:12,810 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:12,810 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:12,810 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:12,810 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration21_Loop [2019-11-28 02:59:12,811 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:12,811 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:12,812 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 02:59:12,814 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 02:59:12,818 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 02:59:12,823 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 02:59:12,875 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:12,875 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:12,885 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:12,886 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 105 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:12,890 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:59:12,890 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_21=0} Honda state: {v_rep~unnamed0~0~false_21=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:12,896 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:12,896 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 106 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 107 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:12,905 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:59:12,906 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 107 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:12,916 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:59:12,919 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:12,919 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:12,919 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:12,919 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:12,919 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:59:12,919 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:12,919 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:12,919 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:12,920 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration21_Loop [2019-11-28 02:59:12,920 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:12,920 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:12,920 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 02:59:12,922 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 02:59:12,926 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 02:59:12,935 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 02:59:12,993 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:12,993 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 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 108 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:12,998 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 02:59:12,999 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:12,999 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:12,999 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:12,999 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:13,000 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:59:13,000 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:59:13,004 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 109 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 109 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:13,008 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 02:59:13,010 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:13,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:13,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:13,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:13,012 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:59:13,013 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:59:13,017 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 110 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 110 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:13,022 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 02:59:13,023 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:13,024 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:59:13,024 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:13,024 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:13,024 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:13,025 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:59:13,025 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:59:13,027 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:59:13,028 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 02:59:13,028 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 111 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 111 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:13,032 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:59:13,032 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:59:13,032 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:59:13,033 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 8 Supporting invariants [] [2019-11-28 02:59:13,035 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 02:59:13,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:13,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:13,063 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:59:13,063 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:13,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:13,082 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 02:59:13,083 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:13,143 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 309 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-11-28 02:59:13,144 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 8 loop predicates [2019-11-28 02:59:13,145 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 179 states and 197 transitions. cyclomatic complexity: 21 Second operand 10 states. [2019-11-28 02:59:13,547 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 179 states and 197 transitions. cyclomatic complexity: 21. Second operand 10 states. Result 793 states and 836 transitions. Complement of second has 31 states. [2019-11-28 02:59:13,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 1 stem states 14 non-accepting loop states 1 accepting loop states [2019-11-28 02:59:13,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-28 02:59:13,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 71 transitions. [2019-11-28 02:59:13,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 71 transitions. Stem has 43 letters. Loop has 64 letters. [2019-11-28 02:59:13,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:13,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 71 transitions. Stem has 107 letters. Loop has 64 letters. [2019-11-28 02:59:13,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:13,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 71 transitions. Stem has 43 letters. Loop has 128 letters. [2019-11-28 02:59:13,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:13,551 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 793 states and 836 transitions. [2019-11-28 02:59:13,554 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 85 [2019-11-28 02:59:13,557 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 793 states to 591 states and 634 transitions. [2019-11-28 02:59:13,557 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 319 [2019-11-28 02:59:13,557 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 323 [2019-11-28 02:59:13,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 591 states and 634 transitions. [2019-11-28 02:59:13,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:13,558 INFO L688 BuchiCegarLoop]: Abstraction has 591 states and 634 transitions. [2019-11-28 02:59:13,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states and 634 transitions. [2019-11-28 02:59:13,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 441. [2019-11-28 02:59:13,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2019-11-28 02:59:13,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 474 transitions. [2019-11-28 02:59:13,566 INFO L711 BuchiCegarLoop]: Abstraction has 441 states and 474 transitions. [2019-11-28 02:59:13,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:59:13,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 02:59:13,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:59:13,567 INFO L87 Difference]: Start difference. First operand 441 states and 474 transitions. Second operand 9 states. [2019-11-28 02:59:13,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:59:13,635 INFO L93 Difference]: Finished difference Result 338 states and 361 transitions. [2019-11-28 02:59:13,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 02:59:13,636 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 338 states and 361 transitions. [2019-11-28 02:59:13,638 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2019-11-28 02:59:13,639 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 338 states to 287 states and 310 transitions. [2019-11-28 02:59:13,639 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 199 [2019-11-28 02:59:13,640 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 199 [2019-11-28 02:59:13,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 287 states and 310 transitions. [2019-11-28 02:59:13,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:13,640 INFO L688 BuchiCegarLoop]: Abstraction has 287 states and 310 transitions. [2019-11-28 02:59:13,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states and 310 transitions. [2019-11-28 02:59:13,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 183. [2019-11-28 02:59:13,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-11-28 02:59:13,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 200 transitions. [2019-11-28 02:59:13,644 INFO L711 BuchiCegarLoop]: Abstraction has 183 states and 200 transitions. [2019-11-28 02:59:13,645 INFO L591 BuchiCegarLoop]: Abstraction has 183 states and 200 transitions. [2019-11-28 02:59:13,645 INFO L424 BuchiCegarLoop]: ======== Iteration 22============ [2019-11-28 02:59:13,645 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 183 states and 200 transitions. [2019-11-28 02:59:13,646 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2019-11-28 02:59:13,646 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:59:13,646 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:59:13,647 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2019-11-28 02:59:13,647 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [17, 16, 16, 10, 7, 1, 1] [2019-11-28 02:59:13,648 INFO L794 eck$LassoCheckResult]: Stem: 15182#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 15183#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15198#L12 assume !(main_~i~0 >= 10); 15276#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 15275#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15274#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15190#L12 assume !(main_~i~0 >= 10); 15180#L12-2 assume !(main_~i~0 <= 0); 15181#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15186#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15187#L12 assume !(main_~i~0 >= 10); 15273#L12-2 assume !(main_~i~0 <= 0); 15192#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15193#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15272#L12 assume !(main_~i~0 >= 10); 15271#L12-2 assume !(main_~i~0 <= 0); 15270#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15269#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15268#L12 assume !(main_~i~0 >= 10); 15267#L12-2 assume !(main_~i~0 <= 0); 15266#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15265#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15264#L12 assume !(main_~i~0 >= 10); 15263#L12-2 assume !(main_~i~0 <= 0); 15262#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15261#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15260#L12 assume !(main_~i~0 >= 10); 15259#L12-2 assume !(main_~i~0 <= 0); 15258#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15257#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15256#L12 assume !(main_~i~0 >= 10); 15255#L12-2 assume !(main_~i~0 <= 0); 15254#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15253#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15252#L12 assume !(main_~i~0 >= 10); 15251#L12-2 assume !(main_~i~0 <= 0); 15250#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15249#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15205#L12 assume !(main_~i~0 >= 10); 15248#L12-2 assume !(main_~i~0 <= 0); 15247#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15204#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15203#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 15201#L12-2 [2019-11-28 02:59:13,648 INFO L796 eck$LassoCheckResult]: Loop: 15201#L12-2 assume !(main_~i~0 <= 0); 15199#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 15200#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15313#L12 assume !(main_~i~0 >= 10); 15312#L12-2 assume !(main_~i~0 <= 0); 15311#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 15310#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15309#L12 assume !(main_~i~0 >= 10); 15308#L12-2 assume !(main_~i~0 <= 0); 15307#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 15306#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15305#L12 assume !(main_~i~0 >= 10); 15304#L12-2 assume !(main_~i~0 <= 0); 15303#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 15302#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15301#L12 assume !(main_~i~0 >= 10); 15300#L12-2 assume !(main_~i~0 <= 0); 15299#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 15298#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15297#L12 assume !(main_~i~0 >= 10); 15296#L12-2 assume !(main_~i~0 <= 0); 15295#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 15294#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15283#L12 assume !(main_~i~0 >= 10); 15282#L12-2 assume !(main_~i~0 <= 0); 15280#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 15281#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15284#L12 assume !(main_~i~0 >= 10); 15245#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 15244#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15243#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15242#L12 assume !(main_~i~0 >= 10); 15241#L12-2 assume !(main_~i~0 <= 0); 15240#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15239#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15238#L12 assume !(main_~i~0 >= 10); 15237#L12-2 assume !(main_~i~0 <= 0); 15236#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15235#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15234#L12 assume !(main_~i~0 >= 10); 15233#L12-2 assume !(main_~i~0 <= 0); 15232#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15231#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15230#L12 assume !(main_~i~0 >= 10); 15229#L12-2 assume !(main_~i~0 <= 0); 15228#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15227#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15226#L12 assume !(main_~i~0 >= 10); 15225#L12-2 assume !(main_~i~0 <= 0); 15224#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15223#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15222#L12 assume !(main_~i~0 >= 10); 15221#L12-2 assume !(main_~i~0 <= 0); 15220#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15219#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15218#L12 assume !(main_~i~0 >= 10); 15217#L12-2 assume !(main_~i~0 <= 0); 15216#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15215#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15214#L12 assume !(main_~i~0 >= 10); 15213#L12-2 assume !(main_~i~0 <= 0); 15212#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15211#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15210#L12 assume !(main_~i~0 >= 10); 15209#L12-2 assume !(main_~i~0 <= 0); 15208#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15206#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15207#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 15201#L12-2 [2019-11-28 02:59:13,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:13,649 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 14 times [2019-11-28 02:59:13,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:13,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422665971] [2019-11-28 02:59:13,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:13,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:13,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:13,661 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:13,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:13,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1847643336, now seen corresponding path program 14 times [2019-11-28 02:59:13,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:13,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245626713] [2019-11-28 02:59:13,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:13,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:13,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:13,679 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:13,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:13,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1125533446, now seen corresponding path program 8 times [2019-11-28 02:59:13,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:13,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092277575] [2019-11-28 02:59:13,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:13,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:13,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 996 proven. 91 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2019-11-28 02:59:13,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092277575] [2019-11-28 02:59:13,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597306299] [2019-11-28 02:59:13,783 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 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:59:13,843 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 02:59:13,843 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:59:13,844 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 02:59:13,846 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:13,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 996 proven. 91 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2019-11-28 02:59:13,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:59:13,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-11-28 02:59:13,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797607245] [2019-11-28 02:59:14,243 WARN L192 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 68 [2019-11-28 02:59:14,266 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:14,266 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:14,266 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:14,266 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:14,267 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:59:14,267 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:14,267 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:14,267 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:14,267 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration22_Loop [2019-11-28 02:59:14,267 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:14,267 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:14,268 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 02:59:14,274 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 02:59:14,279 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 02:59:14,282 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 02:59:14,324 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:14,324 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 113 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 113 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:14,329 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:14,329 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 114 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 114 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:14,336 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:59:14,337 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:59:14,343 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:59:14,344 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:14,344 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:14,345 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:14,345 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:14,345 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:59:14,345 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:14,345 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:14,345 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:14,345 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration22_Loop [2019-11-28 02:59:14,345 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:14,345 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:14,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:14,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:14,357 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 02:59:14,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:14,408 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:14,409 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 115 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 115 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:14,413 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 02:59:14,414 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:14,414 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:59:14,414 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:14,414 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:14,414 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:14,415 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:59:14,415 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:59:14,422 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:59:14,424 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 02:59:14,424 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 116 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 116 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:14,434 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:59:14,434 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:59:14,434 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:59:14,434 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 17 Supporting invariants [] [2019-11-28 02:59:14,435 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 02:59:14,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:14,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:14,463 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:59:14,464 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:14,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:14,480 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 02:59:14,481 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:14,562 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 373 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-11-28 02:59:14,562 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2019-11-28 02:59:14,563 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 183 states and 200 transitions. cyclomatic complexity: 20 Second operand 11 states. [2019-11-28 02:59:15,016 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 183 states and 200 transitions. cyclomatic complexity: 20. Second operand 11 states. Result 913 states and 956 transitions. Complement of second has 35 states. [2019-11-28 02:59:15,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 18 states 1 stem states 16 non-accepting loop states 1 accepting loop states [2019-11-28 02:59:15,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-28 02:59:15,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 80 transitions. [2019-11-28 02:59:15,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 80 transitions. Stem has 43 letters. Loop has 68 letters. [2019-11-28 02:59:15,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:15,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 80 transitions. Stem has 111 letters. Loop has 68 letters. [2019-11-28 02:59:15,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:15,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 80 transitions. Stem has 43 letters. Loop has 136 letters. [2019-11-28 02:59:15,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:15,020 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 913 states and 956 transitions. [2019-11-28 02:59:15,026 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 85 [2019-11-28 02:59:15,029 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 913 states to 651 states and 694 transitions. [2019-11-28 02:59:15,029 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 367 [2019-11-28 02:59:15,030 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 371 [2019-11-28 02:59:15,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 651 states and 694 transitions. [2019-11-28 02:59:15,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:15,030 INFO L688 BuchiCegarLoop]: Abstraction has 651 states and 694 transitions. [2019-11-28 02:59:15,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states and 694 transitions. [2019-11-28 02:59:15,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 449. [2019-11-28 02:59:15,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-11-28 02:59:15,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 480 transitions. [2019-11-28 02:59:15,038 INFO L711 BuchiCegarLoop]: Abstraction has 449 states and 480 transitions. [2019-11-28 02:59:15,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:59:15,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 02:59:15,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:59:15,039 INFO L87 Difference]: Start difference. First operand 449 states and 480 transitions. Second operand 10 states. [2019-11-28 02:59:15,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:59:15,106 INFO L93 Difference]: Finished difference Result 354 states and 375 transitions. [2019-11-28 02:59:15,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 02:59:15,107 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 354 states and 375 transitions. [2019-11-28 02:59:15,109 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2019-11-28 02:59:15,110 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 354 states to 295 states and 316 transitions. [2019-11-28 02:59:15,110 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 207 [2019-11-28 02:59:15,111 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 207 [2019-11-28 02:59:15,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 295 states and 316 transitions. [2019-11-28 02:59:15,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:15,111 INFO L688 BuchiCegarLoop]: Abstraction has 295 states and 316 transitions. [2019-11-28 02:59:15,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states and 316 transitions. [2019-11-28 02:59:15,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 187. [2019-11-28 02:59:15,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-11-28 02:59:15,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 203 transitions. [2019-11-28 02:59:15,115 INFO L711 BuchiCegarLoop]: Abstraction has 187 states and 203 transitions. [2019-11-28 02:59:15,115 INFO L591 BuchiCegarLoop]: Abstraction has 187 states and 203 transitions. [2019-11-28 02:59:15,115 INFO L424 BuchiCegarLoop]: ======== Iteration 23============ [2019-11-28 02:59:15,115 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 187 states and 203 transitions. [2019-11-28 02:59:15,116 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2019-11-28 02:59:15,116 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:59:15,117 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:59:15,117 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2019-11-28 02:59:15,118 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [18, 17, 17, 10, 8, 1, 1] [2019-11-28 02:59:15,118 INFO L794 eck$LassoCheckResult]: Stem: 17833#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 17834#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17847#L12 assume !(main_~i~0 >= 10); 17931#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 17930#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17929#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17928#L12 assume !(main_~i~0 >= 10); 17831#L12-2 assume !(main_~i~0 <= 0); 17832#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17837#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17838#L12 assume !(main_~i~0 >= 10); 17840#L12-2 assume !(main_~i~0 <= 0); 17925#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17922#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17921#L12 assume !(main_~i~0 >= 10); 17920#L12-2 assume !(main_~i~0 <= 0); 17919#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17918#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17917#L12 assume !(main_~i~0 >= 10); 17916#L12-2 assume !(main_~i~0 <= 0); 17915#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17914#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17913#L12 assume !(main_~i~0 >= 10); 17912#L12-2 assume !(main_~i~0 <= 0); 17911#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17910#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17909#L12 assume !(main_~i~0 >= 10); 17908#L12-2 assume !(main_~i~0 <= 0); 17907#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17906#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17905#L12 assume !(main_~i~0 >= 10); 17904#L12-2 assume !(main_~i~0 <= 0); 17903#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17902#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17901#L12 assume !(main_~i~0 >= 10); 17900#L12-2 assume !(main_~i~0 <= 0); 17899#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17898#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17856#L12 assume !(main_~i~0 >= 10); 17897#L12-2 assume !(main_~i~0 <= 0); 17896#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17855#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17852#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 17850#L12-2 [2019-11-28 02:59:15,118 INFO L796 eck$LassoCheckResult]: Loop: 17850#L12-2 assume !(main_~i~0 <= 0); 17848#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 17849#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17964#L12 assume !(main_~i~0 >= 10); 17963#L12-2 assume !(main_~i~0 <= 0); 17962#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 17961#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17960#L12 assume !(main_~i~0 >= 10); 17959#L12-2 assume !(main_~i~0 <= 0); 17958#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 17957#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17956#L12 assume !(main_~i~0 >= 10); 17955#L12-2 assume !(main_~i~0 <= 0); 17954#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 17953#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17952#L12 assume !(main_~i~0 >= 10); 17951#L12-2 assume !(main_~i~0 <= 0); 17950#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 17949#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17948#L12 assume !(main_~i~0 >= 10); 17947#L12-2 assume !(main_~i~0 <= 0); 17946#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 17945#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17944#L12 assume !(main_~i~0 >= 10); 17943#L12-2 assume !(main_~i~0 <= 0); 17942#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 17941#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17935#L12 assume !(main_~i~0 >= 10); 17936#L12-2 assume !(main_~i~0 <= 0); 17926#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 17927#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17937#L12 assume !(main_~i~0 >= 10); 17894#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 17893#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17892#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17891#L12 assume !(main_~i~0 >= 10); 17890#L12-2 assume !(main_~i~0 <= 0); 17889#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17888#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17887#L12 assume !(main_~i~0 >= 10); 17886#L12-2 assume !(main_~i~0 <= 0); 17885#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17884#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17883#L12 assume !(main_~i~0 >= 10); 17882#L12-2 assume !(main_~i~0 <= 0); 17881#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17880#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17879#L12 assume !(main_~i~0 >= 10); 17878#L12-2 assume !(main_~i~0 <= 0); 17877#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17876#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17875#L12 assume !(main_~i~0 >= 10); 17874#L12-2 assume !(main_~i~0 <= 0); 17873#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17872#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17871#L12 assume !(main_~i~0 >= 10); 17870#L12-2 assume !(main_~i~0 <= 0); 17869#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17868#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17867#L12 assume !(main_~i~0 >= 10); 17866#L12-2 assume !(main_~i~0 <= 0); 17865#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17864#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17863#L12 assume !(main_~i~0 >= 10); 17862#L12-2 assume !(main_~i~0 <= 0); 17861#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17860#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17859#L12 assume !(main_~i~0 >= 10); 17858#L12-2 assume !(main_~i~0 <= 0); 17857#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17853#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17854#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 17850#L12-2 [2019-11-28 02:59:15,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:15,119 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 15 times [2019-11-28 02:59:15,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:15,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749164490] [2019-11-28 02:59:15,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:15,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:15,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:15,129 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:15,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:15,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1176703283, now seen corresponding path program 15 times [2019-11-28 02:59:15,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:15,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72814863] [2019-11-28 02:59:15,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:15,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:15,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:15,144 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:15,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:15,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1395997809, now seen corresponding path program 9 times [2019-11-28 02:59:15,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:15,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648582751] [2019-11-28 02:59:15,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:15,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:15,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 1077 proven. 120 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2019-11-28 02:59:15,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648582751] [2019-11-28 02:59:15,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275827190] [2019-11-28 02:59:15,229 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 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:59:15,276 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-11-28 02:59:15,276 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:59:15,277 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-28 02:59:15,278 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:15,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 1112 proven. 226 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2019-11-28 02:59:15,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:59:15,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 13 [2019-11-28 02:59:15,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641463811] [2019-11-28 02:59:15,723 WARN L192 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 69 [2019-11-28 02:59:15,736 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:15,736 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:15,737 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:15,737 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:15,737 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:59:15,737 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:15,737 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:15,737 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:15,737 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration23_Loop [2019-11-28 02:59:15,738 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:15,738 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:15,739 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 02:59:15,742 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 02:59:15,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:15,745 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 02:59:15,793 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:15,793 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 118 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 118 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:15,805 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:15,805 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:59:15,808 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:59:15,808 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=0} Honda state: {ULTIMATE.start_main_~up~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 119 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 119 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:15,813 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:15,813 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:59:15,816 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:59:15,816 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_25=1} Honda state: {v_rep~unnamed0~0~true_25=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 120 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 120 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:15,838 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:15,838 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:59:15,841 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:59:15,841 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_25=0} Honda state: {v_rep~unnamed0~0~false_25=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 121 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 121 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:15,846 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:15,846 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 122 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 122 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:15,854 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:59:15,854 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:59:15,857 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:59:15,859 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:15,859 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:15,859 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:15,859 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:15,859 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:59:15,859 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:15,859 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:15,859 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:15,860 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration23_Loop [2019-11-28 02:59:15,860 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:15,860 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:15,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:15,864 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 02:59:15,868 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 02:59:15,870 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 02:59:15,917 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:15,918 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 123 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 123 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:15,921 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 02:59:15,923 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:15,923 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:15,923 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:15,923 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:15,924 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:59:15,924 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:59:15,927 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 124 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 124 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:15,932 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 02:59:15,934 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:15,934 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:59:15,934 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:15,934 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:15,934 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:15,934 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:59:15,934 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:59:15,936 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 125 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:15,941 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 Waiting until toolchain timeout for monitored process 125 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:15,942 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:15,943 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:15,943 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:15,943 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:15,944 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:59:15,944 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:59:15,946 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 126 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 126 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:15,953 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 02:59:15,954 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:15,954 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:59:15,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:15,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:15,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:15,955 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:59:15,955 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:59:15,957 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:59:15,958 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 02:59:15,958 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 127 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 127 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:15,963 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:59:15,963 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:59:15,963 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:59:15,963 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 9 Supporting invariants [] [2019-11-28 02:59:15,965 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 02:59:15,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:15,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:15,984 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:59:15,984 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:16,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:16,001 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 02:59:16,002 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:16,075 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-11-28 02:59:16,075 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 10 loop predicates [2019-11-28 02:59:16,075 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 187 states and 203 transitions. cyclomatic complexity: 19 Second operand 12 states. [2019-11-28 02:59:16,514 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 187 states and 203 transitions. cyclomatic complexity: 19. Second operand 12 states. Result 1050 states and 1093 transitions. Complement of second has 39 states. [2019-11-28 02:59:16,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 20 states 1 stem states 18 non-accepting loop states 1 accepting loop states [2019-11-28 02:59:16,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-28 02:59:16,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 89 transitions. [2019-11-28 02:59:16,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 89 transitions. Stem has 43 letters. Loop has 72 letters. [2019-11-28 02:59:16,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:16,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 89 transitions. Stem has 115 letters. Loop has 72 letters. [2019-11-28 02:59:16,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:16,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 89 transitions. Stem has 43 letters. Loop has 144 letters. [2019-11-28 02:59:16,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:16,524 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1050 states and 1093 transitions. [2019-11-28 02:59:16,529 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 85 [2019-11-28 02:59:16,533 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1050 states to 720 states and 763 transitions. [2019-11-28 02:59:16,533 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 423 [2019-11-28 02:59:16,534 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 427 [2019-11-28 02:59:16,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 720 states and 763 transitions. [2019-11-28 02:59:16,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:16,539 INFO L688 BuchiCegarLoop]: Abstraction has 720 states and 763 transitions. [2019-11-28 02:59:16,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states and 763 transitions. [2019-11-28 02:59:16,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 457. [2019-11-28 02:59:16,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2019-11-28 02:59:16,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 486 transitions. [2019-11-28 02:59:16,547 INFO L711 BuchiCegarLoop]: Abstraction has 457 states and 486 transitions. [2019-11-28 02:59:16,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:59:16,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 02:59:16,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-11-28 02:59:16,548 INFO L87 Difference]: Start difference. First operand 457 states and 486 transitions. Second operand 13 states. [2019-11-28 02:59:16,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:59:16,627 INFO L93 Difference]: Finished difference Result 370 states and 389 transitions. [2019-11-28 02:59:16,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 02:59:16,628 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 370 states and 389 transitions. [2019-11-28 02:59:16,630 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2019-11-28 02:59:16,632 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 370 states to 303 states and 322 transitions. [2019-11-28 02:59:16,632 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 215 [2019-11-28 02:59:16,632 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 215 [2019-11-28 02:59:16,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 303 states and 322 transitions. [2019-11-28 02:59:16,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:16,633 INFO L688 BuchiCegarLoop]: Abstraction has 303 states and 322 transitions. [2019-11-28 02:59:16,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states and 322 transitions. [2019-11-28 02:59:16,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 191. [2019-11-28 02:59:16,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-11-28 02:59:16,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 206 transitions. [2019-11-28 02:59:16,638 INFO L711 BuchiCegarLoop]: Abstraction has 191 states and 206 transitions. [2019-11-28 02:59:16,638 INFO L591 BuchiCegarLoop]: Abstraction has 191 states and 206 transitions. [2019-11-28 02:59:16,638 INFO L424 BuchiCegarLoop]: ======== Iteration 24============ [2019-11-28 02:59:16,639 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 191 states and 206 transitions. [2019-11-28 02:59:16,640 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2019-11-28 02:59:16,640 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:59:16,640 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:59:16,641 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2019-11-28 02:59:16,641 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [19, 18, 18, 10, 9, 1, 1] [2019-11-28 02:59:16,641 INFO L794 eck$LassoCheckResult]: Stem: 20684#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 20685#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20695#L12 assume !(main_~i~0 >= 10); 20812#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 20810#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20808#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20806#L12 assume !(main_~i~0 >= 10); 20804#L12-2 assume !(main_~i~0 <= 0); 20803#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20688#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20689#L12 assume !(main_~i~0 >= 10); 20682#L12-2 assume !(main_~i~0 <= 0); 20683#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20691#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20800#L12 assume !(main_~i~0 >= 10); 20798#L12-2 assume !(main_~i~0 <= 0); 20796#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20794#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20792#L12 assume !(main_~i~0 >= 10); 20790#L12-2 assume !(main_~i~0 <= 0); 20788#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20786#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20784#L12 assume !(main_~i~0 >= 10); 20782#L12-2 assume !(main_~i~0 <= 0); 20780#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20778#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20776#L12 assume !(main_~i~0 >= 10); 20774#L12-2 assume !(main_~i~0 <= 0); 20772#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20770#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20768#L12 assume !(main_~i~0 >= 10); 20766#L12-2 assume !(main_~i~0 <= 0); 20764#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20762#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20760#L12 assume !(main_~i~0 >= 10); 20758#L12-2 assume !(main_~i~0 <= 0); 20756#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20753#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20705#L12 assume !(main_~i~0 >= 10); 20748#L12-2 assume !(main_~i~0 <= 0); 20745#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20704#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20701#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 20698#L12-2 [2019-11-28 02:59:16,641 INFO L796 eck$LassoCheckResult]: Loop: 20698#L12-2 assume !(main_~i~0 <= 0); 20699#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 20813#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20811#L12 assume !(main_~i~0 >= 10); 20809#L12-2 assume !(main_~i~0 <= 0); 20807#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 20805#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20802#L12 assume !(main_~i~0 >= 10); 20801#L12-2 assume !(main_~i~0 <= 0); 20799#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 20797#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20795#L12 assume !(main_~i~0 >= 10); 20793#L12-2 assume !(main_~i~0 <= 0); 20791#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 20789#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20787#L12 assume !(main_~i~0 >= 10); 20785#L12-2 assume !(main_~i~0 <= 0); 20783#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 20781#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20779#L12 assume !(main_~i~0 >= 10); 20777#L12-2 assume !(main_~i~0 <= 0); 20775#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 20773#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20771#L12 assume !(main_~i~0 >= 10); 20769#L12-2 assume !(main_~i~0 <= 0); 20767#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 20765#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20763#L12 assume !(main_~i~0 >= 10); 20761#L12-2 assume !(main_~i~0 <= 0); 20759#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 20757#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20754#L12 assume !(main_~i~0 >= 10); 20751#L12-2 assume !(main_~i~0 <= 0); 20752#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 20746#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20747#L12 assume !(main_~i~0 >= 10); 20743#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 20742#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20741#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20740#L12 assume !(main_~i~0 >= 10); 20739#L12-2 assume !(main_~i~0 <= 0); 20738#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20737#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20736#L12 assume !(main_~i~0 >= 10); 20735#L12-2 assume !(main_~i~0 <= 0); 20734#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20733#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20732#L12 assume !(main_~i~0 >= 10); 20731#L12-2 assume !(main_~i~0 <= 0); 20730#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20729#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20728#L12 assume !(main_~i~0 >= 10); 20727#L12-2 assume !(main_~i~0 <= 0); 20726#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20725#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20724#L12 assume !(main_~i~0 >= 10); 20723#L12-2 assume !(main_~i~0 <= 0); 20722#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20721#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20720#L12 assume !(main_~i~0 >= 10); 20719#L12-2 assume !(main_~i~0 <= 0); 20718#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20717#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20716#L12 assume !(main_~i~0 >= 10); 20715#L12-2 assume !(main_~i~0 <= 0); 20714#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20713#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20712#L12 assume !(main_~i~0 >= 10); 20711#L12-2 assume !(main_~i~0 <= 0); 20710#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20709#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20708#L12 assume !(main_~i~0 >= 10); 20707#L12-2 assume !(main_~i~0 <= 0); 20706#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20702#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20703#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 20698#L12-2 [2019-11-28 02:59:16,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:16,642 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 16 times [2019-11-28 02:59:16,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:16,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831375671] [2019-11-28 02:59:16,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:16,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:16,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:16,654 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:16,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:16,654 INFO L82 PathProgramCache]: Analyzing trace with hash 289875998, now seen corresponding path program 16 times [2019-11-28 02:59:16,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:16,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477982241] [2019-11-28 02:59:16,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:16,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:16,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:16,668 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:16,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:16,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1498053540, now seen corresponding path program 10 times [2019-11-28 02:59:16,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:16,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247634386] [2019-11-28 02:59:16,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:16,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:16,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1682 backedges. 1158 proven. 153 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2019-11-28 02:59:16,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247634386] [2019-11-28 02:59:16,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880564291] [2019-11-28 02:59:16,770 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 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:59:16,806 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 02:59:16,806 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:59:16,807 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 02:59:16,809 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:16,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1682 backedges. 1158 proven. 153 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2019-11-28 02:59:16,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:59:16,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2019-11-28 02:59:16,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468823073] [2019-11-28 02:59:17,276 WARN L192 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 74 [2019-11-28 02:59:17,289 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:17,289 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:17,289 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:17,289 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:17,289 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:59:17,289 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:17,289 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:17,290 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:17,290 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration24_Loop [2019-11-28 02:59:17,290 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:17,290 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:17,291 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 02:59:17,292 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 02:59:17,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:17,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:17,349 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:17,349 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 129 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 129 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:17,353 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:17,353 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:59:17,357 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:59:17,357 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_27=1} Honda state: {v_rep~unnamed0~0~true_27=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 130 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 130 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:17,362 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:17,362 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:59:17,364 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:59:17,364 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=0} Honda state: {ULTIMATE.start_main_~up~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 131 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 131 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:17,373 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:17,373 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 132 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 132 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:17,380 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:59:17,380 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:59:17,384 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:59:17,385 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:17,385 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:17,385 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:17,385 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:17,385 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:59:17,385 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:17,385 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:17,386 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:17,386 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration24_Loop [2019-11-28 02:59:17,386 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:17,386 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:17,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:17,390 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 02:59:17,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:17,399 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 02:59:17,444 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:17,444 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 133 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 133 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:17,449 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 02:59:17,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:17,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:17,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:17,450 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:17,451 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:59:17,451 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:59:17,454 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 134 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 134 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:17,459 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 02:59:17,460 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:17,461 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:59:17,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:17,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:17,461 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:17,462 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:59:17,462 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:59:17,463 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 135 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 135 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:17,468 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 02:59:17,469 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:17,469 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:59:17,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:17,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:17,469 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:17,470 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:59:17,470 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:59:17,472 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:59:17,474 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 02:59:17,474 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 136 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 136 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:17,477 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:59:17,477 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:59:17,478 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:59:17,478 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 19 Supporting invariants [] [2019-11-28 02:59:17,479 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 02:59:17,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:17,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:17,500 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:59:17,500 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:17,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:17,521 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-28 02:59:17,522 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:17,614 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 513 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-11-28 02:59:17,616 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 11 loop predicates [2019-11-28 02:59:17,616 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 191 states and 206 transitions. cyclomatic complexity: 18 Second operand 13 states. [2019-11-28 02:59:18,259 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 191 states and 206 transitions. cyclomatic complexity: 18. Second operand 13 states. Result 1203 states and 1246 transitions. Complement of second has 43 states. [2019-11-28 02:59:18,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 22 states 1 stem states 20 non-accepting loop states 1 accepting loop states [2019-11-28 02:59:18,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-28 02:59:18,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 96 transitions. [2019-11-28 02:59:18,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 96 transitions. Stem has 43 letters. Loop has 76 letters. [2019-11-28 02:59:18,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:18,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 96 transitions. Stem has 119 letters. Loop has 76 letters. [2019-11-28 02:59:18,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:18,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 96 transitions. Stem has 43 letters. Loop has 152 letters. [2019-11-28 02:59:18,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:18,262 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1203 states and 1246 transitions. [2019-11-28 02:59:18,268 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2019-11-28 02:59:18,273 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1203 states to 796 states and 837 transitions. [2019-11-28 02:59:18,273 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 486 [2019-11-28 02:59:18,274 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 491 [2019-11-28 02:59:18,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 796 states and 837 transitions. [2019-11-28 02:59:18,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:18,275 INFO L688 BuchiCegarLoop]: Abstraction has 796 states and 837 transitions. [2019-11-28 02:59:18,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states and 837 transitions. [2019-11-28 02:59:18,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 464. [2019-11-28 02:59:18,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-11-28 02:59:18,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 489 transitions. [2019-11-28 02:59:18,283 INFO L711 BuchiCegarLoop]: Abstraction has 464 states and 489 transitions. [2019-11-28 02:59:18,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:59:18,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 02:59:18,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-11-28 02:59:18,284 INFO L87 Difference]: Start difference. First operand 464 states and 489 transitions. Second operand 12 states. [2019-11-28 02:59:18,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:59:18,411 INFO L93 Difference]: Finished difference Result 388 states and 402 transitions. [2019-11-28 02:59:18,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 02:59:18,411 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 388 states and 402 transitions. [2019-11-28 02:59:18,413 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2019-11-28 02:59:18,415 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 388 states to 311 states and 325 transitions. [2019-11-28 02:59:18,415 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 223 [2019-11-28 02:59:18,416 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 295 [2019-11-28 02:59:18,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 311 states and 325 transitions. [2019-11-28 02:59:18,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:18,418 INFO L688 BuchiCegarLoop]: Abstraction has 311 states and 325 transitions. [2019-11-28 02:59:18,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states and 325 transitions. [2019-11-28 02:59:18,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 115. [2019-11-28 02:59:18,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-28 02:59:18,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 126 transitions. [2019-11-28 02:59:18,421 INFO L711 BuchiCegarLoop]: Abstraction has 115 states and 126 transitions. [2019-11-28 02:59:18,421 INFO L591 BuchiCegarLoop]: Abstraction has 115 states and 126 transitions. [2019-11-28 02:59:18,421 INFO L424 BuchiCegarLoop]: ======== Iteration 25============ [2019-11-28 02:59:18,421 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 115 states and 126 transitions. [2019-11-28 02:59:18,422 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2019-11-28 02:59:18,422 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:59:18,422 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:59:18,423 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 02:59:18,423 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [20, 19, 19, 10, 10, 1, 1] [2019-11-28 02:59:18,423 INFO L794 eck$LassoCheckResult]: Stem: 23748#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 23749#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23796#L12 [2019-11-28 02:59:18,423 INFO L796 eck$LassoCheckResult]: Loop: 23796#L12 assume !(main_~i~0 >= 10); 23795#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 23794#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 23793#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23792#L12 assume !(main_~i~0 >= 10); 23791#L12-2 assume !(main_~i~0 <= 0); 23790#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 23789#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23788#L12 assume !(main_~i~0 >= 10); 23787#L12-2 assume !(main_~i~0 <= 0); 23786#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 23785#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23784#L12 assume !(main_~i~0 >= 10); 23783#L12-2 assume !(main_~i~0 <= 0); 23782#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 23781#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23780#L12 assume !(main_~i~0 >= 10); 23779#L12-2 assume !(main_~i~0 <= 0); 23778#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 23777#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23776#L12 assume !(main_~i~0 >= 10); 23775#L12-2 assume !(main_~i~0 <= 0); 23774#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 23773#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23772#L12 assume !(main_~i~0 >= 10); 23771#L12-2 assume !(main_~i~0 <= 0); 23770#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 23769#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23768#L12 assume !(main_~i~0 >= 10); 23767#L12-2 assume !(main_~i~0 <= 0); 23766#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 23765#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23764#L12 assume !(main_~i~0 >= 10); 23763#L12-2 assume !(main_~i~0 <= 0); 23762#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 23761#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23760#L12 assume !(main_~i~0 >= 10); 23759#L12-2 assume !(main_~i~0 <= 0); 23758#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 23757#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23756#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 23755#L12-2 assume !(main_~i~0 <= 0); 23747#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 23752#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23753#L12 assume !(main_~i~0 >= 10); 23744#L12-2 assume !(main_~i~0 <= 0); 23745#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 23750#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23751#L12 assume !(main_~i~0 >= 10); 23754#L12-2 assume !(main_~i~0 <= 0); 23858#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 23857#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23856#L12 assume !(main_~i~0 >= 10); 23855#L12-2 assume !(main_~i~0 <= 0); 23854#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 23853#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23852#L12 assume !(main_~i~0 >= 10); 23851#L12-2 assume !(main_~i~0 <= 0); 23850#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 23849#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23848#L12 assume !(main_~i~0 >= 10); 23847#L12-2 assume !(main_~i~0 <= 0); 23846#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 23845#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23844#L12 assume !(main_~i~0 >= 10); 23843#L12-2 assume !(main_~i~0 <= 0); 23842#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 23841#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23840#L12 assume !(main_~i~0 >= 10); 23839#L12-2 assume !(main_~i~0 <= 0); 23838#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 23837#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23836#L12 assume !(main_~i~0 >= 10); 23835#L12-2 assume !(main_~i~0 <= 0); 23809#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 23805#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23806#L12 assume !(main_~i~0 >= 10); 23808#L12-2 assume !(main_~i~0 <= 0); 23807#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 23797#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23796#L12 [2019-11-28 02:59:18,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:18,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1002, now seen corresponding path program 1 times [2019-11-28 02:59:18,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:18,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604117231] [2019-11-28 02:59:18,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:18,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:18,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:18,430 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:18,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:18,430 INFO L82 PathProgramCache]: Analyzing trace with hash -950527111, now seen corresponding path program 17 times [2019-11-28 02:59:18,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:18,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791907230] [2019-11-28 02:59:18,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:18,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:18,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:18,454 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:18,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:18,454 INFO L82 PathProgramCache]: Analyzing trace with hash -2117507742, now seen corresponding path program 11 times [2019-11-28 02:59:18,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:18,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425536840] [2019-11-28 02:59:18,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:18,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:18,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:18,479 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:19,050 WARN L192 SmtUtils]: Spent 566.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 74 [2019-11-28 02:59:19,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 02:59:19 BoogieIcfgContainer [2019-11-28 02:59:19,102 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 02:59:19,103 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 02:59:19,103 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 02:59:19,103 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 02:59:19,104 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:59:01" (3/4) ... [2019-11-28 02:59:19,106 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-28 02:59:19,169 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 02:59:19,169 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 02:59:19,171 INFO L168 Benchmark]: Toolchain (without parser) took 18475.18 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 502.3 MB). Free memory was 961.7 MB in the beginning and 1.4 GB in the end (delta: -485.7 MB). Peak memory consumption was 16.6 MB. Max. memory is 11.5 GB. [2019-11-28 02:59:19,171 INFO L168 Benchmark]: CDTParser took 0.26 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 02:59:19,172 INFO L168 Benchmark]: CACSL2BoogieTranslator took 258.54 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 951.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 02:59:19,172 INFO L168 Benchmark]: Boogie Procedure Inliner took 86.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -178.4 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2019-11-28 02:59:19,172 INFO L168 Benchmark]: Boogie Preprocessor took 20.55 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 02:59:19,173 INFO L168 Benchmark]: RCFGBuilder took 206.84 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: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. [2019-11-28 02:59:19,173 INFO L168 Benchmark]: BuchiAutomizer took 17830.86 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 369.6 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -339.1 MB). Peak memory consumption was 665.4 MB. Max. memory is 11.5 GB. [2019-11-28 02:59:19,174 INFO L168 Benchmark]: Witness Printer took 66.64 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 904.6 kB). Peak memory consumption was 904.6 kB. Max. memory is 11.5 GB. [2019-11-28 02:59:19,176 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.26 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 258.54 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 951.0 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 86.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -178.4 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.55 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. * RCFGBuilder took 206.84 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: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 17830.86 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 369.6 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -339.1 MB). Peak memory consumption was 665.4 MB. Max. memory is 11.5 GB. * Witness Printer took 66.64 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 904.6 kB). Peak memory consumption was 904.6 kB. 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 36 terminating modules (22 trivial, 12 deterministic, 2 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function i and consists of 3 locations. One deterministic module has affine ranking function -2 * i + 1 and consists of 4 locations. One deterministic module has affine ranking function -2 * i + 19 and consists of 4 locations. One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function -1 * i + 6 and consists of 8 locations. One deterministic module has affine ranking function -2 * i + 13 and consists of 10 locations. One deterministic module has affine ranking function -1 * i + 7 and consists of 12 locations. One deterministic module has affine ranking function -2 * i + 15 and consists of 14 locations. One deterministic module has affine ranking function -1 * i + 8 and consists of 16 locations. One deterministic module has affine ranking function -2 * i + 17 and consists of 18 locations. One deterministic module has affine ranking function -1 * i + 9 and consists of 20 locations. One deterministic module has affine ranking function -2 * i + 19 and consists of 22 locations. One nondeterministic module has affine ranking function i and consists of 4 locations. One nondeterministic module has affine ranking function i and consists of 4 locations. 22 modules have a trivial ranking function, the largest among these consists of 13 locations. The remainder module has 115 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 17.7s and 25 iterations. TraceHistogramMax:20. Analysis of lassos took 11.2s. Construction of modules took 2.0s. Büchi inclusion checks took 3.8s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 35. Automata minimization 0.1s AutomataMinimizationTime, 36 MinimizatonAttempts, 2226 StatesRemovedByMinimization, 35 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 191 states and ocurred in iteration 23. Nontrivial modules had stage [12, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1368/3680 HoareTripleCheckerStatistics: 281 SDtfs, 858 SDslu, 9 SDs, 0 SdLazy, 2372 SolverSat, 290 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT2 conc0 concLT10 SILN0 SILU0 SILI9 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital19 mio100 ax161 hnf97 lsp43 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq129 hnf96 smp94 dnf100 smp100 tf113 neg100 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 33ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 28 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 14 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 12]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {up=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1abde993=0, \result=0, i=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 12]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] int up; [L8] i = __VERIFIER_nondet_int() [L9] up = 0 [L11] COND TRUE 0 <= i && i <= 10 Loop: [L12] COND FALSE !(i >= 10) [L15] COND TRUE i <= 0 [L16] up = 1 [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND TRUE i >= 10 [L13] up = 0 [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...