./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/NO_13.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/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-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 16:58:10,287 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 16:58:10,338 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-10-13 16:58:10,343 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 16:58:10,344 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 16:58:10,367 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 16:58:10,368 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 16:58:10,369 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 16:58:10,369 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 16:58:10,370 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 16:58:10,370 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 16:58:10,371 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 16:58:10,371 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 16:58:10,371 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-13 16:58:10,371 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-13 16:58:10,371 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-13 16:58:10,372 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-13 16:58:10,372 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-13 16:58:10,374 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-13 16:58:10,374 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 16:58:10,374 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-13 16:58:10,375 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 16:58:10,376 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 16:58:10,377 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-13 16:58:10,377 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-13 16:58:10,377 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-13 16:58:10,377 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 16:58:10,377 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 16:58:10,377 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 16:58:10,378 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-13 16:58:10,378 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 16:58:10,378 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 16:58:10,378 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 16:58:10,378 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 16:58:10,378 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 16:58:10,379 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-13 16:58:10,379 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-10-13 16:58:10,572 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 16:58:10,589 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 16:58:10,591 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 16:58:10,592 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 16:58:10,593 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 16:58:10,594 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/NO_13.c [2024-10-13 16:58:11,784 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 16:58:11,919 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 16:58:11,919 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/NO_13.c [2024-10-13 16:58:11,924 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3dcafacdb/ec7975df376e4a1d8d66167ec180eded/FLAG5802f13bc [2024-10-13 16:58:11,934 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3dcafacdb/ec7975df376e4a1d8d66167ec180eded [2024-10-13 16:58:11,939 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 16:58:11,939 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 16:58:11,941 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 16:58:11,941 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 16:58:11,945 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 16:58:11,946 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:58:11" (1/1) ... [2024-10-13 16:58:11,946 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5204c357 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:58:11, skipping insertion in model container [2024-10-13 16:58:11,947 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:58:11" (1/1) ... [2024-10-13 16:58:11,958 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 16:58:12,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 16:58:12,094 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 16:58:12,104 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 16:58:12,114 INFO L204 MainTranslator]: Completed translation [2024-10-13 16:58:12,115 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:58:12 WrapperNode [2024-10-13 16:58:12,115 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 16:58:12,116 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 16:58:12,116 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 16:58:12,116 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 16:58:12,120 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:58:12" (1/1) ... [2024-10-13 16:58:12,122 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:58:12" (1/1) ... [2024-10-13 16:58:12,132 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 17 [2024-10-13 16:58:12,133 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 16:58:12,133 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 16:58:12,133 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 16:58:12,133 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 16:58:12,140 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:58:12" (1/1) ... [2024-10-13 16:58:12,140 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:58:12" (1/1) ... [2024-10-13 16:58:12,141 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:58:12" (1/1) ... [2024-10-13 16:58:12,145 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-13 16:58:12,145 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:58:12" (1/1) ... [2024-10-13 16:58:12,145 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:58:12" (1/1) ... [2024-10-13 16:58:12,146 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:58:12" (1/1) ... [2024-10-13 16:58:12,149 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:58:12" (1/1) ... [2024-10-13 16:58:12,149 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:58:12" (1/1) ... [2024-10-13 16:58:12,150 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:58:12" (1/1) ... [2024-10-13 16:58:12,150 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 16:58:12,151 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 16:58:12,151 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 16:58:12,151 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 16:58:12,152 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:58:12" (1/1) ... [2024-10-13 16:58:12,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:12,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:12,177 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-10-13 16:58:12,179 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-10-13 16:58:12,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 16:58:12,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 16:58:12,279 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 16:58:12,280 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 16:58:12,319 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-10-13 16:58:12,319 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 16:58:12,326 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 16:58:12,327 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 16:58:12,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:58:12 BoogieIcfgContainer [2024-10-13 16:58:12,327 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 16:58:12,328 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-13 16:58:12,328 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-13 16:58:12,331 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-13 16:58:12,331 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 16:58:12,332 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.10 04:58:11" (1/3) ... [2024-10-13 16:58:12,332 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@60c6498b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.10 04:58:12, skipping insertion in model container [2024-10-13 16:58:12,333 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 16:58:12,333 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:58:12" (2/3) ... [2024-10-13 16:58:12,334 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@60c6498b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.10 04:58:12, skipping insertion in model container [2024-10-13 16:58:12,334 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 16:58:12,334 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:58:12" (3/3) ... [2024-10-13 16:58:12,335 INFO L332 chiAutomizerObserver]: Analyzing ICFG NO_13.c [2024-10-13 16:58:12,370 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-13 16:58:12,370 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-13 16:58:12,370 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-13 16:58:12,370 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-13 16:58:12,370 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-13 16:58:12,370 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-13 16:58:12,371 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-13 16:58:12,371 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-13 16:58:12,373 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-10-13 16:58:12,383 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 16:58:12,383 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:58:12,384 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:58:12,387 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-13 16:58:12,387 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-13 16:58:12,387 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-13 16:58:12,387 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-10-13 16:58:12,388 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 16:58:12,388 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:58:12,388 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:58:12,388 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-13 16:58:12,388 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-13 16:58:12,393 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-10-13 16:58:12,393 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-10-13 16:58:12,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:12,397 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-10-13 16:58:12,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:12,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851702762] [2024-10-13 16:58:12,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:12,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:12,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:12,465 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:58:12,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:12,483 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:58:12,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:12,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1318, now seen corresponding path program 1 times [2024-10-13 16:58:12,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:12,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669533072] [2024-10-13 16:58:12,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:12,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:12,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:12,499 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:58:12,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:12,507 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:58:12,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:12,508 INFO L85 PathProgramCache]: Analyzing trace with hash 925800, now seen corresponding path program 1 times [2024-10-13 16:58:12,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:12,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750709661] [2024-10-13 16:58:12,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:12,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:12,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:12,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-10-13 16:58:12,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:58:12,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750709661] [2024-10-13 16:58:12,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750709661] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:58:12,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:58:12,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 16:58:12,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145151281] [2024-10-13 16:58:12,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:58:12,654 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:58:12,655 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:58:12,655 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:58:12,655 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:58:12,655 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-13 16:58:12,656 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:12,656 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:58:12,656 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:58:12,656 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration1_Loop [2024-10-13 16:58:12,656 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:58:12,656 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:58:12,671 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:12,680 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:12,686 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:12,761 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:58:12,762 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-13 16:58:12,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:12,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:12,765 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-10-13 16:58:12,766 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-10-13 16:58:12,767 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:58:12,767 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:12,790 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:58:12,790 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-10-13 16:58:12,801 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-10-13 16:58:12,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:12,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:12,803 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-10-13 16:58:12,804 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-10-13 16:58:12,805 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:58:12,805 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:12,823 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:58:12,824 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-10-13 16:58:12,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-10-13 16:58:12,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:12,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:12,836 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-10-13 16:58:12,837 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-10-13 16:58:12,838 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:58:12,838 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:12,859 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-10-13 16:58:12,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:12,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:12,861 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-10-13 16:58:12,861 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-10-13 16:58:12,864 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-13 16:58:12,864 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:12,893 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-13 16:58:12,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-10-13 16:58:12,898 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:58:12,898 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:58:12,898 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:58:12,898 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:58:12,898 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 16:58:12,898 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:12,899 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:58:12,899 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:58:12,899 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration1_Loop [2024-10-13 16:58:12,899 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:58:12,899 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:58:12,901 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:12,906 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:12,909 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:12,964 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:58:12,971 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 16:58:12,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:12,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:12,974 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-10-13 16:58:12,976 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-10-13 16:58:12,978 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-10-13 16:58:12,987 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:58:12,988 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:58:12,988 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:58:12,988 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:58:12,992 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 16:58:12,992 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 16:58:13,000 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:58:13,014 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-10-13 16:58:13,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:13,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:13,015 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-10-13 16:58:13,016 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-10-13 16:58:13,017 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-10-13 16:58:13,026 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:58:13,027 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:58:13,027 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:58:13,027 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:58:13,031 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 16:58:13,031 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 16:58:13,036 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:58:13,046 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-10-13 16:58:13,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:13,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:13,048 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-10-13 16:58:13,049 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-10-13 16:58:13,049 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-10-13 16:58:13,059 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:58:13,059 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:58:13,059 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:58:13,060 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:58:13,060 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:58:13,061 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:58:13,061 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:58:13,063 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 16:58:13,067 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-13 16:58:13,067 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-13 16:58:13,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:13,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:13,071 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-10-13 16:58:13,072 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-10-13 16:58:13,072 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 16:58:13,072 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-13 16:58:13,072 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 16:58:13,073 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-10-13 16:58:13,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-10-13 16:58:13,085 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-13 16:58:13,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:13,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:13,115 INFO L255 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 16:58:13,116 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:13,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:13,126 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 16:58:13,127 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:13,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:58:13,152 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-10-13 16:58:13,162 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-10-13 16:58:13,185 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-10-13 16:58:13,223 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-10-13 16:58:13,226 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-10-13 16:58:13,230 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-10-13 16:58:13,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2024-10-13 16:58:13,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 2 letters. [2024-10-13 16:58:13,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:13,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 4 letters. Loop has 2 letters. [2024-10-13 16:58:13,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:13,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 4 letters. [2024-10-13 16:58:13,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:13,233 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 24 transitions. [2024-10-13 16:58:13,235 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 16:58:13,237 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 8 states and 11 transitions. [2024-10-13 16:58:13,238 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2024-10-13 16:58:13,239 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2024-10-13 16:58:13,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 11 transitions. [2024-10-13 16:58:13,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:58:13,239 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8 states and 11 transitions. [2024-10-13 16:58:13,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 11 transitions. [2024-10-13 16:58:13,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2024-10-13 16:58:13,256 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-10-13 16:58:13,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2024-10-13 16:58:13,258 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 11 transitions. [2024-10-13 16:58:13,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:58:13,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 16:58:13,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 16:58:13,261 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-10-13 16:58:13,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:58:13,269 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2024-10-13 16:58:13,269 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7 states and 8 transitions. [2024-10-13 16:58:13,270 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 16:58:13,270 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7 states to 6 states and 7 transitions. [2024-10-13 16:58:13,270 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2024-10-13 16:58:13,270 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2024-10-13 16:58:13,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 7 transitions. [2024-10-13 16:58:13,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 16:58:13,270 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6 states and 7 transitions. [2024-10-13 16:58:13,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states and 7 transitions. [2024-10-13 16:58:13,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2024-10-13 16:58:13,271 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-10-13 16:58:13,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2024-10-13 16:58:13,271 INFO L240 hiAutomatonCegarLoop]: Abstraction has 6 states and 7 transitions. [2024-10-13 16:58:13,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 16:58:13,274 INFO L425 stractBuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2024-10-13 16:58:13,274 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-13 16:58:13,274 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 7 transitions. [2024-10-13 16:58:13,275 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 16:58:13,275 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:58:13,275 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:58:13,275 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-13 16:58:13,275 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-13 16:58:13,276 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-10-13 16:58:13,276 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-10-13 16:58:13,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:13,276 INFO L85 PathProgramCache]: Analyzing trace with hash 925798, now seen corresponding path program 1 times [2024-10-13 16:58:13,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:13,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010888823] [2024-10-13 16:58:13,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:13,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:13,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:13,281 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:58:13,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:13,288 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:58:13,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:13,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1318, now seen corresponding path program 2 times [2024-10-13 16:58:13,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:13,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130537942] [2024-10-13 16:58:13,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:13,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:13,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:13,292 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:58:13,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:13,297 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:58:13,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:13,298 INFO L85 PathProgramCache]: Analyzing trace with hash 889692235, now seen corresponding path program 1 times [2024-10-13 16:58:13,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:13,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819237449] [2024-10-13 16:58:13,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:13,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:13,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:13,332 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:58:13,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:58:13,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819237449] [2024-10-13 16:58:13,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819237449] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 16:58:13,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651617776] [2024-10-13 16:58:13,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:13,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:58:13,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:13,334 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-10-13 16:58:13,335 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-10-13 16:58:13,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:13,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 16:58:13,373 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:13,395 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:58:13,395 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 16:58:13,420 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:58:13,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651617776] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 16:58:13,420 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 16:58:13,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-10-13 16:58:13,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341472218] [2024-10-13 16:58:13,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 16:58:13,448 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:58:13,449 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:58:13,449 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:58:13,449 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:58:13,449 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-13 16:58:13,449 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:13,449 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:58:13,449 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:58:13,449 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration2_Loop [2024-10-13 16:58:13,449 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:58:13,449 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:58:13,450 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:13,454 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:13,457 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:13,500 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:58:13,500 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-13 16:58:13,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:13,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:13,502 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-10-13 16:58:13,504 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-10-13 16:58:13,504 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:58:13,504 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:13,524 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:58:13,524 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-10-13 16:58:13,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-10-13 16:58:13,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:13,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:13,537 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-10-13 16:58:13,540 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-10-13 16:58:13,542 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:58:13,542 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:13,561 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:58:13,561 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-10-13 16:58:13,572 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-10-13 16:58:13,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:13,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:13,574 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-10-13 16:58:13,575 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-10-13 16:58:13,575 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:58:13,575 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:13,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-10-13 16:58:13,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:13,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:13,599 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-10-13 16:58:13,599 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-10-13 16:58:13,600 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-13 16:58:13,600 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:13,628 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-13 16:58:13,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-10-13 16:58:13,633 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:58:13,633 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:58:13,634 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:58:13,634 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:58:13,634 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 16:58:13,634 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:13,634 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:58:13,634 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:58:13,634 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration2_Loop [2024-10-13 16:58:13,634 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:58:13,634 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:58:13,636 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:13,639 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:13,642 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:13,681 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:58:13,682 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 16:58:13,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:13,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:13,683 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-10-13 16:58:13,684 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-10-13 16:58:13,685 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-10-13 16:58:13,695 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:58:13,695 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:58:13,695 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:58:13,695 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:58:13,697 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 16:58:13,697 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 16:58:13,699 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:58:13,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-10-13 16:58:13,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:13,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:13,711 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-10-13 16:58:13,711 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-10-13 16:58:13,712 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-10-13 16:58:13,722 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:58:13,723 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:58:13,723 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:58:13,723 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:58:13,725 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 16:58:13,725 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 16:58:13,729 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:58:13,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-10-13 16:58:13,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:13,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:13,741 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-10-13 16:58:13,742 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-10-13 16:58:13,742 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-10-13 16:58:13,752 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:58:13,752 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:58:13,752 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:58:13,752 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:58:13,752 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:58:13,753 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:58:13,754 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:58:13,756 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 16:58:13,758 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-13 16:58:13,759 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-13 16:58:13,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:13,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:13,760 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-10-13 16:58:13,761 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-10-13 16:58:13,762 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 16:58:13,763 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-13 16:58:13,763 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 16:58:13,766 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-10-13 16:58:13,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-10-13 16:58:13,778 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-13 16:58:13,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:13,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:13,800 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 16:58:13,800 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:13,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:13,806 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 16:58:13,806 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:13,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:58:13,809 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-10-13 16:58:13,809 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-10-13 16:58:13,819 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-10-13 16:58:13,819 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-10-13 16:58:13,820 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-10-13 16:58:13,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2024-10-13 16:58:13,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 4 letters. Loop has 2 letters. [2024-10-13 16:58:13,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:13,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 6 letters. Loop has 2 letters. [2024-10-13 16:58:13,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:13,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 4 letters. Loop has 4 letters. [2024-10-13 16:58:13,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:13,821 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 13 transitions. [2024-10-13 16:58:13,821 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 16:58:13,822 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 13 transitions. [2024-10-13 16:58:13,822 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2024-10-13 16:58:13,822 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-10-13 16:58:13,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2024-10-13 16:58:13,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:58:13,822 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 13 transitions. [2024-10-13 16:58:13,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2024-10-13 16:58:13,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2024-10-13 16:58:13,823 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-10-13 16:58:13,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2024-10-13 16:58:13,823 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 13 transitions. [2024-10-13 16:58:13,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:58:13,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 16:58:13,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 16:58:13,825 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-10-13 16:58:13,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:58:13,842 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2024-10-13 16:58:13,842 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2024-10-13 16:58:13,843 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 16:58:13,843 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 12 states and 13 transitions. [2024-10-13 16:58:13,843 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-10-13 16:58:13,843 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-10-13 16:58:13,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 13 transitions. [2024-10-13 16:58:13,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 16:58:13,844 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 13 transitions. [2024-10-13 16:58:13,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 13 transitions. [2024-10-13 16:58:13,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-10-13 16:58:13,845 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-10-13 16:58:13,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2024-10-13 16:58:13,845 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 13 transitions. [2024-10-13 16:58:13,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 16:58:13,846 INFO L425 stractBuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2024-10-13 16:58:13,846 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-13 16:58:13,846 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 13 transitions. [2024-10-13 16:58:13,847 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 16:58:13,847 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:58:13,847 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:58:13,847 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1] [2024-10-13 16:58:13,847 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-13 16:58:13,847 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-10-13 16:58:13,847 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-10-13 16:58:13,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:13,848 INFO L85 PathProgramCache]: Analyzing trace with hash 742492623, now seen corresponding path program 2 times [2024-10-13 16:58:13,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:13,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133760704] [2024-10-13 16:58:13,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:13,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:13,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:13,860 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:58:13,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:13,872 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:58:13,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:13,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1318, now seen corresponding path program 3 times [2024-10-13 16:58:13,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:13,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695647782] [2024-10-13 16:58:13,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:13,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:13,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:13,875 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:58:13,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:13,878 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:58:13,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:13,878 INFO L85 PathProgramCache]: Analyzing trace with hash 570839924, now seen corresponding path program 2 times [2024-10-13 16:58:13,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:13,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396693231] [2024-10-13 16:58:13,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:13,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:13,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:13,978 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:58:13,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:58:13,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396693231] [2024-10-13 16:58:13,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396693231] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 16:58:13,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382311123] [2024-10-13 16:58:13,979 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 16:58:13,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:58:13,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:13,981 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-10-13 16:58:13,982 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-10-13 16:58:14,006 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 16:58:14,007 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 16:58:14,007 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 16:58:14,008 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:14,022 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:58:14,022 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 16:58:14,086 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:58:14,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [382311123] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 16:58:14,087 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 16:58:14,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-10-13 16:58:14,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430197224] [2024-10-13 16:58:14,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 16:58:14,106 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:58:14,106 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:58:14,106 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:58:14,106 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:58:14,107 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-13 16:58:14,107 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:14,107 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:58:14,107 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:58:14,107 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration3_Loop [2024-10-13 16:58:14,107 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:58:14,107 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:58:14,107 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:14,112 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:14,123 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:14,165 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:58:14,165 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-13 16:58:14,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:14,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:14,167 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-10-13 16:58:14,168 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-10-13 16:58:14,189 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:58:14,189 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:14,203 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-10-13 16:58:14,237 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:58:14,237 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-10-13 16:58:14,249 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-10-13 16:58:14,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:14,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:14,251 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-10-13 16:58:14,252 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-10-13 16:58:14,253 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:58:14,253 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:14,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-10-13 16:58:14,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:14,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:14,277 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-10-13 16:58:14,278 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-10-13 16:58:14,278 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-13 16:58:14,279 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:14,306 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-13 16:58:14,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-10-13 16:58:14,310 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:58:14,310 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:58:14,310 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:58:14,310 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:58:14,311 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 16:58:14,311 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:14,311 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:58:14,311 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:58:14,311 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration3_Loop [2024-10-13 16:58:14,311 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:58:14,311 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:58:14,312 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:14,315 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:14,322 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:14,356 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:58:14,357 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 16:58:14,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:14,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:14,362 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-10-13 16:58:14,363 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-10-13 16:58:14,364 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-10-13 16:58:14,373 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:58:14,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:58:14,373 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:58:14,373 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:58:14,375 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 16:58:14,375 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 16:58:14,378 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:58:14,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-10-13 16:58:14,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:14,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:14,390 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-10-13 16:58:14,390 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-10-13 16:58:14,391 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-10-13 16:58:14,401 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:58:14,401 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:58:14,401 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:58:14,401 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:58:14,401 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:58:14,402 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:58:14,402 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:58:14,404 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 16:58:14,406 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-13 16:58:14,406 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-13 16:58:14,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:14,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:14,408 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-10-13 16:58:14,409 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-10-13 16:58:14,409 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 16:58:14,409 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-13 16:58:14,409 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 16:58:14,409 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-10-13 16:58:14,420 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-10-13 16:58:14,421 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-13 16:58:14,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:14,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:14,441 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 16:58:14,441 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:14,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:14,463 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 16:58:14,463 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:14,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:58:14,466 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-10-13 16:58:14,466 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-10-13 16:58:14,473 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-10-13 16:58:14,473 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-10-13 16:58:14,474 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-10-13 16:58:14,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2024-10-13 16:58:14,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 10 letters. Loop has 2 letters. [2024-10-13 16:58:14,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:14,474 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 16:58:14,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:14,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:14,494 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 16:58:14,494 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:14,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:14,511 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 16:58:14,512 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:14,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:58:14,514 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-10-13 16:58:14,514 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-10-13 16:58:14,522 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-10-13 16:58:14,522 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-10-13 16:58:14,523 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-10-13 16:58:14,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2024-10-13 16:58:14,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 10 letters. Loop has 2 letters. [2024-10-13 16:58:14,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:14,523 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 16:58:14,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:14,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:14,541 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 16:58:14,541 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:14,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:14,556 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 16:58:14,556 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:14,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:58:14,562 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-10-13 16:58:14,562 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-10-13 16:58:14,571 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-10-13 16:58:14,572 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-10-13 16:58:14,572 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-10-13 16:58:14,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2024-10-13 16:58:14,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 10 letters. Loop has 2 letters. [2024-10-13 16:58:14,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:14,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 12 letters. Loop has 2 letters. [2024-10-13 16:58:14,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:14,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 10 letters. Loop has 4 letters. [2024-10-13 16:58:14,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:14,573 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2024-10-13 16:58:14,574 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-13 16:58:14,574 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 14 states and 16 transitions. [2024-10-13 16:58:14,574 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-10-13 16:58:14,574 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-10-13 16:58:14,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2024-10-13 16:58:14,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:58:14,575 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 16 transitions. [2024-10-13 16:58:14,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2024-10-13 16:58:14,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2024-10-13 16:58:14,576 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-10-13 16:58:14,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2024-10-13 16:58:14,577 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 15 transitions. [2024-10-13 16:58:14,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:58:14,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 16:58:14,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-10-13 16:58:14,579 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-10-13 16:58:14,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:58:14,618 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2024-10-13 16:58:14,618 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 34 transitions. [2024-10-13 16:58:14,619 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-13 16:58:14,619 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 26 states and 28 transitions. [2024-10-13 16:58:14,619 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2024-10-13 16:58:14,619 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-10-13 16:58:14,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 28 transitions. [2024-10-13 16:58:14,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:58:14,619 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 28 transitions. [2024-10-13 16:58:14,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 28 transitions. [2024-10-13 16:58:14,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2024-10-13 16:58:14,621 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-10-13 16:58:14,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2024-10-13 16:58:14,621 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 27 transitions. [2024-10-13 16:58:14,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 16:58:14,625 INFO L425 stractBuchiCegarLoop]: Abstraction has 25 states and 27 transitions. [2024-10-13 16:58:14,625 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-13 16:58:14,625 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 27 transitions. [2024-10-13 16:58:14,625 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-13 16:58:14,626 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:58:14,626 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:58:14,626 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 9, 1, 1] [2024-10-13 16:58:14,626 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-13 16:58:14,626 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-10-13 16:58:14,626 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-10-13 16:58:14,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:14,627 INFO L85 PathProgramCache]: Analyzing trace with hash -926509747, now seen corresponding path program 3 times [2024-10-13 16:58:14,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:14,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552429305] [2024-10-13 16:58:14,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:14,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:14,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:14,648 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:58:14,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:14,668 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:58:14,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:14,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1406, now seen corresponding path program 1 times [2024-10-13 16:58:14,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:14,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750707414] [2024-10-13 16:58:14,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:14,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:14,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:14,673 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:58:14,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:14,674 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:58:14,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:14,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1317636150, now seen corresponding path program 4 times [2024-10-13 16:58:14,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:14,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246074115] [2024-10-13 16:58:14,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:14,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:14,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:14,692 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:58:14,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:14,698 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:58:14,719 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:58:14,719 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:58:14,719 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:58:14,719 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:58:14,719 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-13 16:58:14,719 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:14,719 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:58:14,719 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:58:14,719 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration4_Loop [2024-10-13 16:58:14,719 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:58:14,720 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:58:14,720 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:14,726 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:14,728 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:14,757 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:58:14,757 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-13 16:58:14,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:14,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:14,758 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-10-13 16:58:14,759 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-10-13 16:58:14,760 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:58:14,760 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:14,780 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-10-13 16:58:14,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:14,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:14,782 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-10-13 16:58:14,782 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-10-13 16:58:14,783 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-13 16:58:14,783 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:14,809 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-13 16:58:14,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2024-10-13 16:58:14,813 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:58:14,813 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:58:14,813 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:58:14,813 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:58:14,813 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 16:58:14,813 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:14,813 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:58:14,813 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:58:14,813 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration4_Loop [2024-10-13 16:58:14,813 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:58:14,813 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:58:14,814 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:14,820 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:14,822 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:14,856 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:58:14,856 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 16:58:14,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:14,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:14,858 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-10-13 16:58:14,859 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-10-13 16:58:14,859 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-10-13 16:58:14,869 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:58:14,869 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:58:14,869 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:58:14,869 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:58:14,869 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:58:14,870 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:58:14,870 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:58:14,872 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 16:58:14,874 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2024-10-13 16:58:14,874 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-13 16:58:14,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:14,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:14,877 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-10-13 16:58:14,878 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-10-13 16:58:14,879 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 16:58:14,879 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-13 16:58:14,879 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 16:58:14,879 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-10-13 16:58:14,889 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-10-13 16:58:14,889 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-13 16:58:14,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:14,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:14,913 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 16:58:14,913 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:14,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:14,945 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 16:58:14,945 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:14,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:58:14,956 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-10-13 16:58:14,957 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-10-13 16:58:14,963 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-10-13 16:58:14,963 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-10-13 16:58:14,964 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-10-13 16:58:14,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2024-10-13 16:58:14,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 21 letters. Loop has 2 letters. [2024-10-13 16:58:14,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:14,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 23 letters. Loop has 2 letters. [2024-10-13 16:58:14,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:14,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 21 letters. Loop has 4 letters. [2024-10-13 16:58:14,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:14,964 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 42 transitions. [2024-10-13 16:58:14,965 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-13 16:58:14,965 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 28 states and 31 transitions. [2024-10-13 16:58:14,966 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2024-10-13 16:58:14,966 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2024-10-13 16:58:14,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 31 transitions. [2024-10-13 16:58:14,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:58:14,966 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 31 transitions. [2024-10-13 16:58:14,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 31 transitions. [2024-10-13 16:58:14,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2024-10-13 16:58:14,967 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-10-13 16:58:14,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2024-10-13 16:58:14,967 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 30 transitions. [2024-10-13 16:58:14,967 INFO L425 stractBuchiCegarLoop]: Abstraction has 27 states and 30 transitions. [2024-10-13 16:58:14,967 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-13 16:58:14,967 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 30 transitions. [2024-10-13 16:58:14,968 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-13 16:58:14,968 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:58:14,968 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:58:14,968 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 10, 1, 1, 1] [2024-10-13 16:58:14,968 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-13 16:58:14,968 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-10-13 16:58:14,968 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-10-13 16:58:14,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:14,969 INFO L85 PathProgramCache]: Analyzing trace with hash 767012677, now seen corresponding path program 3 times [2024-10-13 16:58:14,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:14,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623668478] [2024-10-13 16:58:14,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:14,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:14,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:15,094 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 11 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:58:15,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:58:15,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623668478] [2024-10-13 16:58:15,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623668478] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 16:58:15,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701422472] [2024-10-13 16:58:15,095 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 16:58:15,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:58:15,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:15,096 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-10-13 16:58:15,096 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-10-13 16:58:15,124 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2024-10-13 16:58:15,125 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 16:58:15,125 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 16:58:15,126 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:15,162 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 11 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:58:15,163 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 16:58:15,313 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-10-13 16:58:15,330 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-10-13 16:58:15,368 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 11 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:58:15,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701422472] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 16:58:15,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 16:58:15,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2024-10-13 16:58:15,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354449369] [2024-10-13 16:58:15,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 16:58:15,369 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 16:58:15,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:15,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1406, now seen corresponding path program 2 times [2024-10-13 16:58:15,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:15,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584088797] [2024-10-13 16:58:15,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:15,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:15,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:15,372 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:58:15,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:15,373 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:58:15,393 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:58:15,393 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:58:15,393 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:58:15,393 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:58:15,393 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-13 16:58:15,393 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:15,393 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:58:15,393 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:58:15,393 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration5_Loop [2024-10-13 16:58:15,393 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:58:15,393 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:58:15,394 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:15,403 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:15,405 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:15,434 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:58:15,434 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-13 16:58:15,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:15,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:15,437 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-10-13 16:58:15,438 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-10-13 16:58:15,439 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:58:15,439 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:15,460 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-10-13 16:58:15,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:15,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:15,461 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-10-13 16:58:15,462 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-10-13 16:58:15,463 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-13 16:58:15,463 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:15,491 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-13 16:58:15,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2024-10-13 16:58:15,495 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:58:15,495 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:58:15,495 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:58:15,495 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:58:15,495 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 16:58:15,495 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:15,495 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:58:15,495 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:58:15,495 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration5_Loop [2024-10-13 16:58:15,495 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:58:15,495 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:58:15,496 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:15,503 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:15,506 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:15,534 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:58:15,534 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 16:58:15,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:15,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:15,536 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-10-13 16:58:15,537 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-10-13 16:58:15,538 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-10-13 16:58:15,549 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:58:15,549 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:58:15,549 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:58:15,549 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:58:15,549 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:58:15,550 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:58:15,550 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:58:15,553 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 16:58:15,555 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2024-10-13 16:58:15,555 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-13 16:58:15,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:15,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:15,556 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-10-13 16:58:15,557 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-10-13 16:58:15,558 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 16:58:15,558 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-13 16:58:15,558 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 16:58:15,558 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-10-13 16:58:15,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2024-10-13 16:58:15,571 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-13 16:58:15,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:15,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:15,595 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 16:58:15,595 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:15,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:15,622 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 16:58:15,622 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:15,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:58:15,631 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-10-13 16:58:15,631 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-10-13 16:58:15,637 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-10-13 16:58:15,637 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-10-13 16:58:15,637 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-10-13 16:58:15,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2024-10-13 16:58:15,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 25 letters. Loop has 2 letters. [2024-10-13 16:58:15,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:15,638 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 16:58:15,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:15,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:15,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 16:58:15,655 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:15,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:15,707 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 16:58:15,707 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:15,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:58:15,717 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-10-13 16:58:15,718 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-10-13 16:58:15,729 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-10-13 16:58:15,730 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-10-13 16:58:15,730 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-10-13 16:58:15,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2024-10-13 16:58:15,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 25 letters. Loop has 2 letters. [2024-10-13 16:58:15,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:15,730 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 16:58:15,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:15,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:15,748 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 16:58:15,748 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:15,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:15,777 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 16:58:15,778 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:15,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:58:15,787 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-10-13 16:58:15,787 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-10-13 16:58:15,794 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-10-13 16:58:15,794 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-10-13 16:58:15,794 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-10-13 16:58:15,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2024-10-13 16:58:15,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 25 letters. Loop has 2 letters. [2024-10-13 16:58:15,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:15,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 27 letters. Loop has 2 letters. [2024-10-13 16:58:15,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:15,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 25 letters. Loop has 4 letters. [2024-10-13 16:58:15,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:15,800 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 45 transitions. [2024-10-13 16:58:15,800 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-10-13 16:58:15,801 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 29 states and 32 transitions. [2024-10-13 16:58:15,801 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2024-10-13 16:58:15,801 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2024-10-13 16:58:15,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 32 transitions. [2024-10-13 16:58:15,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:58:15,801 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 32 transitions. [2024-10-13 16:58:15,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 32 transitions. [2024-10-13 16:58:15,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2024-10-13 16:58:15,802 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-10-13 16:58:15,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2024-10-13 16:58:15,803 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 28 transitions. [2024-10-13 16:58:15,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:58:15,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-13 16:58:15,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2024-10-13 16:58:15,804 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-10-13 16:58:15,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:58:15,863 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2024-10-13 16:58:15,863 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 65 transitions. [2024-10-13 16:58:15,864 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-13 16:58:15,864 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 51 states and 53 transitions. [2024-10-13 16:58:15,864 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2024-10-13 16:58:15,865 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2024-10-13 16:58:15,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 53 transitions. [2024-10-13 16:58:15,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:58:15,865 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 53 transitions. [2024-10-13 16:58:15,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 53 transitions. [2024-10-13 16:58:15,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2024-10-13 16:58:15,869 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-10-13 16:58:15,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2024-10-13 16:58:15,870 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 52 transitions. [2024-10-13 16:58:15,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-13 16:58:15,870 INFO L425 stractBuchiCegarLoop]: Abstraction has 50 states and 52 transitions. [2024-10-13 16:58:15,871 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-13 16:58:15,871 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 52 transitions. [2024-10-13 16:58:15,871 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-13 16:58:15,871 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:58:15,871 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:58:15,872 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [24, 22, 1, 1, 1] [2024-10-13 16:58:15,872 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2024-10-13 16:58:15,872 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-10-13 16:58:15,872 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-10-13 16:58:15,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:15,872 INFO L85 PathProgramCache]: Analyzing trace with hash -694298463, now seen corresponding path program 4 times [2024-10-13 16:58:15,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:15,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232398610] [2024-10-13 16:58:15,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:15,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:15,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:16,019 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-10-13 16:58:16,244 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 23 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:58:16,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:58:16,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232398610] [2024-10-13 16:58:16,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232398610] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 16:58:16,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223913556] [2024-10-13 16:58:16,244 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-13 16:58:16,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:58:16,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:16,245 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-10-13 16:58:16,246 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-10-13 16:58:16,283 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-13 16:58:16,284 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 16:58:16,284 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-13 16:58:16,285 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:16,350 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 23 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:58:16,350 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 16:58:16,897 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 23 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:58:16,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223913556] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 16:58:16,899 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 16:58:16,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 48 [2024-10-13 16:58:16,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917561287] [2024-10-13 16:58:16,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 16:58:16,900 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 16:58:16,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:16,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1351673, now seen corresponding path program 1 times [2024-10-13 16:58:16,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:16,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315524616] [2024-10-13 16:58:16,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:16,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:16,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:16,906 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:58:16,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:16,908 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:58:16,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:58:16,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-10-13 16:58:16,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2024-10-13 16:58:16,947 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-10-13 16:58:17,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:58:17,073 INFO L93 Difference]: Finished difference Result 123 states and 125 transitions. [2024-10-13 16:58:17,073 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 125 transitions. [2024-10-13 16:58:17,074 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-13 16:58:17,075 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 99 states and 101 transitions. [2024-10-13 16:58:17,075 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2024-10-13 16:58:17,075 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2024-10-13 16:58:17,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 101 transitions. [2024-10-13 16:58:17,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:58:17,086 INFO L218 hiAutomatonCegarLoop]: Abstraction has 99 states and 101 transitions. [2024-10-13 16:58:17,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 101 transitions. [2024-10-13 16:58:17,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2024-10-13 16:58:17,089 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-10-13 16:58:17,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2024-10-13 16:58:17,090 INFO L240 hiAutomatonCegarLoop]: Abstraction has 98 states and 100 transitions. [2024-10-13 16:58:17,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-10-13 16:58:17,090 INFO L425 stractBuchiCegarLoop]: Abstraction has 98 states and 100 transitions. [2024-10-13 16:58:17,090 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-13 16:58:17,091 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 98 states and 100 transitions. [2024-10-13 16:58:17,091 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-13 16:58:17,091 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:58:17,091 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:58:17,093 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [48, 46, 1, 1, 1] [2024-10-13 16:58:17,093 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2024-10-13 16:58:17,094 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-10-13 16:58:17,094 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-10-13 16:58:17,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:17,094 INFO L85 PathProgramCache]: Analyzing trace with hash -818401447, now seen corresponding path program 5 times [2024-10-13 16:58:17,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:17,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167506956] [2024-10-13 16:58:17,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:17,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:17,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:18,373 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 47 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:58:18,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:58:18,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167506956] [2024-10-13 16:58:18,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167506956] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 16:58:18,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520068556] [2024-10-13 16:58:18,373 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-13 16:58:18,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:58:18,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:18,377 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-10-13 16:58:18,379 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-10-13 16:58:18,445 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2024-10-13 16:58:18,445 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 16:58:18,447 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-10-13 16:58:18,449 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:18,593 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 47 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:58:18,593 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 16:58:19,517 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 47 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:58:19,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520068556] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 16:58:19,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 16:58:19,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 51 [2024-10-13 16:58:19,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276740852] [2024-10-13 16:58:19,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 16:58:19,518 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 16:58:19,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:19,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1351673, now seen corresponding path program 2 times [2024-10-13 16:58:19,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:19,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681288218] [2024-10-13 16:58:19,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:19,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:19,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:19,521 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:58:19,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:19,523 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:58:19,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:58:19,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-10-13 16:58:19,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2024-10-13 16:58:19,556 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-10-13 16:58:19,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:58:19,658 INFO L93 Difference]: Finished difference Result 108 states and 110 transitions. [2024-10-13 16:58:19,658 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 110 transitions. [2024-10-13 16:58:19,659 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-13 16:58:19,659 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 105 states and 107 transitions. [2024-10-13 16:58:19,659 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2024-10-13 16:58:19,659 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2024-10-13 16:58:19,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 107 transitions. [2024-10-13 16:58:19,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:58:19,660 INFO L218 hiAutomatonCegarLoop]: Abstraction has 105 states and 107 transitions. [2024-10-13 16:58:19,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 107 transitions. [2024-10-13 16:58:19,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2024-10-13 16:58:19,663 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-10-13 16:58:19,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 106 transitions. [2024-10-13 16:58:19,666 INFO L240 hiAutomatonCegarLoop]: Abstraction has 104 states and 106 transitions. [2024-10-13 16:58:19,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-10-13 16:58:19,667 INFO L425 stractBuchiCegarLoop]: Abstraction has 104 states and 106 transitions. [2024-10-13 16:58:19,667 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-13 16:58:19,667 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 106 transitions. [2024-10-13 16:58:19,667 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-13 16:58:19,667 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:58:19,667 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:58:19,668 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [51, 49, 1, 1, 1] [2024-10-13 16:58:19,668 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2024-10-13 16:58:19,668 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-10-13 16:58:19,671 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-10-13 16:58:19,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:19,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1994822288, now seen corresponding path program 6 times [2024-10-13 16:58:19,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:19,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665529712] [2024-10-13 16:58:19,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:19,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:19,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:19,700 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:58:19,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:19,735 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:58:19,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:19,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1351673, now seen corresponding path program 3 times [2024-10-13 16:58:19,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:19,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830569796] [2024-10-13 16:58:19,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:19,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:19,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:19,737 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:58:19,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:19,738 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:58:19,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:19,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1522445560, now seen corresponding path program 7 times [2024-10-13 16:58:19,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:19,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273493085] [2024-10-13 16:58:19,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:19,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:19,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:19,758 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:58:19,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:19,781 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:58:22,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:22,178 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:58:22,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:22,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.10 04:58:22 BoogieIcfgContainer [2024-10-13 16:58:22,291 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-13 16:58:22,291 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 16:58:22,291 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 16:58:22,291 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 16:58:22,292 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:58:12" (3/4) ... [2024-10-13 16:58:22,293 INFO L136 WitnessPrinter]: Generating witness for non-termination counterexample [2024-10-13 16:58:22,351 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 16:58:22,351 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 16:58:22,352 INFO L158 Benchmark]: Toolchain (without parser) took 10412.47ms. Allocated memory was 146.8MB in the beginning and 310.4MB in the end (delta: 163.6MB). Free memory was 79.2MB in the beginning and 159.9MB in the end (delta: -80.6MB). Peak memory consumption was 84.5MB. Max. memory is 16.1GB. [2024-10-13 16:58:22,352 INFO L158 Benchmark]: CDTParser took 0.50ms. Allocated memory is still 146.8MB. Free memory is still 109.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 16:58:22,352 INFO L158 Benchmark]: CACSL2BoogieTranslator took 174.12ms. Allocated memory is still 146.8MB. Free memory was 79.0MB in the beginning and 68.1MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-13 16:58:22,352 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.19ms. Allocated memory is still 146.8MB. Free memory was 68.1MB in the beginning and 66.9MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 16:58:22,352 INFO L158 Benchmark]: Boogie Preprocessor took 17.31ms. Allocated memory is still 146.8MB. Free memory was 66.9MB in the beginning and 65.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 16:58:22,353 INFO L158 Benchmark]: RCFGBuilder took 176.13ms. Allocated memory is still 146.8MB. Free memory was 65.3MB in the beginning and 114.6MB in the end (delta: -49.3MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. [2024-10-13 16:58:22,353 INFO L158 Benchmark]: BuchiAutomizer took 9962.96ms. Allocated memory was 146.8MB in the beginning and 310.4MB in the end (delta: 163.6MB). Free memory was 114.6MB in the beginning and 164.1MB in the end (delta: -49.5MB). Peak memory consumption was 114.5MB. Max. memory is 16.1GB. [2024-10-13 16:58:22,353 INFO L158 Benchmark]: Witness Printer took 60.49ms. Allocated memory is still 310.4MB. Free memory was 164.1MB in the beginning and 159.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 16:58:22,354 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.50ms. Allocated memory is still 146.8MB. Free memory is still 109.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 174.12ms. Allocated memory is still 146.8MB. Free memory was 79.0MB in the beginning and 68.1MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 17.19ms. Allocated memory is still 146.8MB. Free memory was 68.1MB in the beginning and 66.9MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 17.31ms. Allocated memory is still 146.8MB. Free memory was 66.9MB in the beginning and 65.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 176.13ms. Allocated memory is still 146.8MB. Free memory was 65.3MB in the beginning and 114.6MB in the end (delta: -49.3MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 9962.96ms. Allocated memory was 146.8MB in the beginning and 310.4MB in the end (delta: 163.6MB). Free memory was 114.6MB in the beginning and 164.1MB in the end (delta: -49.5MB). Peak memory consumption was 114.5MB. Max. memory is 16.1GB. * Witness Printer took 60.49ms. Allocated memory is still 310.4MB. Free memory was 164.1MB in the beginning and 159.9MB 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 9.8s and 8 iterations. TraceHistogramMax:51. Analysis of lassos took 8.7s. Construction of modules took 0.2s. Büchi inclusion checks took 0.7s. 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.3s 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: 28ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s 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-10-13 16:58:22,382 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-10-13 16:58:22,578 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-10-13 16:58:22,778 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-10-13 16:58:22,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-10-13 16:58:23,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-13 16:58:23,380 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)