./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/NO_13.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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/NO_13.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 --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 eeea679d58a502ae5881094604c1f31424fa081cb4c3d3de58dd4530f33f3571 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 15:21:02,666 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 15:21:02,744 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-09 15:21:02,748 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 15:21:02,749 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 15:21:02,772 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 15:21:02,773 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 15:21:02,773 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 15:21:02,774 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 15:21:02,774 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 15:21:02,775 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 15:21:02,775 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 15:21:02,775 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 15:21:02,776 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-09 15:21:02,776 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-09 15:21:02,776 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-09 15:21:02,777 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-09 15:21:02,777 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-09 15:21:02,778 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-09 15:21:02,778 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 15:21:02,778 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-09 15:21:02,781 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 15:21:02,781 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 15:21:02,781 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-09 15:21:02,782 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-09 15:21:02,782 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-09 15:21:02,782 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 15:21:02,782 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 15:21:02,783 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 15:21:02,783 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-09 15:21:02,783 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 15:21:02,783 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 15:21:02,784 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 15:21:02,784 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 15:21:02,788 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 15:21:02,789 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-09 15:21:02,789 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 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 -> eeea679d58a502ae5881094604c1f31424fa081cb4c3d3de58dd4530f33f3571 [2024-11-09 15:21:03,033 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 15:21:03,056 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 15:21:03,060 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 15:21:03,062 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 15:21:03,062 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 15:21:03,063 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/NO_13.c [2024-11-09 15:21:04,546 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 15:21:04,715 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 15:21:04,715 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/NO_13.c [2024-11-09 15:21:04,721 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efa8f14f7/cf06ec68e28c4a549186f0aa5c64e216/FLAG046e77c82 [2024-11-09 15:21:04,733 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efa8f14f7/cf06ec68e28c4a549186f0aa5c64e216 [2024-11-09 15:21:04,735 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 15:21:04,736 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 15:21:04,737 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 15:21:04,737 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 15:21:04,743 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 15:21:04,744 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:21:04" (1/1) ... [2024-11-09 15:21:04,745 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23ecaf01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:21:04, skipping insertion in model container [2024-11-09 15:21:04,745 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:21:04" (1/1) ... [2024-11-09 15:21:04,761 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 15:21:04,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:21:04,941 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 15:21:04,951 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:21:04,962 INFO L204 MainTranslator]: Completed translation [2024-11-09 15:21:04,963 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:21:04 WrapperNode [2024-11-09 15:21:04,963 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 15:21:04,964 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 15:21:04,964 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 15:21:04,964 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 15:21:04,969 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:21:04" (1/1) ... [2024-11-09 15:21:04,972 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:21:04" (1/1) ... [2024-11-09 15:21:04,986 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 17 [2024-11-09 15:21:04,986 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 15:21:04,987 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 15:21:04,987 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 15:21:04,987 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 15:21:04,996 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:21:04" (1/1) ... [2024-11-09 15:21:04,996 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:21:04" (1/1) ... [2024-11-09 15:21:04,996 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:21:04" (1/1) ... [2024-11-09 15:21:05,001 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-09 15:21:05,002 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:21:04" (1/1) ... [2024-11-09 15:21:05,002 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:21:04" (1/1) ... [2024-11-09 15:21:05,003 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:21:04" (1/1) ... [2024-11-09 15:21:05,007 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:21:04" (1/1) ... [2024-11-09 15:21:05,008 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:21:04" (1/1) ... [2024-11-09 15:21:05,008 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:21:04" (1/1) ... [2024-11-09 15:21:05,009 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 15:21:05,011 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 15:21:05,012 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 15:21:05,012 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 15:21:05,012 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:21:04" (1/1) ... [2024-11-09 15:21:05,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:05,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:05,047 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:05,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-09 15:21:05,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 15:21:05,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 15:21:05,172 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 15:21:05,175 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 15:21:05,236 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-11-09 15:21:05,237 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 15:21:05,249 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 15:21:05,252 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 15:21:05,253 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:21:05 BoogieIcfgContainer [2024-11-09 15:21:05,253 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 15:21:05,254 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-09 15:21:05,254 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-09 15:21:05,262 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-09 15:21:05,263 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:21:05,263 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.11 03:21:04" (1/3) ... [2024-11-09 15:21:05,264 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@324a7d4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:21:05, skipping insertion in model container [2024-11-09 15:21:05,264 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:21:05,264 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:21:04" (2/3) ... [2024-11-09 15:21:05,265 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@324a7d4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:21:05, skipping insertion in model container [2024-11-09 15:21:05,266 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:21:05,266 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:21:05" (3/3) ... [2024-11-09 15:21:05,267 INFO L332 chiAutomizerObserver]: Analyzing ICFG NO_13.c [2024-11-09 15:21:05,318 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-09 15:21:05,318 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-09 15:21:05,318 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-09 15:21:05,319 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-09 15:21:05,319 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-09 15:21:05,319 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-09 15:21:05,319 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-09 15:21:05,319 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-09 15:21:05,323 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:05,334 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:21:05,334 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:21:05,334 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:21:05,338 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:21:05,338 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:21:05,338 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-09 15:21:05,338 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:05,339 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:21:05,339 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:21:05,339 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:21:05,339 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:21:05,340 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:21:05,344 INFO L745 eck$LassoCheckResult]: Stem: 5#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true; 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~j~0#1 := 100;main_~i~0#1 := 0; 2#L12-2true [2024-11-09 15:21:05,344 INFO L747 eck$LassoCheckResult]: Loop: 2#L12-2true assume !!(main_~i~0#1 < main_~j~0#1); 8#L12true assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1; 2#L12-2true [2024-11-09 15:21:05,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:05,349 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-09 15:21:05,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:05,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477644226] [2024-11-09 15:21:05,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:05,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:05,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:05,445 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:21:05,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:05,470 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:21:05,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:05,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1318, now seen corresponding path program 1 times [2024-11-09 15:21:05,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:05,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279146693] [2024-11-09 15:21:05,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:05,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:05,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:05,491 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:21:05,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:05,497 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:21:05,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:05,498 INFO L85 PathProgramCache]: Analyzing trace with hash 925800, now seen corresponding path program 1 times [2024-11-09 15:21:05,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:05,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313653212] [2024-11-09 15:21:05,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:05,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:05,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:05,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:21:05,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:21:05,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313653212] [2024-11-09 15:21:05,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313653212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:21:05,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:21:05,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 15:21:05,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728692477] [2024-11-09 15:21:05,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:21:05,660 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:21:05,661 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:21:05,661 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:21:05,662 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:21:05,662 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-09 15:21:05,662 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:05,662 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:21:05,662 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:21:05,662 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration1_Loop [2024-11-09 15:21:05,663 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:21:05,663 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:21:05,684 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:05,694 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:05,698 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:05,791 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:21:05,792 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-09 15:21:05,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:05,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:05,796 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:05,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-09 15:21:05,799 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:21:05,800 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:21:05,828 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:21:05,829 INFO L401 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: [] [2024-11-09 15:21:05,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-11-09 15:21:05,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:05,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:05,849 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:05,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-09 15:21:05,851 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:21:05,851 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:21:05,876 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:21:05,876 INFO L401 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: [] [2024-11-09 15:21:05,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-11-09 15:21:05,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:05,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:05,891 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:05,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-09 15:21:05,893 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:21:05,893 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:21:05,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-11-09 15:21:05,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:05,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:05,929 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:05,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-09 15:21:05,931 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-09 15:21:05,931 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:21:05,971 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-09 15:21:05,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-09 15:21:05,977 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:21:05,977 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:21:05,977 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:21:05,977 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:21:05,977 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:21:05,977 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:05,977 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:21:05,977 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:21:05,977 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration1_Loop [2024-11-09 15:21:05,977 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:21:05,978 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:21:05,980 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:05,990 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:05,998 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:06,079 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:21:06,085 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:21:06,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:06,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:06,088 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:06,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-09 15:21:06,091 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:21:06,102 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:21:06,102 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:21:06,102 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:21:06,102 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:21:06,106 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:21:06,106 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:21:06,112 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:21:06,129 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-09 15:21:06,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:06,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:06,134 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:06,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-09 15:21:06,137 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:21:06,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:21:06,149 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:21:06,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:21:06,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:21:06,152 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:21:06,152 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:21:06,157 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:21:06,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-11-09 15:21:06,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:06,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:06,173 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:06,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-09 15:21:06,174 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:21:06,185 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:21:06,185 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:21:06,186 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:21:06,186 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:21:06,186 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:21:06,187 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:21:06,188 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:21:06,191 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:21:06,194 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-09 15:21:06,194 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-09 15:21:06,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:06,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:06,220 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:06,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-09 15:21:06,222 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:21:06,222 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-09 15:21:06,223 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:21:06,223 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1) = -2*ULTIMATE.start_main_~j~0#1 + 103 Supporting invariants [] [2024-11-09 15:21:06,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-11-09 15:21:06,237 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-09 15:21:06,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:06,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:06,271 INFO L255 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:21:06,272 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:06,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:06,286 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:21:06,287 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:06,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:21:06,333 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2024-11-09 15:21:06,335 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:06,372 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 17 states and 24 transitions. Complement of second has 6 states. [2024-11-09 15:21:06,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-09 15:21:06,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:06,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2024-11-09 15:21:06,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 2 letters. [2024-11-09 15:21:06,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:06,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 4 letters. Loop has 2 letters. [2024-11-09 15:21:06,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:06,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 4 letters. [2024-11-09 15:21:06,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:06,386 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 24 transitions. [2024-11-09 15:21:06,388 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:21:06,392 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 8 states and 11 transitions. [2024-11-09 15:21:06,393 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2024-11-09 15:21:06,393 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2024-11-09 15:21:06,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 11 transitions. [2024-11-09 15:21:06,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:21:06,394 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8 states and 11 transitions. [2024-11-09 15:21:06,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 11 transitions. [2024-11-09 15:21:06,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2024-11-09 15:21:06,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:06,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2024-11-09 15:21:06,415 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 11 transitions. [2024-11-09 15:21:06,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:21:06,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 15:21:06,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 15:21:06,418 INFO L87 Difference]: Start difference. First operand 8 states and 11 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:06,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:21:06,430 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2024-11-09 15:21:06,430 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7 states and 8 transitions. [2024-11-09 15:21:06,430 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:21:06,431 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7 states to 6 states and 7 transitions. [2024-11-09 15:21:06,431 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2024-11-09 15:21:06,431 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2024-11-09 15:21:06,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 7 transitions. [2024-11-09 15:21:06,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:21:06,431 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6 states and 7 transitions. [2024-11-09 15:21:06,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states and 7 transitions. [2024-11-09 15:21:06,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2024-11-09 15:21:06,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:06,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2024-11-09 15:21:06,432 INFO L240 hiAutomatonCegarLoop]: Abstraction has 6 states and 7 transitions. [2024-11-09 15:21:06,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 15:21:06,435 INFO L425 stractBuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2024-11-09 15:21:06,435 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-09 15:21:06,435 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 7 transitions. [2024-11-09 15:21:06,435 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:21:06,435 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:21:06,435 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:21:06,436 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-09 15:21:06,436 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:21:06,436 INFO L745 eck$LassoCheckResult]: Stem: 78#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 79#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~j~0#1 := 100;main_~i~0#1 := 0; 80#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 81#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 76#L12-2 [2024-11-09 15:21:06,436 INFO L747 eck$LassoCheckResult]: Loop: 76#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 77#L12 assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1; 76#L12-2 [2024-11-09 15:21:06,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:06,437 INFO L85 PathProgramCache]: Analyzing trace with hash 925798, now seen corresponding path program 1 times [2024-11-09 15:21:06,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:06,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754427128] [2024-11-09 15:21:06,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:06,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:06,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:06,449 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:21:06,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:06,454 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:21:06,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:06,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1318, now seen corresponding path program 2 times [2024-11-09 15:21:06,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:06,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912489686] [2024-11-09 15:21:06,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:06,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:06,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:06,460 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:21:06,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:06,463 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:21:06,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:06,467 INFO L85 PathProgramCache]: Analyzing trace with hash 889692235, now seen corresponding path program 1 times [2024-11-09 15:21:06,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:06,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829908934] [2024-11-09 15:21:06,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:06,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:06,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:06,543 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:21:06,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:21:06,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829908934] [2024-11-09 15:21:06,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829908934] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:21:06,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544640319] [2024-11-09 15:21:06,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:06,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:21:06,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:06,547 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:21:06,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 15:21:06,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:06,578 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 15:21:06,579 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:06,608 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:21:06,608 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:21:06,631 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:21:06,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544640319] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:21:06,632 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:21:06,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-11-09 15:21:06,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025959677] [2024-11-09 15:21:06,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:21:06,661 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:21:06,661 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:21:06,661 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:21:06,661 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:21:06,662 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-09 15:21:06,662 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:06,662 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:21:06,662 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:21:06,662 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration2_Loop [2024-11-09 15:21:06,662 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:21:06,662 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:21:06,663 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:06,667 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:06,670 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:06,720 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:21:06,720 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-09 15:21:06,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:06,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:06,722 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:06,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-09 15:21:06,725 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:21:06,725 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:21:06,748 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:21:06,748 INFO L401 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: [] [2024-11-09 15:21:06,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-11-09 15:21:06,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:06,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:06,765 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:06,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-09 15:21:06,769 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:21:06,769 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:21:06,792 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:21:06,793 INFO L401 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: [] [2024-11-09 15:21:06,807 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-11-09 15:21:06,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:06,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:06,809 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:06,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-09 15:21:06,811 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:21:06,812 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:21:06,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-11-09 15:21:06,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:06,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:06,846 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:06,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-09 15:21:06,848 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-09 15:21:06,848 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:21:06,885 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-09 15:21:06,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-11-09 15:21:06,890 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:21:06,890 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:21:06,891 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:21:06,891 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:21:06,891 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:21:06,891 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:06,891 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:21:06,891 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:21:06,891 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration2_Loop [2024-11-09 15:21:06,891 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:21:06,891 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:21:06,892 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:06,896 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:06,900 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:06,948 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:21:06,949 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:21:06,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:06,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:06,951 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:06,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-09 15:21:06,953 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:21:06,965 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:21:06,966 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:21:06,966 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:21:06,966 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:21:06,968 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:21:06,968 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:21:06,972 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:21:06,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-11-09 15:21:06,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:06,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:06,988 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:06,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-09 15:21:06,990 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:21:07,003 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:21:07,003 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:21:07,003 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:21:07,003 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:21:07,006 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:21:07,006 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:21:07,009 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:21:07,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-11-09 15:21:07,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:07,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:07,026 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:07,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-09 15:21:07,029 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:21:07,042 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:21:07,042 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:21:07,043 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:21:07,043 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:21:07,043 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:21:07,044 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:21:07,044 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:21:07,047 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:21:07,051 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-09 15:21:07,054 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-09 15:21:07,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:07,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:07,057 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:07,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-09 15:21:07,060 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:21:07,060 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-09 15:21:07,060 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:21:07,060 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1) = -2*ULTIMATE.start_main_~j~0#1 + 103 Supporting invariants [] [2024-11-09 15:21:07,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-11-09 15:21:07,076 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-09 15:21:07,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:07,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:07,103 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:21:07,104 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:07,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:07,115 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:21:07,116 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:07,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:21:07,120 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2024-11-09 15:21:07,120 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 7 transitions. cyclomatic complexity: 2 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:07,131 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 7 transitions. cyclomatic complexity: 2. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 10 states and 13 transitions. Complement of second has 5 states. [2024-11-09 15:21:07,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-09 15:21:07,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:07,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2024-11-09 15:21:07,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 4 letters. Loop has 2 letters. [2024-11-09 15:21:07,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:07,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 6 letters. Loop has 2 letters. [2024-11-09 15:21:07,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:07,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 4 letters. Loop has 4 letters. [2024-11-09 15:21:07,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:07,135 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 13 transitions. [2024-11-09 15:21:07,135 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:21:07,135 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 13 transitions. [2024-11-09 15:21:07,136 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2024-11-09 15:21:07,136 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-11-09 15:21:07,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2024-11-09 15:21:07,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:21:07,138 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 13 transitions. [2024-11-09 15:21:07,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2024-11-09 15:21:07,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2024-11-09 15:21:07,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:07,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2024-11-09 15:21:07,139 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 13 transitions. [2024-11-09 15:21:07,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:21:07,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 15:21:07,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 15:21:07,141 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:07,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:21:07,165 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2024-11-09 15:21:07,165 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2024-11-09 15:21:07,165 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:21:07,166 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 12 states and 13 transitions. [2024-11-09 15:21:07,166 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-11-09 15:21:07,166 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-09 15:21:07,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 13 transitions. [2024-11-09 15:21:07,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:21:07,166 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 13 transitions. [2024-11-09 15:21:07,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 13 transitions. [2024-11-09 15:21:07,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-11-09 15:21:07,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:07,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2024-11-09 15:21:07,168 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 13 transitions. [2024-11-09 15:21:07,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 15:21:07,170 INFO L425 stractBuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2024-11-09 15:21:07,171 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-09 15:21:07,171 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 13 transitions. [2024-11-09 15:21:07,173 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:21:07,173 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:21:07,173 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:21:07,173 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1] [2024-11-09 15:21:07,173 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:21:07,174 INFO L745 eck$LassoCheckResult]: Stem: 188#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 189#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~j~0#1 := 100;main_~i~0#1 := 0; 190#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 191#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 186#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 187#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 197#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 196#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 195#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 194#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 193#L12-2 [2024-11-09 15:21:07,174 INFO L747 eck$LassoCheckResult]: Loop: 193#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 192#L12 assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1; 193#L12-2 [2024-11-09 15:21:07,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:07,174 INFO L85 PathProgramCache]: Analyzing trace with hash 742492623, now seen corresponding path program 2 times [2024-11-09 15:21:07,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:07,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818907410] [2024-11-09 15:21:07,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:07,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:07,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:07,192 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:21:07,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:07,206 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:21:07,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:07,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1318, now seen corresponding path program 3 times [2024-11-09 15:21:07,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:07,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237225110] [2024-11-09 15:21:07,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:07,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:07,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:07,214 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:21:07,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:07,219 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:21:07,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:07,219 INFO L85 PathProgramCache]: Analyzing trace with hash 570839924, now seen corresponding path program 2 times [2024-11-09 15:21:07,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:07,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241176531] [2024-11-09 15:21:07,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:07,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:07,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:07,334 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:21:07,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:21:07,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241176531] [2024-11-09 15:21:07,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241176531] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:21:07,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018657514] [2024-11-09 15:21:07,336 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 15:21:07,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:21:07,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:07,338 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:21:07,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-09 15:21:07,374 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 15:21:07,374 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:21:07,375 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 15:21:07,376 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:07,400 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:21:07,400 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:21:07,484 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:21:07,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018657514] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:21:07,484 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:21:07,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-09 15:21:07,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570854265] [2024-11-09 15:21:07,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:21:07,538 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-11-09 15:21:07,563 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:21:07,563 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:21:07,564 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:21:07,564 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:21:07,564 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-09 15:21:07,564 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:07,564 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:21:07,564 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:21:07,564 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration3_Loop [2024-11-09 15:21:07,564 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:21:07,564 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:21:07,565 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:07,571 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:07,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-09 15:21:07,617 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:07,663 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:21:07,663 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-09 15:21:07,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:07,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:07,665 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:07,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-09 15:21:07,668 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:21:07,668 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:21:07,690 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:21:07,691 INFO L401 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: [] [2024-11-09 15:21:07,706 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-11-09 15:21:07,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:07,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:07,708 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:07,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-09 15:21:07,710 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:21:07,711 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:21:07,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-11-09 15:21:07,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:07,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:07,743 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:07,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-09 15:21:07,745 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-09 15:21:07,745 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:21:07,784 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-09 15:21:07,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-11-09 15:21:07,790 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:21:07,790 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:21:07,790 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:21:07,791 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:21:07,791 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:21:07,791 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:07,791 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:21:07,791 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:21:07,791 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration3_Loop [2024-11-09 15:21:07,791 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:21:07,791 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:21:07,792 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:07,796 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:07,806 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:07,850 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:21:07,851 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:21:07,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:07,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:07,853 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:07,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-09 15:21:07,855 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:21:07,868 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:21:07,869 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:21:07,869 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:21:07,869 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:21:07,874 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:21:07,874 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:21:07,879 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:21:07,894 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2024-11-09 15:21:07,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:07,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:07,897 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:07,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-09 15:21:07,899 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:21:07,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:21:07,912 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:21:07,912 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:21:07,912 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:21:07,912 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:21:07,913 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:21:07,913 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:21:07,917 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:21:07,920 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-09 15:21:07,921 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-09 15:21:07,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:07,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:07,923 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:07,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-11-09 15:21:07,925 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:21:07,925 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-09 15:21:07,925 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:21:07,925 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1) = -2*ULTIMATE.start_main_~j~0#1 + 103 Supporting invariants [] [2024-11-09 15:21:07,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-11-09 15:21:07,941 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-09 15:21:07,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:07,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:07,964 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:21:07,965 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:07,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:07,988 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:21:07,988 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:07,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:21:07,992 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2024-11-09 15:21:07,992 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:08,001 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 13 states and 14 transitions. Complement of second has 5 states. [2024-11-09 15:21:08,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-09 15:21:08,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:08,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2024-11-09 15:21:08,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 10 letters. Loop has 2 letters. [2024-11-09 15:21:08,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:08,003 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:21:08,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:08,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:08,028 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:21:08,028 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:08,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:08,049 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:21:08,049 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:08,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:21:08,054 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2024-11-09 15:21:08,055 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:08,062 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 13 states and 14 transitions. Complement of second has 5 states. [2024-11-09 15:21:08,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-09 15:21:08,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:08,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2024-11-09 15:21:08,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 10 letters. Loop has 2 letters. [2024-11-09 15:21:08,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:08,065 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:21:08,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:08,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:08,091 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:21:08,092 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:08,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:08,111 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:21:08,111 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:08,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:21:08,114 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2024-11-09 15:21:08,115 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:08,129 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 17 states and 19 transitions. Complement of second has 4 states. [2024-11-09 15:21:08,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-09 15:21:08,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:08,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2024-11-09 15:21:08,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 10 letters. Loop has 2 letters. [2024-11-09 15:21:08,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:08,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 12 letters. Loop has 2 letters. [2024-11-09 15:21:08,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:08,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 10 letters. Loop has 4 letters. [2024-11-09 15:21:08,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:08,131 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2024-11-09 15:21:08,132 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-09 15:21:08,132 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 14 states and 16 transitions. [2024-11-09 15:21:08,132 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-11-09 15:21:08,132 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-09 15:21:08,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2024-11-09 15:21:08,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:21:08,133 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 16 transitions. [2024-11-09 15:21:08,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2024-11-09 15:21:08,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2024-11-09 15:21:08,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:08,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2024-11-09 15:21:08,136 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 15 transitions. [2024-11-09 15:21:08,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:21:08,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 15:21:08,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-11-09 15:21:08,136 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:08,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:21:08,189 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2024-11-09 15:21:08,189 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 34 transitions. [2024-11-09 15:21:08,190 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-09 15:21:08,190 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 26 states and 28 transitions. [2024-11-09 15:21:08,190 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2024-11-09 15:21:08,190 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-11-09 15:21:08,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 28 transitions. [2024-11-09 15:21:08,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:21:08,191 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 28 transitions. [2024-11-09 15:21:08,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 28 transitions. [2024-11-09 15:21:08,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2024-11-09 15:21:08,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.08) internal successors, (27), 24 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:08,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2024-11-09 15:21:08,194 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 27 transitions. [2024-11-09 15:21:08,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 15:21:08,196 INFO L425 stractBuchiCegarLoop]: Abstraction has 25 states and 27 transitions. [2024-11-09 15:21:08,196 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-09 15:21:08,196 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 27 transitions. [2024-11-09 15:21:08,196 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-09 15:21:08,197 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:21:08,197 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:21:08,197 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 9, 1, 1] [2024-11-09 15:21:08,197 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:21:08,198 INFO L745 eck$LassoCheckResult]: Stem: 501#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 502#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~j~0#1 := 100;main_~i~0#1 := 0; 503#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 504#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 496#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 497#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 520#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 519#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 518#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 517#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 516#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 515#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 514#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 513#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 512#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 511#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 510#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 509#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 508#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 507#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 506#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 500#L12 [2024-11-09 15:21:08,198 INFO L747 eck$LassoCheckResult]: Loop: 500#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 505#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 500#L12 [2024-11-09 15:21:08,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:08,198 INFO L85 PathProgramCache]: Analyzing trace with hash -926509747, now seen corresponding path program 3 times [2024-11-09 15:21:08,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:08,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694609034] [2024-11-09 15:21:08,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:08,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:08,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:08,224 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:21:08,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:08,243 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:21:08,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:08,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1406, now seen corresponding path program 1 times [2024-11-09 15:21:08,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:08,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981021513] [2024-11-09 15:21:08,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:08,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:08,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:08,248 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:21:08,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:08,250 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:21:08,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:08,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1317636150, now seen corresponding path program 4 times [2024-11-09 15:21:08,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:08,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106679221] [2024-11-09 15:21:08,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:08,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:08,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:08,275 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:21:08,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:08,295 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:21:08,326 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:21:08,326 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:21:08,326 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:21:08,326 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:21:08,327 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-09 15:21:08,327 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:08,327 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:21:08,327 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:21:08,327 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration4_Loop [2024-11-09 15:21:08,327 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:21:08,327 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:21:08,328 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:08,340 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:08,343 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:08,393 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:21:08,393 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-09 15:21:08,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:08,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:08,396 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:08,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-11-09 15:21:08,399 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:21:08,399 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:21:08,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-11-09 15:21:08,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:08,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:08,433 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:08,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-11-09 15:21:08,435 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-09 15:21:08,435 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:21:08,475 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-09 15:21:08,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2024-11-09 15:21:08,480 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:21:08,480 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:21:08,480 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:21:08,480 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:21:08,480 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:21:08,480 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:08,481 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:21:08,481 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:21:08,481 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration4_Loop [2024-11-09 15:21:08,481 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:21:08,481 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:21:08,483 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:08,493 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:08,497 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:08,538 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:21:08,538 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:21:08,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:08,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:08,541 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:08,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-11-09 15:21:08,543 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:21:08,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:21:08,556 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:21:08,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:21:08,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:21:08,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:21:08,557 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:21:08,558 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:21:08,560 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:21:08,564 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2024-11-09 15:21:08,564 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-09 15:21:08,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:08,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:08,566 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:08,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-11-09 15:21:08,568 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:21:08,568 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-09 15:21:08,568 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:21:08,568 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1) = 1*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2024-11-09 15:21:08,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-11-09 15:21:08,584 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-09 15:21:08,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:08,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:08,609 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:21:08,610 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:08,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:08,639 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:21:08,639 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:08,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:21:08,655 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-09 15:21:08,655 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 27 transitions. cyclomatic complexity: 3 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:08,665 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 27 transitions. cyclomatic complexity: 3. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 38 states and 42 transitions. Complement of second has 5 states. [2024-11-09 15:21:08,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-09 15:21:08,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:08,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2024-11-09 15:21:08,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 21 letters. Loop has 2 letters. [2024-11-09 15:21:08,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:08,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 23 letters. Loop has 2 letters. [2024-11-09 15:21:08,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:08,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 21 letters. Loop has 4 letters. [2024-11-09 15:21:08,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:08,668 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 42 transitions. [2024-11-09 15:21:08,669 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-09 15:21:08,669 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 28 states and 31 transitions. [2024-11-09 15:21:08,670 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2024-11-09 15:21:08,670 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2024-11-09 15:21:08,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 31 transitions. [2024-11-09 15:21:08,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:21:08,673 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 31 transitions. [2024-11-09 15:21:08,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 31 transitions. [2024-11-09 15:21:08,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2024-11-09 15:21:08,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:08,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2024-11-09 15:21:08,676 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 30 transitions. [2024-11-09 15:21:08,676 INFO L425 stractBuchiCegarLoop]: Abstraction has 27 states and 30 transitions. [2024-11-09 15:21:08,677 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-09 15:21:08,677 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 30 transitions. [2024-11-09 15:21:08,677 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-09 15:21:08,677 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:21:08,677 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:21:08,678 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 10, 1, 1, 1] [2024-11-09 15:21:08,678 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:21:08,678 INFO L745 eck$LassoCheckResult]: Stem: 652#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 653#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~j~0#1 := 100;main_~i~0#1 := 0; 648#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 649#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 654#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 655#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 650#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 651#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 674#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 673#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 672#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 671#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 670#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 669#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 668#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 667#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 666#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 665#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 664#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 663#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 662#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 661#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 660#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 657#L12 assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1; 656#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 658#L12 [2024-11-09 15:21:08,679 INFO L747 eck$LassoCheckResult]: Loop: 658#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 659#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 658#L12 [2024-11-09 15:21:08,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:08,679 INFO L85 PathProgramCache]: Analyzing trace with hash 767012677, now seen corresponding path program 3 times [2024-11-09 15:21:08,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:08,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461323401] [2024-11-09 15:21:08,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:08,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:08,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:08,852 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 11 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:21:08,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:21:08,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461323401] [2024-11-09 15:21:08,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461323401] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:21:08,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512419016] [2024-11-09 15:21:08,853 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 15:21:08,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:21:08,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:08,855 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:21:08,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2024-11-09 15:21:08,898 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2024-11-09 15:21:08,899 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:21:08,902 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 15:21:08,903 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:08,957 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 11 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:21:08,957 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:21:09,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-11-09 15:21:09,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2024-11-09 15:21:09,225 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 11 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:21:09,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512419016] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:21:09,226 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:21:09,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2024-11-09 15:21:09,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256472914] [2024-11-09 15:21:09,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:21:09,227 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:21:09,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:09,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1406, now seen corresponding path program 2 times [2024-11-09 15:21:09,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:09,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80252770] [2024-11-09 15:21:09,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:09,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:09,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:09,231 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:21:09,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:09,234 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:21:09,259 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:21:09,259 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:21:09,259 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:21:09,260 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:21:09,260 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-09 15:21:09,260 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:09,260 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:21:09,260 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:21:09,260 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration5_Loop [2024-11-09 15:21:09,260 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:21:09,260 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:21:09,261 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:09,270 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:09,273 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:09,311 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:21:09,311 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-09 15:21:09,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:09,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:09,314 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:09,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-11-09 15:21:09,316 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:21:09,316 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:21:09,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2024-11-09 15:21:09,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:09,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:09,345 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:09,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-11-09 15:21:09,347 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-09 15:21:09,347 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:21:09,382 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-09 15:21:09,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2024-11-09 15:21:09,388 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:21:09,388 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:21:09,388 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:21:09,388 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:21:09,388 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:21:09,388 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:09,388 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:21:09,388 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:21:09,388 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration5_Loop [2024-11-09 15:21:09,388 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:21:09,388 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:21:09,389 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:09,400 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:09,402 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:21:09,441 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:21:09,441 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:21:09,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:09,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:09,443 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:09,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-11-09 15:21:09,445 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:21:09,458 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:21:09,458 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:21:09,458 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:21:09,458 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:21:09,458 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:21:09,460 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:21:09,460 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:21:09,465 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:21:09,469 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2024-11-09 15:21:09,470 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-09 15:21:09,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:21:09,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:09,472 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:21:09,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-11-09 15:21:09,474 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:21:09,474 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-09 15:21:09,474 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:21:09,474 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1) = 1*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2024-11-09 15:21:09,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2024-11-09 15:21:09,489 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-09 15:21:09,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:09,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:09,523 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:21:09,524 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:09,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:09,562 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:21:09,562 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:09,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:21:09,578 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-09 15:21:09,578 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:09,592 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 38 states and 42 transitions. Complement of second has 5 states. [2024-11-09 15:21:09,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-09 15:21:09,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:09,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2024-11-09 15:21:09,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 25 letters. Loop has 2 letters. [2024-11-09 15:21:09,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:09,594 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:21:09,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:09,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:09,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:21:09,619 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:09,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:09,648 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:21:09,648 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:09,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:21:09,664 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-09 15:21:09,664 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:09,681 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 39 states and 43 transitions. Complement of second has 5 states. [2024-11-09 15:21:09,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-09 15:21:09,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:09,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2024-11-09 15:21:09,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 25 letters. Loop has 2 letters. [2024-11-09 15:21:09,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:09,683 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:21:09,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:09,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:09,708 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:21:09,709 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:09,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:09,746 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:21:09,746 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:09,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:21:09,760 INFO L141 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 [2024-11-09 15:21:09,760 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:09,771 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 40 states and 45 transitions. Complement of second has 4 states. [2024-11-09 15:21:09,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-09 15:21:09,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:09,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2024-11-09 15:21:09,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 25 letters. Loop has 2 letters. [2024-11-09 15:21:09,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:09,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 27 letters. Loop has 2 letters. [2024-11-09 15:21:09,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:09,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 25 letters. Loop has 4 letters. [2024-11-09 15:21:09,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:21:09,773 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 45 transitions. [2024-11-09 15:21:09,774 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-11-09 15:21:09,776 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 29 states and 32 transitions. [2024-11-09 15:21:09,776 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2024-11-09 15:21:09,776 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2024-11-09 15:21:09,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 32 transitions. [2024-11-09 15:21:09,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:21:09,777 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 32 transitions. [2024-11-09 15:21:09,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 32 transitions. [2024-11-09 15:21:09,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2024-11-09 15:21:09,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 25 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:09,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2024-11-09 15:21:09,779 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 28 transitions. [2024-11-09 15:21:09,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:21:09,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-09 15:21:09,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2024-11-09 15:21:09,780 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 24 states, 24 states have (on average 2.0) internal successors, (48), 24 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:09,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:21:09,858 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2024-11-09 15:21:09,859 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 65 transitions. [2024-11-09 15:21:09,860 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-09 15:21:09,860 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 51 states and 53 transitions. [2024-11-09 15:21:09,860 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2024-11-09 15:21:09,860 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2024-11-09 15:21:09,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 53 transitions. [2024-11-09 15:21:09,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:21:09,861 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 53 transitions. [2024-11-09 15:21:09,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 53 transitions. [2024-11-09 15:21:09,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2024-11-09 15:21:09,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.04) internal successors, (52), 49 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:09,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2024-11-09 15:21:09,863 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 52 transitions. [2024-11-09 15:21:09,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-09 15:21:09,864 INFO L425 stractBuchiCegarLoop]: Abstraction has 50 states and 52 transitions. [2024-11-09 15:21:09,864 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-09 15:21:09,864 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 52 transitions. [2024-11-09 15:21:09,865 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-09 15:21:09,865 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:21:09,865 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:21:09,866 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [24, 22, 1, 1, 1] [2024-11-09 15:21:09,866 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2024-11-09 15:21:09,866 INFO L745 eck$LassoCheckResult]: Stem: 1321#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 1322#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~j~0#1 := 100;main_~i~0#1 := 0; 1317#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1318#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1323#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1324#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1319#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1320#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1366#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1365#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1364#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1363#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1362#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1361#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1360#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1359#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1358#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1357#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1356#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1355#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1354#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1353#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1352#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1351#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1350#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1349#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1348#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1347#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1346#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1345#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1344#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1343#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1342#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1341#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1340#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1339#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1338#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1337#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1336#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1335#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1334#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1333#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1332#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1331#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1330#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1329#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1328#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1326#L12 assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1; 1325#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1327#L12 [2024-11-09 15:21:09,866 INFO L747 eck$LassoCheckResult]: Loop: 1327#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1328#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1326#L12 assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1; 1325#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1327#L12 [2024-11-09 15:21:09,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:09,867 INFO L85 PathProgramCache]: Analyzing trace with hash -694298463, now seen corresponding path program 4 times [2024-11-09 15:21:09,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:09,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638571274] [2024-11-09 15:21:09,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:09,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:09,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:10,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2024-11-09 15:21:10,428 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 23 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:21:10,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:21:10,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638571274] [2024-11-09 15:21:10,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638571274] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:21:10,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027442454] [2024-11-09 15:21:10,428 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 15:21:10,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:21:10,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:10,430 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:21:10,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2024-11-09 15:21:10,492 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 15:21:10,492 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:21:10,498 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-09 15:21:10,500 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:10,583 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 23 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:21:10,583 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:21:11,383 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 23 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:21:11,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2027442454] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:21:11,383 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:21:11,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 48 [2024-11-09 15:21:11,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687683621] [2024-11-09 15:21:11,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:21:11,384 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:21:11,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:11,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1351673, now seen corresponding path program 1 times [2024-11-09 15:21:11,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:11,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911078943] [2024-11-09 15:21:11,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:11,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:11,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:11,389 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:21:11,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:11,391 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:21:11,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:21:11,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-09 15:21:11,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2024-11-09 15:21:11,436 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. cyclomatic complexity: 3 Second operand has 48 states, 48 states have (on average 2.0) internal successors, (96), 48 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:11,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:21:11,588 INFO L93 Difference]: Finished difference Result 123 states and 125 transitions. [2024-11-09 15:21:11,588 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 125 transitions. [2024-11-09 15:21:11,589 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-09 15:21:11,590 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 99 states and 101 transitions. [2024-11-09 15:21:11,590 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2024-11-09 15:21:11,590 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2024-11-09 15:21:11,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 101 transitions. [2024-11-09 15:21:11,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:21:11,591 INFO L218 hiAutomatonCegarLoop]: Abstraction has 99 states and 101 transitions. [2024-11-09 15:21:11,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 101 transitions. [2024-11-09 15:21:11,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2024-11-09 15:21:11,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 98 states have (on average 1.0204081632653061) internal successors, (100), 97 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:11,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2024-11-09 15:21:11,601 INFO L240 hiAutomatonCegarLoop]: Abstraction has 98 states and 100 transitions. [2024-11-09 15:21:11,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-11-09 15:21:11,602 INFO L425 stractBuchiCegarLoop]: Abstraction has 98 states and 100 transitions. [2024-11-09 15:21:11,602 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-09 15:21:11,602 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 98 states and 100 transitions. [2024-11-09 15:21:11,604 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-09 15:21:11,604 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:21:11,604 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:21:11,609 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [48, 46, 1, 1, 1] [2024-11-09 15:21:11,609 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2024-11-09 15:21:11,609 INFO L745 eck$LassoCheckResult]: Stem: 1833#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 1834#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~j~0#1 := 100;main_~i~0#1 := 0; 1829#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1830#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1835#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1836#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1831#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1832#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1926#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1925#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1924#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1923#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1922#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1921#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1920#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1919#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1918#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1917#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1916#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1915#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1914#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1913#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1912#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1911#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1910#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1909#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1908#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1907#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1906#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1905#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1904#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1903#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1902#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1901#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1900#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1899#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1898#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1897#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1896#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1895#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1894#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1893#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1892#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1891#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1890#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1889#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1888#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1887#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1886#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1885#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1884#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1883#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1882#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1881#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1880#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1879#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1878#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1877#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1876#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1875#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1874#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1873#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1872#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1871#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1870#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1869#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1868#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1867#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1866#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1865#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1864#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1863#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1862#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1861#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1860#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1859#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1858#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1857#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1856#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1855#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1854#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1853#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1852#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1851#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1850#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1849#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1848#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1847#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1846#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1845#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1844#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1843#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1842#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1841#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1840#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1838#L12 assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1; 1837#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1839#L12 [2024-11-09 15:21:11,609 INFO L747 eck$LassoCheckResult]: Loop: 1839#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1840#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1838#L12 assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1; 1837#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1839#L12 [2024-11-09 15:21:11,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:11,610 INFO L85 PathProgramCache]: Analyzing trace with hash -818401447, now seen corresponding path program 5 times [2024-11-09 15:21:11,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:11,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437286152] [2024-11-09 15:21:11,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:11,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:11,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:21:13,257 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 47 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:21:13,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:21:13,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437286152] [2024-11-09 15:21:13,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437286152] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:21:13,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121002020] [2024-11-09 15:21:13,260 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-09 15:21:13,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:21:13,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:21:13,264 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:21:13,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2024-11-09 15:21:13,354 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2024-11-09 15:21:13,354 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:21:13,356 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-09 15:21:13,360 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:21:13,556 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 47 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:21:13,556 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:21:14,727 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 47 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:21:14,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121002020] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:21:14,728 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:21:14,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 51 [2024-11-09 15:21:14,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379256290] [2024-11-09 15:21:14,728 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:21:14,729 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:21:14,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:14,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1351673, now seen corresponding path program 2 times [2024-11-09 15:21:14,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:14,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604269323] [2024-11-09 15:21:14,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:14,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:14,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:14,733 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:21:14,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:14,735 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:21:14,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:21:14,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-11-09 15:21:14,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2024-11-09 15:21:14,779 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. cyclomatic complexity: 3 Second operand has 51 states, 51 states have (on average 2.019607843137255) internal successors, (103), 51 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:14,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:21:14,906 INFO L93 Difference]: Finished difference Result 108 states and 110 transitions. [2024-11-09 15:21:14,906 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 110 transitions. [2024-11-09 15:21:14,907 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-09 15:21:14,908 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 105 states and 107 transitions. [2024-11-09 15:21:14,908 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2024-11-09 15:21:14,908 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2024-11-09 15:21:14,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 107 transitions. [2024-11-09 15:21:14,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:21:14,909 INFO L218 hiAutomatonCegarLoop]: Abstraction has 105 states and 107 transitions. [2024-11-09 15:21:14,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 107 transitions. [2024-11-09 15:21:14,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2024-11-09 15:21:14,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 104 states have (on average 1.0192307692307692) internal successors, (106), 103 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:21:14,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 106 transitions. [2024-11-09 15:21:14,913 INFO L240 hiAutomatonCegarLoop]: Abstraction has 104 states and 106 transitions. [2024-11-09 15:21:14,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-11-09 15:21:14,914 INFO L425 stractBuchiCegarLoop]: Abstraction has 104 states and 106 transitions. [2024-11-09 15:21:14,914 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-09 15:21:14,914 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 106 transitions. [2024-11-09 15:21:14,915 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-09 15:21:14,915 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:21:14,915 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:21:14,917 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [51, 49, 1, 1, 1] [2024-11-09 15:21:14,917 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2024-11-09 15:21:14,918 INFO L745 eck$LassoCheckResult]: Stem: 2669#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 2670#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~j~0#1 := 100;main_~i~0#1 := 0; 2665#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2666#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2671#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2672#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2667#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2668#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2768#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2767#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2766#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2765#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2764#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2763#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2762#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2761#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2760#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2759#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2758#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2757#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2756#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2755#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2754#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2753#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2752#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2751#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2750#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2749#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2748#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2747#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2746#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2745#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2744#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2743#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2742#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2741#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2740#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2739#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2738#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2737#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2736#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2735#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2734#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2733#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2732#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2731#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2730#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2729#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2728#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2727#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2726#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2725#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2724#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2723#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2722#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2721#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2720#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2719#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2718#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2717#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2716#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2715#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2714#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2713#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2712#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2711#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2710#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2709#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2708#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2707#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2706#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2705#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2704#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2703#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2702#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2701#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2700#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2699#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2698#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2697#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2696#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2695#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2694#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2693#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2692#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2691#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2690#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2689#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2688#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2687#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2686#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2685#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2684#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2683#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2682#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2681#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2680#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2679#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2678#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2677#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2676#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2674#L12 assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1; 2673#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2675#L12 [2024-11-09 15:21:14,918 INFO L747 eck$LassoCheckResult]: Loop: 2675#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2676#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2674#L12 assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1; 2673#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2675#L12 [2024-11-09 15:21:14,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:14,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1994822288, now seen corresponding path program 6 times [2024-11-09 15:21:14,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:14,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857913129] [2024-11-09 15:21:14,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:14,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:14,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:14,965 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:21:15,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:15,008 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:21:15,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:15,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1351673, now seen corresponding path program 3 times [2024-11-09 15:21:15,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:15,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922061527] [2024-11-09 15:21:15,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:15,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:15,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:15,012 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:21:15,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:15,014 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:21:15,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:21:15,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1522445560, now seen corresponding path program 7 times [2024-11-09 15:21:15,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:21:15,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702660605] [2024-11-09 15:21:15,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:21:15,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:21:15,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:15,053 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:21:15,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:15,088 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:21:18,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:18,258 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:21:18,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:21:18,363 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.11 03:21:18 BoogieIcfgContainer [2024-11-09 15:21:18,364 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-09 15:21:18,364 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 15:21:18,364 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 15:21:18,364 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 15:21:18,365 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:21:05" (3/4) ... [2024-11-09 15:21:18,367 INFO L139 WitnessPrinter]: Generating witness for non-termination counterexample [2024-11-09 15:21:18,420 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 15:21:18,420 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 15:21:18,421 INFO L158 Benchmark]: Toolchain (without parser) took 13684.80ms. Allocated memory was 144.7MB in the beginning and 270.5MB in the end (delta: 125.8MB). Free memory was 92.0MB in the beginning and 97.2MB in the end (delta: -5.3MB). Peak memory consumption was 123.7MB. Max. memory is 16.1GB. [2024-11-09 15:21:18,421 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 144.7MB. Free memory is still 104.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 15:21:18,421 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.39ms. Allocated memory is still 144.7MB. Free memory was 91.5MB in the beginning and 80.1MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-09 15:21:18,422 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.67ms. Allocated memory is still 144.7MB. Free memory was 80.1MB in the beginning and 78.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 15:21:18,422 INFO L158 Benchmark]: Boogie Preprocessor took 22.33ms. Allocated memory is still 144.7MB. Free memory was 78.5MB in the beginning and 77.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 15:21:18,422 INFO L158 Benchmark]: RCFGBuilder took 241.73ms. Allocated memory is still 144.7MB. Free memory was 77.2MB in the beginning and 68.4MB in the end (delta: 8.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-09 15:21:18,422 INFO L158 Benchmark]: BuchiAutomizer took 13109.94ms. Allocated memory was 144.7MB in the beginning and 270.5MB in the end (delta: 125.8MB). Free memory was 68.4MB in the beginning and 102.5MB in the end (delta: -34.0MB). Peak memory consumption was 92.2MB. Max. memory is 16.1GB. [2024-11-09 15:21:18,423 INFO L158 Benchmark]: Witness Printer took 56.11ms. Allocated memory is still 270.5MB. Free memory was 101.4MB in the beginning and 97.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 15:21:18,424 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.45ms. Allocated memory is still 144.7MB. Free memory is still 104.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 226.39ms. Allocated memory is still 144.7MB. Free memory was 91.5MB in the beginning and 80.1MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.67ms. Allocated memory is still 144.7MB. Free memory was 80.1MB in the beginning and 78.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.33ms. Allocated memory is still 144.7MB. Free memory was 78.5MB in the beginning and 77.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 241.73ms. Allocated memory is still 144.7MB. Free memory was 77.2MB in the beginning and 68.4MB in the end (delta: 8.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 13109.94ms. Allocated memory was 144.7MB in the beginning and 270.5MB in the end (delta: 125.8MB). Free memory was 68.4MB in the beginning and 102.5MB in the end (delta: -34.0MB). Peak memory consumption was 92.2MB. Max. memory is 16.1GB. * Witness Printer took 56.11ms. Allocated memory is still 270.5MB. Free memory was 101.4MB in the beginning and 97.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (6 trivial, 3 deterministic, 2 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function (((long) -2 * j) + 103) and consists of 4 locations. One deterministic module has affine ranking function (((long) -2 * j) + 103) and consists of 3 locations. One deterministic module has affine ranking function j and consists of 3 locations. One nondeterministic module has affine ranking function (((long) -2 * j) + 103) and consists of 3 locations. One nondeterministic module has affine ranking function j and consists of 3 locations. 6 modules have a trivial ranking function, the largest among these consists of 51 locations. The remainder module has 104 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 13.0s and 8 iterations. TraceHistogramMax:51. Analysis of lassos took 11.6s. Construction of modules took 0.3s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 9. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 9 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 44 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 35 mSDsluCounter, 72 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21 mSDsCounter, 62 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 349 IncrementalHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 62 mSolverCounterUnsat, 51 mSDtfsCounter, 349 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT1 conc0 concLT3 SILN2 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital20 mio100 ax160 hnf100 lsp62 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf106 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 25ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 12]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L6] int i; [L7] int j; [L8] j = 100 [L9] i = 0 VAL [i=0, j=100] [L11] COND TRUE i < j VAL [i=0, j=100] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=1, j=99] [L11] COND TRUE i < j VAL [i=1, j=99] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=2, j=98] [L11] COND TRUE i < j VAL [i=2, j=98] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=3, j=97] [L11] COND TRUE i < j VAL [i=3, j=97] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=4, j=96] [L11] COND TRUE i < j VAL [i=4, j=96] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=5, j=95] [L11] COND TRUE i < j VAL [i=5, j=95] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=6, j=94] [L11] COND TRUE i < j VAL [i=6, j=94] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=7, j=93] [L11] COND TRUE i < j VAL [i=7, j=93] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=8, j=92] [L11] COND TRUE i < j VAL [i=8, j=92] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=9, j=91] [L11] COND TRUE i < j VAL [i=9, j=91] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=10, j=90] [L11] COND TRUE i < j VAL [i=10, j=90] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=11, j=89] [L11] COND TRUE i < j VAL [i=11, j=89] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=12, j=88] [L11] COND TRUE i < j VAL [i=12, j=88] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=13, j=87] [L11] COND TRUE i < j VAL [i=13, j=87] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=14, j=86] [L11] COND TRUE i < j VAL [i=14, j=86] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=15, j=85] [L11] COND TRUE i < j VAL [i=15, j=85] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=16, j=84] [L11] COND TRUE i < j VAL [i=16, j=84] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=17, j=83] [L11] COND TRUE i < j VAL [i=17, j=83] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=18, j=82] [L11] COND TRUE i < j VAL [i=18, j=82] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=19, j=81] [L11] COND TRUE i < j VAL [i=19, j=81] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=20, j=80] [L11] COND TRUE i < j VAL [i=20, j=80] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=21, j=79] [L11] COND TRUE i < j VAL [i=21, j=79] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=22, j=78] [L11] COND TRUE i < j VAL [i=22, j=78] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=23, j=77] [L11] COND TRUE i < j VAL [i=23, j=77] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=24, j=76] [L11] COND TRUE i < j VAL [i=24, j=76] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=25, j=75] [L11] COND TRUE i < j VAL [i=25, j=75] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=26, j=74] [L11] COND TRUE i < j VAL [i=26, j=74] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=27, j=73] [L11] COND TRUE i < j VAL [i=27, j=73] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=28, j=72] [L11] COND TRUE i < j VAL [i=28, j=72] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=29, j=71] [L11] COND TRUE i < j VAL [i=29, j=71] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=30, j=70] [L11] COND TRUE i < j VAL [i=30, j=70] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=31, j=69] [L11] COND TRUE i < j VAL [i=31, j=69] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=32, j=68] [L11] COND TRUE i < j VAL [i=32, j=68] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=33, j=67] [L11] COND TRUE i < j VAL [i=33, j=67] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=34, j=66] [L11] COND TRUE i < j VAL [i=34, j=66] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=35, j=65] [L11] COND TRUE i < j VAL [i=35, j=65] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=36, j=64] [L11] COND TRUE i < j VAL [i=36, j=64] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=37, j=63] [L11] COND TRUE i < j VAL [i=37, j=63] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=38, j=62] [L11] COND TRUE i < j VAL [i=38, j=62] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=39, j=61] [L11] COND TRUE i < j VAL [i=39, j=61] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=40, j=60] [L11] COND TRUE i < j VAL [i=40, j=60] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=41, j=59] [L11] COND TRUE i < j VAL [i=41, j=59] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=42, j=58] [L11] COND TRUE i < j VAL [i=42, j=58] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=43, j=57] [L11] COND TRUE i < j VAL [i=43, j=57] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=44, j=56] [L11] COND TRUE i < j VAL [i=44, j=56] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=45, j=55] [L11] COND TRUE i < j VAL [i=45, j=55] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=46, j=54] [L11] COND TRUE i < j VAL [i=46, j=54] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=47, j=53] [L11] COND TRUE i < j VAL [i=47, j=53] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=48, j=52] [L11] COND TRUE i < j VAL [i=48, j=52] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=49, j=51] [L11] COND TRUE i < j VAL [i=49, j=51] [L12] COND FALSE !(51 < j) [L13] i = i-1 [L13] j = j+1 VAL [i=48, j=52] [L11] COND TRUE i < j VAL [i=48, j=52] Loop: [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND FALSE !(51 < j) [L13] i = i-1 [L13] j = j+1 [L11] COND TRUE i < j End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 12]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] int j; [L8] j = 100 [L9] i = 0 VAL [i=0, j=100] [L11] COND TRUE i < j VAL [i=0, j=100] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=1, j=99] [L11] COND TRUE i < j VAL [i=1, j=99] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=2, j=98] [L11] COND TRUE i < j VAL [i=2, j=98] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=3, j=97] [L11] COND TRUE i < j VAL [i=3, j=97] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=4, j=96] [L11] COND TRUE i < j VAL [i=4, j=96] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=5, j=95] [L11] COND TRUE i < j VAL [i=5, j=95] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=6, j=94] [L11] COND TRUE i < j VAL [i=6, j=94] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=7, j=93] [L11] COND TRUE i < j VAL [i=7, j=93] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=8, j=92] [L11] COND TRUE i < j VAL [i=8, j=92] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=9, j=91] [L11] COND TRUE i < j VAL [i=9, j=91] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=10, j=90] [L11] COND TRUE i < j VAL [i=10, j=90] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=11, j=89] [L11] COND TRUE i < j VAL [i=11, j=89] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=12, j=88] [L11] COND TRUE i < j VAL [i=12, j=88] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=13, j=87] [L11] COND TRUE i < j VAL [i=13, j=87] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=14, j=86] [L11] COND TRUE i < j VAL [i=14, j=86] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=15, j=85] [L11] COND TRUE i < j VAL [i=15, j=85] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=16, j=84] [L11] COND TRUE i < j VAL [i=16, j=84] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=17, j=83] [L11] COND TRUE i < j VAL [i=17, j=83] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=18, j=82] [L11] COND TRUE i < j VAL [i=18, j=82] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=19, j=81] [L11] COND TRUE i < j VAL [i=19, j=81] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=20, j=80] [L11] COND TRUE i < j VAL [i=20, j=80] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=21, j=79] [L11] COND TRUE i < j VAL [i=21, j=79] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=22, j=78] [L11] COND TRUE i < j VAL [i=22, j=78] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=23, j=77] [L11] COND TRUE i < j VAL [i=23, j=77] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=24, j=76] [L11] COND TRUE i < j VAL [i=24, j=76] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=25, j=75] [L11] COND TRUE i < j VAL [i=25, j=75] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=26, j=74] [L11] COND TRUE i < j VAL [i=26, j=74] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=27, j=73] [L11] COND TRUE i < j VAL [i=27, j=73] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=28, j=72] [L11] COND TRUE i < j VAL [i=28, j=72] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=29, j=71] [L11] COND TRUE i < j VAL [i=29, j=71] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=30, j=70] [L11] COND TRUE i < j VAL [i=30, j=70] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=31, j=69] [L11] COND TRUE i < j VAL [i=31, j=69] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=32, j=68] [L11] COND TRUE i < j VAL [i=32, j=68] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=33, j=67] [L11] COND TRUE i < j VAL [i=33, j=67] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=34, j=66] [L11] COND TRUE i < j VAL [i=34, j=66] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=35, j=65] [L11] COND TRUE i < j VAL [i=35, j=65] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=36, j=64] [L11] COND TRUE i < j VAL [i=36, j=64] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=37, j=63] [L11] COND TRUE i < j VAL [i=37, j=63] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=38, j=62] [L11] COND TRUE i < j VAL [i=38, j=62] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=39, j=61] [L11] COND TRUE i < j VAL [i=39, j=61] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=40, j=60] [L11] COND TRUE i < j VAL [i=40, j=60] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=41, j=59] [L11] COND TRUE i < j VAL [i=41, j=59] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=42, j=58] [L11] COND TRUE i < j VAL [i=42, j=58] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=43, j=57] [L11] COND TRUE i < j VAL [i=43, j=57] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=44, j=56] [L11] COND TRUE i < j VAL [i=44, j=56] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=45, j=55] [L11] COND TRUE i < j VAL [i=45, j=55] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=46, j=54] [L11] COND TRUE i < j VAL [i=46, j=54] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=47, j=53] [L11] COND TRUE i < j VAL [i=47, j=53] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=48, j=52] [L11] COND TRUE i < j VAL [i=48, j=52] [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 VAL [i=49, j=51] [L11] COND TRUE i < j VAL [i=49, j=51] [L12] COND FALSE !(51 < j) [L13] i = i-1 [L13] j = j+1 VAL [i=48, j=52] [L11] COND TRUE i < j VAL [i=48, j=52] Loop: [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND FALSE !(51 < j) [L13] i = i-1 [L13] j = j+1 [L11] COND TRUE i < j End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-11-09 15:21:18,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2024-11-09 15:21:18,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2024-11-09 15:21:18,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2024-11-09 15:21:19,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-11-09 15:21:19,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-09 15:21:19,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)