./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/NO_13.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-restricted-15/NO_13.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash eeea679d58a502ae5881094604c1f31424fa081cb4c3d3de58dd4530f33f3571 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 22:34:28,635 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 22:34:28,685 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-10 22:34:28,689 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 22:34:28,690 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 22:34:28,690 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2024-11-10 22:34:28,717 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 22:34:28,718 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 22:34:28,718 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 22:34:28,720 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 22:34:28,720 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 22:34:28,720 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 22:34:28,721 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 22:34:28,721 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 22:34:28,721 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-10 22:34:28,721 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-10 22:34:28,722 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-10 22:34:28,722 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-10 22:34:28,722 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-10 22:34:28,722 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-10 22:34:28,723 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 22:34:28,726 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-10 22:34:28,727 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 22:34:28,727 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 22:34:28,727 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-10 22:34:28,727 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-10 22:34:28,727 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-10 22:34:28,728 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 22:34:28,728 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 22:34:28,728 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 22:34:28,728 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-10 22:34:28,728 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 22:34:28,728 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 22:34:28,729 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 22:34:28,729 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 22:34:28,729 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 22:34:28,729 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-10 22:34:28,730 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> eeea679d58a502ae5881094604c1f31424fa081cb4c3d3de58dd4530f33f3571 [2024-11-10 22:34:28,966 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 22:34:28,992 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 22:34:28,995 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 22:34:28,997 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 22:34:28,997 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 22:34:28,999 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/NO_13.c [2024-11-10 22:34:30,236 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 22:34:30,414 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 22:34:30,415 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/NO_13.c [2024-11-10 22:34:30,420 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a8548fc3/8233094226dc40e5976971688121de55/FLAG4492b240a [2024-11-10 22:34:30,843 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a8548fc3/8233094226dc40e5976971688121de55 [2024-11-10 22:34:30,845 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 22:34:30,846 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 22:34:30,847 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 22:34:30,847 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 22:34:30,851 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 22:34:30,852 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:34:30" (1/1) ... [2024-11-10 22:34:30,853 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70dfb436 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:34:30, skipping insertion in model container [2024-11-10 22:34:30,853 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:34:30" (1/1) ... [2024-11-10 22:34:30,866 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 22:34:30,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 22:34:30,996 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 22:34:31,004 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 22:34:31,016 INFO L204 MainTranslator]: Completed translation [2024-11-10 22:34:31,016 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:34:31 WrapperNode [2024-11-10 22:34:31,016 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 22:34:31,017 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 22:34:31,017 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 22:34:31,017 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 22:34:31,022 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:34:31" (1/1) ... [2024-11-10 22:34:31,026 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:34:31" (1/1) ... [2024-11-10 22:34:31,037 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 16 [2024-11-10 22:34:31,037 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 22:34:31,038 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 22:34:31,038 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 22:34:31,038 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 22:34:31,045 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:34:31" (1/1) ... [2024-11-10 22:34:31,045 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:34:31" (1/1) ... [2024-11-10 22:34:31,046 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:34:31" (1/1) ... [2024-11-10 22:34:31,050 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-10 22:34:31,050 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:34:31" (1/1) ... [2024-11-10 22:34:31,050 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:34:31" (1/1) ... [2024-11-10 22:34:31,051 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:34:31" (1/1) ... [2024-11-10 22:34:31,051 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:34:31" (1/1) ... [2024-11-10 22:34:31,052 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:34:31" (1/1) ... [2024-11-10 22:34:31,052 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:34:31" (1/1) ... [2024-11-10 22:34:31,053 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 22:34:31,054 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 22:34:31,054 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 22:34:31,054 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 22:34:31,054 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:34:31" (1/1) ... [2024-11-10 22:34:31,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:31,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:31,086 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:34:31,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-10 22:34:31,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 22:34:31,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 22:34:31,180 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 22:34:31,182 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 22:34:31,241 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-11-10 22:34:31,241 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 22:34:31,272 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 22:34:31,273 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 22:34:31,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:34:31 BoogieIcfgContainer [2024-11-10 22:34:31,274 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 22:34:31,275 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-10 22:34:31,276 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-10 22:34:31,279 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-10 22:34:31,279 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 22:34:31,280 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 10:34:30" (1/3) ... [2024-11-10 22:34:31,280 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@22ba6251 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 10:34:31, skipping insertion in model container [2024-11-10 22:34:31,280 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 22:34:31,280 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:34:31" (2/3) ... [2024-11-10 22:34:31,281 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@22ba6251 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 10:34:31, skipping insertion in model container [2024-11-10 22:34:31,281 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 22:34:31,281 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:34:31" (3/3) ... [2024-11-10 22:34:31,282 INFO L332 chiAutomizerObserver]: Analyzing ICFG NO_13.c [2024-11-10 22:34:31,340 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-10 22:34:31,340 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-10 22:34:31,340 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-10 22:34:31,340 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-10 22:34:31,340 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-10 22:34:31,341 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-10 22:34:31,341 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-10 22:34:31,341 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-10 22:34:31,345 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:31,359 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-10 22:34:31,359 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:34:31,360 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:34:31,363 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 22:34:31,363 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-10 22:34:31,365 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-10 22:34:31,365 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:31,366 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-10 22:34:31,366 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:34:31,366 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:34:31,366 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 22:34:31,366 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-10 22:34:31,372 INFO L745 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 7#ULTIMATE.init_returnLabel#1true assume true;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; 8#L11true [2024-11-10 22:34:31,373 INFO L747 eck$LassoCheckResult]: Loop: 8#L11true assume true; 6#L11-1true assume !!(main_~i~0#1 < main_~j~0#1); 9#L12true assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 8#L11true [2024-11-10 22:34:31,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:31,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1280, now seen corresponding path program 1 times [2024-11-10 22:34:31,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:31,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858698448] [2024-11-10 22:34:31,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:31,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:31,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:31,452 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:34:31,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:31,467 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:34:31,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:31,469 INFO L85 PathProgramCache]: Analyzing trace with hash 36707, now seen corresponding path program 1 times [2024-11-10 22:34:31,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:31,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161034492] [2024-11-10 22:34:31,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:31,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:31,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:31,478 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:34:31,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:31,483 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:34:31,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:31,484 INFO L85 PathProgramCache]: Analyzing trace with hash 38139396, now seen corresponding path program 1 times [2024-11-10 22:34:31,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:31,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617731709] [2024-11-10 22:34:31,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:31,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:31,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:31,492 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:34:31,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:31,496 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:34:31,574 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:34:31,574 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:34:31,574 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:34:31,574 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:34:31,574 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-10 22:34:31,577 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:31,577 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:34:31,577 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:34:31,577 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration1_Loop [2024-11-10 22:34:31,577 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:34:31,578 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:34:31,592 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:31,602 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:31,605 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:31,673 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:34:31,674 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-10 22:34:31,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:31,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:31,677 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:34:31,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-10 22:34:31,680 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 22:34:31,680 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 22:34:31,704 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-10 22:34:31,705 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-10 22:34:31,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-11-10 22:34:31,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:31,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:31,725 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:34:31,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-10 22:34:31,728 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 22:34:31,728 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 22:34:31,751 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-10 22:34:31,751 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-10 22:34:31,766 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-11-10 22:34:31,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:31,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:31,768 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:34:31,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-10 22:34:31,770 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 22:34:31,770 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 22:34:31,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-11-10 22:34:31,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:31,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:31,803 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:34:31,813 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-10 22:34:31,813 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 22:34:31,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-10 22:34:31,851 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-10 22:34:31,856 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-11-10 22:34:31,856 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:34:31,856 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:34:31,856 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:34:31,856 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:34:31,856 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 22:34:31,857 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:31,857 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:34:31,857 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:34:31,857 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration1_Loop [2024-11-10 22:34:31,857 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:34:31,857 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:34:31,858 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:31,863 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:31,866 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:31,921 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:34:31,925 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 22:34:31,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:31,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:31,929 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:34:31,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-10 22:34:31,933 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:34:31,948 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:34:31,949 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:34:31,949 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:34:31,949 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:34:31,954 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:34:31,955 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:34:31,964 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:34:31,980 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-10 22:34:31,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:31,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:31,986 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:34:31,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-10 22:34:31,995 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:34:32,007 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:34:32,008 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:34:32,008 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:34:32,008 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:34:32,012 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:34:32,012 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:34:32,018 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:34:32,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-10 22:34:32,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:32,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:32,036 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:34:32,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-10 22:34:32,038 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:34:32,050 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:34:32,051 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:34:32,051 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:34:32,051 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:34:32,051 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:34:32,053 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:34:32,053 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:34:32,058 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 22:34:32,062 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-10 22:34:32,063 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-10 22:34:32,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:32,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:32,067 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:34:32,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-10 22:34:32,068 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 22:34:32,070 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-10 22:34:32,070 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 22:34:32,070 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1) = 1*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2024-11-10 22:34:32,085 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-11-10 22:34:32,088 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-10 22:34:32,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:32,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:32,126 INFO L255 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 22:34:32,127 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:32,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:32,140 INFO L255 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 22:34:32,141 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:32,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:34:32,180 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2024-11-10 22:34:32,183 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 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) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:32,219 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 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). Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 19 states and 25 transitions. Complement of second has 6 states. [2024-11-10 22:34:32,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-10 22:34:32,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:32,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-11-10 22:34:32,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 2 letters. Loop has 3 letters. [2024-11-10 22:34:32,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:34:32,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 5 letters. Loop has 3 letters. [2024-11-10 22:34:32,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:34:32,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 2 letters. Loop has 6 letters. [2024-11-10 22:34:32,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:34:32,232 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 25 transitions. [2024-11-10 22:34:32,234 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-10 22:34:32,237 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 11 states and 14 transitions. [2024-11-10 22:34:32,239 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2024-11-10 22:34:32,239 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-11-10 22:34:32,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2024-11-10 22:34:32,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:34:32,241 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 14 transitions. [2024-11-10 22:34:32,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2024-11-10 22:34:32,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2024-11-10 22:34:32,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:32,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2024-11-10 22:34:32,262 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11 states and 14 transitions. [2024-11-10 22:34:32,262 INFO L425 stractBuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2024-11-10 22:34:32,262 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-10 22:34:32,263 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2024-11-10 22:34:32,264 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-10 22:34:32,265 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:34:32,265 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:34:32,265 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-10 22:34:32,266 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-10 22:34:32,266 INFO L745 eck$LassoCheckResult]: Stem: 70#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 71#ULTIMATE.init_returnLabel#1 assume true;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; 72#L11 assume true; 66#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 67#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; 73#L11 [2024-11-10 22:34:32,266 INFO L747 eck$LassoCheckResult]: Loop: 73#L11 assume true; 74#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 76#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 73#L11 [2024-11-10 22:34:32,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:32,268 INFO L85 PathProgramCache]: Analyzing trace with hash 38139397, now seen corresponding path program 1 times [2024-11-10 22:34:32,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:32,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458777746] [2024-11-10 22:34:32,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:32,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:32,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:32,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:34:32,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:34:32,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458777746] [2024-11-10 22:34:32,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458777746] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:34:32,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:34:32,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 22:34:32,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140197947] [2024-11-10 22:34:32,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:34:32,328 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-10 22:34:32,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:32,329 INFO L85 PathProgramCache]: Analyzing trace with hash 36707, now seen corresponding path program 2 times [2024-11-10 22:34:32,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:32,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817024829] [2024-11-10 22:34:32,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:32,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:32,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:32,340 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:34:32,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:32,346 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:34:32,379 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:34:32,379 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:34:32,379 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:34:32,379 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:34:32,379 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-10 22:34:32,379 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:32,379 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:34:32,380 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:34:32,380 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration2_Loop [2024-11-10 22:34:32,380 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:34:32,380 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:34:32,381 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:32,387 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:32,420 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:32,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-11-10 22:34:32,476 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:34:32,476 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-10 22:34:32,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:32,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:32,478 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:34:32,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-10 22:34:32,481 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 22:34:32,481 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 22:34:32,504 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-10 22:34:32,505 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-10 22:34:32,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-10 22:34:32,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:32,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:32,519 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:34:32,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-10 22:34:32,525 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 22:34:32,525 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 22:34:32,554 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-11-10 22:34:32,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:32,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:32,557 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:34:32,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-10 22:34:32,559 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-10 22:34:32,559 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 22:34:32,590 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-10 22:34:32,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-11-10 22:34:32,594 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:34:32,595 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:34:32,595 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:34:32,595 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:34:32,595 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 22:34:32,595 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:32,595 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:34:32,595 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:34:32,595 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration2_Loop [2024-11-10 22:34:32,595 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:34:32,595 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:34:32,597 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:32,601 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:32,612 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:32,651 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:34:32,651 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 22:34:32,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:32,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:32,653 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:34:32,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-10 22:34:32,657 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:34:32,667 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:34:32,667 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:34:32,667 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:34:32,667 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:34:32,670 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:34:32,670 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:34:32,673 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:34:32,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-11-10 22:34:32,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:32,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:32,687 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:34:32,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-10 22:34:32,689 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:34:32,700 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:34:32,700 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:34:32,700 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:34:32,700 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:34:32,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:34:32,701 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:34:32,702 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:34:32,704 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 22:34:32,707 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-10 22:34:32,707 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-10 22:34:32,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:32,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:32,709 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:34:32,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-10 22:34:32,711 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 22:34:32,711 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-10 22:34:32,712 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 22:34:32,712 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1) = 1*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2024-11-10 22:34:32,723 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-11-10 22:34:32,724 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-10 22:34:32,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:32,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:32,748 INFO L255 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 22:34:32,748 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:32,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:32,760 INFO L255 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 22:34:32,761 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:32,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:34:32,766 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2024-11-10 22:34:32,767 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:32,777 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 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 17 states and 22 transitions. Complement of second has 5 states. [2024-11-10 22:34:32,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-10 22:34:32,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:32,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2024-11-10 22:34:32,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 5 letters. Loop has 3 letters. [2024-11-10 22:34:32,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:34:32,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 8 letters. Loop has 3 letters. [2024-11-10 22:34:32,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:34:32,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 5 letters. Loop has 6 letters. [2024-11-10 22:34:32,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:34:32,780 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 22 transitions. [2024-11-10 22:34:32,780 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-10 22:34:32,781 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 22 transitions. [2024-11-10 22:34:32,781 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-10 22:34:32,781 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-11-10 22:34:32,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2024-11-10 22:34:32,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:34:32,781 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 22 transitions. [2024-11-10 22:34:32,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2024-11-10 22:34:32,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-11-10 22:34:32,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:32,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2024-11-10 22:34:32,783 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 22 transitions. [2024-11-10 22:34:32,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:34:32,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 22:34:32,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 22:34:32,787 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:32,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:34:32,798 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2024-11-10 22:34:32,798 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 25 transitions. [2024-11-10 22:34:32,799 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-10 22:34:32,799 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 19 states and 23 transitions. [2024-11-10 22:34:32,799 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-11-10 22:34:32,800 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-11-10 22:34:32,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 23 transitions. [2024-11-10 22:34:32,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:34:32,800 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 23 transitions. [2024-11-10 22:34:32,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 23 transitions. [2024-11-10 22:34:32,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2024-11-10 22:34:32,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:32,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2024-11-10 22:34:32,802 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 21 transitions. [2024-11-10 22:34:32,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 22:34:32,804 INFO L425 stractBuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2024-11-10 22:34:32,804 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-10 22:34:32,804 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2024-11-10 22:34:32,805 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-10 22:34:32,805 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:34:32,805 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:34:32,805 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1] [2024-11-10 22:34:32,805 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-10 22:34:32,806 INFO L745 eck$LassoCheckResult]: Stem: 178#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 179#ULTIMATE.init_returnLabel#1 assume true;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; 180#L11 assume true; 176#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 177#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 190#L11 assume true; 189#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 188#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; 185#L11 assume true; 174#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 175#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; 183#L11 [2024-11-10 22:34:32,806 INFO L747 eck$LassoCheckResult]: Loop: 183#L11 assume true; 187#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 186#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 183#L11 [2024-11-10 22:34:32,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:32,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1755920156, now seen corresponding path program 1 times [2024-11-10 22:34:32,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:32,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021704392] [2024-11-10 22:34:32,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:32,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:32,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:32,864 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:34:32,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:34:32,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021704392] [2024-11-10 22:34:32,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021704392] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 22:34:32,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419705404] [2024-11-10 22:34:32,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:32,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 22:34:32,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:32,867 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 22:34:32,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-10 22:34:32,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:32,892 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 22:34:32,893 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:32,923 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:34:32,924 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 22:34:32,949 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:34:32,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1419705404] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 22:34:32,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 22:34:32,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-11-10 22:34:32,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194964610] [2024-11-10 22:34:32,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 22:34:32,950 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-10 22:34:32,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:32,951 INFO L85 PathProgramCache]: Analyzing trace with hash 36707, now seen corresponding path program 3 times [2024-11-10 22:34:32,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:32,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004547660] [2024-11-10 22:34:32,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:32,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:32,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:32,955 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:34:32,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:32,957 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:34:32,984 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:34:32,985 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:34:32,985 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:34:32,985 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:34:32,985 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-10 22:34:32,985 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:32,985 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:34:32,985 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:34:32,985 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration3_Loop [2024-11-10 22:34:32,985 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:34:32,985 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:34:32,986 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:32,989 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:32,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:33,032 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:34:33,032 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-10 22:34:33,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:33,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:33,034 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:34:33,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-10 22:34:33,037 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 22:34:33,038 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 22:34:33,055 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-10 22:34:33,055 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-10 22:34:33,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-11-10 22:34:33,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:33,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:33,069 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:34:33,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-10 22:34:33,072 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 22:34:33,072 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 22:34:33,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-11-10 22:34:33,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:33,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:33,095 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:34:33,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-10 22:34:33,097 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-10 22:34:33,097 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 22:34:33,125 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-10 22:34:33,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-11-10 22:34:33,129 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:34:33,129 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:34:33,129 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:34:33,129 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:34:33,129 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 22:34:33,129 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:33,129 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:34:33,129 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:34:33,129 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration3_Loop [2024-11-10 22:34:33,129 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:34:33,129 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:34:33,130 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:33,133 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:33,141 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:33,173 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:34:33,174 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 22:34:33,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:33,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:33,175 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:34:33,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-10 22:34:33,181 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:34:33,191 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:34:33,191 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:34:33,191 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:34:33,191 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:34:33,194 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:34:33,194 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:34:33,197 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:34:33,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-11-10 22:34:33,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:33,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:33,209 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:34:33,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-10 22:34:33,212 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:34:33,222 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:34:33,223 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:34:33,223 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:34:33,223 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:34:33,223 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:34:33,224 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:34:33,225 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:34:33,227 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 22:34:33,230 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-10 22:34:33,230 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-10 22:34:33,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:33,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:33,232 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:34:33,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-10 22:34:33,235 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 22:34:33,235 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-10 22:34:33,235 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 22:34:33,235 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1) = 1*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2024-11-10 22:34:33,246 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-11-10 22:34:33,247 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-10 22:34:33,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:33,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:33,266 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 22:34:33,267 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:33,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:33,281 INFO L255 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 22:34:33,282 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:33,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:34:33,285 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2024-11-10 22:34:33,285 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 7 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:33,293 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 7. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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) Result 21 states and 27 transitions. Complement of second has 5 states. [2024-11-10 22:34:33,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-10 22:34:33,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:33,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2024-11-10 22:34:33,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 11 letters. Loop has 3 letters. [2024-11-10 22:34:33,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:34:33,294 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-10 22:34:33,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:33,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:33,309 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 22:34:33,309 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:33,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:33,323 INFO L255 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 22:34:33,323 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:33,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:34:33,326 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2024-11-10 22:34:33,327 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 7 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:33,333 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 7. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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) Result 21 states and 27 transitions. Complement of second has 5 states. [2024-11-10 22:34:33,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-10 22:34:33,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:33,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2024-11-10 22:34:33,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 11 letters. Loop has 3 letters. [2024-11-10 22:34:33,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:34:33,335 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-10 22:34:33,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:33,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:33,349 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 22:34:33,350 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:33,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:33,364 INFO L255 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 22:34:33,364 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:33,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:34:33,368 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2024-11-10 22:34:33,368 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 7 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:33,382 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 7. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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) Result 24 states and 31 transitions. Complement of second has 4 states. [2024-11-10 22:34:33,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-10 22:34:33,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:33,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2024-11-10 22:34:33,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 11 letters. Loop has 3 letters. [2024-11-10 22:34:33,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:34:33,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 14 letters. Loop has 3 letters. [2024-11-10 22:34:33,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:34:33,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 11 letters. Loop has 6 letters. [2024-11-10 22:34:33,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:34:33,384 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 31 transitions. [2024-11-10 22:34:33,385 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-11-10 22:34:33,386 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 20 states and 25 transitions. [2024-11-10 22:34:33,386 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-11-10 22:34:33,386 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-11-10 22:34:33,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 25 transitions. [2024-11-10 22:34:33,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:34:33,386 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 25 transitions. [2024-11-10 22:34:33,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 25 transitions. [2024-11-10 22:34:33,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 9. [2024-11-10 22:34:33,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:33,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2024-11-10 22:34:33,387 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 11 transitions. [2024-11-10 22:34:33,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:34:33,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 22:34:33,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 22:34:33,388 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:33,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:34:33,410 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2024-11-10 22:34:33,410 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 28 transitions. [2024-11-10 22:34:33,410 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-11-10 22:34:33,411 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 20 states and 22 transitions. [2024-11-10 22:34:33,411 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2024-11-10 22:34:33,411 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2024-11-10 22:34:33,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2024-11-10 22:34:33,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:34:33,411 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 22 transitions. [2024-11-10 22:34:33,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2024-11-10 22:34:33,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2024-11-10 22:34:33,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:33,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2024-11-10 22:34:33,413 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 20 transitions. [2024-11-10 22:34:33,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 22:34:33,414 INFO L425 stractBuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2024-11-10 22:34:33,414 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-10 22:34:33,414 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 20 transitions. [2024-11-10 22:34:33,415 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-11-10 22:34:33,415 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:34:33,415 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:34:33,415 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 1, 1] [2024-11-10 22:34:33,415 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-10 22:34:33,415 INFO L745 eck$LassoCheckResult]: Stem: 506#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 507#ULTIMATE.init_returnLabel#1 assume true;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; 512#L11 assume true; 513#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 523#L12 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#L11 assume true; 510#L11-1 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; 516#L11 assume true; 522#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 521#L12 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#L11 assume true; 518#L11-1 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; 517#L11 assume true; 508#L11-1 [2024-11-10 22:34:33,415 INFO L747 eck$LassoCheckResult]: Loop: 508#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 509#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; 515#L11 assume true; 508#L11-1 [2024-11-10 22:34:33,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:33,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1554794489, now seen corresponding path program 2 times [2024-11-10 22:34:33,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:33,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213410627] [2024-11-10 22:34:33,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:33,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:33,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:33,432 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:34:33,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:33,440 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:34:33,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:33,440 INFO L85 PathProgramCache]: Analyzing trace with hash 35688, now seen corresponding path program 1 times [2024-11-10 22:34:33,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:33,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184924392] [2024-11-10 22:34:33,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:33,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:33,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:33,444 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:34:33,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:33,446 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:34:33,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:33,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1955295838, now seen corresponding path program 2 times [2024-11-10 22:34:33,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:33,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305658355] [2024-11-10 22:34:33,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:33,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:33,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:33,529 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:34:33,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:34:33,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305658355] [2024-11-10 22:34:33,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305658355] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 22:34:33,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523943206] [2024-11-10 22:34:33,529 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 22:34:33,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 22:34:33,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:33,531 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 22:34:33,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-11-10 22:34:33,560 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 22:34:33,560 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 22:34:33,561 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 22:34:33,561 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:33,586 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:34:33,586 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 22:34:33,646 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:34:33,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523943206] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 22:34:33,646 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 22:34:33,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-11-10 22:34:33,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853847036] [2024-11-10 22:34:33,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 22:34:33,668 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:34:33,668 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:34:33,668 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:34:33,668 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:34:33,669 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-10 22:34:33,669 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:33,669 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:34:33,669 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:34:33,669 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration4_Loop [2024-11-10 22:34:33,669 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:34:33,669 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:34:33,669 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:33,678 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:33,680 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:33,712 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:34:33,712 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-10 22:34:33,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:33,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:33,715 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:34:33,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-10 22:34:33,717 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 22:34:33,717 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 22:34:33,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-11-10 22:34:33,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:33,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:33,742 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:34:33,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-11-10 22:34:33,744 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-10 22:34:33,744 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 22:34:33,774 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-10 22:34:33,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-11-10 22:34:33,778 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:34:33,779 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:34:33,779 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:34:33,779 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:34:33,779 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 22:34:33,779 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:33,779 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:34:33,779 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:34:33,779 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration4_Loop [2024-11-10 22:34:33,779 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:34:33,779 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:34:33,782 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:33,791 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:33,794 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:33,825 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:34:33,825 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 22:34:33,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:33,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:33,827 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:34:33,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-11-10 22:34:33,830 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:34:33,840 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:34:33,840 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:34:33,840 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:34:33,840 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:34:33,840 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:34:33,842 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:34:33,843 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:34:33,845 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 22:34:33,847 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-10 22:34:33,847 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-10 22:34:33,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:33,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:33,849 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:34:33,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-11-10 22:34:33,858 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 22:34:33,859 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-10 22:34:33,859 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 22:34:33,859 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1) = -2*ULTIMATE.start_main_~j~0#1 + 103 Supporting invariants [] [2024-11-10 22:34:33,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-11-10 22:34:33,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-11-10 22:34:33,874 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-10 22:34:33,878 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-11-10 22:34:33,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:33,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:33,901 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 22:34:33,901 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:33,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:33,922 INFO L255 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 22:34:33,922 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:33,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:34:33,941 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-10 22:34:33,941 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 20 transitions. cyclomatic complexity: 3 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:33,954 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 20 transitions. cyclomatic complexity: 3. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 19 states and 21 transitions. Complement of second has 5 states. [2024-11-10 22:34:33,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-10 22:34:33,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:33,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2024-11-10 22:34:33,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 15 letters. Loop has 3 letters. [2024-11-10 22:34:33,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:34:33,958 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-10 22:34:33,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:33,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:33,984 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 22:34:33,984 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:34,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:34,004 INFO L255 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 22:34:34,004 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:34,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:34:34,019 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-10 22:34:34,019 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 20 transitions. cyclomatic complexity: 3 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:34,026 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 20 transitions. cyclomatic complexity: 3. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 19 states and 21 transitions. Complement of second has 5 states. [2024-11-10 22:34:34,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-10 22:34:34,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:34,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2024-11-10 22:34:34,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 15 letters. Loop has 3 letters. [2024-11-10 22:34:34,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:34:34,028 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-10 22:34:34,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:34,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:34,045 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 22:34:34,046 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:34,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:34,065 INFO L255 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 22:34:34,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:34,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:34:34,081 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-10 22:34:34,081 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 20 transitions. cyclomatic complexity: 3 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:34,089 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 20 transitions. cyclomatic complexity: 3. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 29 states and 31 transitions. Complement of second has 6 states. [2024-11-10 22:34:34,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-10 22:34:34,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:34,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2024-11-10 22:34:34,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 15 letters. Loop has 3 letters. [2024-11-10 22:34:34,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:34:34,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 18 letters. Loop has 3 letters. [2024-11-10 22:34:34,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:34:34,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 15 letters. Loop has 6 letters. [2024-11-10 22:34:34,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:34:34,091 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 31 transitions. [2024-11-10 22:34:34,091 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-10 22:34:34,094 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 20 states and 22 transitions. [2024-11-10 22:34:34,095 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2024-11-10 22:34:34,095 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2024-11-10 22:34:34,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2024-11-10 22:34:34,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:34:34,095 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 22 transitions. [2024-11-10 22:34:34,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2024-11-10 22:34:34,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2024-11-10 22:34:34,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.105263157894737) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:34,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2024-11-10 22:34:34,096 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 21 transitions. [2024-11-10 22:34:34,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:34:34,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 22:34:34,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-11-10 22:34:34,097 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:34,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:34:34,125 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2024-11-10 22:34:34,125 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 53 transitions. [2024-11-10 22:34:34,127 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-10 22:34:34,127 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 39 states and 41 transitions. [2024-11-10 22:34:34,127 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2024-11-10 22:34:34,127 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2024-11-10 22:34:34,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 41 transitions. [2024-11-10 22:34:34,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:34:34,128 INFO L218 hiAutomatonCegarLoop]: Abstraction has 39 states and 41 transitions. [2024-11-10 22:34:34,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 41 transitions. [2024-11-10 22:34:34,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2024-11-10 22:34:34,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.054054054054054) internal successors, (39), 36 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:34,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2024-11-10 22:34:34,129 INFO L240 hiAutomatonCegarLoop]: Abstraction has 37 states and 39 transitions. [2024-11-10 22:34:34,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 22:34:34,130 INFO L425 stractBuchiCegarLoop]: Abstraction has 37 states and 39 transitions. [2024-11-10 22:34:34,130 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-10 22:34:34,130 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 39 transitions. [2024-11-10 22:34:34,131 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-10 22:34:34,131 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:34:34,131 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:34:34,132 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 10, 10, 1, 1] [2024-11-10 22:34:34,132 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2024-11-10 22:34:34,132 INFO L745 eck$LassoCheckResult]: Stem: 970#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 971#ULTIMATE.init_returnLabel#1 assume true;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; 972#L11 assume true; 968#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 969#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 973#L11 assume true; 974#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 1002#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1001#L11 assume true; 1000#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 999#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 998#L11 assume true; 997#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 996#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 995#L11 assume true; 994#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 993#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 992#L11 assume true; 991#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 990#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 989#L11 assume true; 988#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 987#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 986#L11 assume true; 985#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 984#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 983#L11 assume true; 981#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 979#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 978#L11 assume true; 976#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 977#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 975#L11 assume true; 966#L11-1 [2024-11-10 22:34:34,132 INFO L747 eck$LassoCheckResult]: Loop: 966#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 967#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; 980#L11 assume true; 976#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 977#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 975#L11 assume true; 966#L11-1 [2024-11-10 22:34:34,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:34,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1912984455, now seen corresponding path program 3 times [2024-11-10 22:34:34,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:34,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984767747] [2024-11-10 22:34:34,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:34,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:34,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:34,147 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:34:34,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:34,160 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:34:34,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:34,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1063187074, now seen corresponding path program 1 times [2024-11-10 22:34:34,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:34,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561424654] [2024-11-10 22:34:34,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:34,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:34,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:34,165 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:34:34,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:34,169 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:34:34,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:34,171 INFO L85 PathProgramCache]: Analyzing trace with hash -855799416, now seen corresponding path program 3 times [2024-11-10 22:34:34,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:34,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829959839] [2024-11-10 22:34:34,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:34,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:34,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:34,359 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 44 proven. 165 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 22:34:34,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:34:34,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829959839] [2024-11-10 22:34:34,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829959839] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 22:34:34,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928028109] [2024-11-10 22:34:34,360 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 22:34:34,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 22:34:34,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:34,361 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 22:34:34,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2024-11-10 22:34:34,392 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2024-11-10 22:34:34,392 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 22:34:34,393 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-10 22:34:34,394 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:34,439 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 44 proven. 165 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 22:34:34,439 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 22:34:34,636 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 44 proven. 165 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 22:34:34,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928028109] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 22:34:34,636 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 22:34:34,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2024-11-10 22:34:34,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949197260] [2024-11-10 22:34:34,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 22:34:34,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:34:34,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-10 22:34:34,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2024-11-10 22:34:34,684 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. cyclomatic complexity: 3 Second operand has 24 states, 24 states have (on average 3.0) internal successors, (72), 24 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:34,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:34:34,749 INFO L93 Difference]: Finished difference Result 99 states and 101 transitions. [2024-11-10 22:34:34,749 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 101 transitions. [2024-11-10 22:34:34,750 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-10 22:34:34,751 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 75 states and 77 transitions. [2024-11-10 22:34:34,751 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2024-11-10 22:34:34,751 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2024-11-10 22:34:34,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 77 transitions. [2024-11-10 22:34:34,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:34:34,751 INFO L218 hiAutomatonCegarLoop]: Abstraction has 75 states and 77 transitions. [2024-11-10 22:34:34,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 77 transitions. [2024-11-10 22:34:34,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2024-11-10 22:34:34,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 72 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:34,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2024-11-10 22:34:34,758 INFO L240 hiAutomatonCegarLoop]: Abstraction has 73 states and 75 transitions. [2024-11-10 22:34:34,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-10 22:34:34,758 INFO L425 stractBuchiCegarLoop]: Abstraction has 73 states and 75 transitions. [2024-11-10 22:34:34,759 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-10 22:34:34,759 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 75 transitions. [2024-11-10 22:34:34,759 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-10 22:34:34,760 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:34:34,760 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:34:34,761 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [23, 22, 22, 1, 1] [2024-11-10 22:34:34,762 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2024-11-10 22:34:34,762 INFO L745 eck$LassoCheckResult]: Stem: 1363#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1364#ULTIMATE.init_returnLabel#1 assume true;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; 1365#L11 assume true; 1361#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 1362#L12 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#L11 assume true; 1367#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 1431#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1430#L11 assume true; 1429#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 1428#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1427#L11 assume true; 1426#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 1425#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1424#L11 assume true; 1423#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 1422#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1421#L11 assume true; 1420#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 1419#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1418#L11 assume true; 1417#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 1416#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1415#L11 assume true; 1414#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 1413#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1412#L11 assume true; 1411#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 1410#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1409#L11 assume true; 1408#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 1407#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1406#L11 assume true; 1405#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 1404#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1403#L11 assume true; 1402#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 1401#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1400#L11 assume true; 1399#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 1398#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1397#L11 assume true; 1396#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 1395#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1394#L11 assume true; 1393#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 1392#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1391#L11 assume true; 1390#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 1389#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1388#L11 assume true; 1387#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 1386#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1385#L11 assume true; 1384#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 1383#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1382#L11 assume true; 1381#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 1380#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1379#L11 assume true; 1378#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 1377#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1376#L11 assume true; 1374#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 1372#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1371#L11 assume true; 1369#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 1370#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1368#L11 assume true; 1359#L11-1 [2024-11-10 22:34:34,762 INFO L747 eck$LassoCheckResult]: Loop: 1359#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 1360#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; 1373#L11 assume true; 1369#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 1370#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1368#L11 assume true; 1359#L11-1 [2024-11-10 22:34:34,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:34,762 INFO L85 PathProgramCache]: Analyzing trace with hash -358454649, now seen corresponding path program 4 times [2024-11-10 22:34:34,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:34,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210343641] [2024-11-10 22:34:34,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:34,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:34,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:34,781 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:34:34,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:34,793 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:34:34,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:34,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1063187074, now seen corresponding path program 2 times [2024-11-10 22:34:34,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:34,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646323363] [2024-11-10 22:34:34,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:34,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:34,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:34,797 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:34:34,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:34,801 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:34:34,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:34,802 INFO L85 PathProgramCache]: Analyzing trace with hash 764207240, now seen corresponding path program 4 times [2024-11-10 22:34:34,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:34,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68469367] [2024-11-10 22:34:34,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:34,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:34,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:34,844 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-11-10 22:34:35,247 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 92 proven. 759 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 22:34:35,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:34:35,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68469367] [2024-11-10 22:34:35,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68469367] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 22:34:35,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589532016] [2024-11-10 22:34:35,249 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-10 22:34:35,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 22:34:35,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:35,254 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 22:34:35,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2024-11-10 22:34:35,294 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-10 22:34:35,294 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 22:34:35,295 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-10 22:34:35,297 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:35,407 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 92 proven. 759 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 22:34:35,407 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 22:34:36,051 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 92 proven. 759 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 22:34:36,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589532016] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 22:34:36,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 22:34:36,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 48 [2024-11-10 22:34:36,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335191047] [2024-11-10 22:34:36,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 22:34:36,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:34:36,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-10 22:34:36,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2024-11-10 22:34:36,084 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. cyclomatic complexity: 3 Second operand has 48 states, 48 states have (on average 3.0) internal successors, (144), 48 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:36,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:34:36,231 INFO L93 Difference]: Finished difference Result 195 states and 197 transitions. [2024-11-10 22:34:36,231 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 195 states and 197 transitions. [2024-11-10 22:34:36,232 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-10 22:34:36,233 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 195 states to 147 states and 149 transitions. [2024-11-10 22:34:36,233 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2024-11-10 22:34:36,233 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2024-11-10 22:34:36,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 147 states and 149 transitions. [2024-11-10 22:34:36,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:34:36,234 INFO L218 hiAutomatonCegarLoop]: Abstraction has 147 states and 149 transitions. [2024-11-10 22:34:36,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states and 149 transitions. [2024-11-10 22:34:36,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2024-11-10 22:34:36,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 145 states have (on average 1.013793103448276) internal successors, (147), 144 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:36,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 147 transitions. [2024-11-10 22:34:36,239 INFO L240 hiAutomatonCegarLoop]: Abstraction has 145 states and 147 transitions. [2024-11-10 22:34:36,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-11-10 22:34:36,240 INFO L425 stractBuchiCegarLoop]: Abstraction has 145 states and 147 transitions. [2024-11-10 22:34:36,240 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-10 22:34:36,240 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 145 states and 147 transitions. [2024-11-10 22:34:36,241 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-10 22:34:36,241 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:34:36,241 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:34:36,244 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [47, 46, 46, 1, 1] [2024-11-10 22:34:36,244 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2024-11-10 22:34:36,244 INFO L745 eck$LassoCheckResult]: Stem: 2128#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 2129#ULTIMATE.init_returnLabel#1 assume true;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; 2130#L11 assume true; 2126#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 2127#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2131#L11 assume true; 2132#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 2268#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2267#L11 assume true; 2266#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 2265#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2264#L11 assume true; 2263#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 2262#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2261#L11 assume true; 2260#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 2259#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2258#L11 assume true; 2257#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 2256#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2255#L11 assume true; 2254#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 2253#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2252#L11 assume true; 2251#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 2250#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2249#L11 assume true; 2248#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 2247#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2246#L11 assume true; 2245#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 2244#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2243#L11 assume true; 2242#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 2241#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2240#L11 assume true; 2239#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 2238#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2237#L11 assume true; 2236#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 2235#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2234#L11 assume true; 2233#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 2232#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2231#L11 assume true; 2230#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 2229#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2228#L11 assume true; 2227#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 2226#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2225#L11 assume true; 2224#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 2223#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2222#L11 assume true; 2221#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 2220#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2219#L11 assume true; 2218#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 2217#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2216#L11 assume true; 2215#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 2214#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2213#L11 assume true; 2212#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 2211#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2210#L11 assume true; 2209#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 2208#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2207#L11 assume true; 2206#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 2205#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2204#L11 assume true; 2203#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 2202#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2201#L11 assume true; 2200#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 2199#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2198#L11 assume true; 2197#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 2196#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2195#L11 assume true; 2194#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 2193#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2192#L11 assume true; 2191#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 2190#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2189#L11 assume true; 2188#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 2187#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2186#L11 assume true; 2185#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 2184#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2183#L11 assume true; 2182#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 2181#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2180#L11 assume true; 2179#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 2178#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2177#L11 assume true; 2176#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 2175#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2174#L11 assume true; 2173#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 2172#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2171#L11 assume true; 2170#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 2169#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2168#L11 assume true; 2167#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 2166#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2165#L11 assume true; 2164#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 2163#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2162#L11 assume true; 2161#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 2160#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2159#L11 assume true; 2158#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 2157#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2156#L11 assume true; 2155#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 2154#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2153#L11 assume true; 2152#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 2151#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2150#L11 assume true; 2149#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 2148#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2147#L11 assume true; 2146#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 2145#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2144#L11 assume true; 2143#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 2142#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2141#L11 assume true; 2139#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 2137#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2136#L11 assume true; 2134#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 2135#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2133#L11 assume true; 2124#L11-1 [2024-11-10 22:34:36,245 INFO L747 eck$LassoCheckResult]: Loop: 2124#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 2125#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; 2138#L11 assume true; 2134#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 2135#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2133#L11 assume true; 2124#L11-1 [2024-11-10 22:34:36,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:36,245 INFO L85 PathProgramCache]: Analyzing trace with hash -2065885049, now seen corresponding path program 5 times [2024-11-10 22:34:36,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:36,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560213516] [2024-11-10 22:34:36,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:36,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:36,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:36,270 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:34:36,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:36,292 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:34:36,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:36,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1063187074, now seen corresponding path program 3 times [2024-11-10 22:34:36,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:36,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092101650] [2024-11-10 22:34:36,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:36,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:36,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:36,295 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:34:36,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:36,297 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:34:36,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:36,297 INFO L85 PathProgramCache]: Analyzing trace with hash 814550664, now seen corresponding path program 5 times [2024-11-10 22:34:36,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:36,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799817398] [2024-11-10 22:34:36,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:36,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:36,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:37,650 INFO L134 CoverageAnalysis]: Checked inductivity of 3432 backedges. 188 proven. 3243 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 22:34:37,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:34:37,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799817398] [2024-11-10 22:34:37,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799817398] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 22:34:37,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262098803] [2024-11-10 22:34:37,651 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-10 22:34:37,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 22:34:37,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:37,653 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 22:34:37,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2024-11-10 22:34:37,725 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 49 check-sat command(s) [2024-11-10 22:34:37,725 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 22:34:37,727 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-10 22:34:37,729 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:37,909 INFO L134 CoverageAnalysis]: Checked inductivity of 3432 backedges. 188 proven. 3243 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 22:34:37,910 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 22:34:38,876 INFO L134 CoverageAnalysis]: Checked inductivity of 3432 backedges. 188 proven. 3243 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 22:34:38,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262098803] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 22:34:38,876 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 22:34:38,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 51 [2024-11-10 22:34:38,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172501676] [2024-11-10 22:34:38,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 22:34:38,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:34:38,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-11-10 22:34:38,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2024-11-10 22:34:38,911 INFO L87 Difference]: Start difference. First operand 145 states and 147 transitions. cyclomatic complexity: 3 Second operand has 51 states, 51 states have (on average 3.019607843137255) internal successors, (154), 51 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:39,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:34:39,017 INFO L93 Difference]: Finished difference Result 162 states and 164 transitions. [2024-11-10 22:34:39,017 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 162 states and 164 transitions. [2024-11-10 22:34:39,018 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-10 22:34:39,018 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 162 states to 156 states and 158 transitions. [2024-11-10 22:34:39,018 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2024-11-10 22:34:39,018 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2024-11-10 22:34:39,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 156 states and 158 transitions. [2024-11-10 22:34:39,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:34:39,019 INFO L218 hiAutomatonCegarLoop]: Abstraction has 156 states and 158 transitions. [2024-11-10 22:34:39,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states and 158 transitions. [2024-11-10 22:34:39,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 154. [2024-11-10 22:34:39,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 154 states have (on average 1.0129870129870129) internal successors, (156), 153 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:39,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 156 transitions. [2024-11-10 22:34:39,024 INFO L240 hiAutomatonCegarLoop]: Abstraction has 154 states and 156 transitions. [2024-11-10 22:34:39,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-11-10 22:34:39,028 INFO L425 stractBuchiCegarLoop]: Abstraction has 154 states and 156 transitions. [2024-11-10 22:34:39,028 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-10 22:34:39,028 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 154 states and 156 transitions. [2024-11-10 22:34:39,029 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-10 22:34:39,029 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:34:39,029 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:34:39,033 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [50, 49, 49, 1, 1] [2024-11-10 22:34:39,033 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2024-11-10 22:34:39,034 INFO L745 eck$LassoCheckResult]: Stem: 3367#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 3368#ULTIMATE.init_returnLabel#1 assume true;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; 3369#L11 assume true; 3365#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 3366#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 3370#L11 assume true; 3371#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 3516#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 3515#L11 assume true; 3514#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 3513#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 3512#L11 assume true; 3511#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 3510#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 3509#L11 assume true; 3508#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 3507#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 3506#L11 assume true; 3505#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 3504#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 3503#L11 assume true; 3502#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 3501#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 3500#L11 assume true; 3499#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 3498#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 3497#L11 assume true; 3496#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 3495#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 3494#L11 assume true; 3493#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 3492#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 3491#L11 assume true; 3490#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 3489#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 3488#L11 assume true; 3487#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 3486#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 3485#L11 assume true; 3484#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 3483#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 3482#L11 assume true; 3481#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 3480#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 3479#L11 assume true; 3478#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 3477#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 3476#L11 assume true; 3475#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 3474#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 3473#L11 assume true; 3472#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 3471#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 3470#L11 assume true; 3469#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 3468#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 3467#L11 assume true; 3466#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 3465#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 3464#L11 assume true; 3463#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 3462#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 3461#L11 assume true; 3460#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 3459#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 3458#L11 assume true; 3457#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 3456#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 3455#L11 assume true; 3454#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 3453#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 3452#L11 assume true; 3451#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 3450#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 3449#L11 assume true; 3448#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 3447#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 3446#L11 assume true; 3445#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 3444#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 3443#L11 assume true; 3442#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 3441#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 3440#L11 assume true; 3439#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 3438#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 3437#L11 assume true; 3436#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 3435#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 3434#L11 assume true; 3433#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 3432#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 3431#L11 assume true; 3430#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 3429#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 3428#L11 assume true; 3427#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 3426#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 3425#L11 assume true; 3424#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 3423#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 3422#L11 assume true; 3421#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 3420#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 3419#L11 assume true; 3418#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 3417#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 3416#L11 assume true; 3415#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 3414#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 3413#L11 assume true; 3412#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 3411#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 3410#L11 assume true; 3409#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 3408#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 3407#L11 assume true; 3406#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 3405#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 3404#L11 assume true; 3403#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 3402#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 3401#L11 assume true; 3400#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 3399#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 3398#L11 assume true; 3397#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 3396#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 3395#L11 assume true; 3394#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 3393#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 3392#L11 assume true; 3391#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 3390#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 3389#L11 assume true; 3388#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 3387#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 3386#L11 assume true; 3385#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 3384#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 3383#L11 assume true; 3382#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 3381#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 3380#L11 assume true; 3378#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 3376#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 3375#L11 assume true; 3373#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 3374#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 3372#L11 assume true; 3363#L11-1 [2024-11-10 22:34:39,034 INFO L747 eck$LassoCheckResult]: Loop: 3363#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 3364#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; 3377#L11 assume true; 3373#L11-1 assume !!(main_~i~0#1 < main_~j~0#1); 3374#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 3372#L11 assume true; 3363#L11-1 [2024-11-10 22:34:39,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:39,034 INFO L85 PathProgramCache]: Analyzing trace with hash -2029195645, now seen corresponding path program 6 times [2024-11-10 22:34:39,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:39,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988919749] [2024-11-10 22:34:39,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:39,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:39,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:39,055 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:34:39,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:39,078 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:34:39,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:39,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1063187074, now seen corresponding path program 4 times [2024-11-10 22:34:39,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:39,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112932706] [2024-11-10 22:34:39,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:39,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:39,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:39,085 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:34:39,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:39,088 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:34:39,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:39,088 INFO L85 PathProgramCache]: Analyzing trace with hash 896235396, now seen corresponding path program 6 times [2024-11-10 22:34:39,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:39,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745015711] [2024-11-10 22:34:39,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:39,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:39,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:39,124 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:34:39,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:39,162 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:34:41,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:41,508 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:34:41,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:41,601 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 10:34:41 BoogieIcfgContainer [2024-11-10 22:34:41,602 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-10 22:34:41,602 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 22:34:41,602 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 22:34:41,602 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 22:34:41,603 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:34:31" (3/4) ... [2024-11-10 22:34:41,608 INFO L140 WitnessPrinter]: Generating witness for non-termination counterexample [2024-11-10 22:34:41,661 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 22:34:41,661 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 22:34:41,662 INFO L158 Benchmark]: Toolchain (without parser) took 10815.66ms. Allocated memory was 142.6MB in the beginning and 264.2MB in the end (delta: 121.6MB). Free memory was 108.1MB in the beginning and 108.0MB in the end (delta: 148.1kB). Peak memory consumption was 120.3MB. Max. memory is 16.1GB. [2024-11-10 22:34:41,662 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 100.7MB. Free memory is still 71.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 22:34:41,662 INFO L158 Benchmark]: CACSL2BoogieTranslator took 169.26ms. Allocated memory is still 142.6MB. Free memory was 107.5MB in the beginning and 96.4MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-10 22:34:41,662 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.67ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 95.5MB in the end (delta: 828.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 22:34:41,662 INFO L158 Benchmark]: Boogie Preprocessor took 14.91ms. Allocated memory is still 142.6MB. Free memory was 95.5MB in the beginning and 94.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 22:34:41,663 INFO L158 Benchmark]: IcfgBuilder took 220.04ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 112.4MB in the end (delta: -18.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 22:34:41,663 INFO L158 Benchmark]: BuchiAutomizer took 10326.17ms. Allocated memory was 142.6MB in the beginning and 264.2MB in the end (delta: 121.6MB). Free memory was 111.6MB in the beginning and 113.2MB in the end (delta: -1.6MB). Peak memory consumption was 120.7MB. Max. memory is 16.1GB. [2024-11-10 22:34:41,663 INFO L158 Benchmark]: Witness Printer took 59.34ms. Allocated memory is still 264.2MB. Free memory was 112.2MB in the beginning and 108.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 22:34:41,664 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.21ms. Allocated memory is still 100.7MB. Free memory is still 71.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 169.26ms. Allocated memory is still 142.6MB. Free memory was 107.5MB in the beginning and 96.4MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.67ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 95.5MB in the end (delta: 828.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 14.91ms. Allocated memory is still 142.6MB. Free memory was 95.5MB in the beginning and 94.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 220.04ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 112.4MB in the end (delta: -18.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 10326.17ms. Allocated memory was 142.6MB in the beginning and 264.2MB in the end (delta: 121.6MB). Free memory was 111.6MB in the beginning and 113.2MB in the end (delta: -1.6MB). Peak memory consumption was 120.7MB. Max. memory is 16.1GB. * Witness Printer took 59.34ms. Allocated memory is still 264.2MB. Free memory was 112.2MB in the beginning and 108.0MB 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 10 terminating modules (6 trivial, 2 deterministic, 2 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function j and consists of 4 locations. One deterministic module has affine ranking function j and consists of 3 locations. One nondeterministic 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. 6 modules have a trivial ranking function, the largest among these consists of 51 locations. The remainder module has 154 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.2s and 8 iterations. TraceHistogramMax:50. Analysis of lassos took 9.1s. Construction of modules took 0.2s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 10. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 24 StatesRemovedByMinimization, 8 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 [2, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 54 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 46 mSDsluCounter, 225 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 157 mSDsCounter, 64 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 343 IncrementalHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 64 mSolverCounterUnsat, 68 mSDtfsCounter, 343 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT1 conc3 concLT1 SILN0 SILU0 SILI0 SILT2 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: 37ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 11]: 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] Loop: [L11] COND TRUE i < j [L12] COND FALSE !(51 < j) [L13] i = i-1 [L13] j = j+1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 11]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] int 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] Loop: [L11] COND TRUE i < j [L12] COND FALSE !(51 < j) [L13] i = i-1 [L13] j = j+1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-11-10 22:34:41,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2024-11-10 22:34:41,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2024-11-10 22:34:42,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2024-11-10 22:34:42,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2024-11-10 22:34:42,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-11-10 22:34:42,691 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)