./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 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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.25-9a8b2e8 [2020-10-20 06:36:11,181 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 06:36:11,183 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 06:36:11,207 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 06:36:11,207 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 06:36:11,208 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 06:36:11,210 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 06:36:11,211 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 06:36:11,226 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 06:36:11,227 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 06:36:11,228 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 06:36:11,229 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 06:36:11,230 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 06:36:11,233 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 06:36:11,235 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 06:36:11,237 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 06:36:11,239 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 06:36:11,241 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 06:36:11,243 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 06:36:11,246 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 06:36:11,249 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 06:36:11,251 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 06:36:11,252 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 06:36:11,254 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 06:36:11,257 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 06:36:11,259 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 06:36:11,259 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 06:36:11,261 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 06:36:11,262 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 06:36:11,263 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 06:36:11,269 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 06:36:11,270 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 06:36:11,271 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 06:36:11,272 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 06:36:11,275 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 06:36:11,275 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 06:36:11,276 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 06:36:11,277 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 06:36:11,277 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 06:36:11,278 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 06:36:11,279 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 06:36:11,280 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-10-20 06:36:11,322 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 06:36:11,322 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 06:36:11,323 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 06:36:11,324 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 06:36:11,324 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 06:36:11,324 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-20 06:36:11,324 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-20 06:36:11,325 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-20 06:36:11,325 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-20 06:36:11,325 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-20 06:36:11,325 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-20 06:36:11,326 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 06:36:11,326 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 06:36:11,326 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 06:36:11,326 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 06:36:11,327 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-20 06:36:11,327 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-20 06:36:11,327 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-20 06:36:11,327 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 06:36:11,327 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-20 06:36:11,328 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 06:36:11,328 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-20 06:36:11,328 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 06:36:11,328 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 06:36:11,329 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-20 06:36:11,329 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 06:36:11,329 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 06:36:11,329 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 06:36:11,330 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-20 06:36:11,331 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-20 06:36:11,331 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 [2020-10-20 06:36:11,509 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 06:36:11,521 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 06:36:11,524 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 06:36:11,526 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 06:36:11,526 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 06:36:11,527 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/UpAndDownIneq.c [2020-10-20 06:36:11,583 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eafa608cc/20aa214acfb5454a9acf065db5e764dd/FLAG6ebebb862 [2020-10-20 06:36:11,962 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 06:36:11,963 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/UpAndDownIneq.c [2020-10-20 06:36:11,969 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eafa608cc/20aa214acfb5454a9acf065db5e764dd/FLAG6ebebb862 [2020-10-20 06:36:12,320 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eafa608cc/20aa214acfb5454a9acf065db5e764dd [2020-10-20 06:36:12,323 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 06:36:12,329 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 06:36:12,330 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 06:36:12,331 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 06:36:12,334 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 06:36:12,335 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 06:36:12" (1/1) ... [2020-10-20 06:36:12,338 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@651199fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:36:12, skipping insertion in model container [2020-10-20 06:36:12,338 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 06:36:12" (1/1) ... [2020-10-20 06:36:12,346 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 06:36:12,362 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 06:36:12,562 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:36:12,567 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 06:36:12,579 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:36:12,590 INFO L208 MainTranslator]: Completed translation [2020-10-20 06:36:12,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:36:12 WrapperNode [2020-10-20 06:36:12,590 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 06:36:12,591 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 06:36:12,591 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 06:36:12,591 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 06:36:12,598 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:36:12" (1/1) ... [2020-10-20 06:36:12,602 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:36:12" (1/1) ... [2020-10-20 06:36:12,616 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 06:36:12,617 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 06:36:12,617 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 06:36:12,617 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 06:36:12,627 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:36:12" (1/1) ... [2020-10-20 06:36:12,627 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:36:12" (1/1) ... [2020-10-20 06:36:12,628 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:36:12" (1/1) ... [2020-10-20 06:36:12,628 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:36:12" (1/1) ... [2020-10-20 06:36:12,630 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:36:12" (1/1) ... [2020-10-20 06:36:12,634 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:36:12" (1/1) ... [2020-10-20 06:36:12,635 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:36:12" (1/1) ... [2020-10-20 06:36:12,637 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 06:36:12,637 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 06:36:12,637 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 06:36:12,638 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 06:36:12,638 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:36:12" (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 [2020-10-20 06:36:12,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 06:36:12,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 06:36:12,868 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 06:36:12,869 INFO L298 CfgBuilder]: Removed 5 assume(true) statements. [2020-10-20 06:36:12,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:36:12 BoogieIcfgContainer [2020-10-20 06:36:12,870 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 06:36:12,872 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-20 06:36:12,872 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-20 06:36:12,876 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-20 06:36:12,877 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:36:12,877 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.10 06:36:12" (1/3) ... [2020-10-20 06:36:12,879 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@ddfed3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 06:36:12, skipping insertion in model container [2020-10-20 06:36:12,879 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:36:12,879 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:36:12" (2/3) ... [2020-10-20 06:36:12,880 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@ddfed3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 06:36:12, skipping insertion in model container [2020-10-20 06:36:12,880 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:36:12,880 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:36:12" (3/3) ... [2020-10-20 06:36:12,882 INFO L373 chiAutomizerObserver]: Analyzing ICFG UpAndDownIneq.c [2020-10-20 06:36:12,948 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-20 06:36:12,948 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-20 06:36:12,948 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-20 06:36:12,948 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 06:36:12,949 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 06:36:12,949 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-20 06:36:12,949 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 06:36:12,949 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-20 06:36:12,962 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2020-10-20 06:36:12,980 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-20 06:36:12,981 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:36:12,981 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:36:12,988 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-10-20 06:36:12,988 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 06:36:12,988 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-20 06:36:12,988 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2020-10-20 06:36:12,990 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-20 06:36:12,990 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:36:12,990 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:36:12,990 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-10-20 06:36:12,991 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 06:36:12,998 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 [2020-10-20 06:36:12,999 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 [2020-10-20 06:36:13,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:13,006 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2020-10-20 06:36:13,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:13,014 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958544505] [2020-10-20 06:36:13,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:13,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:13,089 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:13,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:13,093 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:13,105 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:13,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:13,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1234538, now seen corresponding path program 1 times [2020-10-20 06:36:13,107 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:13,107 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924465111] [2020-10-20 06:36:13,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:13,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:13,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:13,161 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924465111] [2020-10-20 06:36:13,161 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:36:13,162 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:36:13,162 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169271117] [2020-10-20 06:36:13,167 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:36:13,168 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:36:13,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:36:13,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:36:13,191 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2020-10-20 06:36:13,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:36:13,262 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2020-10-20 06:36:13,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:36:13,266 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 21 transitions. [2020-10-20 06:36:13,268 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-20 06:36:13,275 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 9 states and 13 transitions. [2020-10-20 06:36:13,277 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-10-20 06:36:13,278 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-10-20 06:36:13,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 13 transitions. [2020-10-20 06:36:13,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:36:13,280 INFO L691 BuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2020-10-20 06:36:13,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 13 transitions. [2020-10-20 06:36:13,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2020-10-20 06:36:13,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-20 06:36:13,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 13 transitions. [2020-10-20 06:36:13,319 INFO L714 BuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2020-10-20 06:36:13,319 INFO L594 BuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2020-10-20 06:36:13,319 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-20 06:36:13,319 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 13 transitions. [2020-10-20 06:36:13,320 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-20 06:36:13,320 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:36:13,321 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:36:13,321 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-10-20 06:36:13,321 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 06:36:13,322 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 [2020-10-20 06:36:13,322 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 [2020-10-20 06:36:13,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:13,323 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2020-10-20 06:36:13,323 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:13,324 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134781350] [2020-10-20 06:36:13,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:13,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:13,331 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:13,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:13,334 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:13,335 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:13,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:13,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1234602, now seen corresponding path program 1 times [2020-10-20 06:36:13,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:13,336 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041239551] [2020-10-20 06:36:13,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:13,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:13,352 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:13,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:13,357 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:13,358 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:13,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:13,359 INFO L82 PathProgramCache]: Analyzing trace with hash 29863753, now seen corresponding path program 1 times [2020-10-20 06:36:13,359 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:13,360 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107538153] [2020-10-20 06:36:13,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:13,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:13,367 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:13,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:13,372 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:13,373 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:13,430 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:36:13,431 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:36:13,432 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:36:13,432 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:36:13,432 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 06:36:13,432 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:13,433 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:36:13,433 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:36:13,433 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration2_Loop [2020-10-20 06:36:13,433 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:36:13,434 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:36:13,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:13,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:13,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:13,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:13,571 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:36:13,572 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) [2020-10-20 06:36:13,582 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:13,582 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 [2020-10-20 06:36:13,591 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 06:36:13,592 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:13,636 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:13,636 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 06:36:13,641 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 06:36:13,641 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:36:13,688 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:13,688 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 [2020-10-20 06:36:13,694 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 06:36:13,695 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) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:13,739 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:13,739 INFO L160 nArgumentSynthesizer]: Using integer mode. 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) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:13,779 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 06:36:13,780 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 06:36:13,786 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 06:36:13,810 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:36:13,810 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:36:13,810 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:36:13,811 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:36:13,811 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:36:13,811 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:13,811 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:36:13,811 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:36:13,811 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration2_Loop [2020-10-20 06:36:13,812 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:36:13,812 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:36:13,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:13,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:13,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:13,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:13,892 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:36:13,898 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) [2020-10-20 06:36:13,902 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 [2020-10-20 06:36:13,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:36:13,905 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:36:13,905 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:36:13,905 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:36:13,912 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:36:13,913 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:36:13,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 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 [2020-10-20 06:36:13,956 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:36:13,958 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:36:13,959 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:36:13,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:36:13,959 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:36:13,962 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:36:13,962 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:36:13,968 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 [2020-10-20 06:36:13,995 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 [2020-10-20 06:36:13,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:36:13,996 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:36:13,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:36:13,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:36:13,997 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:36:13,998 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:36:13,999 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:36:14,007 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) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:14,048 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 [2020-10-20 06:36:14,050 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:36:14,050 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:36:14,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:36:14,050 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:36:14,051 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:36:14,055 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:36:14,055 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:36:14,061 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:36:14,071 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-20 06:36:14,071 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) [2020-10-20 06:36:14,091 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:36:14,091 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 06:36:14,091 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:36:14,092 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 [2020-10-20 06:36:14,125 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 06:36:14,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:14,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:14,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:36:14,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:14,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:14,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 06:36:14,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:14,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:14,206 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 [2020-10-20 06:36:14,207 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 13 transitions. cyclomatic complexity: 5 Second operand 4 states. [2020-10-20 06:36:14,291 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 13 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 24 states and 36 transitions. Complement of second has 7 states. [2020-10-20 06:36:14,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 06:36:14,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-20 06:36:14,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2020-10-20 06:36:14,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 1 letters. Loop has 4 letters. [2020-10-20 06:36:14,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:14,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 5 letters. Loop has 4 letters. [2020-10-20 06:36:14,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:14,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 1 letters. Loop has 8 letters. [2020-10-20 06:36:14,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:14,297 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 36 transitions. [2020-10-20 06:36:14,298 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2020-10-20 06:36:14,299 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 36 transitions. [2020-10-20 06:36:14,299 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-10-20 06:36:14,300 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-10-20 06:36:14,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 36 transitions. [2020-10-20 06:36:14,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:14,300 INFO L691 BuchiCegarLoop]: Abstraction has 24 states and 36 transitions. [2020-10-20 06:36:14,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 36 transitions. [2020-10-20 06:36:14,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2020-10-20 06:36:14,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-10-20 06:36:14,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 34 transitions. [2020-10-20 06:36:14,307 INFO L714 BuchiCegarLoop]: Abstraction has 23 states and 34 transitions. [2020-10-20 06:36:14,307 INFO L594 BuchiCegarLoop]: Abstraction has 23 states and 34 transitions. [2020-10-20 06:36:14,307 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-20 06:36:14,308 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 34 transitions. [2020-10-20 06:36:14,309 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2020-10-20 06:36:14,309 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:36:14,309 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:36:14,310 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:36:14,310 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 06:36:14,310 INFO L794 eck$LassoCheckResult]: Stem: 111#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; 112#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 122#L12 [2020-10-20 06:36:14,310 INFO L796 eck$LassoCheckResult]: Loop: 122#L12 assume !(main_~i~0 >= 10); 125#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 128#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 126#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 122#L12 [2020-10-20 06:36:14,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:14,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1002, now seen corresponding path program 1 times [2020-10-20 06:36:14,311 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:14,311 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176474718] [2020-10-20 06:36:14,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:14,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:14,315 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:14,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:14,318 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:14,319 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:14,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:14,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1389492, now seen corresponding path program 1 times [2020-10-20 06:36:14,319 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:14,320 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731927371] [2020-10-20 06:36:14,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:14,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:14,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:14,332 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731927371] [2020-10-20 06:36:14,333 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:36:14,333 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:36:14,333 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695540572] [2020-10-20 06:36:14,333 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:36:14,334 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:36:14,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:36:14,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:36:14,334 INFO L87 Difference]: Start difference. First operand 23 states and 34 transitions. cyclomatic complexity: 14 Second operand 3 states. [2020-10-20 06:36:14,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:36:14,344 INFO L93 Difference]: Finished difference Result 29 states and 41 transitions. [2020-10-20 06:36:14,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:36:14,345 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 41 transitions. [2020-10-20 06:36:14,346 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2020-10-20 06:36:14,347 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 28 states and 40 transitions. [2020-10-20 06:36:14,347 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2020-10-20 06:36:14,348 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2020-10-20 06:36:14,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 40 transitions. [2020-10-20 06:36:14,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:14,348 INFO L691 BuchiCegarLoop]: Abstraction has 28 states and 40 transitions. [2020-10-20 06:36:14,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 40 transitions. [2020-10-20 06:36:14,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2020-10-20 06:36:14,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-10-20 06:36:14,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 39 transitions. [2020-10-20 06:36:14,352 INFO L714 BuchiCegarLoop]: Abstraction has 27 states and 39 transitions. [2020-10-20 06:36:14,352 INFO L594 BuchiCegarLoop]: Abstraction has 27 states and 39 transitions. [2020-10-20 06:36:14,352 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-20 06:36:14,352 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 39 transitions. [2020-10-20 06:36:14,353 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2020-10-20 06:36:14,353 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:36:14,354 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:36:14,354 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:36:14,354 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 06:36:14,354 INFO L794 eck$LassoCheckResult]: Stem: 169#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; 170#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 178#L12 [2020-10-20 06:36:14,354 INFO L796 eck$LassoCheckResult]: Loop: 178#L12 assume !(main_~i~0 >= 10); 185#L12-2 assume !(main_~i~0 <= 0); 189#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 187#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 178#L12 [2020-10-20 06:36:14,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:14,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1002, now seen corresponding path program 2 times [2020-10-20 06:36:14,355 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:14,355 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088646623] [2020-10-20 06:36:14,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:14,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:14,359 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:14,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:14,361 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:14,362 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:14,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:14,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1391414, now seen corresponding path program 1 times [2020-10-20 06:36:14,363 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:14,363 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514126280] [2020-10-20 06:36:14,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:14,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:14,369 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:14,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:14,372 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:14,373 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:14,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:14,374 INFO L82 PathProgramCache]: Analyzing trace with hash 925835935, now seen corresponding path program 1 times [2020-10-20 06:36:14,374 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:14,374 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962321797] [2020-10-20 06:36:14,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:14,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:14,380 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:14,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:14,384 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:14,385 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:14,415 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:36:14,415 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:36:14,415 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:36:14,416 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:36:14,416 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 06:36:14,416 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:14,416 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:36:14,416 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:36:14,416 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration4_Loop [2020-10-20 06:36:14,416 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:36:14,417 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:36:14,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:14,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:14,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:14,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:14,489 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:36:14,489 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) [2020-10-20 06:36:14,504 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:14,504 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 [2020-10-20 06:36:14,509 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 06:36:14,509 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) [2020-10-20 06:36:14,552 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:14,552 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 [2020-10-20 06:36:14,557 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 06:36:14,557 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) [2020-10-20 06:36:14,602 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:14,603 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 [2020-10-20 06:36:14,606 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 06:36:14,607 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:36:14,649 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:14,649 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 15 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:36:14,696 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 06:36:14,696 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:14,741 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 06:36:14,743 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:36:14,743 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:36:14,743 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:36:14,743 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:36:14,744 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:36:14,744 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:14,744 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:36:14,744 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:36:14,744 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration4_Loop [2020-10-20 06:36:14,744 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:36:14,744 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:36:14,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:14,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:14,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:14,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:14,806 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:36:14,806 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 [2020-10-20 06:36:14,815 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:36:14,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:36:14,816 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:36:14,817 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:36:14,817 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:36:14,819 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:36:14,819 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:36:14,824 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) [2020-10-20 06:36:14,867 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 [2020-10-20 06:36:14,869 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:36:14,869 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:36:14,870 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:36:14,870 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:36:14,870 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:36:14,870 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:36:14,870 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:14,872 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) [2020-10-20 06:36:14,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 [2020-10-20 06:36:14,917 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:36:14,917 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:36:14,917 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:36:14,918 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:36:14,920 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:36:14,920 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:14,924 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:36:14,984 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 [2020-10-20 06:36:14,986 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:36:14,986 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:36:14,987 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:36:14,987 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:36:14,987 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:36:14,990 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:36:14,990 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:14,994 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:36:14,998 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-20 06:36:14,998 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:36:15,022 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:36:15,022 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 06:36:15,022 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:36:15,023 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:15,061 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 06:36:15,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:15,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:15,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:36:15,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:15,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:15,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 06:36:15,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:15,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:15,196 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 [2020-10-20 06:36:15,197 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 39 transitions. cyclomatic complexity: 15 Second operand 5 states. [2020-10-20 06:36:15,241 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 39 transitions. cyclomatic complexity: 15. Second operand 5 states. Result 45 states and 68 transitions. Complement of second has 7 states. [2020-10-20 06:36:15,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 06:36:15,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-20 06:36:15,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2020-10-20 06:36:15,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 2 letters. Loop has 4 letters. [2020-10-20 06:36:15,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:15,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 6 letters. Loop has 4 letters. [2020-10-20 06:36:15,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:15,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 2 letters. Loop has 8 letters. [2020-10-20 06:36:15,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:15,244 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 68 transitions. [2020-10-20 06:36:15,250 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-10-20 06:36:15,255 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 37 states and 55 transitions. [2020-10-20 06:36:15,256 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2020-10-20 06:36:15,259 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2020-10-20 06:36:15,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 55 transitions. [2020-10-20 06:36:15,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:15,259 INFO L691 BuchiCegarLoop]: Abstraction has 37 states and 55 transitions. [2020-10-20 06:36:15,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 55 transitions. [2020-10-20 06:36:15,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2020-10-20 06:36:15,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-10-20 06:36:15,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 44 transitions. [2020-10-20 06:36:15,267 INFO L714 BuchiCegarLoop]: Abstraction has 30 states and 44 transitions. [2020-10-20 06:36:15,269 INFO L594 BuchiCegarLoop]: Abstraction has 30 states and 44 transitions. [2020-10-20 06:36:15,269 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-20 06:36:15,269 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 44 transitions. [2020-10-20 06:36:15,272 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-10-20 06:36:15,272 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:36:15,272 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:36:15,273 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-10-20 06:36:15,273 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 06:36:15,274 INFO L794 eck$LassoCheckResult]: Stem: 284#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; 285#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 295#L12 assume !(main_~i~0 >= 10); 291#L12-2 [2020-10-20 06:36:15,274 INFO L796 eck$LassoCheckResult]: Loop: 291#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 294#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 286#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 287#L12 assume !(main_~i~0 >= 10); 291#L12-2 [2020-10-20 06:36:15,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:15,275 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 1 times [2020-10-20 06:36:15,275 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:15,275 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104838745] [2020-10-20 06:36:15,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:15,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:15,283 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:15,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:15,290 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:15,291 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:15,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:15,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1513900, now seen corresponding path program 1 times [2020-10-20 06:36:15,292 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:15,292 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590032693] [2020-10-20 06:36:15,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:15,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:15,302 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:15,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:15,311 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:15,312 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:15,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:15,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1363918576, now seen corresponding path program 1 times [2020-10-20 06:36:15,313 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:15,313 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128693160] [2020-10-20 06:36:15,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:15,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:15,325 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:15,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:15,329 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:15,330 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:15,356 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:36:15,357 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:36:15,357 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:36:15,357 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:36:15,357 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 06:36:15,357 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:15,357 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:36:15,358 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:36:15,358 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration5_Loop [2020-10-20 06:36:15,358 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:36:15,358 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:36:15,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:15,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:15,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:15,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:15,433 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:36:15,434 INFO L404 LassoAnalysis]: Checking for nontermination... 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) [2020-10-20 06:36:15,439 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:15,439 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:15,444 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 06:36:15,444 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:36:15,481 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:15,482 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 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) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:15,515 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 06:36:15,516 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 06:36:15,541 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 06:36:15,543 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:36:15,543 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:36:15,543 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:36:15,543 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:36:15,543 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:36:15,543 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:15,543 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:36:15,543 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:36:15,543 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration5_Loop [2020-10-20 06:36:15,543 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:36:15,544 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:36:15,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:15,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:15,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:15,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:15,602 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:36:15,602 INFO L489 LassoAnalysis]: Using template 'affine'. 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) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:15,606 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 [2020-10-20 06:36:15,608 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:36:15,608 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:36:15,608 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:36:15,608 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:36:15,608 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:36:15,610 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:36:15,610 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:36:15,613 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:36:15,616 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-20 06:36:15,616 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:15,618 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:36:15,618 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 06:36:15,618 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:36:15,619 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 1 Supporting invariants [] [2020-10-20 06:36:15,643 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 06:36:15,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:15,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:15,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:36:15,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:15,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:15,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 06:36:15,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:15,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:15,753 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 [2020-10-20 06:36:15,753 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 44 transitions. cyclomatic complexity: 17 Second operand 4 states. [2020-10-20 06:36:15,779 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 44 transitions. cyclomatic complexity: 17. Second operand 4 states. Result 76 states and 108 transitions. Complement of second has 7 states. [2020-10-20 06:36:15,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 06:36:15,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-20 06:36:15,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2020-10-20 06:36:15,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 3 letters. Loop has 4 letters. [2020-10-20 06:36:15,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:15,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 7 letters. Loop has 4 letters. [2020-10-20 06:36:15,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:15,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 3 letters. Loop has 8 letters. [2020-10-20 06:36:15,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:15,784 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 108 transitions. [2020-10-20 06:36:15,786 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 26 [2020-10-20 06:36:15,788 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 68 states and 98 transitions. [2020-10-20 06:36:15,788 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2020-10-20 06:36:15,788 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2020-10-20 06:36:15,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 98 transitions. [2020-10-20 06:36:15,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:15,788 INFO L691 BuchiCegarLoop]: Abstraction has 68 states and 98 transitions. [2020-10-20 06:36:15,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 98 transitions. [2020-10-20 06:36:15,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 56. [2020-10-20 06:36:15,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-10-20 06:36:15,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 84 transitions. [2020-10-20 06:36:15,797 INFO L714 BuchiCegarLoop]: Abstraction has 56 states and 84 transitions. [2020-10-20 06:36:15,797 INFO L594 BuchiCegarLoop]: Abstraction has 56 states and 84 transitions. [2020-10-20 06:36:15,797 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-20 06:36:15,797 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 84 transitions. [2020-10-20 06:36:15,798 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2020-10-20 06:36:15,799 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:36:15,799 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:36:15,799 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-20 06:36:15,799 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 06:36:15,800 INFO L794 eck$LassoCheckResult]: Stem: 436#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; 437#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 449#L12 assume !(main_~i~0 >= 10); 452#L12-2 assume !(main_~i~0 <= 0); 433#L15-1 [2020-10-20 06:36:15,800 INFO L796 eck$LassoCheckResult]: Loop: 433#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 438#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 439#L12 assume !(main_~i~0 >= 10); 432#L12-2 assume !(main_~i~0 <= 0); 433#L15-1 [2020-10-20 06:36:15,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:15,800 INFO L82 PathProgramCache]: Analyzing trace with hash 963408, now seen corresponding path program 1 times [2020-10-20 06:36:15,800 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:15,801 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191108713] [2020-10-20 06:36:15,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:15,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:15,805 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:15,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:15,807 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:15,808 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:15,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:15,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1678392, now seen corresponding path program 1 times [2020-10-20 06:36:15,809 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:15,810 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790887018] [2020-10-20 06:36:15,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:15,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:15,816 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:15,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:15,823 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:15,825 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:15,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:15,825 INFO L82 PathProgramCache]: Analyzing trace with hash 670044167, now seen corresponding path program 1 times [2020-10-20 06:36:15,825 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:15,826 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069793008] [2020-10-20 06:36:15,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:15,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:15,856 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:15,856 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069793008] [2020-10-20 06:36:15,856 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:36:15,856 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 06:36:15,857 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270722652] [2020-10-20 06:36:15,880 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:36:15,880 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:36:15,880 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:36:15,880 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:36:15,880 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 06:36:15,880 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:15,880 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:36:15,880 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:36:15,881 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration6_Loop [2020-10-20 06:36:15,881 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:36:15,881 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:36:15,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:15,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:15,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:15,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:15,944 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:36:15,944 INFO L404 LassoAnalysis]: Checking for nontermination... 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) [2020-10-20 06:36:15,947 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:15,947 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:15,973 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 06:36:15,973 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 06:36:16,077 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 06:36:16,078 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:36:16,078 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:36:16,079 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:36:16,079 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:36:16,079 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:36:16,079 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:16,079 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:36:16,079 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:36:16,079 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration6_Loop [2020-10-20 06:36:16,079 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:36:16,079 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:36:16,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:16,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:16,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:16,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:16,144 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:36:16,144 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:36:16,149 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:16,151 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:36:16,151 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:36:16,151 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:36:16,151 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:36:16,151 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:36:16,152 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:36:16,153 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:36:16,154 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:36:16,157 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-20 06:36:16,157 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 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 [2020-10-20 06:36:16,160 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:36:16,160 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 06:36:16,160 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:36:16,161 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 17 Supporting invariants [] [2020-10-20 06:36:16,180 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 06:36:16,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:16,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:16,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:36:16,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:16,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:16,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 06:36:16,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:16,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:16,238 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 [2020-10-20 06:36:16,238 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 84 transitions. cyclomatic complexity: 35 Second operand 4 states. [2020-10-20 06:36:16,291 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 84 transitions. cyclomatic complexity: 35. Second operand 4 states. Result 155 states and 227 transitions. Complement of second has 7 states. [2020-10-20 06:36:16,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 06:36:16,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-20 06:36:16,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2020-10-20 06:36:16,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 4 letters. Loop has 4 letters. [2020-10-20 06:36:16,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:16,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 8 letters. Loop has 4 letters. [2020-10-20 06:36:16,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:16,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 4 letters. Loop has 8 letters. [2020-10-20 06:36:16,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:16,295 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 155 states and 227 transitions. [2020-10-20 06:36:16,299 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 43 [2020-10-20 06:36:16,301 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 155 states to 151 states and 219 transitions. [2020-10-20 06:36:16,301 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2020-10-20 06:36:16,302 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 78 [2020-10-20 06:36:16,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 151 states and 219 transitions. [2020-10-20 06:36:16,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:16,302 INFO L691 BuchiCegarLoop]: Abstraction has 151 states and 219 transitions. [2020-10-20 06:36:16,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states and 219 transitions. [2020-10-20 06:36:16,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 125. [2020-10-20 06:36:16,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2020-10-20 06:36:16,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 189 transitions. [2020-10-20 06:36:16,313 INFO L714 BuchiCegarLoop]: Abstraction has 125 states and 189 transitions. [2020-10-20 06:36:16,313 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:36:16,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:36:16,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:36:16,314 INFO L87 Difference]: Start difference. First operand 125 states and 189 transitions. Second operand 3 states. [2020-10-20 06:36:16,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:36:16,324 INFO L93 Difference]: Finished difference Result 97 states and 129 transitions. [2020-10-20 06:36:16,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:36:16,324 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 97 states and 129 transitions. [2020-10-20 06:36:16,326 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2020-10-20 06:36:16,327 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 97 states to 83 states and 115 transitions. [2020-10-20 06:36:16,328 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2020-10-20 06:36:16,328 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2020-10-20 06:36:16,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 115 transitions. [2020-10-20 06:36:16,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:16,329 INFO L691 BuchiCegarLoop]: Abstraction has 83 states and 115 transitions. [2020-10-20 06:36:16,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 115 transitions. [2020-10-20 06:36:16,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 78. [2020-10-20 06:36:16,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-10-20 06:36:16,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 110 transitions. [2020-10-20 06:36:16,334 INFO L714 BuchiCegarLoop]: Abstraction has 78 states and 110 transitions. [2020-10-20 06:36:16,335 INFO L594 BuchiCegarLoop]: Abstraction has 78 states and 110 transitions. [2020-10-20 06:36:16,335 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-20 06:36:16,335 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 110 transitions. [2020-10-20 06:36:16,336 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 21 [2020-10-20 06:36:16,336 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:36:16,336 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:36:16,337 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2020-10-20 06:36:16,337 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 06:36:16,337 INFO L794 eck$LassoCheckResult]: Stem: 919#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; 920#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 972#L12 assume !(main_~i~0 >= 10); 970#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 965#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 962#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 957#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 915#L12-2 [2020-10-20 06:36:16,338 INFO L796 eck$LassoCheckResult]: Loop: 915#L12-2 assume !(main_~i~0 <= 0); 916#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 921#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 922#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 915#L12-2 [2020-10-20 06:36:16,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:16,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1363918578, now seen corresponding path program 1 times [2020-10-20 06:36:16,338 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:16,339 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228239966] [2020-10-20 06:36:16,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:16,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:16,366 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:16,367 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228239966] [2020-10-20 06:36:16,367 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:36:16,367 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:36:16,367 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609528991] [2020-10-20 06:36:16,368 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:36:16,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:16,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1575402, now seen corresponding path program 2 times [2020-10-20 06:36:16,368 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:16,369 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713202939] [2020-10-20 06:36:16,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:16,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:16,372 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:16,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:16,375 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:16,376 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:16,402 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:36:16,402 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:36:16,402 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:36:16,402 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:36:16,402 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 06:36:16,402 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:16,402 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:36:16,403 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:36:16,403 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration7_Loop [2020-10-20 06:36:16,403 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:36:16,403 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:36:16,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:16,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:16,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:16,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:16,489 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:36:16,489 INFO L404 LassoAnalysis]: Checking for nontermination... 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) [2020-10-20 06:36:16,496 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:16,496 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 [2020-10-20 06:36:16,502 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 06:36:16,502 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 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:16,533 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:16,533 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 06:36:16,538 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 06:36:16,538 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 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:16,560 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:16,560 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 06:36:16,563 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 06:36:16,563 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 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:16,595 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:16,595 INFO L160 nArgumentSynthesizer]: Using integer mode. 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) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:16,618 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 06:36:16,618 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 06:36:16,716 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 06:36:16,717 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:36:16,717 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:36:16,718 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:36:16,718 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:36:16,718 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:36:16,718 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:16,718 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:36:16,718 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:36:16,718 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration7_Loop [2020-10-20 06:36:16,718 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:36:16,718 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:36:16,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:16,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:16,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:16,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:16,792 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:36:16,792 INFO L489 LassoAnalysis]: Using template 'affine'. 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) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:16,796 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 [2020-10-20 06:36:16,798 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:36:16,798 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:36:16,798 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:36:16,798 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:36:16,803 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:36:16,803 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:36:16,806 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 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 [2020-10-20 06:36:16,827 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:36:16,828 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:36:16,828 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:36:16,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:36:16,828 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:36:16,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:36:16,829 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:36:16,829 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:36:16,831 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 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 [2020-10-20 06:36:16,851 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 [2020-10-20 06:36:16,852 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:36:16,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:36:16,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:36:16,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:36:16,855 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:36:16,855 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:36:16,859 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:36:16,895 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 [2020-10-20 06:36:16,896 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:36:16,896 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:36:16,896 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:36:16,896 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:36:16,896 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:36:16,897 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:36:16,898 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:16,900 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:36:16,903 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-20 06:36:16,903 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:36:16,906 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:36:16,906 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 06:36:16,906 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:36:16,907 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:16,928 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 06:36:16,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:16,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:16,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:36:16,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:16,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:16,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 06:36:16,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:16,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:16,967 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 [2020-10-20 06:36:16,967 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 78 states and 110 transitions. cyclomatic complexity: 43 Second operand 4 states. [2020-10-20 06:36:16,999 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 78 states and 110 transitions. cyclomatic complexity: 43. Second operand 4 states. Result 148 states and 199 transitions. Complement of second has 7 states. [2020-10-20 06:36:17,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 06:36:17,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-20 06:36:17,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2020-10-20 06:36:17,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 4 letters. [2020-10-20 06:36:17,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:17,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 4 letters. [2020-10-20 06:36:17,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:17,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 8 letters. [2020-10-20 06:36:17,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:17,005 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 148 states and 199 transitions. [2020-10-20 06:36:17,006 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 25 [2020-10-20 06:36:17,008 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 148 states to 121 states and 162 transitions. [2020-10-20 06:36:17,008 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2020-10-20 06:36:17,009 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2020-10-20 06:36:17,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 162 transitions. [2020-10-20 06:36:17,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:17,009 INFO L691 BuchiCegarLoop]: Abstraction has 121 states and 162 transitions. [2020-10-20 06:36:17,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states and 162 transitions. [2020-10-20 06:36:17,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 101. [2020-10-20 06:36:17,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-10-20 06:36:17,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 140 transitions. [2020-10-20 06:36:17,024 INFO L714 BuchiCegarLoop]: Abstraction has 101 states and 140 transitions. [2020-10-20 06:36:17,028 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:36:17,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 06:36:17,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-20 06:36:17,029 INFO L87 Difference]: Start difference. First operand 101 states and 140 transitions. Second operand 4 states. [2020-10-20 06:36:17,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:36:17,060 INFO L93 Difference]: Finished difference Result 135 states and 179 transitions. [2020-10-20 06:36:17,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 06:36:17,062 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 135 states and 179 transitions. [2020-10-20 06:36:17,063 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 27 [2020-10-20 06:36:17,064 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 135 states to 128 states and 168 transitions. [2020-10-20 06:36:17,064 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2020-10-20 06:36:17,065 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2020-10-20 06:36:17,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 128 states and 168 transitions. [2020-10-20 06:36:17,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:17,065 INFO L691 BuchiCegarLoop]: Abstraction has 128 states and 168 transitions. [2020-10-20 06:36:17,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states and 168 transitions. [2020-10-20 06:36:17,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 109. [2020-10-20 06:36:17,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-10-20 06:36:17,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 142 transitions. [2020-10-20 06:36:17,071 INFO L714 BuchiCegarLoop]: Abstraction has 109 states and 142 transitions. [2020-10-20 06:36:17,071 INFO L594 BuchiCegarLoop]: Abstraction has 109 states and 142 transitions. [2020-10-20 06:36:17,071 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-20 06:36:17,071 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 109 states and 142 transitions. [2020-10-20 06:36:17,072 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 23 [2020-10-20 06:36:17,072 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:36:17,072 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:36:17,073 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2020-10-20 06:36:17,073 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 06:36:17,073 INFO L794 eck$LassoCheckResult]: Stem: 1438#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; 1439#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1490#L12 assume !(main_~i~0 >= 10); 1491#L12-2 assume !(main_~i~0 <= 0); 1535#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 1533#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1531#L12 assume !(main_~i~0 >= 10); 1434#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 1435#L15-1 [2020-10-20 06:36:17,073 INFO L796 eck$LassoCheckResult]: Loop: 1435#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 1440#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1441#L12 assume !(main_~i~0 >= 10); 1518#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 1435#L15-1 [2020-10-20 06:36:17,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:17,073 INFO L82 PathProgramCache]: Analyzing trace with hash 670103747, now seen corresponding path program 1 times [2020-10-20 06:36:17,074 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:17,074 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035928714] [2020-10-20 06:36:17,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:17,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:17,079 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:17,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:17,082 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:17,084 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:17,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:17,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1678390, now seen corresponding path program 2 times [2020-10-20 06:36:17,084 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:17,084 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190550242] [2020-10-20 06:36:17,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:17,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:17,087 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:17,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:17,090 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:17,090 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:17,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:17,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1635542008, now seen corresponding path program 1 times [2020-10-20 06:36:17,091 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:17,091 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858342856] [2020-10-20 06:36:17,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:17,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:17,135 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 06:36:17,136 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858342856] [2020-10-20 06:36:17,136 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:36:17,136 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:36:17,138 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967550436] [2020-10-20 06:36:17,187 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:36:17,188 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:36:17,188 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:36:17,188 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:36:17,188 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 06:36:17,188 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:17,188 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:36:17,188 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:36:17,188 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration8_Loop [2020-10-20 06:36:17,188 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:36:17,188 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:36:17,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:17,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:17,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:17,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:17,261 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:36:17,262 INFO L404 LassoAnalysis]: Checking for nontermination... 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) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:17,276 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:17,276 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 06:36:17,279 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 06:36:17,279 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 42 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:17,300 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:17,301 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 06:36:17,304 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 06:36:17,304 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 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 [2020-10-20 06:36:17,326 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:17,327 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 06:36:17,329 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 06:36:17,329 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 44 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 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:17,351 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:17,351 INFO L160 nArgumentSynthesizer]: Using integer mode. 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 [2020-10-20 06:36:17,378 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 06:36:17,378 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 06:36:17,443 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 06:36:17,444 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:36:17,444 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:36:17,444 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:36:17,444 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:36:17,444 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:36:17,445 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:17,445 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:36:17,445 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:36:17,445 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration8_Loop [2020-10-20 06:36:17,445 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:36:17,445 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:36:17,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:17,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:17,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:17,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:17,511 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:36:17,512 INFO L489 LassoAnalysis]: Using template 'affine'. 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 [2020-10-20 06:36:17,516 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 [2020-10-20 06:36:17,517 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:36:17,517 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:36:17,517 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:36:17,517 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:36:17,517 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:36:17,518 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:36:17,518 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:36:17,522 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 47 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:17,543 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 [2020-10-20 06:36:17,544 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:36:17,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:36:17,544 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:36:17,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:36:17,546 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:36:17,546 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:36:17,549 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 48 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:17,572 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 [2020-10-20 06:36:17,573 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:36:17,573 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:36:17,573 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:36:17,573 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:36:17,574 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:36:17,575 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:36:17,579 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 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:36:17,614 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 [2020-10-20 06:36:17,616 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:36:17,616 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:36:17,616 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:36:17,616 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:36:17,616 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:36:17,617 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:36:17,617 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:17,620 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:36:17,629 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-20 06:36:17,629 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 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:36:17,631 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:36:17,631 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 06:36:17,632 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:36:17,632 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 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:17,661 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 06:36:17,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:17,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:17,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:36:17,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:17,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:17,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 06:36:17,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:17,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:17,694 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 [2020-10-20 06:36:17,694 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 109 states and 142 transitions. cyclomatic complexity: 46 Second operand 3 states. [2020-10-20 06:36:17,736 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 109 states and 142 transitions. cyclomatic complexity: 46. Second operand 3 states. Result 215 states and 277 transitions. Complement of second has 7 states. [2020-10-20 06:36:17,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 06:36:17,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 06:36:17,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2020-10-20 06:36:17,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 8 letters. Loop has 4 letters. [2020-10-20 06:36:17,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:17,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 12 letters. Loop has 4 letters. [2020-10-20 06:36:17,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:17,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 8 letters. Loop has 8 letters. [2020-10-20 06:36:17,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:17,739 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 215 states and 277 transitions. [2020-10-20 06:36:17,740 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 32 [2020-10-20 06:36:17,742 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 215 states to 187 states and 239 transitions. [2020-10-20 06:36:17,742 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2020-10-20 06:36:17,742 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 74 [2020-10-20 06:36:17,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 187 states and 239 transitions. [2020-10-20 06:36:17,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:17,743 INFO L691 BuchiCegarLoop]: Abstraction has 187 states and 239 transitions. [2020-10-20 06:36:17,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states and 239 transitions. [2020-10-20 06:36:17,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 167. [2020-10-20 06:36:17,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2020-10-20 06:36:17,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 218 transitions. [2020-10-20 06:36:17,750 INFO L714 BuchiCegarLoop]: Abstraction has 167 states and 218 transitions. [2020-10-20 06:36:17,750 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:36:17,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 06:36:17,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-20 06:36:17,750 INFO L87 Difference]: Start difference. First operand 167 states and 218 transitions. Second operand 4 states. [2020-10-20 06:36:17,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:36:17,771 INFO L93 Difference]: Finished difference Result 162 states and 201 transitions. [2020-10-20 06:36:17,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 06:36:17,773 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 162 states and 201 transitions. [2020-10-20 06:36:17,775 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 28 [2020-10-20 06:36:17,775 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 162 states to 110 states and 138 transitions. [2020-10-20 06:36:17,776 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 61 [2020-10-20 06:36:17,776 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 64 [2020-10-20 06:36:17,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 110 states and 138 transitions. [2020-10-20 06:36:17,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:17,776 INFO L691 BuchiCegarLoop]: Abstraction has 110 states and 138 transitions. [2020-10-20 06:36:17,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states and 138 transitions. [2020-10-20 06:36:17,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 83. [2020-10-20 06:36:17,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-10-20 06:36:17,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 103 transitions. [2020-10-20 06:36:17,780 INFO L714 BuchiCegarLoop]: Abstraction has 83 states and 103 transitions. [2020-10-20 06:36:17,780 INFO L594 BuchiCegarLoop]: Abstraction has 83 states and 103 transitions. [2020-10-20 06:36:17,780 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-20 06:36:17,780 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 103 transitions. [2020-10-20 06:36:17,781 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2020-10-20 06:36:17,781 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:36:17,781 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:36:17,782 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2020-10-20 06:36:17,782 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 1, 1, 1] [2020-10-20 06:36:17,782 INFO L794 eck$LassoCheckResult]: Stem: 2153#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; 2154#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2171#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 2174#L12-2 assume !(main_~i~0 <= 0); 2173#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 2170#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2159#L12 assume !(main_~i~0 >= 10); 2160#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 2218#L15-1 [2020-10-20 06:36:17,782 INFO L796 eck$LassoCheckResult]: Loop: 2218#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2155#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2156#L12 assume !(main_~i~0 >= 10); 2219#L12-2 assume !(main_~i~0 <= 0); 2220#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2229#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2228#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 2149#L12-2 assume !(main_~i~0 <= 0); 2150#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 2223#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2222#L12 assume !(main_~i~0 >= 10); 2221#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 2218#L15-1 [2020-10-20 06:36:17,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:17,782 INFO L82 PathProgramCache]: Analyzing trace with hash 612845445, now seen corresponding path program 1 times [2020-10-20 06:36:17,782 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:17,783 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655136968] [2020-10-20 06:36:17,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:17,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:17,805 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:17,805 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655136968] [2020-10-20 06:36:17,805 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343482248] [2020-10-20 06:36:17,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:36:17,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:17,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-20 06:36:17,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:17,829 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:17,829 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:36:17,829 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2020-10-20 06:36:17,829 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189212584] [2020-10-20 06:36:17,830 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:36:17,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:17,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1192554916, now seen corresponding path program 1 times [2020-10-20 06:36:17,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:17,830 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107427469] [2020-10-20 06:36:17,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:17,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:17,875 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-20 06:36:17,875 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107427469] [2020-10-20 06:36:17,875 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936113820] [2020-10-20 06:36:17,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:36:17,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:17,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-20 06:36:17,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:17,904 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-20 06:36:17,904 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:36:17,904 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2020-10-20 06:36:17,904 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110625235] [2020-10-20 06:36:17,905 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:36:17,905 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:36:17,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 06:36:17,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-20 06:36:17,905 INFO L87 Difference]: Start difference. First operand 83 states and 103 transitions. cyclomatic complexity: 28 Second operand 4 states. [2020-10-20 06:36:17,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:36:17,932 INFO L93 Difference]: Finished difference Result 87 states and 106 transitions. [2020-10-20 06:36:17,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 06:36:17,933 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 87 states and 106 transitions. [2020-10-20 06:36:17,935 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2020-10-20 06:36:17,936 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 87 states to 80 states and 98 transitions. [2020-10-20 06:36:17,936 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2020-10-20 06:36:17,936 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2020-10-20 06:36:17,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 98 transitions. [2020-10-20 06:36:17,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:17,937 INFO L691 BuchiCegarLoop]: Abstraction has 80 states and 98 transitions. [2020-10-20 06:36:17,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states and 98 transitions. [2020-10-20 06:36:17,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 68. [2020-10-20 06:36:17,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-10-20 06:36:17,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 84 transitions. [2020-10-20 06:36:17,939 INFO L714 BuchiCegarLoop]: Abstraction has 68 states and 84 transitions. [2020-10-20 06:36:17,939 INFO L594 BuchiCegarLoop]: Abstraction has 68 states and 84 transitions. [2020-10-20 06:36:17,939 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-20 06:36:17,939 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 84 transitions. [2020-10-20 06:36:17,940 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2020-10-20 06:36:17,940 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:36:17,940 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:36:17,940 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1] [2020-10-20 06:36:17,941 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 06:36:17,941 INFO L794 eck$LassoCheckResult]: Stem: 2386#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; 2387#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2408#L12 assume !(main_~i~0 >= 10); 2409#L12-2 assume !(main_~i~0 <= 0); 2448#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 2446#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2445#L12 assume !(main_~i~0 >= 10); 2444#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 2443#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2441#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2414#L12 assume !(main_~i~0 >= 10); 2415#L12-2 [2020-10-20 06:36:17,941 INFO L796 eck$LassoCheckResult]: Loop: 2415#L12-2 assume !(main_~i~0 <= 0); 2429#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2428#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2426#L12 assume !(main_~i~0 >= 10); 2415#L12-2 [2020-10-20 06:36:17,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:17,941 INFO L82 PathProgramCache]: Analyzing trace with hash 52759419, now seen corresponding path program 2 times [2020-10-20 06:36:17,941 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:17,942 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042641630] [2020-10-20 06:36:17,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:17,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:17,947 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:17,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:17,950 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:17,952 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:17,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:17,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1573482, now seen corresponding path program 2 times [2020-10-20 06:36:17,952 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:17,952 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892880531] [2020-10-20 06:36:17,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:17,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:17,955 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:17,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:17,957 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:17,958 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:17,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:17,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1971928860, now seen corresponding path program 3 times [2020-10-20 06:36:17,958 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:17,958 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164722535] [2020-10-20 06:36:17,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:17,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:17,964 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:17,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:17,968 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:17,969 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:17,995 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:36:17,995 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:36:17,995 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:36:17,995 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:36:17,995 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 06:36:17,995 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:17,996 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:36:17,996 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:36:17,996 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration10_Loop [2020-10-20 06:36:17,996 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:36:17,996 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:36:17,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:18,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:18,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:18,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:18,056 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:36:18,056 INFO L404 LassoAnalysis]: Checking for nontermination... 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) Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:18,071 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:18,071 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 06:36:18,074 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 06:36:18,074 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 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:36:18,114 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:18,114 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:18,122 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 06:36:18,122 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 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:36:18,157 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:18,157 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 55 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 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:36:18,194 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 06:36:18,195 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:18,231 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 06:36:18,232 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:36:18,232 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:36:18,232 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:36:18,232 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:36:18,232 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:36:18,233 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:18,233 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:36:18,233 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:36:18,233 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration10_Loop [2020-10-20 06:36:18,233 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:36:18,233 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:36:18,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:18,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:18,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:18,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:18,294 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:36:18,294 INFO L489 LassoAnalysis]: Using template 'affine'. 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) Waiting until toolchain timeout for monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:18,298 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 [2020-10-20 06:36:18,299 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:36:18,299 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:36:18,299 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:36:18,299 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:36:18,299 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:36:18,300 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:36:18,300 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:36:18,302 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 58 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 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:18,323 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 [2020-10-20 06:36:18,324 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:36:18,325 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:36:18,325 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:36:18,325 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:36:18,325 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:36:18,326 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:36:18,326 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:36:18,327 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:36:18,329 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-20 06:36:18,330 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 59 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 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:18,333 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:36:18,333 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 06:36:18,333 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:36:18,333 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 17 Supporting invariants [] [2020-10-20 06:36:18,352 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 06:36:18,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:18,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:18,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:36:18,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:18,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:18,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 06:36:18,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:18,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:18,393 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 [2020-10-20 06:36:18,393 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 68 states and 84 transitions. cyclomatic complexity: 23 Second operand 4 states. [2020-10-20 06:36:18,441 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 68 states and 84 transitions. cyclomatic complexity: 23. Second operand 4 states. Result 108 states and 129 transitions. Complement of second has 7 states. [2020-10-20 06:36:18,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 06:36:18,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-20 06:36:18,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2020-10-20 06:36:18,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 11 letters. Loop has 4 letters. [2020-10-20 06:36:18,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:18,442 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-20 06:36:18,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:18,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:18,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:36:18,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:18,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:18,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 06:36:18,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:18,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:18,479 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-20 06:36:18,479 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 68 states and 84 transitions. cyclomatic complexity: 23 Second operand 4 states. [2020-10-20 06:36:18,523 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 68 states and 84 transitions. cyclomatic complexity: 23. Second operand 4 states. Result 108 states and 129 transitions. Complement of second has 7 states. [2020-10-20 06:36:18,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 06:36:18,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-20 06:36:18,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2020-10-20 06:36:18,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 11 letters. Loop has 4 letters. [2020-10-20 06:36:18,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:18,526 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-20 06:36:18,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:18,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:18,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:36:18,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:18,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:18,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 06:36:18,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:18,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:18,575 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 2 loop predicates [2020-10-20 06:36:18,575 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 68 states and 84 transitions. cyclomatic complexity: 23 Second operand 4 states. [2020-10-20 06:36:18,610 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 68 states and 84 transitions. cyclomatic complexity: 23. Second operand 4 states. Result 123 states and 147 transitions. Complement of second has 8 states. [2020-10-20 06:36:18,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 06:36:18,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-20 06:36:18,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2020-10-20 06:36:18,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 11 letters. Loop has 4 letters. [2020-10-20 06:36:18,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:18,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 15 letters. Loop has 4 letters. [2020-10-20 06:36:18,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:18,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 11 letters. Loop has 8 letters. [2020-10-20 06:36:18,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:18,617 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 147 transitions. [2020-10-20 06:36:18,618 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2020-10-20 06:36:18,619 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 88 states and 106 transitions. [2020-10-20 06:36:18,619 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2020-10-20 06:36:18,619 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2020-10-20 06:36:18,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 88 states and 106 transitions. [2020-10-20 06:36:18,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:18,619 INFO L691 BuchiCegarLoop]: Abstraction has 88 states and 106 transitions. [2020-10-20 06:36:18,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states and 106 transitions. [2020-10-20 06:36:18,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 55. [2020-10-20 06:36:18,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-10-20 06:36:18,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. [2020-10-20 06:36:18,621 INFO L714 BuchiCegarLoop]: Abstraction has 55 states and 69 transitions. [2020-10-20 06:36:18,621 INFO L594 BuchiCegarLoop]: Abstraction has 55 states and 69 transitions. [2020-10-20 06:36:18,621 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-10-20 06:36:18,621 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 69 transitions. [2020-10-20 06:36:18,622 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2020-10-20 06:36:18,622 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:36:18,622 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:36:18,623 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 1, 1, 1, 1] [2020-10-20 06:36:18,623 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 2, 2, 1, 1] [2020-10-20 06:36:18,623 INFO L794 eck$LassoCheckResult]: Stem: 2971#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; 2972#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3010#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 3012#L12-2 assume !(main_~i~0 <= 0); 3011#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 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); 3005#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 3003#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3001#L12 assume !(main_~i~0 >= 10); 2988#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 2994#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2997#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2995#L12 assume !(main_~i~0 >= 10); 2993#L12-2 assume !(main_~i~0 <= 0); 2981#L15-1 [2020-10-20 06:36:18,623 INFO L796 eck$LassoCheckResult]: Loop: 2981#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2973#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2974#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 2977#L12-2 assume !(main_~i~0 <= 0); 2979#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 2980#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3021#L12 assume !(main_~i~0 >= 10); 3006#L12-2 assume !(main_~i~0 <= 0); 2999#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 3002#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;main_~up~0 := 1; 2994#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2997#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2995#L12 assume !(main_~i~0 >= 10); 2993#L12-2 assume !(main_~i~0 <= 0); 2981#L15-1 [2020-10-20 06:36:18,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:18,623 INFO L82 PathProgramCache]: Analyzing trace with hash -120270543, now seen corresponding path program 1 times [2020-10-20 06:36:18,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:18,624 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397012563] [2020-10-20 06:36:18,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:18,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:18,646 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:18,647 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397012563] [2020-10-20 06:36:18,647 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701121708] [2020-10-20 06:36:18,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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) [2020-10-20 06:36:18,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:18,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 06:36:18,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:36:18,691 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:18,691 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:36:18,691 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2020-10-20 06:36:18,692 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919648816] [2020-10-20 06:36:18,692 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:36:18,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:18,692 INFO L82 PathProgramCache]: Analyzing trace with hash 511811097, now seen corresponding path program 2 times [2020-10-20 06:36:18,693 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:18,693 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104987248] [2020-10-20 06:36:18,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:18,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:18,715 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:18,715 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104987248] [2020-10-20 06:36:18,716 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754327126] [2020-10-20 06:36:18,716 INFO L93 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) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:36:18,732 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 06:36:18,733 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:36:18,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 06:36:18,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:18,747 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:18,747 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:36:18,747 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2020-10-20 06:36:18,747 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155889792] [2020-10-20 06:36:18,748 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:36:18,748 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:36:18,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 06:36:18,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-20 06:36:18,748 INFO L87 Difference]: Start difference. First operand 55 states and 69 transitions. cyclomatic complexity: 20 Second operand 5 states. [2020-10-20 06:36:18,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:36:18,779 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2020-10-20 06:36:18,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 06:36:18,780 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 100 transitions. [2020-10-20 06:36:18,781 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2020-10-20 06:36:18,781 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 79 states and 97 transitions. [2020-10-20 06:36:18,781 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2020-10-20 06:36:18,782 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2020-10-20 06:36:18,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 97 transitions. [2020-10-20 06:36:18,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:18,782 INFO L691 BuchiCegarLoop]: Abstraction has 79 states and 97 transitions. [2020-10-20 06:36:18,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 97 transitions. [2020-10-20 06:36:18,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 66. [2020-10-20 06:36:18,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-10-20 06:36:18,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 82 transitions. [2020-10-20 06:36:18,784 INFO L714 BuchiCegarLoop]: Abstraction has 66 states and 82 transitions. [2020-10-20 06:36:18,784 INFO L594 BuchiCegarLoop]: Abstraction has 66 states and 82 transitions. [2020-10-20 06:36:18,784 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-10-20 06:36:18,784 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 82 transitions. [2020-10-20 06:36:18,785 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2020-10-20 06:36:18,785 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:36:18,785 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:36:18,786 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 3, 1, 1, 1, 1] [2020-10-20 06:36:18,786 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [5, 4, 4, 3, 2, 1, 1] [2020-10-20 06:36:18,786 INFO L794 eck$LassoCheckResult]: Stem: 3208#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; 3209#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3213#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 3267#L12-2 assume !(main_~i~0 <= 0); 3266#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 3265#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3214#L12 assume !(main_~i~0 >= 10); 3215#L12-2 assume !(main_~i~0 <= 0); 3269#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 3268#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3216#L12 assume !(main_~i~0 >= 10); 3217#L12-2 assume !(main_~i~0 <= 0); 3258#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 3255#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3256#L12 assume !(main_~i~0 >= 10); 3235#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 3227#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3228#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3223#L12 assume !(main_~i~0 >= 10); 3224#L12-2 assume !(main_~i~0 <= 0); 3218#L15-1 [2020-10-20 06:36:18,786 INFO L796 eck$LassoCheckResult]: Loop: 3218#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3219#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3264#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 3204#L12-2 assume !(main_~i~0 <= 0); 3205#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 3210#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3211#L12 assume !(main_~i~0 >= 10); 3263#L12-2 assume !(main_~i~0 <= 0); 3262#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 3261#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3260#L12 assume !(main_~i~0 >= 10); 3259#L12-2 assume !(main_~i~0 <= 0); 3257#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 3254#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3230#L12 assume !(main_~i~0 >= 10); 3231#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 3227#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3228#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3223#L12 assume !(main_~i~0 >= 10); 3224#L12-2 assume !(main_~i~0 <= 0); 3218#L15-1 [2020-10-20 06:36:18,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:18,786 INFO L82 PathProgramCache]: Analyzing trace with hash -353280474, now seen corresponding path program 2 times [2020-10-20 06:36:18,787 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:18,787 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631235965] [2020-10-20 06:36:18,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:18,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:18,823 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:18,823 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631235965] [2020-10-20 06:36:18,823 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273387138] [2020-10-20 06:36:18,823 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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 [2020-10-20 06:36:18,845 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 06:36:18,845 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:36:18,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-20 06:36:18,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:18,858 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:18,859 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:36:18,859 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2020-10-20 06:36:18,859 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553442215] [2020-10-20 06:36:18,859 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:36:18,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:18,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1575127282, now seen corresponding path program 3 times [2020-10-20 06:36:18,860 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:18,860 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412910154] [2020-10-20 06:36:18,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:18,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:18,888 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 25 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:18,888 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412910154] [2020-10-20 06:36:18,888 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666998574] [2020-10-20 06:36:18,888 INFO L93 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 [2020-10-20 06:36:18,912 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2020-10-20 06:36:18,913 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:36:18,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-20 06:36:18,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:18,925 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 25 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:18,926 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:36:18,926 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2020-10-20 06:36:18,926 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137679674] [2020-10-20 06:36:18,927 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:36:18,927 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:36:18,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 06:36:18,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-10-20 06:36:18,928 INFO L87 Difference]: Start difference. First operand 66 states and 82 transitions. cyclomatic complexity: 22 Second operand 6 states. [2020-10-20 06:36:18,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:36:18,980 INFO L93 Difference]: Finished difference Result 97 states and 119 transitions. [2020-10-20 06:36:18,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 06:36:18,982 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 97 states and 119 transitions. [2020-10-20 06:36:18,983 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2020-10-20 06:36:18,984 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 97 states to 95 states and 116 transitions. [2020-10-20 06:36:18,984 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2020-10-20 06:36:18,984 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2020-10-20 06:36:18,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 116 transitions. [2020-10-20 06:36:18,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:18,985 INFO L691 BuchiCegarLoop]: Abstraction has 95 states and 116 transitions. [2020-10-20 06:36:18,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states and 116 transitions. [2020-10-20 06:36:18,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 78. [2020-10-20 06:36:18,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-10-20 06:36:18,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 96 transitions. [2020-10-20 06:36:18,987 INFO L714 BuchiCegarLoop]: Abstraction has 78 states and 96 transitions. [2020-10-20 06:36:18,988 INFO L594 BuchiCegarLoop]: Abstraction has 78 states and 96 transitions. [2020-10-20 06:36:18,988 INFO L427 BuchiCegarLoop]: ======== Iteration 13============ [2020-10-20 06:36:18,988 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 96 transitions. [2020-10-20 06:36:18,988 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2020-10-20 06:36:18,989 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:36:18,989 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:36:18,990 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 4, 1, 1, 1, 1] [2020-10-20 06:36:18,990 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 5, 4, 2, 1, 1] [2020-10-20 06:36:18,990 INFO L794 eck$LassoCheckResult]: Stem: 3498#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; 3499#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3503#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 3567#L12-2 assume !(main_~i~0 <= 0); 3566#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 3565#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3504#L12 assume !(main_~i~0 >= 10); 3505#L12-2 assume !(main_~i~0 <= 0); 3569#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 3568#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3506#L12 assume !(main_~i~0 >= 10); 3507#L12-2 assume !(main_~i~0 <= 0); 3571#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 3570#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3545#L12 assume !(main_~i~0 >= 10); 3564#L12-2 assume !(main_~i~0 <= 0); 3548#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 3544#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3546#L12 assume !(main_~i~0 >= 10); 3523#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 3517#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3518#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3513#L12 assume !(main_~i~0 >= 10); 3514#L12-2 assume !(main_~i~0 <= 0); 3509#L15-1 [2020-10-20 06:36:18,990 INFO L796 eck$LassoCheckResult]: Loop: 3509#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3500#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3501#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 3494#L12-2 assume !(main_~i~0 <= 0); 3495#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 3508#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3563#L12 assume !(main_~i~0 >= 10); 3562#L12-2 assume !(main_~i~0 <= 0); 3561#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 3560#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3559#L12 assume !(main_~i~0 >= 10); 3558#L12-2 assume !(main_~i~0 <= 0); 3557#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 3556#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3555#L12 assume !(main_~i~0 >= 10); 3554#L12-2 assume !(main_~i~0 <= 0); 3547#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 3543#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3524#L12 assume !(main_~i~0 >= 10); 3525#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 3517#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3518#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3513#L12 assume !(main_~i~0 >= 10); 3514#L12-2 assume !(main_~i~0 <= 0); 3509#L15-1 [2020-10-20 06:36:18,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:18,991 INFO L82 PathProgramCache]: Analyzing trace with hash 828663963, now seen corresponding path program 3 times [2020-10-20 06:36:18,991 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:18,991 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830877294] [2020-10-20 06:36:18,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:18,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:19,029 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 27 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:19,029 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830877294] [2020-10-20 06:36:19,030 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725358604] [2020-10-20 06:36:19,030 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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 [2020-10-20 06:36:19,048 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2020-10-20 06:36:19,048 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:36:19,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-20 06:36:19,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:19,067 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 27 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:19,068 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:36:19,068 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2020-10-20 06:36:19,068 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788105485] [2020-10-20 06:36:19,068 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:36:19,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:19,069 INFO L82 PathProgramCache]: Analyzing trace with hash -779498109, now seen corresponding path program 4 times [2020-10-20 06:36:19,069 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:19,069 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605257849] [2020-10-20 06:36:19,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:19,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:19,109 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 32 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:19,109 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605257849] [2020-10-20 06:36:19,109 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442814521] [2020-10-20 06:36:19,109 INFO L93 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) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:36:19,127 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-20 06:36:19,127 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:36:19,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-20 06:36:19,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:19,141 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 32 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:19,141 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:36:19,141 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2020-10-20 06:36:19,141 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877948109] [2020-10-20 06:36:19,142 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:36:19,142 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:36:19,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 06:36:19,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-10-20 06:36:19,142 INFO L87 Difference]: Start difference. First operand 78 states and 96 transitions. cyclomatic complexity: 24 Second operand 7 states. [2020-10-20 06:36:19,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:36:19,185 INFO L93 Difference]: Finished difference Result 113 states and 138 transitions. [2020-10-20 06:36:19,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 06:36:19,186 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 113 states and 138 transitions. [2020-10-20 06:36:19,187 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2020-10-20 06:36:19,188 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 113 states to 111 states and 135 transitions. [2020-10-20 06:36:19,188 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2020-10-20 06:36:19,188 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2020-10-20 06:36:19,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 111 states and 135 transitions. [2020-10-20 06:36:19,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:19,188 INFO L691 BuchiCegarLoop]: Abstraction has 111 states and 135 transitions. [2020-10-20 06:36:19,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states and 135 transitions. [2020-10-20 06:36:19,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 90. [2020-10-20 06:36:19,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-10-20 06:36:19,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 110 transitions. [2020-10-20 06:36:19,190 INFO L714 BuchiCegarLoop]: Abstraction has 90 states and 110 transitions. [2020-10-20 06:36:19,190 INFO L594 BuchiCegarLoop]: Abstraction has 90 states and 110 transitions. [2020-10-20 06:36:19,191 INFO L427 BuchiCegarLoop]: ======== Iteration 14============ [2020-10-20 06:36:19,191 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states and 110 transitions. [2020-10-20 06:36:19,191 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2020-10-20 06:36:19,191 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:36:19,191 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:36:19,192 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [7, 6, 6, 5, 1, 1, 1, 1] [2020-10-20 06:36:19,193 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [7, 6, 6, 5, 2, 1, 1] [2020-10-20 06:36:19,193 INFO L794 eck$LassoCheckResult]: Stem: 3842#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; 3843#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3847#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 3919#L12-2 assume !(main_~i~0 <= 0); 3918#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 3917#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3848#L12 assume !(main_~i~0 >= 10); 3849#L12-2 assume !(main_~i~0 <= 0); 3926#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 3924#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3850#L12 assume !(main_~i~0 >= 10); 3851#L12-2 assume !(main_~i~0 <= 0); 3927#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 3925#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3923#L12 assume !(main_~i~0 >= 10); 3922#L12-2 assume !(main_~i~0 <= 0); 3921#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 3920#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3892#L12 assume !(main_~i~0 >= 10); 3902#L12-2 assume !(main_~i~0 <= 0); 3895#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 3891#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3893#L12 assume !(main_~i~0 >= 10); 3869#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 3861#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3862#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3857#L12 assume !(main_~i~0 >= 10); 3858#L12-2 assume !(main_~i~0 <= 0); 3853#L15-1 [2020-10-20 06:36:19,193 INFO L796 eck$LassoCheckResult]: Loop: 3853#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3844#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3845#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 3838#L12-2 assume !(main_~i~0 <= 0); 3839#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 3852#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3916#L12 assume !(main_~i~0 >= 10); 3915#L12-2 assume !(main_~i~0 <= 0); 3914#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 3913#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3912#L12 assume !(main_~i~0 >= 10); 3911#L12-2 assume !(main_~i~0 <= 0); 3910#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 3909#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3908#L12 assume !(main_~i~0 >= 10); 3907#L12-2 assume !(main_~i~0 <= 0); 3906#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 3905#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3904#L12 assume !(main_~i~0 >= 10); 3903#L12-2 assume !(main_~i~0 <= 0); 3896#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 3894#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3864#L12 assume !(main_~i~0 >= 10); 3865#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 3861#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3862#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3857#L12 assume !(main_~i~0 >= 10); 3858#L12-2 assume !(main_~i~0 <= 0); 3853#L15-1 [2020-10-20 06:36:19,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:19,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1716309872, now seen corresponding path program 4 times [2020-10-20 06:36:19,193 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:19,194 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339692134] [2020-10-20 06:36:19,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:19,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:19,236 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 33 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:19,236 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339692134] [2020-10-20 06:36:19,236 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042440408] [2020-10-20 06:36:19,236 INFO L93 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 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 [2020-10-20 06:36:19,264 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-20 06:36:19,264 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:36:19,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-20 06:36:19,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:19,282 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 33 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:19,282 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:36:19,282 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2020-10-20 06:36:19,283 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026218976] [2020-10-20 06:36:19,283 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:36:19,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:19,283 INFO L82 PathProgramCache]: Analyzing trace with hash 759947640, now seen corresponding path program 5 times [2020-10-20 06:36:19,283 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:19,284 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013803328] [2020-10-20 06:36:19,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:19,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:19,333 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 39 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:19,333 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013803328] [2020-10-20 06:36:19,333 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100019299] [2020-10-20 06:36:19,334 INFO L93 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 [2020-10-20 06:36:19,383 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2020-10-20 06:36:19,383 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:36:19,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-20 06:36:19,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:19,416 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 39 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:19,417 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:36:19,417 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2020-10-20 06:36:19,417 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67818120] [2020-10-20 06:36:19,419 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:36:19,419 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:36:19,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 06:36:19,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-10-20 06:36:19,420 INFO L87 Difference]: Start difference. First operand 90 states and 110 transitions. cyclomatic complexity: 26 Second operand 8 states. [2020-10-20 06:36:19,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:36:19,490 INFO L93 Difference]: Finished difference Result 129 states and 157 transitions. [2020-10-20 06:36:19,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 06:36:19,490 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 129 states and 157 transitions. [2020-10-20 06:36:19,491 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2020-10-20 06:36:19,492 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 129 states to 127 states and 154 transitions. [2020-10-20 06:36:19,492 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2020-10-20 06:36:19,492 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2020-10-20 06:36:19,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 127 states and 154 transitions. [2020-10-20 06:36:19,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:19,493 INFO L691 BuchiCegarLoop]: Abstraction has 127 states and 154 transitions. [2020-10-20 06:36:19,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states and 154 transitions. [2020-10-20 06:36:19,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 102. [2020-10-20 06:36:19,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-10-20 06:36:19,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 124 transitions. [2020-10-20 06:36:19,495 INFO L714 BuchiCegarLoop]: Abstraction has 102 states and 124 transitions. [2020-10-20 06:36:19,495 INFO L594 BuchiCegarLoop]: Abstraction has 102 states and 124 transitions. [2020-10-20 06:36:19,495 INFO L427 BuchiCegarLoop]: ======== Iteration 15============ [2020-10-20 06:36:19,495 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 124 transitions. [2020-10-20 06:36:19,496 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2020-10-20 06:36:19,496 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:36:19,496 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:36:19,497 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [8, 7, 7, 6, 1, 1, 1, 1] [2020-10-20 06:36:19,497 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [8, 7, 7, 6, 2, 1, 1] [2020-10-20 06:36:19,497 INFO L794 eck$LassoCheckResult]: Stem: 4240#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; 4241#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4245#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 4325#L12-2 assume !(main_~i~0 <= 0); 4324#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 4323#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4246#L12 assume !(main_~i~0 >= 10); 4247#L12-2 assume !(main_~i~0 <= 0); 4336#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 4334#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4248#L12 assume !(main_~i~0 >= 10); 4249#L12-2 assume !(main_~i~0 <= 0); 4337#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 4335#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4333#L12 assume !(main_~i~0 >= 10); 4332#L12-2 assume !(main_~i~0 <= 0); 4331#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 4330#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4329#L12 assume !(main_~i~0 >= 10); 4328#L12-2 assume !(main_~i~0 <= 0); 4327#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 4326#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4295#L12 assume !(main_~i~0 >= 10); 4322#L12-2 assume !(main_~i~0 <= 0); 4298#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 4294#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4296#L12 assume !(main_~i~0 >= 10); 4267#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 4259#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4260#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4255#L12 assume !(main_~i~0 >= 10); 4256#L12-2 assume !(main_~i~0 <= 0); 4251#L15-1 [2020-10-20 06:36:19,498 INFO L796 eck$LassoCheckResult]: Loop: 4251#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4242#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4243#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 4236#L12-2 assume !(main_~i~0 <= 0); 4237#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 4250#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4321#L12 assume !(main_~i~0 >= 10); 4320#L12-2 assume !(main_~i~0 <= 0); 4319#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 4318#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4317#L12 assume !(main_~i~0 >= 10); 4316#L12-2 assume !(main_~i~0 <= 0); 4315#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 4314#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4313#L12 assume !(main_~i~0 >= 10); 4312#L12-2 assume !(main_~i~0 <= 0); 4311#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 4310#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4309#L12 assume !(main_~i~0 >= 10); 4308#L12-2 assume !(main_~i~0 <= 0); 4307#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 4306#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4305#L12 assume !(main_~i~0 >= 10); 4304#L12-2 assume !(main_~i~0 <= 0); 4297#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 4293#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4262#L12 assume !(main_~i~0 >= 10); 4263#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 4259#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4260#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4255#L12 assume !(main_~i~0 >= 10); 4256#L12-2 assume !(main_~i~0 <= 0); 4251#L15-1 [2020-10-20 06:36:19,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:19,498 INFO L82 PathProgramCache]: Analyzing trace with hash 750974469, now seen corresponding path program 5 times [2020-10-20 06:36:19,498 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:19,498 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278154151] [2020-10-20 06:36:19,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:19,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:19,552 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 39 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:19,553 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278154151] [2020-10-20 06:36:19,553 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592593705] [2020-10-20 06:36:19,553 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 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 [2020-10-20 06:36:19,579 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2020-10-20 06:36:19,580 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:36:19,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-20 06:36:19,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:19,600 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 39 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:19,600 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:36:19,601 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2020-10-20 06:36:19,601 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936582758] [2020-10-20 06:36:19,601 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:36:19,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:19,602 INFO L82 PathProgramCache]: Analyzing trace with hash -246877459, now seen corresponding path program 6 times [2020-10-20 06:36:19,602 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:19,602 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31358962] [2020-10-20 06:36:19,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:19,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:19,661 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 46 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:19,662 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31358962] [2020-10-20 06:36:19,662 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977678943] [2020-10-20 06:36:19,662 INFO L93 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 [2020-10-20 06:36:19,683 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2020-10-20 06:36:19,683 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:36:19,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-20 06:36:19,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:19,710 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 46 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:19,711 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:36:19,711 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2020-10-20 06:36:19,711 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273191422] [2020-10-20 06:36:19,711 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:36:19,711 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:36:19,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-20 06:36:19,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-10-20 06:36:19,712 INFO L87 Difference]: Start difference. First operand 102 states and 124 transitions. cyclomatic complexity: 28 Second operand 9 states. [2020-10-20 06:36:19,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:36:19,772 INFO L93 Difference]: Finished difference Result 145 states and 176 transitions. [2020-10-20 06:36:19,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-20 06:36:19,773 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 145 states and 176 transitions. [2020-10-20 06:36:19,774 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 37 [2020-10-20 06:36:19,775 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 145 states to 143 states and 173 transitions. [2020-10-20 06:36:19,775 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2020-10-20 06:36:19,775 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2020-10-20 06:36:19,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 143 states and 173 transitions. [2020-10-20 06:36:19,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:19,776 INFO L691 BuchiCegarLoop]: Abstraction has 143 states and 173 transitions. [2020-10-20 06:36:19,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states and 173 transitions. [2020-10-20 06:36:19,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 114. [2020-10-20 06:36:19,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2020-10-20 06:36:19,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 138 transitions. [2020-10-20 06:36:19,778 INFO L714 BuchiCegarLoop]: Abstraction has 114 states and 138 transitions. [2020-10-20 06:36:19,779 INFO L594 BuchiCegarLoop]: Abstraction has 114 states and 138 transitions. [2020-10-20 06:36:19,779 INFO L427 BuchiCegarLoop]: ======== Iteration 16============ [2020-10-20 06:36:19,779 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 114 states and 138 transitions. [2020-10-20 06:36:19,779 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2020-10-20 06:36:19,780 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:36:19,780 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:36:19,781 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [9, 8, 8, 7, 1, 1, 1, 1] [2020-10-20 06:36:19,781 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [9, 8, 8, 7, 2, 1, 1] [2020-10-20 06:36:19,781 INFO L794 eck$LassoCheckResult]: Stem: 4692#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; 4693#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4697#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 4785#L12-2 assume !(main_~i~0 <= 0); 4784#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 4783#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4698#L12 assume !(main_~i~0 >= 10); 4699#L12-2 assume !(main_~i~0 <= 0); 4800#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 4798#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4700#L12 assume !(main_~i~0 >= 10); 4701#L12-2 assume !(main_~i~0 <= 0); 4801#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 4799#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4797#L12 assume !(main_~i~0 >= 10); 4796#L12-2 assume !(main_~i~0 <= 0); 4795#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 4794#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4793#L12 assume !(main_~i~0 >= 10); 4792#L12-2 assume !(main_~i~0 <= 0); 4791#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 4790#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4789#L12 assume !(main_~i~0 >= 10); 4788#L12-2 assume !(main_~i~0 <= 0); 4787#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 4786#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4750#L12 assume !(main_~i~0 >= 10); 4760#L12-2 assume !(main_~i~0 <= 0); 4753#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 4749#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4751#L12 assume !(main_~i~0 >= 10); 4719#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 4711#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4712#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4707#L12 assume !(main_~i~0 >= 10); 4708#L12-2 assume !(main_~i~0 <= 0); 4703#L15-1 [2020-10-20 06:36:19,781 INFO L796 eck$LassoCheckResult]: Loop: 4703#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4694#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4695#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 4688#L12-2 assume !(main_~i~0 <= 0); 4689#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 4702#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4782#L12 assume !(main_~i~0 >= 10); 4781#L12-2 assume !(main_~i~0 <= 0); 4780#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 4779#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4778#L12 assume !(main_~i~0 >= 10); 4777#L12-2 assume !(main_~i~0 <= 0); 4776#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 4775#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4774#L12 assume !(main_~i~0 >= 10); 4773#L12-2 assume !(main_~i~0 <= 0); 4772#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 4771#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4770#L12 assume !(main_~i~0 >= 10); 4769#L12-2 assume !(main_~i~0 <= 0); 4768#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 4767#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4766#L12 assume !(main_~i~0 >= 10); 4765#L12-2 assume !(main_~i~0 <= 0); 4764#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 4763#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4762#L12 assume !(main_~i~0 >= 10); 4761#L12-2 assume !(main_~i~0 <= 0); 4754#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 4752#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4714#L12 assume !(main_~i~0 >= 10); 4715#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 4711#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4712#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4707#L12 assume !(main_~i~0 >= 10); 4708#L12-2 assume !(main_~i~0 <= 0); 4703#L15-1 [2020-10-20 06:36:19,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:19,781 INFO L82 PathProgramCache]: Analyzing trace with hash 2128148730, now seen corresponding path program 6 times [2020-10-20 06:36:19,782 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:19,782 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320653920] [2020-10-20 06:36:19,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:19,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:19,847 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 45 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:19,847 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320653920] [2020-10-20 06:36:19,848 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324917633] [2020-10-20 06:36:19,848 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE 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 [2020-10-20 06:36:19,875 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2020-10-20 06:36:19,875 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:36:19,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-20 06:36:19,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:19,895 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 45 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:19,895 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:36:19,895 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2020-10-20 06:36:19,895 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418992046] [2020-10-20 06:36:19,896 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:36:19,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:19,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1690714594, now seen corresponding path program 7 times [2020-10-20 06:36:19,896 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:19,896 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848317634] [2020-10-20 06:36:19,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:19,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:19,968 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 53 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:19,968 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848317634] [2020-10-20 06:36:19,969 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542968824] [2020-10-20 06:36:19,969 INFO L93 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 [2020-10-20 06:36:19,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:19,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-20 06:36:19,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:20,003 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 53 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:20,003 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:36:20,003 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2020-10-20 06:36:20,004 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776727469] [2020-10-20 06:36:20,004 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:36:20,004 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:36:20,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 06:36:20,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-10-20 06:36:20,004 INFO L87 Difference]: Start difference. First operand 114 states and 138 transitions. cyclomatic complexity: 30 Second operand 10 states. [2020-10-20 06:36:20,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:36:20,087 INFO L93 Difference]: Finished difference Result 161 states and 195 transitions. [2020-10-20 06:36:20,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-20 06:36:20,087 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 161 states and 195 transitions. [2020-10-20 06:36:20,088 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 41 [2020-10-20 06:36:20,089 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 161 states to 159 states and 192 transitions. [2020-10-20 06:36:20,090 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2020-10-20 06:36:20,090 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2020-10-20 06:36:20,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 159 states and 192 transitions. [2020-10-20 06:36:20,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:20,090 INFO L691 BuchiCegarLoop]: Abstraction has 159 states and 192 transitions. [2020-10-20 06:36:20,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states and 192 transitions. [2020-10-20 06:36:20,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 126. [2020-10-20 06:36:20,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-10-20 06:36:20,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 152 transitions. [2020-10-20 06:36:20,093 INFO L714 BuchiCegarLoop]: Abstraction has 126 states and 152 transitions. [2020-10-20 06:36:20,093 INFO L594 BuchiCegarLoop]: Abstraction has 126 states and 152 transitions. [2020-10-20 06:36:20,093 INFO L427 BuchiCegarLoop]: ======== Iteration 17============ [2020-10-20 06:36:20,093 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 152 transitions. [2020-10-20 06:36:20,094 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 40 [2020-10-20 06:36:20,094 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:36:20,094 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:36:20,095 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 9, 8, 1, 1, 1, 1] [2020-10-20 06:36:20,095 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [10, 9, 9, 8, 2, 1, 1] [2020-10-20 06:36:20,095 INFO L794 eck$LassoCheckResult]: Stem: 5198#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; 5199#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5203#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 5299#L12-2 assume !(main_~i~0 <= 0); 5298#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 5297#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5204#L12 assume !(main_~i~0 >= 10); 5205#L12-2 assume !(main_~i~0 <= 0); 5318#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 5316#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5206#L12 assume !(main_~i~0 >= 10); 5207#L12-2 assume !(main_~i~0 <= 0); 5319#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 5317#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5315#L12 assume !(main_~i~0 >= 10); 5314#L12-2 assume !(main_~i~0 <= 0); 5313#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 5312#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5311#L12 assume !(main_~i~0 >= 10); 5310#L12-2 assume !(main_~i~0 <= 0); 5309#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 5308#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5307#L12 assume !(main_~i~0 >= 10); 5306#L12-2 assume !(main_~i~0 <= 0); 5305#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 5304#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5303#L12 assume !(main_~i~0 >= 10); 5302#L12-2 assume !(main_~i~0 <= 0); 5301#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 5300#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5260#L12 assume !(main_~i~0 >= 10); 5270#L12-2 assume !(main_~i~0 <= 0); 5263#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 5259#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5261#L12 assume !(main_~i~0 >= 10); 5225#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 5217#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 5218#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5213#L12 assume !(main_~i~0 >= 10); 5214#L12-2 assume !(main_~i~0 <= 0); 5209#L15-1 [2020-10-20 06:36:20,095 INFO L796 eck$LassoCheckResult]: Loop: 5209#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 5200#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5201#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 5194#L12-2 assume !(main_~i~0 <= 0); 5195#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 5208#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5296#L12 assume !(main_~i~0 >= 10); 5295#L12-2 assume !(main_~i~0 <= 0); 5294#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 5293#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5292#L12 assume !(main_~i~0 >= 10); 5291#L12-2 assume !(main_~i~0 <= 0); 5290#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 5289#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5288#L12 assume !(main_~i~0 >= 10); 5287#L12-2 assume !(main_~i~0 <= 0); 5286#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 5285#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5284#L12 assume !(main_~i~0 >= 10); 5283#L12-2 assume !(main_~i~0 <= 0); 5282#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 5281#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5280#L12 assume !(main_~i~0 >= 10); 5279#L12-2 assume !(main_~i~0 <= 0); 5278#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 5277#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5276#L12 assume !(main_~i~0 >= 10); 5275#L12-2 assume !(main_~i~0 <= 0); 5274#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 5273#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5272#L12 assume !(main_~i~0 >= 10); 5271#L12-2 assume !(main_~i~0 <= 0); 5264#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 5262#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5220#L12 assume !(main_~i~0 >= 10); 5221#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 5217#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 5218#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5213#L12 assume !(main_~i~0 >= 10); 5214#L12-2 assume !(main_~i~0 <= 0); 5209#L15-1 [2020-10-20 06:36:20,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:20,096 INFO L82 PathProgramCache]: Analyzing trace with hash -6653585, now seen corresponding path program 7 times [2020-10-20 06:36:20,096 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:20,096 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805452493] [2020-10-20 06:36:20,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:20,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:20,184 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 51 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:20,184 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805452493] [2020-10-20 06:36:20,184 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418034151] [2020-10-20 06:36:20,185 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 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) [2020-10-20 06:36:20,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:36:20,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-20 06:36:20,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:20,234 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 51 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:20,234 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:36:20,234 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2020-10-20 06:36:20,235 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948644228] [2020-10-20 06:36:20,235 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:36:20,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:20,235 INFO L82 PathProgramCache]: Analyzing trace with hash 711528023, now seen corresponding path program 8 times [2020-10-20 06:36:20,235 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:20,235 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959512846] [2020-10-20 06:36:20,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:20,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:20,331 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 60 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:20,331 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959512846] [2020-10-20 06:36:20,331 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125446360] [2020-10-20 06:36:20,331 INFO L93 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 [2020-10-20 06:36:20,363 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 06:36:20,363 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:36:20,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-20 06:36:20,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:20,387 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 60 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:20,387 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:36:20,387 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2020-10-20 06:36:20,387 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492616241] [2020-10-20 06:36:20,388 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:36:20,388 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:36:20,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-20 06:36:20,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2020-10-20 06:36:20,388 INFO L87 Difference]: Start difference. First operand 126 states and 152 transitions. cyclomatic complexity: 32 Second operand 11 states. [2020-10-20 06:36:20,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:36:20,461 INFO L93 Difference]: Finished difference Result 177 states and 214 transitions. [2020-10-20 06:36:20,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-20 06:36:20,462 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 177 states and 214 transitions. [2020-10-20 06:36:20,464 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 45 [2020-10-20 06:36:20,465 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 177 states to 175 states and 211 transitions. [2020-10-20 06:36:20,465 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2020-10-20 06:36:20,466 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2020-10-20 06:36:20,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 175 states and 211 transitions. [2020-10-20 06:36:20,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:20,466 INFO L691 BuchiCegarLoop]: Abstraction has 175 states and 211 transitions. [2020-10-20 06:36:20,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states and 211 transitions. [2020-10-20 06:36:20,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 138. [2020-10-20 06:36:20,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-10-20 06:36:20,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 166 transitions. [2020-10-20 06:36:20,469 INFO L714 BuchiCegarLoop]: Abstraction has 138 states and 166 transitions. [2020-10-20 06:36:20,469 INFO L594 BuchiCegarLoop]: Abstraction has 138 states and 166 transitions. [2020-10-20 06:36:20,469 INFO L427 BuchiCegarLoop]: ======== Iteration 18============ [2020-10-20 06:36:20,479 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 138 states and 166 transitions. [2020-10-20 06:36:20,480 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2020-10-20 06:36:20,480 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:36:20,480 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:36:20,481 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1, 1] [2020-10-20 06:36:20,482 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [11, 10, 10, 9, 2, 1, 1] [2020-10-20 06:36:20,482 INFO L794 eck$LassoCheckResult]: Stem: 5758#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; 5759#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5763#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 5867#L12-2 assume !(main_~i~0 <= 0); 5866#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 5865#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5764#L12 assume !(main_~i~0 >= 10); 5765#L12-2 assume !(main_~i~0 <= 0); 5890#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 5888#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5766#L12 assume !(main_~i~0 >= 10); 5767#L12-2 assume !(main_~i~0 <= 0); 5891#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 5889#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5887#L12 assume !(main_~i~0 >= 10); 5886#L12-2 assume !(main_~i~0 <= 0); 5885#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 5884#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5883#L12 assume !(main_~i~0 >= 10); 5882#L12-2 assume !(main_~i~0 <= 0); 5881#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 5880#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5879#L12 assume !(main_~i~0 >= 10); 5878#L12-2 assume !(main_~i~0 <= 0); 5877#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 5876#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5875#L12 assume !(main_~i~0 >= 10); 5874#L12-2 assume !(main_~i~0 <= 0); 5873#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 5872#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5871#L12 assume !(main_~i~0 >= 10); 5870#L12-2 assume !(main_~i~0 <= 0); 5869#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 5868#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5825#L12 assume !(main_~i~0 >= 10); 5864#L12-2 assume !(main_~i~0 <= 0); 5828#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 5824#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5826#L12 assume !(main_~i~0 >= 10); 5783#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 5777#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 5778#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5773#L12 assume !(main_~i~0 >= 10); 5774#L12-2 assume !(main_~i~0 <= 0); 5769#L15-1 [2020-10-20 06:36:20,482 INFO L796 eck$LassoCheckResult]: Loop: 5769#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 5760#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5761#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 5754#L12-2 assume !(main_~i~0 <= 0); 5755#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 5768#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5863#L12 assume !(main_~i~0 >= 10); 5862#L12-2 assume !(main_~i~0 <= 0); 5861#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 5860#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5859#L12 assume !(main_~i~0 >= 10); 5858#L12-2 assume !(main_~i~0 <= 0); 5857#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 5856#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5855#L12 assume !(main_~i~0 >= 10); 5854#L12-2 assume !(main_~i~0 <= 0); 5853#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 5852#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5851#L12 assume !(main_~i~0 >= 10); 5850#L12-2 assume !(main_~i~0 <= 0); 5849#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 5848#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5847#L12 assume !(main_~i~0 >= 10); 5846#L12-2 assume !(main_~i~0 <= 0); 5845#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 5844#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5843#L12 assume !(main_~i~0 >= 10); 5842#L12-2 assume !(main_~i~0 <= 0); 5841#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 5840#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5839#L12 assume !(main_~i~0 >= 10); 5838#L12-2 assume !(main_~i~0 <= 0); 5837#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 5836#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5835#L12 assume !(main_~i~0 >= 10); 5834#L12-2 assume !(main_~i~0 <= 0); 5827#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 5823#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5784#L12 assume !(main_~i~0 >= 10); 5785#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 5777#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 5778#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5773#L12 assume !(main_~i~0 >= 10); 5774#L12-2 assume !(main_~i~0 <= 0); 5769#L15-1 [2020-10-20 06:36:20,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:20,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1242347364, now seen corresponding path program 8 times [2020-10-20 06:36:20,483 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:20,483 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108492446] [2020-10-20 06:36:20,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:20,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:20,562 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 57 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:20,562 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108492446] [2020-10-20 06:36:20,563 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906022449] [2020-10-20 06:36:20,563 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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 [2020-10-20 06:36:20,590 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 06:36:20,590 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:36:20,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-20 06:36:20,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:20,614 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 57 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:20,614 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:36:20,614 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2020-10-20 06:36:20,615 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056182475] [2020-10-20 06:36:20,615 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:36:20,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:20,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1875470260, now seen corresponding path program 9 times [2020-10-20 06:36:20,615 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:20,616 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663585683] [2020-10-20 06:36:20,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:20,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:20,721 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 67 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:20,721 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663585683] [2020-10-20 06:36:20,721 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355203217] [2020-10-20 06:36:20,722 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:36:20,760 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2020-10-20 06:36:20,761 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:36:20,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-20 06:36:20,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:20,778 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 67 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:20,778 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:36:20,779 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2020-10-20 06:36:20,779 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879363753] [2020-10-20 06:36:20,779 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:36:20,779 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:36:20,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-20 06:36:20,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2020-10-20 06:36:20,780 INFO L87 Difference]: Start difference. First operand 138 states and 166 transitions. cyclomatic complexity: 34 Second operand 12 states. [2020-10-20 06:36:20,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:36:20,948 INFO L93 Difference]: Finished difference Result 307 states and 361 transitions. [2020-10-20 06:36:20,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-20 06:36:20,950 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 307 states and 361 transitions. [2020-10-20 06:36:20,952 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 104 [2020-10-20 06:36:20,954 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 307 states to 299 states and 352 transitions. [2020-10-20 06:36:20,954 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 104 [2020-10-20 06:36:20,954 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 176 [2020-10-20 06:36:20,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 299 states and 352 transitions. [2020-10-20 06:36:20,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:20,955 INFO L691 BuchiCegarLoop]: Abstraction has 299 states and 352 transitions. [2020-10-20 06:36:20,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states and 352 transitions. [2020-10-20 06:36:20,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 214. [2020-10-20 06:36:20,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-10-20 06:36:20,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 258 transitions. [2020-10-20 06:36:20,960 INFO L714 BuchiCegarLoop]: Abstraction has 214 states and 258 transitions. [2020-10-20 06:36:20,960 INFO L594 BuchiCegarLoop]: Abstraction has 214 states and 258 transitions. [2020-10-20 06:36:20,960 INFO L427 BuchiCegarLoop]: ======== Iteration 19============ [2020-10-20 06:36:20,961 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 214 states and 258 transitions. [2020-10-20 06:36:20,962 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2020-10-20 06:36:20,962 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:36:20,962 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:36:20,963 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 10, 1, 1, 1] [2020-10-20 06:36:20,964 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [12, 11, 11, 10, 2, 1, 1] [2020-10-20 06:36:20,964 INFO L794 eck$LassoCheckResult]: Stem: 6486#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; 6487#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6491#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 6599#L12-2 assume !(main_~i~0 <= 0); 6597#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 6595#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6492#L12 assume !(main_~i~0 >= 10); 6493#L12-2 assume !(main_~i~0 <= 0); 6639#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 6636#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6494#L12 assume !(main_~i~0 >= 10); 6495#L12-2 assume !(main_~i~0 <= 0); 6625#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 6624#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6623#L12 assume !(main_~i~0 >= 10); 6622#L12-2 assume !(main_~i~0 <= 0); 6621#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 6620#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6619#L12 assume !(main_~i~0 >= 10); 6618#L12-2 assume !(main_~i~0 <= 0); 6617#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 6616#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6615#L12 assume !(main_~i~0 >= 10); 6614#L12-2 assume !(main_~i~0 <= 0); 6613#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 6612#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6611#L12 assume !(main_~i~0 >= 10); 6610#L12-2 assume !(main_~i~0 <= 0); 6609#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 6608#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6607#L12 assume !(main_~i~0 >= 10); 6606#L12-2 assume !(main_~i~0 <= 0); 6605#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 6604#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6603#L12 assume !(main_~i~0 >= 10); 6602#L12-2 assume !(main_~i~0 <= 0); 6601#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 6600#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6594#L12 assume !(main_~i~0 >= 10); 6598#L12-2 assume !(main_~i~0 <= 0); 6596#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 6593#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6547#L12 assume !(main_~i~0 >= 10); 6548#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 6628#L15-1 [2020-10-20 06:36:20,964 INFO L796 eck$LassoCheckResult]: Loop: 6628#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6690#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6688#L12 assume !(main_~i~0 >= 10); 6629#L12-2 assume !(main_~i~0 <= 0); 6554#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6552#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6545#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 6546#L12-2 assume !(main_~i~0 <= 0); 6695#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 6488#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6489#L12 assume !(main_~i~0 >= 10); 6482#L12-2 assume !(main_~i~0 <= 0); 6483#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 6496#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6694#L12 assume !(main_~i~0 >= 10); 6693#L12-2 assume !(main_~i~0 <= 0); 6692#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 6691#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6689#L12 assume !(main_~i~0 >= 10); 6687#L12-2 assume !(main_~i~0 <= 0); 6686#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 6684#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6682#L12 assume !(main_~i~0 >= 10); 6680#L12-2 assume !(main_~i~0 <= 0); 6678#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 6676#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6674#L12 assume !(main_~i~0 >= 10); 6672#L12-2 assume !(main_~i~0 <= 0); 6670#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 6668#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6666#L12 assume !(main_~i~0 >= 10); 6664#L12-2 assume !(main_~i~0 <= 0); 6662#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 6660#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6658#L12 assume !(main_~i~0 >= 10); 6656#L12-2 assume !(main_~i~0 <= 0); 6654#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 6652#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6650#L12 assume !(main_~i~0 >= 10); 6648#L12-2 assume !(main_~i~0 <= 0); 6646#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 6644#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6642#L12 assume !(main_~i~0 >= 10); 6640#L12-2 assume !(main_~i~0 <= 0); 6637#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 6634#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6631#L12 assume !(main_~i~0 >= 10); 6632#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 6628#L15-1 [2020-10-20 06:36:20,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:20,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1244253986, now seen corresponding path program 2 times [2020-10-20 06:36:20,965 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:20,965 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902539633] [2020-10-20 06:36:20,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:20,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:20,977 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:20,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:20,984 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:20,989 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:20,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:20,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1107487295, now seen corresponding path program 10 times [2020-10-20 06:36:20,990 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:20,990 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290647007] [2020-10-20 06:36:20,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:20,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:21,002 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:21,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:21,008 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:21,011 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:21,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:21,011 INFO L82 PathProgramCache]: Analyzing trace with hash -429277470, now seen corresponding path program 9 times [2020-10-20 06:36:21,012 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:21,016 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216949407] [2020-10-20 06:36:21,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:21,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:21,097 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 587 proven. 3 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2020-10-20 06:36:21,097 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216949407] [2020-10-20 06:36:21,098 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213628699] [2020-10-20 06:36:21,098 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:36:21,138 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2020-10-20 06:36:21,139 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:36:21,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 06:36:21,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:21,156 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 587 proven. 3 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2020-10-20 06:36:21,157 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:36:21,157 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2020-10-20 06:36:21,157 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419819177] [2020-10-20 06:36:21,381 WARN L193 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 52 [2020-10-20 06:36:21,404 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:36:21,404 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:36:21,405 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:36:21,405 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:36:21,405 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 06:36:21,405 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:21,405 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:36:21,405 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:36:21,405 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration19_Loop [2020-10-20 06:36:21,405 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:36:21,405 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:36:21,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:21,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:21,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:21,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:21,478 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:36:21,481 INFO L404 LassoAnalysis]: Checking for nontermination... 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) [2020-10-20 06:36:21,487 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:21,487 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:21,493 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 06:36:21,493 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 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 [2020-10-20 06:36:21,515 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:21,515 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 06:36:21,517 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 06:36:21,518 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_15=0} Honda state: {v_rep~unnamed0~0~false_15=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) Waiting until toolchain timeout for monitored process 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:21,540 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:21,540 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 06:36:21,542 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 06:36:21,542 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 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 [2020-10-20 06:36:21,565 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:21,565 INFO L160 nArgumentSynthesizer]: Using integer mode. 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) Waiting until toolchain timeout for monitored process 81 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:21,589 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 06:36:21,589 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 06:36:21,592 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 06:36:21,614 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:36:21,614 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:36:21,614 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:36:21,614 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:36:21,614 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:36:21,614 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:21,614 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:36:21,614 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:36:21,614 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration19_Loop [2020-10-20 06:36:21,615 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:36:21,615 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:36:21,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:21,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:21,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:21,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:21,687 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:36:21,687 INFO L489 LassoAnalysis]: Using template 'affine'. 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) Waiting until toolchain timeout for monitored process 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:21,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 [2020-10-20 06:36:21,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:36:21,692 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:36:21,692 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:36:21,692 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:36:21,694 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:36:21,694 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:36:21,697 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 83 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 83 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:21,721 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 [2020-10-20 06:36:21,722 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:36:21,722 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:36:21,723 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:36:21,723 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:36:21,723 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:36:21,724 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:36:21,724 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:36:21,726 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 84 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 84 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:21,748 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 [2020-10-20 06:36:21,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:36:21,750 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:36:21,750 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:36:21,750 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:36:21,750 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:36:21,751 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:36:21,751 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:36:21,753 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:36:21,755 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-10-20 06:36:21,755 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 85 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 85 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:21,758 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:36:21,758 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 06:36:21,758 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:36:21,758 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2020-10-20 06:36:21,778 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 06:36:21,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:21,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:21,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:36:21,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:21,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:21,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-20 06:36:21,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:21,838 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2020-10-20 06:36:21,839 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 [2020-10-20 06:36:21,839 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 214 states and 258 transitions. cyclomatic complexity: 49 Second operand 5 states. [2020-10-20 06:36:21,956 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 214 states and 258 transitions. cyclomatic complexity: 49. Second operand 5 states. Result 493 states and 601 transitions. Complement of second has 15 states. [2020-10-20 06:36:21,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2020-10-20 06:36:21,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-20 06:36:21,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 36 transitions. [2020-10-20 06:36:21,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 36 transitions. Stem has 44 letters. Loop has 48 letters. [2020-10-20 06:36:21,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:21,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 36 transitions. Stem has 92 letters. Loop has 48 letters. [2020-10-20 06:36:21,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:21,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 36 transitions. Stem has 44 letters. Loop has 96 letters. [2020-10-20 06:36:21,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:21,960 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 493 states and 601 transitions. [2020-10-20 06:36:21,963 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 84 [2020-10-20 06:36:21,965 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 493 states to 439 states and 521 transitions. [2020-10-20 06:36:21,965 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 178 [2020-10-20 06:36:21,966 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 183 [2020-10-20 06:36:21,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 439 states and 521 transitions. [2020-10-20 06:36:21,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:21,966 INFO L691 BuchiCegarLoop]: Abstraction has 439 states and 521 transitions. [2020-10-20 06:36:21,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states and 521 transitions. [2020-10-20 06:36:21,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 427. [2020-10-20 06:36:21,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2020-10-20 06:36:21,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 508 transitions. [2020-10-20 06:36:21,973 INFO L714 BuchiCegarLoop]: Abstraction has 427 states and 508 transitions. [2020-10-20 06:36:21,973 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:36:21,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 06:36:21,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-20 06:36:21,974 INFO L87 Difference]: Start difference. First operand 427 states and 508 transitions. Second operand 5 states. [2020-10-20 06:36:21,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:36:21,996 INFO L93 Difference]: Finished difference Result 236 states and 278 transitions. [2020-10-20 06:36:21,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 06:36:21,996 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 236 states and 278 transitions. [2020-10-20 06:36:21,998 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2020-10-20 06:36:21,999 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 236 states to 221 states and 263 transitions. [2020-10-20 06:36:21,999 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 135 [2020-10-20 06:36:21,999 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 135 [2020-10-20 06:36:21,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 221 states and 263 transitions. [2020-10-20 06:36:22,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:22,000 INFO L691 BuchiCegarLoop]: Abstraction has 221 states and 263 transitions. [2020-10-20 06:36:22,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states and 263 transitions. [2020-10-20 06:36:22,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 214. [2020-10-20 06:36:22,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-10-20 06:36:22,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 256 transitions. [2020-10-20 06:36:22,004 INFO L714 BuchiCegarLoop]: Abstraction has 214 states and 256 transitions. [2020-10-20 06:36:22,004 INFO L594 BuchiCegarLoop]: Abstraction has 214 states and 256 transitions. [2020-10-20 06:36:22,004 INFO L427 BuchiCegarLoop]: ======== Iteration 20============ [2020-10-20 06:36:22,004 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 214 states and 256 transitions. [2020-10-20 06:36:22,005 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2020-10-20 06:36:22,005 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:36:22,005 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:36:22,006 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 10, 1, 1, 1] [2020-10-20 06:36:22,006 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [13, 12, 12, 10, 3, 1, 1] [2020-10-20 06:36:22,006 INFO L794 eck$LassoCheckResult]: Stem: 8449#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; 8450#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8462#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 8516#L12-2 assume !(main_~i~0 <= 0); 8515#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 8514#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8512#L12 assume !(main_~i~0 >= 10); 8513#L12-2 assume !(main_~i~0 <= 0); 8595#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 8594#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8457#L12 assume !(main_~i~0 >= 10); 8458#L12-2 assume !(main_~i~0 <= 0); 8522#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 8520#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8521#L12 assume !(main_~i~0 >= 10); 8593#L12-2 assume !(main_~i~0 <= 0); 8592#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 8591#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8590#L12 assume !(main_~i~0 >= 10); 8589#L12-2 assume !(main_~i~0 <= 0); 8588#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 8587#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8586#L12 assume !(main_~i~0 >= 10); 8585#L12-2 assume !(main_~i~0 <= 0); 8584#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 8583#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8582#L12 assume !(main_~i~0 >= 10); 8581#L12-2 assume !(main_~i~0 <= 0); 8580#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 8579#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8578#L12 assume !(main_~i~0 >= 10); 8577#L12-2 assume !(main_~i~0 <= 0); 8576#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 8575#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8574#L12 assume !(main_~i~0 >= 10); 8573#L12-2 assume !(main_~i~0 <= 0); 8572#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 8571#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8568#L12 assume !(main_~i~0 >= 10); 8570#L12-2 assume !(main_~i~0 <= 0); 8569#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 8567#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8455#L12 assume !(main_~i~0 >= 10); 8456#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 8596#L15-1 [2020-10-20 06:36:22,007 INFO L796 eck$LassoCheckResult]: Loop: 8596#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8565#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8566#L12 assume !(main_~i~0 >= 10); 8445#L12-2 assume !(main_~i~0 <= 0); 8446#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8451#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8452#L12 assume !(main_~i~0 >= 10); 8531#L12-2 assume !(main_~i~0 <= 0); 8529#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8528#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8525#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 8526#L12-2 assume !(main_~i~0 <= 0); 8459#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 8460#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8527#L12 assume !(main_~i~0 >= 10); 8523#L12-2 assume !(main_~i~0 <= 0); 8524#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 8631#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8630#L12 assume !(main_~i~0 >= 10); 8629#L12-2 assume !(main_~i~0 <= 0); 8628#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 8627#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8626#L12 assume !(main_~i~0 >= 10); 8625#L12-2 assume !(main_~i~0 <= 0); 8624#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 8623#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8622#L12 assume !(main_~i~0 >= 10); 8621#L12-2 assume !(main_~i~0 <= 0); 8620#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 8619#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8618#L12 assume !(main_~i~0 >= 10); 8617#L12-2 assume !(main_~i~0 <= 0); 8616#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 8615#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8614#L12 assume !(main_~i~0 >= 10); 8613#L12-2 assume !(main_~i~0 <= 0); 8612#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 8611#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8610#L12 assume !(main_~i~0 >= 10); 8609#L12-2 assume !(main_~i~0 <= 0); 8608#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 8607#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8606#L12 assume !(main_~i~0 >= 10); 8605#L12-2 assume !(main_~i~0 <= 0); 8604#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 8603#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8602#L12 assume !(main_~i~0 >= 10); 8601#L12-2 assume !(main_~i~0 <= 0); 8598#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 8600#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8599#L12 assume !(main_~i~0 >= 10); 8597#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 8596#L15-1 [2020-10-20 06:36:22,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:22,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1244253986, now seen corresponding path program 3 times [2020-10-20 06:36:22,007 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:22,007 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720046589] [2020-10-20 06:36:22,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:22,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:22,013 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:22,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:22,045 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:22,050 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:22,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:22,050 INFO L82 PathProgramCache]: Analyzing trace with hash -2004957192, now seen corresponding path program 11 times [2020-10-20 06:36:22,051 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:22,051 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181297640] [2020-10-20 06:36:22,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:22,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:22,062 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:22,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:22,071 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:22,073 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:22,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:22,073 INFO L82 PathProgramCache]: Analyzing trace with hash -364906343, now seen corresponding path program 10 times [2020-10-20 06:36:22,073 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:22,073 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101539721] [2020-10-20 06:36:22,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:22,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:22,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 671 proven. 10 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2020-10-20 06:36:22,115 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101539721] [2020-10-20 06:36:22,115 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614143696] [2020-10-20 06:36:22,115 INFO L93 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 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:36:22,156 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-20 06:36:22,157 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:36:22,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-20 06:36:22,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:22,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 671 proven. 10 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2020-10-20 06:36:22,171 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:36:22,171 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2020-10-20 06:36:22,171 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007889460] [2020-10-20 06:36:22,460 WARN L193 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 53 [2020-10-20 06:36:22,476 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:36:22,477 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:36:22,477 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:36:22,477 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:36:22,477 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 06:36:22,477 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:22,477 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:36:22,477 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:36:22,478 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration20_Loop [2020-10-20 06:36:22,478 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:36:22,478 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:36:22,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:22,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:22,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:22,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:22,551 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:36:22,551 INFO L404 LassoAnalysis]: Checking for nontermination... 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) [2020-10-20 06:36:22,554 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:22,554 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 87 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:22,558 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 06:36:22,559 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 88 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:36:22,596 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:22,596 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 88 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 89 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:36:22,639 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 06:36:22,639 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 89 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:22,643 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 06:36:22,676 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:36:22,676 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:36:22,676 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:36:22,677 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:36:22,677 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:36:22,677 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:22,677 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:36:22,677 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:36:22,677 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration20_Loop [2020-10-20 06:36:22,677 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:36:22,677 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:36:22,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:22,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:22,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:22,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:22,734 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:36:22,734 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:36:22,737 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 [2020-10-20 06:36:22,739 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:36:22,739 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:36:22,739 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:36:22,739 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:36:22,739 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:36:22,740 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:36:22,740 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 90 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:22,742 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:36:22,747 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-20 06:36:22,748 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 91 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:36:22,753 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:36:22,753 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 06:36:22,754 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:36:22,754 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 91 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:22,787 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 06:36:22,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:22,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:22,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:36:22,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:22,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:22,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-20 06:36:22,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:22,857 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2020-10-20 06:36:22,857 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 [2020-10-20 06:36:22,857 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 214 states and 256 transitions. cyclomatic complexity: 47 Second operand 6 states. [2020-10-20 06:36:23,059 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 214 states and 256 transitions. cyclomatic complexity: 47. Second operand 6 states. Result 565 states and 685 transitions. Complement of second has 19 states. [2020-10-20 06:36:23,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 8 non-accepting loop states 1 accepting loop states [2020-10-20 06:36:23,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-20 06:36:23,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 45 transitions. [2020-10-20 06:36:23,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 45 transitions. Stem has 44 letters. Loop has 52 letters. [2020-10-20 06:36:23,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:23,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 45 transitions. Stem has 96 letters. Loop has 52 letters. [2020-10-20 06:36:23,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:23,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 45 transitions. Stem has 44 letters. Loop has 104 letters. [2020-10-20 06:36:23,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:23,066 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 565 states and 685 transitions. [2020-10-20 06:36:23,069 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 84 [2020-10-20 06:36:23,073 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 565 states to 483 states and 571 transitions. [2020-10-20 06:36:23,074 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 182 [2020-10-20 06:36:23,074 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 188 [2020-10-20 06:36:23,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 483 states and 571 transitions. [2020-10-20 06:36:23,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:23,075 INFO L691 BuchiCegarLoop]: Abstraction has 483 states and 571 transitions. [2020-10-20 06:36:23,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states and 571 transitions. [2020-10-20 06:36:23,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 469. [2020-10-20 06:36:23,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2020-10-20 06:36:23,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 556 transitions. [2020-10-20 06:36:23,082 INFO L714 BuchiCegarLoop]: Abstraction has 469 states and 556 transitions. [2020-10-20 06:36:23,083 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:36:23,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 06:36:23,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-10-20 06:36:23,083 INFO L87 Difference]: Start difference. First operand 469 states and 556 transitions. Second operand 6 states. [2020-10-20 06:36:23,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:36:23,122 INFO L93 Difference]: Finished difference Result 248 states and 288 transitions. [2020-10-20 06:36:23,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 06:36:23,124 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 248 states and 288 transitions. [2020-10-20 06:36:23,125 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2020-10-20 06:36:23,127 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 248 states to 225 states and 265 transitions. [2020-10-20 06:36:23,127 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 139 [2020-10-20 06:36:23,127 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 139 [2020-10-20 06:36:23,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 225 states and 265 transitions. [2020-10-20 06:36:23,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:23,127 INFO L691 BuchiCegarLoop]: Abstraction has 225 states and 265 transitions. [2020-10-20 06:36:23,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states and 265 transitions. [2020-10-20 06:36:23,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 214. [2020-10-20 06:36:23,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-10-20 06:36:23,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 254 transitions. [2020-10-20 06:36:23,131 INFO L714 BuchiCegarLoop]: Abstraction has 214 states and 254 transitions. [2020-10-20 06:36:23,132 INFO L594 BuchiCegarLoop]: Abstraction has 214 states and 254 transitions. [2020-10-20 06:36:23,132 INFO L427 BuchiCegarLoop]: ======== Iteration 21============ [2020-10-20 06:36:23,132 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 214 states and 254 transitions. [2020-10-20 06:36:23,133 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2020-10-20 06:36:23,133 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:36:23,133 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:36:23,134 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 10, 1, 1, 1] [2020-10-20 06:36:23,134 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [14, 13, 13, 10, 4, 1, 1] [2020-10-20 06:36:23,134 INFO L794 eck$LassoCheckResult]: Stem: 10571#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; 10572#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10584#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 10637#L12-2 assume !(main_~i~0 <= 0); 10636#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 10635#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10633#L12 assume !(main_~i~0 >= 10); 10634#L12-2 assume !(main_~i~0 <= 0); 10675#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 10674#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10578#L12 assume !(main_~i~0 >= 10); 10579#L12-2 assume !(main_~i~0 <= 0); 10643#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 10641#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10642#L12 assume !(main_~i~0 >= 10); 10673#L12-2 assume !(main_~i~0 <= 0); 10672#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 10671#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10670#L12 assume !(main_~i~0 >= 10); 10669#L12-2 assume !(main_~i~0 <= 0); 10668#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 10667#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10666#L12 assume !(main_~i~0 >= 10); 10665#L12-2 assume !(main_~i~0 <= 0); 10664#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 10663#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10662#L12 assume !(main_~i~0 >= 10); 10661#L12-2 assume !(main_~i~0 <= 0); 10660#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 10659#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10658#L12 assume !(main_~i~0 >= 10); 10657#L12-2 assume !(main_~i~0 <= 0); 10656#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 10655#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10654#L12 assume !(main_~i~0 >= 10); 10653#L12-2 assume !(main_~i~0 <= 0); 10652#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 10651#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10647#L12 assume !(main_~i~0 >= 10); 10650#L12-2 assume !(main_~i~0 <= 0); 10649#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 10646#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10648#L12 assume !(main_~i~0 >= 10); 10688#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 10689#L15-1 [2020-10-20 06:36:23,134 INFO L796 eck$LassoCheckResult]: Loop: 10689#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10684#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10685#L12 assume !(main_~i~0 >= 10); 10692#L12-2 assume !(main_~i~0 <= 0); 10686#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10687#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10577#L12 assume !(main_~i~0 >= 10); 10567#L12-2 assume !(main_~i~0 <= 0); 10568#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10780#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10779#L12 assume !(main_~i~0 >= 10); 10759#L12-2 assume !(main_~i~0 <= 0); 10680#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10679#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10677#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 10678#L12-2 assume !(main_~i~0 <= 0); 10725#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 10573#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10574#L12 assume !(main_~i~0 >= 10); 10676#L12-2 assume !(main_~i~0 <= 0); 10580#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 10581#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10724#L12 assume !(main_~i~0 >= 10); 10723#L12-2 assume !(main_~i~0 <= 0); 10722#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 10721#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10720#L12 assume !(main_~i~0 >= 10); 10719#L12-2 assume !(main_~i~0 <= 0); 10718#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 10717#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10716#L12 assume !(main_~i~0 >= 10); 10715#L12-2 assume !(main_~i~0 <= 0); 10714#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 10713#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10712#L12 assume !(main_~i~0 >= 10); 10711#L12-2 assume !(main_~i~0 <= 0); 10710#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 10709#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10708#L12 assume !(main_~i~0 >= 10); 10707#L12-2 assume !(main_~i~0 <= 0); 10706#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 10705#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10704#L12 assume !(main_~i~0 >= 10); 10703#L12-2 assume !(main_~i~0 <= 0); 10702#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 10701#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10700#L12 assume !(main_~i~0 >= 10); 10699#L12-2 assume !(main_~i~0 <= 0); 10698#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 10697#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10696#L12 assume !(main_~i~0 >= 10); 10695#L12-2 assume !(main_~i~0 <= 0); 10691#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 10694#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10693#L12 assume !(main_~i~0 >= 10); 10690#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 10689#L15-1 [2020-10-20 06:36:23,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:23,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1244253986, now seen corresponding path program 4 times [2020-10-20 06:36:23,135 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:23,135 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670249062] [2020-10-20 06:36:23,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:23,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:23,140 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:23,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:23,145 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:23,146 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:23,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:23,147 INFO L82 PathProgramCache]: Analyzing trace with hash -102857041, now seen corresponding path program 12 times [2020-10-20 06:36:23,147 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:23,147 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640327511] [2020-10-20 06:36:23,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:23,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:23,153 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:23,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:23,159 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:23,161 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:23,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:23,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1080327888, now seen corresponding path program 11 times [2020-10-20 06:36:23,161 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:23,161 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540679144] [2020-10-20 06:36:23,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:23,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:23,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 755 proven. 21 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2020-10-20 06:36:23,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540679144] [2020-10-20 06:36:23,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221859467] [2020-10-20 06:36:23,207 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:36:23,241 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2020-10-20 06:36:23,242 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:36:23,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-20 06:36:23,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:23,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 755 proven. 21 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2020-10-20 06:36:23,258 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:36:23,258 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2020-10-20 06:36:23,258 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988006891] [2020-10-20 06:36:23,566 WARN L193 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 57 [2020-10-20 06:36:23,583 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:36:23,583 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:36:23,583 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:36:23,584 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:36:23,584 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 06:36:23,584 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:23,584 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:36:23,584 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:36:23,584 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration21_Loop [2020-10-20 06:36:23,584 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:36:23,585 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:36:23,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:23,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:23,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:23,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:23,649 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:36:23,650 INFO L404 LassoAnalysis]: Checking for nontermination... 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 [2020-10-20 06:36:23,653 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:23,653 INFO L160 nArgumentSynthesizer]: Using integer mode. 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 [2020-10-20 06:36:23,676 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 06:36:23,676 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 06:36:23,679 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 06:36:23,700 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:36:23,700 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:36:23,700 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:36:23,700 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:36:23,700 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:36:23,700 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:23,701 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:36:23,701 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:36:23,701 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration21_Loop [2020-10-20 06:36:23,701 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:36:23,701 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:36:23,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:23,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:23,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:23,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:23,763 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:36:23,764 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2020-10-20 06:36:23,773 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 95 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:23,775 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:36:23,775 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:36:23,775 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:36:23,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:36:23,775 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:36:23,776 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:36:23,777 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:36:23,778 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:36:23,781 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-20 06:36:23,781 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 96 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 96 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:23,783 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:36:23,783 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 06:36:23,783 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:36:23,783 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2020-10-20 06:36:23,803 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 06:36:23,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:23,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:23,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:36:23,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:23,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:23,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-20 06:36:23,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:23,893 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2020-10-20 06:36:23,894 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 [2020-10-20 06:36:23,894 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 214 states and 254 transitions. cyclomatic complexity: 45 Second operand 7 states. [2020-10-20 06:36:24,232 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 214 states and 254 transitions. cyclomatic complexity: 45. Second operand 7 states. Result 653 states and 789 transitions. Complement of second has 23 states. [2020-10-20 06:36:24,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 10 non-accepting loop states 1 accepting loop states [2020-10-20 06:36:24,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-20 06:36:24,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 54 transitions. [2020-10-20 06:36:24,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 54 transitions. Stem has 44 letters. Loop has 56 letters. [2020-10-20 06:36:24,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:24,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 54 transitions. Stem has 100 letters. Loop has 56 letters. [2020-10-20 06:36:24,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:24,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 54 transitions. Stem has 44 letters. Loop has 112 letters. [2020-10-20 06:36:24,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:24,239 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 653 states and 789 transitions. [2020-10-20 06:36:24,244 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 84 [2020-10-20 06:36:24,248 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 653 states to 535 states and 631 transitions. [2020-10-20 06:36:24,248 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 186 [2020-10-20 06:36:24,248 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 193 [2020-10-20 06:36:24,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 535 states and 631 transitions. [2020-10-20 06:36:24,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:24,249 INFO L691 BuchiCegarLoop]: Abstraction has 535 states and 631 transitions. [2020-10-20 06:36:24,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states and 631 transitions. [2020-10-20 06:36:24,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 519. [2020-10-20 06:36:24,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2020-10-20 06:36:24,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 614 transitions. [2020-10-20 06:36:24,259 INFO L714 BuchiCegarLoop]: Abstraction has 519 states and 614 transitions. [2020-10-20 06:36:24,260 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:36:24,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 06:36:24,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-10-20 06:36:24,260 INFO L87 Difference]: Start difference. First operand 519 states and 614 transitions. Second operand 7 states. [2020-10-20 06:36:24,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:36:24,318 INFO L93 Difference]: Finished difference Result 260 states and 298 transitions. [2020-10-20 06:36:24,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 06:36:24,319 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 260 states and 298 transitions. [2020-10-20 06:36:24,320 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2020-10-20 06:36:24,324 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 260 states to 229 states and 267 transitions. [2020-10-20 06:36:24,324 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 143 [2020-10-20 06:36:24,325 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 143 [2020-10-20 06:36:24,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 229 states and 267 transitions. [2020-10-20 06:36:24,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:24,325 INFO L691 BuchiCegarLoop]: Abstraction has 229 states and 267 transitions. [2020-10-20 06:36:24,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states and 267 transitions. [2020-10-20 06:36:24,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 214. [2020-10-20 06:36:24,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-10-20 06:36:24,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 252 transitions. [2020-10-20 06:36:24,331 INFO L714 BuchiCegarLoop]: Abstraction has 214 states and 252 transitions. [2020-10-20 06:36:24,332 INFO L594 BuchiCegarLoop]: Abstraction has 214 states and 252 transitions. [2020-10-20 06:36:24,332 INFO L427 BuchiCegarLoop]: ======== Iteration 22============ [2020-10-20 06:36:24,332 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 214 states and 252 transitions. [2020-10-20 06:36:24,333 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2020-10-20 06:36:24,333 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:36:24,333 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:36:24,334 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 10, 1, 1, 1] [2020-10-20 06:36:24,335 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [15, 14, 14, 10, 5, 1, 1] [2020-10-20 06:36:24,335 INFO L794 eck$LassoCheckResult]: Stem: 12876#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; 12877#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12888#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 12940#L12-2 assume !(main_~i~0 <= 0); 12939#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 12938#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12936#L12 assume !(main_~i~0 >= 10); 12937#L12-2 assume !(main_~i~0 <= 0); 12946#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 12947#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12883#L12 assume !(main_~i~0 >= 10); 12884#L12-2 assume !(main_~i~0 <= 0); 12948#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 12944#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12945#L12 assume !(main_~i~0 >= 10); 13050#L12-2 assume !(main_~i~0 <= 0); 13049#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 13048#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13047#L12 assume !(main_~i~0 >= 10); 13046#L12-2 assume !(main_~i~0 <= 0); 13045#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 13044#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13043#L12 assume !(main_~i~0 >= 10); 13042#L12-2 assume !(main_~i~0 <= 0); 13041#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 13040#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13039#L12 assume !(main_~i~0 >= 10); 13038#L12-2 assume !(main_~i~0 <= 0); 13037#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 13036#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13035#L12 assume !(main_~i~0 >= 10); 13034#L12-2 assume !(main_~i~0 <= 0); 13033#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 13032#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13031#L12 assume !(main_~i~0 >= 10); 13030#L12-2 assume !(main_~i~0 <= 0); 13029#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 13028#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13024#L12 assume !(main_~i~0 >= 10); 13027#L12-2 assume !(main_~i~0 <= 0); 13026#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 13023#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12882#L12 assume !(main_~i~0 >= 10); 12872#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 12873#L15-1 [2020-10-20 06:36:24,335 INFO L796 eck$LassoCheckResult]: Loop: 12873#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12878#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12879#L12 assume !(main_~i~0 >= 10); 12987#L12-2 assume !(main_~i~0 <= 0); 12986#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12985#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12984#L12 assume !(main_~i~0 >= 10); 12983#L12-2 assume !(main_~i~0 <= 0); 12982#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12981#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12980#L12 assume !(main_~i~0 >= 10); 12961#L12-2 assume !(main_~i~0 <= 0); 12960#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12958#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12959#L12 assume !(main_~i~0 >= 10); 12962#L12-2 assume !(main_~i~0 <= 0); 12954#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12953#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12950#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 12951#L12-2 assume !(main_~i~0 <= 0); 13025#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 13022#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12952#L12 assume !(main_~i~0 >= 10); 12949#L12-2 assume !(main_~i~0 <= 0); 12885#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 12886#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13021#L12 assume !(main_~i~0 >= 10); 13020#L12-2 assume !(main_~i~0 <= 0); 13019#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 13018#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13017#L12 assume !(main_~i~0 >= 10); 13016#L12-2 assume !(main_~i~0 <= 0); 13015#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 13014#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13013#L12 assume !(main_~i~0 >= 10); 13012#L12-2 assume !(main_~i~0 <= 0); 13011#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 13010#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13009#L12 assume !(main_~i~0 >= 10); 13008#L12-2 assume !(main_~i~0 <= 0); 13007#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 13006#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13005#L12 assume !(main_~i~0 >= 10); 13004#L12-2 assume !(main_~i~0 <= 0); 13003#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 13002#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13001#L12 assume !(main_~i~0 >= 10); 13000#L12-2 assume !(main_~i~0 <= 0); 12999#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 12998#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12997#L12 assume !(main_~i~0 >= 10); 12996#L12-2 assume !(main_~i~0 <= 0); 12995#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 12994#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12993#L12 assume !(main_~i~0 >= 10); 12992#L12-2 assume !(main_~i~0 <= 0); 12989#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 12991#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12990#L12 assume !(main_~i~0 >= 10); 12988#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 12873#L15-1 [2020-10-20 06:36:24,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:24,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1244253986, now seen corresponding path program 5 times [2020-10-20 06:36:24,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:24,336 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985061184] [2020-10-20 06:36:24,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:24,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:24,351 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:24,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:24,358 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:24,367 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:24,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:24,368 INFO L82 PathProgramCache]: Analyzing trace with hash 591532518, now seen corresponding path program 13 times [2020-10-20 06:36:24,368 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:24,368 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283796570] [2020-10-20 06:36:24,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:24,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:24,376 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:24,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:24,383 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:24,387 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:24,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:24,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1205670279, now seen corresponding path program 12 times [2020-10-20 06:36:24,387 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:24,388 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38727304] [2020-10-20 06:36:24,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:24,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:24,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 839 proven. 36 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2020-10-20 06:36:24,445 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38727304] [2020-10-20 06:36:24,445 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458923336] [2020-10-20 06:36:24,445 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:36:24,492 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 26 check-sat command(s) [2020-10-20 06:36:24,492 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:36:24,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-20 06:36:24,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:24,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 839 proven. 36 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2020-10-20 06:36:24,533 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:36:24,533 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2020-10-20 06:36:24,535 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80230000] [2020-10-20 06:36:24,863 WARN L193 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 60 [2020-10-20 06:36:24,876 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:36:24,876 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:36:24,876 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:36:24,876 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:36:24,877 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 06:36:24,877 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:24,877 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:36:24,877 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:36:24,877 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration22_Loop [2020-10-20 06:36:24,877 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:36:24,877 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:36:24,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:24,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:24,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:24,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:24,943 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:36:24,943 INFO L404 LassoAnalysis]: Checking for nontermination... 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 [2020-10-20 06:36:24,953 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:24,953 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 06:36:24,955 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 06:36:24,955 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 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 [2020-10-20 06:36:24,976 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:24,976 INFO L160 nArgumentSynthesizer]: Using integer mode. 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 [2020-10-20 06:36:25,000 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 06:36:25,000 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 06:36:25,003 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 06:36:25,024 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:36:25,024 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:36:25,024 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:36:25,024 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:36:25,025 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:36:25,025 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:25,025 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:36:25,025 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:36:25,025 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration22_Loop [2020-10-20 06:36:25,025 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:36:25,025 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:36:25,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:25,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:25,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:25,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:25,083 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:36:25,083 INFO L489 LassoAnalysis]: Using template 'affine'. 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 [2020-10-20 06:36:25,087 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 [2020-10-20 06:36:25,088 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:36:25,088 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:36:25,088 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:36:25,088 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:36:25,091 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:36:25,091 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:36:25,095 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 [2020-10-20 06:36:25,120 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 [2020-10-20 06:36:25,121 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:36:25,121 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:36:25,121 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:36:25,121 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:36:25,122 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:36:25,122 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:36:25,126 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 103 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 103 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:25,148 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 [2020-10-20 06:36:25,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:36:25,149 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:36:25,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:36:25,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:36:25,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:36:25,150 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:36:25,151 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:36:25,152 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:36:25,155 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-20 06:36:25,155 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 104 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 104 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:25,163 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:36:25,163 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 06:36:25,163 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:36:25,163 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2020-10-20 06:36:25,190 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 06:36:25,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:25,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:25,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:36:25,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:25,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:25,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-20 06:36:25,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:25,290 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 230 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2020-10-20 06:36:25,291 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 [2020-10-20 06:36:25,291 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 214 states and 252 transitions. cyclomatic complexity: 43 Second operand 8 states. [2020-10-20 06:36:25,595 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 214 states and 252 transitions. cyclomatic complexity: 43. Second operand 8 states. Result 757 states and 913 transitions. Complement of second has 27 states. [2020-10-20 06:36:25,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 1 stem states 12 non-accepting loop states 1 accepting loop states [2020-10-20 06:36:25,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-20 06:36:25,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 63 transitions. [2020-10-20 06:36:25,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 63 transitions. Stem has 44 letters. Loop has 60 letters. [2020-10-20 06:36:25,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:25,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 63 transitions. Stem has 104 letters. Loop has 60 letters. [2020-10-20 06:36:25,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:25,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 63 transitions. Stem has 44 letters. Loop has 120 letters. [2020-10-20 06:36:25,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:25,605 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 757 states and 913 transitions. [2020-10-20 06:36:25,609 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 84 [2020-10-20 06:36:25,612 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 757 states to 595 states and 701 transitions. [2020-10-20 06:36:25,612 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 190 [2020-10-20 06:36:25,612 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 198 [2020-10-20 06:36:25,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 595 states and 701 transitions. [2020-10-20 06:36:25,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:25,613 INFO L691 BuchiCegarLoop]: Abstraction has 595 states and 701 transitions. [2020-10-20 06:36:25,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states and 701 transitions. [2020-10-20 06:36:25,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 577. [2020-10-20 06:36:25,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2020-10-20 06:36:25,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 682 transitions. [2020-10-20 06:36:25,621 INFO L714 BuchiCegarLoop]: Abstraction has 577 states and 682 transitions. [2020-10-20 06:36:25,622 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:36:25,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 06:36:25,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-10-20 06:36:25,622 INFO L87 Difference]: Start difference. First operand 577 states and 682 transitions. Second operand 8 states. [2020-10-20 06:36:25,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:36:25,672 INFO L93 Difference]: Finished difference Result 272 states and 308 transitions. [2020-10-20 06:36:25,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 06:36:25,673 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 272 states and 308 transitions. [2020-10-20 06:36:25,674 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2020-10-20 06:36:25,675 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 272 states to 233 states and 269 transitions. [2020-10-20 06:36:25,675 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 147 [2020-10-20 06:36:25,676 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 147 [2020-10-20 06:36:25,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 233 states and 269 transitions. [2020-10-20 06:36:25,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:25,676 INFO L691 BuchiCegarLoop]: Abstraction has 233 states and 269 transitions. [2020-10-20 06:36:25,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states and 269 transitions. [2020-10-20 06:36:25,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 214. [2020-10-20 06:36:25,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-10-20 06:36:25,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 250 transitions. [2020-10-20 06:36:25,680 INFO L714 BuchiCegarLoop]: Abstraction has 214 states and 250 transitions. [2020-10-20 06:36:25,680 INFO L594 BuchiCegarLoop]: Abstraction has 214 states and 250 transitions. [2020-10-20 06:36:25,680 INFO L427 BuchiCegarLoop]: ======== Iteration 23============ [2020-10-20 06:36:25,681 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 214 states and 250 transitions. [2020-10-20 06:36:25,681 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2020-10-20 06:36:25,682 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:36:25,682 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:36:25,682 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 10, 1, 1, 1] [2020-10-20 06:36:25,682 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [16, 15, 15, 10, 6, 1, 1] [2020-10-20 06:36:25,683 INFO L794 eck$LassoCheckResult]: Stem: 15388#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; 15389#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15400#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 15453#L12-2 assume !(main_~i~0 <= 0); 15452#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 15451#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15449#L12 assume !(main_~i~0 >= 10); 15450#L12-2 assume !(main_~i~0 <= 0); 15566#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 15564#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15395#L12 assume !(main_~i~0 >= 10); 15396#L12-2 assume !(main_~i~0 <= 0); 15459#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 15457#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15458#L12 assume !(main_~i~0 >= 10); 15561#L12-2 assume !(main_~i~0 <= 0); 15559#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 15557#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15555#L12 assume !(main_~i~0 >= 10); 15553#L12-2 assume !(main_~i~0 <= 0); 15551#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 15549#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15547#L12 assume !(main_~i~0 >= 10); 15545#L12-2 assume !(main_~i~0 <= 0); 15543#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 15541#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15539#L12 assume !(main_~i~0 >= 10); 15537#L12-2 assume !(main_~i~0 <= 0); 15535#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 15533#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15531#L12 assume !(main_~i~0 >= 10); 15529#L12-2 assume !(main_~i~0 <= 0); 15527#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 15525#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15523#L12 assume !(main_~i~0 >= 10); 15521#L12-2 assume !(main_~i~0 <= 0); 15519#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 15517#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15508#L12 assume !(main_~i~0 >= 10); 15514#L12-2 assume !(main_~i~0 <= 0); 15511#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 15507#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15500#L12 assume !(main_~i~0 >= 10); 15384#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 15385#L15-1 [2020-10-20 06:36:25,683 INFO L796 eck$LassoCheckResult]: Loop: 15385#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15390#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15391#L12 assume !(main_~i~0 >= 10); 15394#L12-2 assume !(main_~i~0 <= 0); 15497#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15496#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15495#L12 assume !(main_~i~0 >= 10); 15494#L12-2 assume !(main_~i~0 <= 0); 15493#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15492#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15491#L12 assume !(main_~i~0 >= 10); 15490#L12-2 assume !(main_~i~0 <= 0); 15489#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15488#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15487#L12 assume !(main_~i~0 >= 10); 15472#L12-2 assume !(main_~i~0 <= 0); 15473#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15469#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15467#L12 assume !(main_~i~0 >= 10); 15468#L12-2 assume !(main_~i~0 <= 0); 15465#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15464#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15461#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 15462#L12-2 assume !(main_~i~0 <= 0); 15569#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 15568#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15463#L12 assume !(main_~i~0 >= 10); 15460#L12-2 assume !(main_~i~0 <= 0); 15397#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 15398#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15567#L12 assume !(main_~i~0 >= 10); 15565#L12-2 assume !(main_~i~0 <= 0); 15563#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 15562#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15560#L12 assume !(main_~i~0 >= 10); 15558#L12-2 assume !(main_~i~0 <= 0); 15556#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 15554#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15552#L12 assume !(main_~i~0 >= 10); 15550#L12-2 assume !(main_~i~0 <= 0); 15548#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 15546#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15544#L12 assume !(main_~i~0 >= 10); 15542#L12-2 assume !(main_~i~0 <= 0); 15540#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 15538#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15536#L12 assume !(main_~i~0 >= 10); 15534#L12-2 assume !(main_~i~0 <= 0); 15532#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 15530#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15528#L12 assume !(main_~i~0 >= 10); 15526#L12-2 assume !(main_~i~0 <= 0); 15524#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 15522#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15520#L12 assume !(main_~i~0 >= 10); 15518#L12-2 assume !(main_~i~0 <= 0); 15516#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 15515#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15512#L12 assume !(main_~i~0 >= 10); 15509#L12-2 assume !(main_~i~0 <= 0); 15499#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 15505#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15503#L12 assume !(main_~i~0 >= 10); 15498#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 15385#L15-1 [2020-10-20 06:36:25,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:25,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1244253986, now seen corresponding path program 6 times [2020-10-20 06:36:25,683 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:25,683 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20542519] [2020-10-20 06:36:25,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:25,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:25,689 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:25,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:25,693 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:25,694 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:25,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:25,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1930483299, now seen corresponding path program 14 times [2020-10-20 06:36:25,695 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:25,695 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122577540] [2020-10-20 06:36:25,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:25,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:25,701 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:25,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:25,707 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:25,709 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:25,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:25,709 INFO L82 PathProgramCache]: Analyzing trace with hash -422612802, now seen corresponding path program 13 times [2020-10-20 06:36:25,709 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:25,709 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233417338] [2020-10-20 06:36:25,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:25,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:25,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 923 proven. 55 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2020-10-20 06:36:25,791 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233417338] [2020-10-20 06:36:25,791 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535253692] [2020-10-20 06:36:25,791 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:36:25,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:25,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-20 06:36:25,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:25,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 923 proven. 55 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2020-10-20 06:36:25,860 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:36:25,860 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2020-10-20 06:36:25,860 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103013959] [2020-10-20 06:36:26,203 WARN L193 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 64 [2020-10-20 06:36:26,220 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:36:26,220 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:36:26,220 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:36:26,220 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:36:26,220 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 06:36:26,221 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:26,221 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:36:26,221 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:36:26,221 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration23_Loop [2020-10-20 06:36:26,221 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:36:26,221 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:36:26,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:26,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:26,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:26,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:26,284 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:36:26,285 INFO L404 LassoAnalysis]: Checking for nontermination... 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) Waiting until toolchain timeout for monitored process 106 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:26,287 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:26,288 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 06:36:26,291 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 06:36:26,291 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_23=1} Honda state: {v_rep~unnamed0~0~true_23=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) Waiting until toolchain timeout for monitored process 107 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:26,311 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:26,312 INFO L160 nArgumentSynthesizer]: Using integer mode. 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 [2020-10-20 06:36:26,335 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 06:36:26,335 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 06:36:26,338 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 06:36:26,359 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:36:26,359 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:36:26,359 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:36:26,359 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:36:26,359 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:36:26,359 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:26,359 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:36:26,359 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:36:26,360 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration23_Loop [2020-10-20 06:36:26,360 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:36:26,360 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:36:26,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:26,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:26,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:26,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:26,427 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:36:26,427 INFO L489 LassoAnalysis]: Using template 'affine'. 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 [2020-10-20 06:36:26,429 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 [2020-10-20 06:36:26,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:36:26,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:36:26,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:36:26,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:36:26,431 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:36:26,432 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:36:26,434 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 [2020-10-20 06:36:26,456 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 [2020-10-20 06:36:26,457 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:36:26,457 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:36:26,457 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:36:26,457 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:36:26,457 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:36:26,458 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:36:26,458 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:36:26,459 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:36:26,462 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-20 06:36:26,462 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 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 [2020-10-20 06:36:26,464 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:36:26,465 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 06:36:26,465 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:36:26,465 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2020-10-20 06:36:26,484 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 06:36:26,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:26,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:26,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:36:26,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:26,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:26,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-20 06:36:26,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:26,762 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 290 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2020-10-20 06:36:26,763 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 [2020-10-20 06:36:26,763 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 214 states and 250 transitions. cyclomatic complexity: 41 Second operand 9 states. [2020-10-20 06:36:27,131 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 214 states and 250 transitions. cyclomatic complexity: 41. Second operand 9 states. Result 877 states and 1057 transitions. Complement of second has 31 states. [2020-10-20 06:36:27,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 1 stem states 14 non-accepting loop states 1 accepting loop states [2020-10-20 06:36:27,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-20 06:36:27,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 72 transitions. [2020-10-20 06:36:27,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 72 transitions. Stem has 44 letters. Loop has 64 letters. [2020-10-20 06:36:27,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:27,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 72 transitions. Stem has 108 letters. Loop has 64 letters. [2020-10-20 06:36:27,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:27,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 72 transitions. Stem has 44 letters. Loop has 128 letters. [2020-10-20 06:36:27,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:27,134 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 877 states and 1057 transitions. [2020-10-20 06:36:27,139 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 84 [2020-10-20 06:36:27,142 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 877 states to 663 states and 781 transitions. [2020-10-20 06:36:27,142 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 194 [2020-10-20 06:36:27,142 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 203 [2020-10-20 06:36:27,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 663 states and 781 transitions. [2020-10-20 06:36:27,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:27,143 INFO L691 BuchiCegarLoop]: Abstraction has 663 states and 781 transitions. [2020-10-20 06:36:27,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states and 781 transitions. [2020-10-20 06:36:27,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 643. [2020-10-20 06:36:27,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2020-10-20 06:36:27,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 760 transitions. [2020-10-20 06:36:27,152 INFO L714 BuchiCegarLoop]: Abstraction has 643 states and 760 transitions. [2020-10-20 06:36:27,152 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:36:27,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-20 06:36:27,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-10-20 06:36:27,153 INFO L87 Difference]: Start difference. First operand 643 states and 760 transitions. Second operand 9 states. [2020-10-20 06:36:27,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:36:27,207 INFO L93 Difference]: Finished difference Result 284 states and 318 transitions. [2020-10-20 06:36:27,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-20 06:36:27,208 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 284 states and 318 transitions. [2020-10-20 06:36:27,211 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2020-10-20 06:36:27,212 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 284 states to 237 states and 271 transitions. [2020-10-20 06:36:27,212 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 151 [2020-10-20 06:36:27,213 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 151 [2020-10-20 06:36:27,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 237 states and 271 transitions. [2020-10-20 06:36:27,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:27,213 INFO L691 BuchiCegarLoop]: Abstraction has 237 states and 271 transitions. [2020-10-20 06:36:27,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states and 271 transitions. [2020-10-20 06:36:27,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 214. [2020-10-20 06:36:27,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-10-20 06:36:27,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 248 transitions. [2020-10-20 06:36:27,217 INFO L714 BuchiCegarLoop]: Abstraction has 214 states and 248 transitions. [2020-10-20 06:36:27,217 INFO L594 BuchiCegarLoop]: Abstraction has 214 states and 248 transitions. [2020-10-20 06:36:27,218 INFO L427 BuchiCegarLoop]: ======== Iteration 24============ [2020-10-20 06:36:27,218 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 214 states and 248 transitions. [2020-10-20 06:36:27,219 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2020-10-20 06:36:27,219 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:36:27,219 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:36:27,220 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 10, 1, 1, 1] [2020-10-20 06:36:27,220 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [17, 16, 16, 10, 7, 1, 1] [2020-10-20 06:36:27,220 INFO L794 eck$LassoCheckResult]: Stem: 18131#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; 18132#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18142#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 18195#L12-2 assume !(main_~i~0 <= 0); 18194#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 18193#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18191#L12 assume !(main_~i~0 >= 10); 18192#L12-2 assume !(main_~i~0 <= 0); 18201#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 18202#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18138#L12 assume !(main_~i~0 >= 10); 18139#L12-2 assume !(main_~i~0 <= 0); 18203#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 18199#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18200#L12 assume !(main_~i~0 >= 10); 18305#L12-2 assume !(main_~i~0 <= 0); 18304#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 18303#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18302#L12 assume !(main_~i~0 >= 10); 18301#L12-2 assume !(main_~i~0 <= 0); 18300#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 18299#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18298#L12 assume !(main_~i~0 >= 10); 18297#L12-2 assume !(main_~i~0 <= 0); 18296#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 18295#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18294#L12 assume !(main_~i~0 >= 10); 18293#L12-2 assume !(main_~i~0 <= 0); 18292#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 18291#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18290#L12 assume !(main_~i~0 >= 10); 18289#L12-2 assume !(main_~i~0 <= 0); 18288#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 18287#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18286#L12 assume !(main_~i~0 >= 10); 18285#L12-2 assume !(main_~i~0 <= 0); 18284#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 18283#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18279#L12 assume !(main_~i~0 >= 10); 18282#L12-2 assume !(main_~i~0 <= 0); 18281#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 18278#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18137#L12 assume !(main_~i~0 >= 10); 18127#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 18128#L15-1 [2020-10-20 06:36:27,221 INFO L796 eck$LassoCheckResult]: Loop: 18128#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 18133#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18134#L12 assume !(main_~i~0 >= 10); 18242#L12-2 assume !(main_~i~0 <= 0); 18241#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 18240#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18239#L12 assume !(main_~i~0 >= 10); 18238#L12-2 assume !(main_~i~0 <= 0); 18237#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 18236#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18235#L12 assume !(main_~i~0 >= 10); 18234#L12-2 assume !(main_~i~0 <= 0); 18233#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 18232#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18231#L12 assume !(main_~i~0 >= 10); 18230#L12-2 assume !(main_~i~0 <= 0); 18229#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 18228#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18227#L12 assume !(main_~i~0 >= 10); 18216#L12-2 assume !(main_~i~0 <= 0); 18217#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 18213#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18211#L12 assume !(main_~i~0 >= 10); 18212#L12-2 assume !(main_~i~0 <= 0); 18209#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 18208#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18205#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 18206#L12-2 assume !(main_~i~0 <= 0); 18280#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 18277#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18207#L12 assume !(main_~i~0 >= 10); 18204#L12-2 assume !(main_~i~0 <= 0); 18140#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 18141#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18276#L12 assume !(main_~i~0 >= 10); 18275#L12-2 assume !(main_~i~0 <= 0); 18274#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 18273#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18272#L12 assume !(main_~i~0 >= 10); 18271#L12-2 assume !(main_~i~0 <= 0); 18270#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 18269#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18268#L12 assume !(main_~i~0 >= 10); 18267#L12-2 assume !(main_~i~0 <= 0); 18266#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 18265#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18264#L12 assume !(main_~i~0 >= 10); 18263#L12-2 assume !(main_~i~0 <= 0); 18262#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 18261#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18260#L12 assume !(main_~i~0 >= 10); 18259#L12-2 assume !(main_~i~0 <= 0); 18258#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 18257#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18256#L12 assume !(main_~i~0 >= 10); 18255#L12-2 assume !(main_~i~0 <= 0); 18254#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 18253#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18252#L12 assume !(main_~i~0 >= 10); 18251#L12-2 assume !(main_~i~0 <= 0); 18250#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 18249#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18248#L12 assume !(main_~i~0 >= 10); 18247#L12-2 assume !(main_~i~0 <= 0); 18244#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 18246#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18245#L12 assume !(main_~i~0 >= 10); 18243#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 18128#L15-1 [2020-10-20 06:36:27,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:27,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1244253986, now seen corresponding path program 7 times [2020-10-20 06:36:27,221 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:27,222 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331866796] [2020-10-20 06:36:27,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:27,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:27,229 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:27,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:27,233 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:27,241 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:27,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:27,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1504997932, now seen corresponding path program 15 times [2020-10-20 06:36:27,242 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:27,242 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454638604] [2020-10-20 06:36:27,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:27,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:27,264 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:27,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:27,273 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:27,275 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:27,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:27,276 INFO L82 PathProgramCache]: Analyzing trace with hash -92185483, now seen corresponding path program 14 times [2020-10-20 06:36:27,276 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:27,276 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900353562] [2020-10-20 06:36:27,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:27,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:27,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 1007 proven. 78 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2020-10-20 06:36:27,372 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900353562] [2020-10-20 06:36:27,373 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399986795] [2020-10-20 06:36:27,373 INFO L93 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 [2020-10-20 06:36:27,425 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 06:36:27,426 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:36:27,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-20 06:36:27,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:27,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 1007 proven. 78 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2020-10-20 06:36:27,448 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:36:27,448 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2020-10-20 06:36:27,448 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601767565] [2020-10-20 06:36:27,898 WARN L193 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 66 [2020-10-20 06:36:27,916 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:36:27,916 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:36:27,916 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:36:27,917 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:36:27,917 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 06:36:27,917 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:27,917 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:36:27,917 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:36:27,917 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration24_Loop [2020-10-20 06:36:27,918 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:36:27,918 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:36:27,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:27,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:27,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:27,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:28,005 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:36:28,006 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) [2020-10-20 06:36:28,010 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:28,010 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 113 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 114 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:36:28,081 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 06:36:28,081 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 114 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:28,086 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 06:36:28,150 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:36:28,150 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:36:28,151 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:36:28,151 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:36:28,151 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:36:28,151 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:28,151 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:36:28,151 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:36:28,151 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration24_Loop [2020-10-20 06:36:28,151 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:36:28,152 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:36:28,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:28,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:28,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:28,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:28,242 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:36:28,242 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) [2020-10-20 06:36:28,247 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 [2020-10-20 06:36:28,249 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:36:28,250 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:36:28,250 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:36:28,250 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:36:28,252 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:36:28,252 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 115 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:28,256 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 116 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:36:28,311 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 [2020-10-20 06:36:28,313 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:36:28,313 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:36:28,313 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:36:28,314 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:36:28,314 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:36:28,316 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:36:28,316 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 116 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:28,320 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:36:28,324 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-20 06:36:28,324 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 117 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:36:28,328 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:36:28,328 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 06:36:28,329 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:36:28,329 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 117 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:28,393 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 06:36:28,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:28,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:28,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:36:28,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:28,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:28,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-20 06:36:28,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:28,641 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2020-10-20 06:36:28,641 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 [2020-10-20 06:36:28,641 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 214 states and 248 transitions. cyclomatic complexity: 39 Second operand 10 states. [2020-10-20 06:36:29,079 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 214 states and 248 transitions. cyclomatic complexity: 39. Second operand 10 states. Result 1013 states and 1221 transitions. Complement of second has 35 states. [2020-10-20 06:36:29,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 18 states 1 stem states 16 non-accepting loop states 1 accepting loop states [2020-10-20 06:36:29,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-20 06:36:29,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 81 transitions. [2020-10-20 06:36:29,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 81 transitions. Stem has 44 letters. Loop has 68 letters. [2020-10-20 06:36:29,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:29,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 81 transitions. Stem has 112 letters. Loop has 68 letters. [2020-10-20 06:36:29,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:29,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 81 transitions. Stem has 44 letters. Loop has 136 letters. [2020-10-20 06:36:29,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:29,083 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1013 states and 1221 transitions. [2020-10-20 06:36:29,088 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 84 [2020-10-20 06:36:29,092 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1013 states to 739 states and 871 transitions. [2020-10-20 06:36:29,092 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 198 [2020-10-20 06:36:29,092 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 208 [2020-10-20 06:36:29,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 739 states and 871 transitions. [2020-10-20 06:36:29,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:29,093 INFO L691 BuchiCegarLoop]: Abstraction has 739 states and 871 transitions. [2020-10-20 06:36:29,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states and 871 transitions. [2020-10-20 06:36:29,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 717. [2020-10-20 06:36:29,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 717 states. [2020-10-20 06:36:29,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 848 transitions. [2020-10-20 06:36:29,103 INFO L714 BuchiCegarLoop]: Abstraction has 717 states and 848 transitions. [2020-10-20 06:36:29,104 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:36:29,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 06:36:29,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-10-20 06:36:29,104 INFO L87 Difference]: Start difference. First operand 717 states and 848 transitions. Second operand 10 states. [2020-10-20 06:36:29,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:36:29,176 INFO L93 Difference]: Finished difference Result 296 states and 328 transitions. [2020-10-20 06:36:29,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-20 06:36:29,176 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 296 states and 328 transitions. [2020-10-20 06:36:29,178 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2020-10-20 06:36:29,180 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 296 states to 241 states and 273 transitions. [2020-10-20 06:36:29,180 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 155 [2020-10-20 06:36:29,180 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 155 [2020-10-20 06:36:29,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 241 states and 273 transitions. [2020-10-20 06:36:29,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:29,181 INFO L691 BuchiCegarLoop]: Abstraction has 241 states and 273 transitions. [2020-10-20 06:36:29,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states and 273 transitions. [2020-10-20 06:36:29,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 214. [2020-10-20 06:36:29,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-10-20 06:36:29,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 246 transitions. [2020-10-20 06:36:29,186 INFO L714 BuchiCegarLoop]: Abstraction has 214 states and 246 transitions. [2020-10-20 06:36:29,186 INFO L594 BuchiCegarLoop]: Abstraction has 214 states and 246 transitions. [2020-10-20 06:36:29,186 INFO L427 BuchiCegarLoop]: ======== Iteration 25============ [2020-10-20 06:36:29,186 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 214 states and 246 transitions. [2020-10-20 06:36:29,187 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2020-10-20 06:36:29,187 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:36:29,187 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:36:29,188 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 10, 1, 1, 1] [2020-10-20 06:36:29,188 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [18, 17, 17, 10, 8, 1, 1] [2020-10-20 06:36:29,189 INFO L794 eck$LassoCheckResult]: Stem: 21129#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; 21130#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21141#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 21194#L12-2 assume !(main_~i~0 <= 0); 21193#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 21192#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21190#L12 assume !(main_~i~0 >= 10); 21191#L12-2 assume !(main_~i~0 <= 0); 21201#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 21317#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21137#L12 assume !(main_~i~0 >= 10); 21138#L12-2 assume !(main_~i~0 <= 0); 21200#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 21198#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21199#L12 assume !(main_~i~0 >= 10); 21299#L12-2 assume !(main_~i~0 <= 0); 21297#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 21295#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21293#L12 assume !(main_~i~0 >= 10); 21291#L12-2 assume !(main_~i~0 <= 0); 21289#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 21287#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21285#L12 assume !(main_~i~0 >= 10); 21283#L12-2 assume !(main_~i~0 <= 0); 21281#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 21279#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21277#L12 assume !(main_~i~0 >= 10); 21275#L12-2 assume !(main_~i~0 <= 0); 21273#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 21271#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21269#L12 assume !(main_~i~0 >= 10); 21267#L12-2 assume !(main_~i~0 <= 0); 21265#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 21263#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21261#L12 assume !(main_~i~0 >= 10); 21259#L12-2 assume !(main_~i~0 <= 0); 21257#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 21255#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21248#L12 assume !(main_~i~0 >= 10); 21252#L12-2 assume !(main_~i~0 <= 0); 21251#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 21247#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21244#L12 assume !(main_~i~0 >= 10); 21125#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 21126#L15-1 [2020-10-20 06:36:29,189 INFO L796 eck$LassoCheckResult]: Loop: 21126#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 21202#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21135#L12 assume !(main_~i~0 >= 10); 21136#L12-2 assume !(main_~i~0 <= 0); 21239#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 21238#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21237#L12 assume !(main_~i~0 >= 10); 21236#L12-2 assume !(main_~i~0 <= 0); 21235#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 21234#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21233#L12 assume !(main_~i~0 >= 10); 21232#L12-2 assume !(main_~i~0 <= 0); 21231#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 21230#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21229#L12 assume !(main_~i~0 >= 10); 21228#L12-2 assume !(main_~i~0 <= 0); 21227#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 21226#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21225#L12 assume !(main_~i~0 >= 10); 21224#L12-2 assume !(main_~i~0 <= 0); 21223#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 21222#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21221#L12 assume !(main_~i~0 >= 10); 21215#L12-2 assume !(main_~i~0 <= 0); 21216#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 21211#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21212#L12 assume !(main_~i~0 >= 10); 21217#L12-2 assume !(main_~i~0 <= 0); 21207#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 21206#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21204#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 21203#L12-2 assume !(main_~i~0 <= 0); 21139#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 21131#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21132#L12 assume !(main_~i~0 >= 10); 21205#L12-2 assume !(main_~i~0 <= 0); 21313#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 21311#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21309#L12 assume !(main_~i~0 >= 10); 21307#L12-2 assume !(main_~i~0 <= 0); 21305#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 21303#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21301#L12 assume !(main_~i~0 >= 10); 21300#L12-2 assume !(main_~i~0 <= 0); 21298#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 21296#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21294#L12 assume !(main_~i~0 >= 10); 21292#L12-2 assume !(main_~i~0 <= 0); 21290#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 21288#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21286#L12 assume !(main_~i~0 >= 10); 21284#L12-2 assume !(main_~i~0 <= 0); 21282#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 21280#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21278#L12 assume !(main_~i~0 >= 10); 21276#L12-2 assume !(main_~i~0 <= 0); 21274#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 21272#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21270#L12 assume !(main_~i~0 >= 10); 21268#L12-2 assume !(main_~i~0 <= 0); 21266#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 21264#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21262#L12 assume !(main_~i~0 >= 10); 21260#L12-2 assume !(main_~i~0 <= 0); 21258#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 21256#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21254#L12 assume !(main_~i~0 >= 10); 21253#L12-2 assume !(main_~i~0 <= 0); 21241#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 21249#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21245#L12 assume !(main_~i~0 >= 10); 21240#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 21126#L15-1 [2020-10-20 06:36:29,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:29,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1244253986, now seen corresponding path program 8 times [2020-10-20 06:36:29,190 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:29,190 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668277177] [2020-10-20 06:36:29,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:29,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:29,197 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:29,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:29,202 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:29,204 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:29,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:29,204 INFO L82 PathProgramCache]: Analyzing trace with hash 903675531, now seen corresponding path program 16 times [2020-10-20 06:36:29,204 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:29,204 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472612436] [2020-10-20 06:36:29,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:29,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:29,212 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:29,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:29,219 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:29,222 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:29,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:29,222 INFO L82 PathProgramCache]: Analyzing trace with hash -950496084, now seen corresponding path program 15 times [2020-10-20 06:36:29,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:29,223 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646777206] [2020-10-20 06:36:29,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:29,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:29,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 1091 proven. 105 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2020-10-20 06:36:29,308 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646777206] [2020-10-20 06:36:29,309 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308556227] [2020-10-20 06:36:29,309 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:36:29,368 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2020-10-20 06:36:29,368 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:36:29,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-20 06:36:29,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:29,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 1091 proven. 105 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2020-10-20 06:36:29,406 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:36:29,406 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2020-10-20 06:36:29,406 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477095542] [2020-10-20 06:36:30,015 WARN L193 SmtUtils]: Spent 603.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 69 [2020-10-20 06:36:30,028 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:36:30,028 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:36:30,028 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:36:30,028 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:36:30,028 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 06:36:30,028 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:30,029 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:36:30,029 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:36:30,029 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration25_Loop [2020-10-20 06:36:30,029 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:36:30,029 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:36:30,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:30,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:30,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:30,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:30,089 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:36:30,089 INFO L404 LassoAnalysis]: Checking for nontermination... 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) [2020-10-20 06:36:30,092 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:30,093 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 119 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:30,096 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 06:36:30,096 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 120 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:36:30,137 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:30,137 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 120 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 121 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:36:30,176 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 06:36:30,176 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 121 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:30,180 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 06:36:30,211 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:36:30,212 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:36:30,212 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:36:30,212 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:36:30,212 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:36:30,212 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:30,212 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:36:30,213 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:36:30,213 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration25_Loop [2020-10-20 06:36:30,213 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:36:30,213 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:36:30,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:30,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:30,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:30,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:30,285 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:36:30,285 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2020-10-20 06:36:30,288 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 [2020-10-20 06:36:30,290 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:36:30,290 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:36:30,290 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:36:30,290 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:36:30,292 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:36:30,292 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 122 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:30,296 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 123 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:36:30,331 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 [2020-10-20 06:36:30,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:36:30,332 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:36:30,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:36:30,333 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:36:30,333 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:36:30,334 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:36:30,334 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 123 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:30,336 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:36:30,338 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-10-20 06:36:30,338 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 124 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:36:30,341 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:36:30,341 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 06:36:30,342 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:36:30,342 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 124 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:30,363 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 06:36:30,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:30,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:30,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:36:30,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:30,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:30,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-20 06:36:30,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:30,502 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 422 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2020-10-20 06:36:30,502 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 [2020-10-20 06:36:30,502 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 214 states and 246 transitions. cyclomatic complexity: 37 Second operand 11 states. [2020-10-20 06:36:31,020 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 214 states and 246 transitions. cyclomatic complexity: 37. Second operand 11 states. Result 1165 states and 1405 transitions. Complement of second has 39 states. [2020-10-20 06:36:31,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 20 states 1 stem states 18 non-accepting loop states 1 accepting loop states [2020-10-20 06:36:31,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-20 06:36:31,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 90 transitions. [2020-10-20 06:36:31,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 90 transitions. Stem has 44 letters. Loop has 72 letters. [2020-10-20 06:36:31,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:31,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 90 transitions. Stem has 116 letters. Loop has 72 letters. [2020-10-20 06:36:31,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:31,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 90 transitions. Stem has 44 letters. Loop has 144 letters. [2020-10-20 06:36:31,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:31,024 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1165 states and 1405 transitions. [2020-10-20 06:36:31,029 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 84 [2020-10-20 06:36:31,033 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1165 states to 823 states and 971 transitions. [2020-10-20 06:36:31,033 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 202 [2020-10-20 06:36:31,034 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 213 [2020-10-20 06:36:31,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 823 states and 971 transitions. [2020-10-20 06:36:31,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:31,035 INFO L691 BuchiCegarLoop]: Abstraction has 823 states and 971 transitions. [2020-10-20 06:36:31,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states and 971 transitions. [2020-10-20 06:36:31,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 799. [2020-10-20 06:36:31,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-10-20 06:36:31,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 946 transitions. [2020-10-20 06:36:31,053 INFO L714 BuchiCegarLoop]: Abstraction has 799 states and 946 transitions. [2020-10-20 06:36:31,054 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:36:31,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-20 06:36:31,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2020-10-20 06:36:31,054 INFO L87 Difference]: Start difference. First operand 799 states and 946 transitions. Second operand 11 states. [2020-10-20 06:36:31,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:36:31,124 INFO L93 Difference]: Finished difference Result 308 states and 338 transitions. [2020-10-20 06:36:31,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-20 06:36:31,125 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 308 states and 338 transitions. [2020-10-20 06:36:31,126 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2020-10-20 06:36:31,128 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 308 states to 245 states and 275 transitions. [2020-10-20 06:36:31,128 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 159 [2020-10-20 06:36:31,129 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 159 [2020-10-20 06:36:31,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 245 states and 275 transitions. [2020-10-20 06:36:31,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:31,130 INFO L691 BuchiCegarLoop]: Abstraction has 245 states and 275 transitions. [2020-10-20 06:36:31,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states and 275 transitions. [2020-10-20 06:36:31,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 214. [2020-10-20 06:36:31,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-10-20 06:36:31,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 244 transitions. [2020-10-20 06:36:31,134 INFO L714 BuchiCegarLoop]: Abstraction has 214 states and 244 transitions. [2020-10-20 06:36:31,134 INFO L594 BuchiCegarLoop]: Abstraction has 214 states and 244 transitions. [2020-10-20 06:36:31,134 INFO L427 BuchiCegarLoop]: ======== Iteration 26============ [2020-10-20 06:36:31,134 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 214 states and 244 transitions. [2020-10-20 06:36:31,135 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2020-10-20 06:36:31,135 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:36:31,135 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:36:31,136 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 10, 1, 1, 1] [2020-10-20 06:36:31,136 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [19, 18, 18, 10, 9, 1, 1] [2020-10-20 06:36:31,137 INFO L794 eck$LassoCheckResult]: Stem: 24406#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; 24407#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 24417#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 24470#L12-2 assume !(main_~i~0 <= 0); 24469#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 24468#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 24466#L12 assume !(main_~i~0 >= 10); 24467#L12-2 assume !(main_~i~0 <= 0); 24596#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 24594#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 24413#L12 assume !(main_~i~0 >= 10); 24414#L12-2 assume !(main_~i~0 <= 0); 24476#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 24474#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 24475#L12 assume !(main_~i~0 >= 10); 24574#L12-2 assume !(main_~i~0 <= 0); 24572#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 24570#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 24568#L12 assume !(main_~i~0 >= 10); 24566#L12-2 assume !(main_~i~0 <= 0); 24564#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 24562#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 24560#L12 assume !(main_~i~0 >= 10); 24558#L12-2 assume !(main_~i~0 <= 0); 24556#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 24554#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 24552#L12 assume !(main_~i~0 >= 10); 24550#L12-2 assume !(main_~i~0 <= 0); 24548#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 24546#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 24544#L12 assume !(main_~i~0 >= 10); 24542#L12-2 assume !(main_~i~0 <= 0); 24540#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 24538#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 24536#L12 assume !(main_~i~0 >= 10); 24534#L12-2 assume !(main_~i~0 <= 0); 24532#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 24530#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 24523#L12 assume !(main_~i~0 >= 10); 24527#L12-2 assume !(main_~i~0 <= 0); 24526#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 24522#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 24519#L12 assume !(main_~i~0 >= 10); 24402#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 24403#L15-1 [2020-10-20 06:36:31,137 INFO L796 eck$LassoCheckResult]: Loop: 24403#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 24408#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 24409#L12 assume !(main_~i~0 >= 10); 24412#L12-2 assume !(main_~i~0 <= 0); 24514#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 24513#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 24512#L12 assume !(main_~i~0 >= 10); 24511#L12-2 assume !(main_~i~0 <= 0); 24510#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 24509#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 24508#L12 assume !(main_~i~0 >= 10); 24507#L12-2 assume !(main_~i~0 <= 0); 24506#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 24505#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 24504#L12 assume !(main_~i~0 >= 10); 24503#L12-2 assume !(main_~i~0 <= 0); 24502#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 24501#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 24500#L12 assume !(main_~i~0 >= 10); 24499#L12-2 assume !(main_~i~0 <= 0); 24498#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 24497#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 24496#L12 assume !(main_~i~0 >= 10); 24495#L12-2 assume !(main_~i~0 <= 0); 24494#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 24493#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 24492#L12 assume !(main_~i~0 >= 10); 24490#L12-2 assume !(main_~i~0 <= 0); 24488#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 24489#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 24484#L12 assume !(main_~i~0 >= 10); 24485#L12-2 assume !(main_~i~0 <= 0); 24482#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 24481#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 24478#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 24477#L12-2 assume !(main_~i~0 <= 0); 24415#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 24416#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 24479#L12 assume !(main_~i~0 >= 10); 24480#L12-2 assume !(main_~i~0 <= 0); 24588#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 24586#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 24584#L12 assume !(main_~i~0 >= 10); 24582#L12-2 assume !(main_~i~0 <= 0); 24580#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 24578#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 24576#L12 assume !(main_~i~0 >= 10); 24575#L12-2 assume !(main_~i~0 <= 0); 24573#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 24571#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 24569#L12 assume !(main_~i~0 >= 10); 24567#L12-2 assume !(main_~i~0 <= 0); 24565#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 24563#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 24561#L12 assume !(main_~i~0 >= 10); 24559#L12-2 assume !(main_~i~0 <= 0); 24557#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 24555#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 24553#L12 assume !(main_~i~0 >= 10); 24551#L12-2 assume !(main_~i~0 <= 0); 24549#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 24547#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 24545#L12 assume !(main_~i~0 >= 10); 24543#L12-2 assume !(main_~i~0 <= 0); 24541#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 24539#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 24537#L12 assume !(main_~i~0 >= 10); 24535#L12-2 assume !(main_~i~0 <= 0); 24533#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 24531#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 24529#L12 assume !(main_~i~0 >= 10); 24528#L12-2 assume !(main_~i~0 <= 0); 24516#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 24524#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 24520#L12 assume !(main_~i~0 >= 10); 24515#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 24403#L15-1 [2020-10-20 06:36:31,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:31,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1244253986, now seen corresponding path program 9 times [2020-10-20 06:36:31,138 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:31,139 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31346493] [2020-10-20 06:36:31,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:31,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:31,147 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:31,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:31,152 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:31,153 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:31,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:31,154 INFO L82 PathProgramCache]: Analyzing trace with hash -917947454, now seen corresponding path program 17 times [2020-10-20 06:36:31,154 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:31,154 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86388887] [2020-10-20 06:36:31,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:31,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:31,161 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:31,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:31,167 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:31,169 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:31,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:31,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1759172963, now seen corresponding path program 16 times [2020-10-20 06:36:31,170 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:31,170 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025931694] [2020-10-20 06:36:31,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:31,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:31,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 1175 proven. 136 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2020-10-20 06:36:31,280 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025931694] [2020-10-20 06:36:31,281 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930808160] [2020-10-20 06:36:31,281 INFO L93 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 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:36:31,348 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-20 06:36:31,349 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:36:31,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-20 06:36:31,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:31,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 1175 proven. 136 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2020-10-20 06:36:31,387 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:36:31,387 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2020-10-20 06:36:31,387 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500176851] [2020-10-20 06:36:32,025 WARN L193 SmtUtils]: Spent 632.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 74 [2020-10-20 06:36:32,044 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:36:32,044 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:36:32,044 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:36:32,044 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:36:32,044 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 06:36:32,045 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:32,045 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:36:32,045 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:36:32,045 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration26_Loop [2020-10-20 06:36:32,045 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:36:32,045 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:36:32,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:32,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:32,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:32,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:32,135 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:36:32,135 INFO L404 LassoAnalysis]: Checking for nontermination... 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 [2020-10-20 06:36:32,139 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:32,139 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 06:36:32,145 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 06:36:32,145 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_29=1} Honda state: {v_rep~unnamed0~0~true_29=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) [2020-10-20 06:36:32,213 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:32,213 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 127 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 128 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:36:32,296 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 06:36:32,297 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 128 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:32,301 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 06:36:32,338 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:36:32,339 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:36:32,339 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:36:32,339 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:36:32,339 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:36:32,339 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:32,339 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:36:32,339 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:36:32,339 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration26_Loop [2020-10-20 06:36:32,340 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:36:32,340 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:36:32,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:32,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:32,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:32,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:32,400 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:36:32,400 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2020-10-20 06:36:32,403 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 [2020-10-20 06:36:32,405 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:36:32,405 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:36:32,405 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:36:32,405 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:36:32,405 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:36:32,410 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:36:32,410 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 129 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:32,416 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:36:32,418 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-10-20 06:36:32,418 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 130 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:36:32,422 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:36:32,422 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 06:36:32,422 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:36:32,422 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 130 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:32,455 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 06:36:32,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:32,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:32,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:36:32,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:32,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:32,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjunts are in the unsatisfiable core [2020-10-20 06:36:32,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:32,599 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 494 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2020-10-20 06:36:32,600 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 [2020-10-20 06:36:32,600 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 214 states and 244 transitions. cyclomatic complexity: 35 Second operand 12 states. [2020-10-20 06:36:33,285 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 214 states and 244 transitions. cyclomatic complexity: 35. Second operand 12 states. Result 1239 states and 1496 transitions. Complement of second has 43 states. [2020-10-20 06:36:33,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 22 states 1 stem states 20 non-accepting loop states 1 accepting loop states [2020-10-20 06:36:33,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-20 06:36:33,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 97 transitions. [2020-10-20 06:36:33,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 97 transitions. Stem has 44 letters. Loop has 76 letters. [2020-10-20 06:36:33,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:33,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 97 transitions. Stem has 120 letters. Loop has 76 letters. [2020-10-20 06:36:33,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:33,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 97 transitions. Stem has 44 letters. Loop has 152 letters. [2020-10-20 06:36:33,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:33,288 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1239 states and 1496 transitions. [2020-10-20 06:36:33,294 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2020-10-20 06:36:33,297 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1239 states to 787 states and 932 transitions. [2020-10-20 06:36:33,298 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 168 [2020-10-20 06:36:33,298 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 172 [2020-10-20 06:36:33,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 787 states and 932 transitions. [2020-10-20 06:36:33,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:33,299 INFO L691 BuchiCegarLoop]: Abstraction has 787 states and 932 transitions. [2020-10-20 06:36:33,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states and 932 transitions. [2020-10-20 06:36:33,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 401. [2020-10-20 06:36:33,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2020-10-20 06:36:33,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 456 transitions. [2020-10-20 06:36:33,307 INFO L714 BuchiCegarLoop]: Abstraction has 401 states and 456 transitions. [2020-10-20 06:36:33,308 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:36:33,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-20 06:36:33,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2020-10-20 06:36:33,308 INFO L87 Difference]: Start difference. First operand 401 states and 456 transitions. Second operand 12 states. [2020-10-20 06:36:33,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:36:33,453 INFO L93 Difference]: Finished difference Result 405 states and 418 transitions. [2020-10-20 06:36:33,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-20 06:36:33,458 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 405 states and 418 transitions. [2020-10-20 06:36:33,460 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2020-10-20 06:36:33,462 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 405 states to 292 states and 305 transitions. [2020-10-20 06:36:33,462 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 178 [2020-10-20 06:36:33,463 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 284 [2020-10-20 06:36:33,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 292 states and 305 transitions. [2020-10-20 06:36:33,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:33,463 INFO L691 BuchiCegarLoop]: Abstraction has 292 states and 305 transitions. [2020-10-20 06:36:33,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states and 305 transitions. [2020-10-20 06:36:33,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 169. [2020-10-20 06:36:33,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2020-10-20 06:36:33,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 182 transitions. [2020-10-20 06:36:33,467 INFO L714 BuchiCegarLoop]: Abstraction has 169 states and 182 transitions. [2020-10-20 06:36:33,467 INFO L594 BuchiCegarLoop]: Abstraction has 169 states and 182 transitions. [2020-10-20 06:36:33,467 INFO L427 BuchiCegarLoop]: ======== Iteration 27============ [2020-10-20 06:36:33,467 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 169 states and 182 transitions. [2020-10-20 06:36:33,468 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2020-10-20 06:36:33,468 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:36:33,469 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:36:33,469 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2020-10-20 06:36:33,469 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [20, 19, 19, 10, 10, 1, 1] [2020-10-20 06:36:33,470 INFO L794 eck$LassoCheckResult]: Stem: 27489#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; 27490#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 27495#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 27487#L12-2 assume !(main_~i~0 <= 0); 27488#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 27493#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 27494#L12 assume !(main_~i~0 >= 10); 27485#L12-2 [2020-10-20 06:36:33,470 INFO L796 eck$LassoCheckResult]: Loop: 27485#L12-2 assume !(main_~i~0 <= 0); 27486#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 27615#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 27614#L12 assume !(main_~i~0 >= 10); 27613#L12-2 assume !(main_~i~0 <= 0); 27612#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 27611#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 27610#L12 assume !(main_~i~0 >= 10); 27609#L12-2 assume !(main_~i~0 <= 0); 27608#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 27607#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 27606#L12 assume !(main_~i~0 >= 10); 27605#L12-2 assume !(main_~i~0 <= 0); 27604#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 27603#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 27602#L12 assume !(main_~i~0 >= 10); 27601#L12-2 assume !(main_~i~0 <= 0); 27600#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 27599#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 27598#L12 assume !(main_~i~0 >= 10); 27597#L12-2 assume !(main_~i~0 <= 0); 27596#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 27595#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 27594#L12 assume !(main_~i~0 >= 10); 27593#L12-2 assume !(main_~i~0 <= 0); 27592#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 27591#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 27590#L12 assume !(main_~i~0 >= 10); 27589#L12-2 assume !(main_~i~0 <= 0); 27588#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 27587#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 27586#L12 assume !(main_~i~0 >= 10); 27585#L12-2 assume !(main_~i~0 <= 0); 27584#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 27583#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 27582#L12 assume !(main_~i~0 >= 10); 27580#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 27579#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 27491#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 27492#L12 assume !(main_~i~0 >= 10); 27496#L12-2 assume !(main_~i~0 <= 0); 27581#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 27653#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 27652#L12 assume !(main_~i~0 >= 10); 27651#L12-2 assume !(main_~i~0 <= 0); 27650#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 27649#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 27648#L12 assume !(main_~i~0 >= 10); 27647#L12-2 assume !(main_~i~0 <= 0); 27646#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 27645#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 27644#L12 assume !(main_~i~0 >= 10); 27643#L12-2 assume !(main_~i~0 <= 0); 27642#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 27641#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 27640#L12 assume !(main_~i~0 >= 10); 27639#L12-2 assume !(main_~i~0 <= 0); 27638#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 27637#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 27636#L12 assume !(main_~i~0 >= 10); 27635#L12-2 assume !(main_~i~0 <= 0); 27634#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 27633#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 27632#L12 assume !(main_~i~0 >= 10); 27631#L12-2 assume !(main_~i~0 <= 0); 27630#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 27629#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 27628#L12 assume !(main_~i~0 >= 10); 27627#L12-2 assume !(main_~i~0 <= 0); 27626#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 27625#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 27624#L12 assume !(main_~i~0 >= 10); 27623#L12-2 assume !(main_~i~0 <= 0); 27622#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 27621#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 27616#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 27617#L12-2 assume !(main_~i~0 <= 0); 27497#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 27498#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 27620#L12 assume !(main_~i~0 >= 10); 27485#L12-2 [2020-10-20 06:36:33,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:33,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1365704114, now seen corresponding path program 1 times [2020-10-20 06:36:33,471 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:33,471 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285438679] [2020-10-20 06:36:33,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:33,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:33,474 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:33,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:33,475 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:33,476 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:33,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:33,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1260641161, now seen corresponding path program 18 times [2020-10-20 06:36:33,477 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:33,477 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082712887] [2020-10-20 06:36:33,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:33,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:33,484 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:33,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:33,491 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:33,496 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:33,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:33,497 INFO L82 PathProgramCache]: Analyzing trace with hash -689456170, now seen corresponding path program 17 times [2020-10-20 06:36:33,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:33,498 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390885683] [2020-10-20 06:36:33,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:33,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:33,509 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:33,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:33,517 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:33,520 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:34,036 WARN L193 SmtUtils]: Spent 510.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 78 [2020-10-20 06:36:34,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.10 06:36:34 BoogieIcfgContainer [2020-10-20 06:36:34,113 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-20 06:36:34,114 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 06:36:34,114 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 06:36:34,114 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 06:36:34,115 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:36:12" (3/4) ... [2020-10-20 06:36:34,117 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-10-20 06:36:34,172 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 06:36:34,173 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 06:36:34,174 INFO L168 Benchmark]: Toolchain (without parser) took 21850.69 ms. Allocated memory was 36.2 MB in the beginning and 170.4 MB in the end (delta: 134.2 MB). Free memory was 13.9 MB in the beginning and 48.8 MB in the end (delta: -34.8 MB). Peak memory consumption was 99.4 MB. Max. memory is 14.3 GB. [2020-10-20 06:36:34,175 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 34.1 MB. Free memory was 19.1 MB in the beginning and 19.0 MB in the end (delta: 40.4 kB). Peak memory consumption was 40.4 kB. Max. memory is 14.3 GB. [2020-10-20 06:36:34,175 INFO L168 Benchmark]: CACSL2BoogieTranslator took 260.52 ms. Allocated memory was 36.2 MB in the beginning and 43.5 MB in the end (delta: 7.3 MB). Free memory was 13.0 MB in the beginning and 28.4 MB in the end (delta: -15.4 MB). Peak memory consumption was 9.2 MB. Max. memory is 14.3 GB. [2020-10-20 06:36:34,176 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.61 ms. Allocated memory is still 43.5 MB. Free memory was 28.4 MB in the beginning and 26.9 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 14.3 GB. [2020-10-20 06:36:34,176 INFO L168 Benchmark]: Boogie Preprocessor took 19.80 ms. Allocated memory is still 43.5 MB. Free memory was 26.9 MB in the beginning and 25.8 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.2 MB. Max. memory is 14.3 GB. [2020-10-20 06:36:34,176 INFO L168 Benchmark]: RCFGBuilder took 233.49 ms. Allocated memory is still 43.5 MB. Free memory was 25.8 MB in the beginning and 16.6 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 14.3 GB. [2020-10-20 06:36:34,176 INFO L168 Benchmark]: BuchiAutomizer took 21241.59 ms. Allocated memory was 43.5 MB in the beginning and 170.4 MB in the end (delta: 126.9 MB). Free memory was 16.4 MB in the beginning and 54.2 MB in the end (delta: -37.8 MB). Peak memory consumption was 129.1 MB. Max. memory is 14.3 GB. [2020-10-20 06:36:34,177 INFO L168 Benchmark]: Witness Printer took 59.30 ms. Allocated memory is still 170.4 MB. Free memory was 54.2 MB in the beginning and 48.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 14.3 GB. [2020-10-20 06:36:34,178 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 34.1 MB. Free memory was 19.1 MB in the beginning and 19.0 MB in the end (delta: 40.4 kB). Peak memory consumption was 40.4 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 260.52 ms. Allocated memory was 36.2 MB in the beginning and 43.5 MB in the end (delta: 7.3 MB). Free memory was 13.0 MB in the beginning and 28.4 MB in the end (delta: -15.4 MB). Peak memory consumption was 9.2 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 25.61 ms. Allocated memory is still 43.5 MB. Free memory was 28.4 MB in the beginning and 26.9 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 19.80 ms. Allocated memory is still 43.5 MB. Free memory was 26.9 MB in the beginning and 25.8 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.2 MB. Max. memory is 14.3 GB. * RCFGBuilder took 233.49 ms. Allocated memory is still 43.5 MB. Free memory was 25.8 MB in the beginning and 16.6 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 14.3 GB. * BuchiAutomizer took 21241.59 ms. Allocated memory was 43.5 MB in the beginning and 170.4 MB in the end (delta: 126.9 MB). Free memory was 16.4 MB in the beginning and 54.2 MB in the end (delta: -37.8 MB). Peak memory consumption was 129.1 MB. Max. memory is 14.3 GB. * Witness Printer took 59.30 ms. Allocated memory is still 170.4 MB. Free memory was 54.2 MB in the beginning and 48.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 37 terminating modules (22 trivial, 14 deterministic, 1 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function i 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 -2 * i + 1 and consists of 4 locations. One deterministic module has affine ranking function -2 * i + 17 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 and consists of 4 locations. One deterministic module has affine ranking function i and consists of 8 locations. One deterministic module has affine ranking function i and consists of 10 locations. One deterministic module has affine ranking function i and consists of 12 locations. One deterministic module has affine ranking function i and consists of 14 locations. One deterministic module has affine ranking function i and consists of 16 locations. One deterministic module has affine ranking function i and consists of 18 locations. One deterministic module has affine ranking function i and consists of 20 locations. One deterministic module has affine ranking function i and consists of 22 locations. One nondeterministic module has affine ranking function -2 * i + 17 and consists of 4 locations. 22 modules have a trivial ranking function, the largest among these consists of 12 locations. The remainder module has 169 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 21.1s and 27 iterations. TraceHistogramMax:20. Analysis of lassos took 14.0s. Construction of modules took 2.0s. Büchi inclusion checks took 4.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 36. Automata minimization 0.2s AutomataMinimizationTime, 37 MinimizatonAttempts, 1211 StatesRemovedByMinimization, 36 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 214 states and ocurred in iteration 18. Nontrivial modules had stage [14, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1520/3680 HoareTripleCheckerStatistics: 266 SDtfs, 767 SDslu, 9 SDs, 0 SdLazy, 2635 SolverSat, 277 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT4 conc0 concLT10 SILN0 SILU0 SILI9 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital20 mio100 ax160 hnf96 lsp44 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq127 hnf96 smp100 dnf100 smp100 tf112 neg100 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 19ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 23 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 15 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.3s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 15]: 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@144e7566=0, \result=0, i=9} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 11]: 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 [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) Loop: [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 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) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...