/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i /storage/cav23-termute-examples/4_plus_thr/indep_loops_5.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:42:45,755 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:42:45,809 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:42:45,812 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:42:45,812 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:42:45,812 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:42:45,812 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:42:45,834 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:42:45,834 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:42:45,834 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:42:45,835 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:42:45,835 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:42:45,835 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:42:45,835 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:42:45,835 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:42:45,835 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:42:45,835 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:42:45,835 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:42:45,837 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:42:45,837 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:42:45,837 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:42:45,837 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:42:45,837 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:42:45,837 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:42:45,837 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:42:45,837 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:42:45,837 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:42:45,837 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:42:45,837 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:42:45,837 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:42:45,838 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:42:45,838 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:42:45,838 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:42:45,838 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:42:45,838 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:42:45,838 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:42:45,838 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:42:45,838 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:42:45,838 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:42:45,838 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:42:45,838 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:42:45,839 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:42:45,839 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:42:46,066 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:42:46,072 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:42:46,073 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:42:46,074 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:42:46,075 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:42:46,076 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/4_plus_thr/indep_loops_5.c.bpl [2025-04-26 18:42:46,076 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/4_plus_thr/indep_loops_5.c.bpl' [2025-04-26 18:42:46,089 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:42:46,090 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:42:46,091 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:42:46,091 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:42:46,091 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:42:46,098 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "indep_loops_5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:46" (1/1) ... [2025-04-26 18:42:46,113 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "indep_loops_5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:46" (1/1) ... [2025-04-26 18:42:46,118 INFO L138 Inliner]: procedures = 6, calls = 5, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:42:46,119 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:42:46,121 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:42:46,121 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:42:46,121 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:42:46,125 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "indep_loops_5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:46" (1/1) ... [2025-04-26 18:42:46,125 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "indep_loops_5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:46" (1/1) ... [2025-04-26 18:42:46,128 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "indep_loops_5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:46" (1/1) ... [2025-04-26 18:42:46,128 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "indep_loops_5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:46" (1/1) ... [2025-04-26 18:42:46,129 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "indep_loops_5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:46" (1/1) ... [2025-04-26 18:42:46,130 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "indep_loops_5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:46" (1/1) ... [2025-04-26 18:42:46,136 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "indep_loops_5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:46" (1/1) ... [2025-04-26 18:42:46,137 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "indep_loops_5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:46" (1/1) ... [2025-04-26 18:42:46,137 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "indep_loops_5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:46" (1/1) ... [2025-04-26 18:42:46,146 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:42:46,149 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:42:46,149 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:42:46,149 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:42:46,150 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "indep_loops_5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:46" (1/1) ... [2025-04-26 18:42:46,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:42:46,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:46,181 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:46,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 18:42:46,208 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:42:46,208 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:42:46,208 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:42:46,208 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:42:46,208 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:42:46,208 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:42:46,208 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 18:42:46,208 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:42:46,208 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:42:46,208 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:42:46,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:42:46,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:42:46,209 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 18:42:46,209 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 18:42:46,209 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 18:42:46,209 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2025-04-26 18:42:46,209 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-04-26 18:42:46,209 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-04-26 18:42:46,210 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 18:42:46,245 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:42:46,246 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:42:46,321 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:42:46,321 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:42:46,328 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:42:46,328 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:42:46,328 INFO L201 PluginConnector]: Adding new model indep_loops_5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:42:46 BoogieIcfgContainer [2025-04-26 18:42:46,328 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:42:46,329 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:42:46,329 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:42:46,333 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:42:46,334 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:42:46,334 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "indep_loops_5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:46" (1/2) ... [2025-04-26 18:42:46,335 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@396fd024 and model type indep_loops_5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:42:46, skipping insertion in model container [2025-04-26 18:42:46,335 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:42:46,335 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "indep_loops_5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:42:46" (2/2) ... [2025-04-26 18:42:46,336 INFO L376 chiAutomizerObserver]: Analyzing ICFG indep_loops_5.c.bpl [2025-04-26 18:42:46,401 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2025-04-26 18:42:46,447 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:42:46,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:42:46,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:46,450 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:46,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 18:42:46,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 41 transitions, 117 flow [2025-04-26 18:42:46,527 INFO L116 PetriNetUnfolderBase]: 5/31 cut-off events. [2025-04-26 18:42:46,528 INFO L117 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-04-26 18:42:46,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 31 events. 5/31 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 57 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 32. Up to 2 conditions per place. [2025-04-26 18:42:46,532 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 41 transitions, 117 flow [2025-04-26 18:42:46,534 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 31 transitions, 92 flow [2025-04-26 18:42:46,534 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 42 places, 31 transitions, 92 flow [2025-04-26 18:42:46,535 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 42 places, 31 transitions, 92 flow [2025-04-26 18:42:46,664 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1707 states, 1706 states have (on average 4.869284876905041) internal successors, (in total 8307), 1706 states have internal predecessors, (8307), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:46,669 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 1707 states, 1706 states have (on average 4.869284876905041) internal successors, (in total 8307), 1706 states have internal predecessors, (8307), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:46,672 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:42:46,941 WARN L140 AmpleReduction]: Number of pruned transitions: 2971 [2025-04-26 18:42:46,941 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:42:46,941 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 801 [2025-04-26 18:42:46,941 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:26 [2025-04-26 18:42:46,942 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:879 [2025-04-26 18:42:46,942 WARN L145 AmpleReduction]: Times succ was already a loop node:1906 [2025-04-26 18:42:46,942 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:176 [2025-04-26 18:42:46,942 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:42:46,948 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 1707 states, 1706 states have (on average 3.12778429073857) internal successors, (in total 5336), 1706 states have internal predecessors, (5336), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:46,955 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:42:46,955 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:42:46,955 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:42:46,955 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:42:46,955 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:42:46,955 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:42:46,955 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:42:46,955 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:42:46,961 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 1707 states, 1706 states have (on average 3.12778429073857) internal successors, (in total 5336), 1706 states have internal predecessors, (5336), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:47,013 INFO L131 ngComponentsAnalysis]: Automaton has 391 accepting balls. 1612 [2025-04-26 18:42:47,013 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:47,013 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:47,017 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-04-26 18:42:47,017 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:47,017 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:42:47,021 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 1707 states, 1706 states have (on average 3.12778429073857) internal successors, (in total 5336), 1706 states have internal predecessors, (5336), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:47,068 INFO L131 ngComponentsAnalysis]: Automaton has 391 accepting balls. 1612 [2025-04-26 18:42:47,068 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:47,068 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:47,069 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-04-26 18:42:47,069 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:47,074 INFO L752 eck$LassoCheckResult]: Stem: "[99] $Ultimate##0-->L27: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 18:42:47,074 INFO L754 eck$LassoCheckResult]: Loop: "[78] L27-->L29: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[80] L29-->L27: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" [2025-04-26 18:42:47,079 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:47,079 INFO L85 PathProgramCache]: Analyzing trace with hash 130, now seen corresponding path program 1 times [2025-04-26 18:42:47,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:47,085 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604031769] [2025-04-26 18:42:47,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:47,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:47,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:42:47,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:42:47,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:47,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:47,141 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:47,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:42:47,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:42:47,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:47,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:47,156 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:47,160 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:47,160 INFO L85 PathProgramCache]: Analyzing trace with hash 3459, now seen corresponding path program 1 times [2025-04-26 18:42:47,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:47,161 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179621754] [2025-04-26 18:42:47,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:47,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:47,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:47,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:47,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:47,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:47,169 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:47,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:47,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:47,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:47,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:47,175 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:47,176 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:47,176 INFO L85 PathProgramCache]: Analyzing trace with hash 127428, now seen corresponding path program 1 times [2025-04-26 18:42:47,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:47,176 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749687892] [2025-04-26 18:42:47,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:47,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:47,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:47,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:47,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:47,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:47,182 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:47,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:47,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:47,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:47,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:47,187 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:47,282 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:47,282 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:47,282 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:47,282 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:47,282 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:47,283 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:47,283 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:47,283 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:47,283 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_5.c.bpl_petrified1_Iteration1_Loop [2025-04-26 18:42:47,284 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:47,284 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:47,293 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:47,324 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:47,324 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:47,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:47,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:47,327 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:47,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 18:42:47,330 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:47,331 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:47,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 18:42:47,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:47,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:47,351 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:47,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 18:42:47,353 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:47,353 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:47,417 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:47,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 18:42:47,422 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:47,422 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:47,422 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:47,422 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:47,422 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:47,422 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:47,422 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:47,422 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:47,422 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_5.c.bpl_petrified1_Iteration1_Loop [2025-04-26 18:42:47,422 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:47,422 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:47,424 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:47,444 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:47,447 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:47,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:47,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:47,450 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:47,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 18:42:47,456 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 [2025-04-26 18:42:47,467 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:47,467 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:47,468 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:47,468 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:47,468 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:47,472 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:47,472 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:47,477 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:47,482 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:42:47,482 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:47,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:47,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:47,485 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:47,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 18:42:47,487 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:47,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:47,490 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:47,491 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:47,491 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, z) = -1*x1 + 1*z Supporting invariants [] [2025-04-26 18:42:47,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:47,499 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:47,522 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:47,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:42:47,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:42:47,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:47,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:47,533 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:47,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:47,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:47,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:47,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:47,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:47,545 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:47,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:47,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:42:47,584 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 [2025-04-26 18:42:47,589 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 1707 states, 1706 states have (on average 3.12778429073857) internal successors, (in total 5336), 1706 states have internal predecessors, (5336), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.0) internal successors, (in total 3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:47,768 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 1707 states, 1706 states have (on average 3.12778429073857) internal successors, (in total 5336), 1706 states have internal predecessors, (5336), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.0) internal successors, (in total 3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 4091 states and 12734 transitions. Complement of second has 6 states. [2025-04-26 18:42:47,769 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:42:47,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.0) internal successors, (in total 3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:47,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2025-04-26 18:42:47,778 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 72 transitions. Stem has 1 letters. Loop has 2 letters. [2025-04-26 18:42:47,778 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:47,779 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 72 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 18:42:47,779 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:47,779 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 72 transitions. Stem has 1 letters. Loop has 4 letters. [2025-04-26 18:42:47,779 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:47,779 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4091 states and 12734 transitions. [2025-04-26 18:42:47,830 INFO L131 ngComponentsAnalysis]: Automaton has 270 accepting balls. 930 [2025-04-26 18:42:47,863 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4091 states to 2258 states and 7014 transitions. [2025-04-26 18:42:47,865 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 959 [2025-04-26 18:42:47,871 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1446 [2025-04-26 18:42:47,872 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2258 states and 7014 transitions. [2025-04-26 18:42:47,873 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:47,873 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2258 states and 7014 transitions. [2025-04-26 18:42:47,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2258 states and 7014 transitions. [2025-04-26 18:42:47,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2258 to 1936. [2025-04-26 18:42:47,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1936 states, 1936 states have (on average 3.104338842975207) internal successors, (in total 6010), 1935 states have internal predecessors, (6010), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:47,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1936 states to 1936 states and 6010 transitions. [2025-04-26 18:42:47,990 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1936 states and 6010 transitions. [2025-04-26 18:42:47,990 INFO L438 stractBuchiCegarLoop]: Abstraction has 1936 states and 6010 transitions. [2025-04-26 18:42:47,990 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:42:47,990 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1936 states and 6010 transitions. [2025-04-26 18:42:47,998 INFO L131 ngComponentsAnalysis]: Automaton has 270 accepting balls. 930 [2025-04-26 18:42:47,998 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:47,998 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:47,999 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 18:42:47,999 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:47,999 INFO L752 eck$LassoCheckResult]: Stem: "[99] $Ultimate##0-->L27: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[77] L27-->thread1FINAL: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" "[79] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[102] L12-->L36: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-04-26 18:42:47,999 INFO L754 eck$LassoCheckResult]: Loop: "[82] L36-->L38: Formula: (< v_x2_1 v_z_3) InVars {x2=v_x2_1, z=v_z_3} OutVars{x2=v_x2_1, z=v_z_3} AuxVars[] AssignedVars[]" "[84] L38-->L36: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-04-26 18:42:48,000 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:48,000 INFO L85 PathProgramCache]: Analyzing trace with hash 3949378, now seen corresponding path program 1 times [2025-04-26 18:42:48,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:48,001 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059949106] [2025-04-26 18:42:48,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:48,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:48,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:48,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:48,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:48,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:48,006 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:48,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:48,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:48,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:48,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:48,012 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:48,012 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:48,012 INFO L85 PathProgramCache]: Analyzing trace with hash 3587, now seen corresponding path program 1 times [2025-04-26 18:42:48,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:48,013 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105353740] [2025-04-26 18:42:48,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:48,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:48,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:48,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:48,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:48,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:48,018 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:48,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:48,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:48,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:48,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:48,022 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:48,022 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:48,022 INFO L85 PathProgramCache]: Analyzing trace with hash -499612412, now seen corresponding path program 1 times [2025-04-26 18:42:48,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:48,022 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304905046] [2025-04-26 18:42:48,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:48,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:48,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:42:48,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:42:48,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:48,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:48,026 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:48,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:42:48,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:42:48,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:48,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:48,033 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:48,051 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:48,051 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:48,051 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:48,051 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:48,051 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:48,051 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:48,051 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:48,051 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:48,051 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_5.c.bpl_petrified1_Iteration2_Loop [2025-04-26 18:42:48,051 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:48,051 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:48,052 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:48,069 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:48,070 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:48,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:48,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:48,072 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:48,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 18:42:48,074 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:48,074 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:48,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 18:42:48,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:48,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:48,092 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:48,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 18:42:48,093 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:48,093 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:48,155 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:48,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 18:42:48,159 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:48,159 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:48,159 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:48,160 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:48,160 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:48,160 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:48,160 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:48,160 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:48,160 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_5.c.bpl_petrified1_Iteration2_Loop [2025-04-26 18:42:48,160 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:48,160 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:48,160 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:48,176 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:48,176 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:48,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:48,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:48,178 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:48,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 18:42:48,180 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 [2025-04-26 18:42:48,190 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:48,190 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:48,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:48,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:48,190 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:48,192 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:48,192 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:48,195 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:48,198 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:42:48,198 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:48,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:48,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:48,201 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:48,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 18:42:48,203 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:48,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:48,206 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:48,206 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:48,206 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x2) = 1*z - 1*x2 Supporting invariants [] [2025-04-26 18:42:48,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 18:42:48,213 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:48,225 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:48,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:48,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:48,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:48,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:48,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:48,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:48,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:48,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:48,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:48,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:48,241 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:48,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:48,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:42:48,255 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 [2025-04-26 18:42:48,255 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1936 states and 6010 transitions. cyclomatic complexity: 4449 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:48,385 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1936 states and 6010 transitions. cyclomatic complexity: 4449. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 5127 states and 16042 transitions. Complement of second has 6 states. [2025-04-26 18:42:48,386 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:42:48,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:48,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2025-04-26 18:42:48,387 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 74 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 18:42:48,387 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:48,387 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 74 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 18:42:48,387 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:48,387 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 74 transitions. Stem has 4 letters. Loop has 4 letters. [2025-04-26 18:42:48,387 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:48,387 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5127 states and 16042 transitions. [2025-04-26 18:42:48,470 INFO L131 ngComponentsAnalysis]: Automaton has 163 accepting balls. 462 [2025-04-26 18:42:48,501 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5127 states to 3091 states and 9433 transitions. [2025-04-26 18:42:48,501 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1060 [2025-04-26 18:42:48,508 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1450 [2025-04-26 18:42:48,509 INFO L74 IsDeterministic]: Start isDeterministic. Operand 3091 states and 9433 transitions. [2025-04-26 18:42:48,509 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:48,509 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3091 states and 9433 transitions. [2025-04-26 18:42:48,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3091 states and 9433 transitions. [2025-04-26 18:42:48,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3091 to 2701. [2025-04-26 18:42:48,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2701 states, 2701 states have (on average 3.095890410958904) internal successors, (in total 8362), 2700 states have internal predecessors, (8362), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:48,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2701 states to 2701 states and 8362 transitions. [2025-04-26 18:42:48,576 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2701 states and 8362 transitions. [2025-04-26 18:42:48,576 INFO L438 stractBuchiCegarLoop]: Abstraction has 2701 states and 8362 transitions. [2025-04-26 18:42:48,576 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:42:48,576 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2701 states and 8362 transitions. [2025-04-26 18:42:48,586 INFO L131 ngComponentsAnalysis]: Automaton has 163 accepting balls. 462 [2025-04-26 18:42:48,587 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:48,587 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:48,587 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:42:48,587 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:48,588 INFO L752 eck$LassoCheckResult]: Stem: "[99] $Ultimate##0-->L27: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[77] L27-->thread1FINAL: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" "[79] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[102] L12-->L36: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[81] L36-->thread2FINAL: Formula: (<= v_z_4 v_x2_4) InVars {x2=v_x2_4, z=v_z_4} OutVars{x2=v_x2_4, z=v_z_4} AuxVars[] AssignedVars[]" "[83] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[105] L13-->L45: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" [2025-04-26 18:42:48,588 INFO L754 eck$LassoCheckResult]: Loop: "[86] L45-->L47: Formula: (< v_x3_1 v_z_5) InVars {x3=v_x3_1, z=v_z_5} OutVars{x3=v_x3_1, z=v_z_5} AuxVars[] AssignedVars[]" "[88] L47-->L45: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" [2025-04-26 18:42:48,588 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:48,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1691883525, now seen corresponding path program 1 times [2025-04-26 18:42:48,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:48,589 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959365262] [2025-04-26 18:42:48,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:48,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:48,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:42:48,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:42:48,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:48,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:48,595 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:48,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:42:48,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:42:48,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:48,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:48,599 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:48,602 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:48,602 INFO L85 PathProgramCache]: Analyzing trace with hash 3715, now seen corresponding path program 1 times [2025-04-26 18:42:48,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:48,602 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581499188] [2025-04-26 18:42:48,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:48,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:48,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:48,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:48,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:48,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:48,606 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:48,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:48,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:48,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:48,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:48,609 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:48,609 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:48,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1892534905, now seen corresponding path program 1 times [2025-04-26 18:42:48,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:48,609 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081800779] [2025-04-26 18:42:48,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:48,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:48,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:42:48,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:42:48,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:48,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:48,615 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:48,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:42:48,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:42:48,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:48,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:48,623 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:48,649 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:48,649 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:48,650 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:48,650 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:48,650 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:48,650 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:48,650 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:48,650 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:48,650 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_5.c.bpl_petrified1_Iteration3_Loop [2025-04-26 18:42:48,650 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:48,650 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:48,650 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:48,669 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:48,669 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:48,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:48,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:48,671 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:48,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 18:42:48,700 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:48,700 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:48,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:48,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:48,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:48,718 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:48,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 18:42:48,722 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:48,722 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:48,789 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:48,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:48,794 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:48,794 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:48,794 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:48,795 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:48,795 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:48,795 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:48,795 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:48,795 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:48,795 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_5.c.bpl_petrified1_Iteration3_Loop [2025-04-26 18:42:48,795 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:48,795 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:48,795 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:48,812 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:48,812 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:48,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:48,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:48,814 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:48,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 18:42:48,817 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 [2025-04-26 18:42:48,827 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:48,827 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:48,827 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:48,827 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:48,827 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:48,828 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:48,828 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:48,830 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:48,832 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:42:48,832 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:42:48,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:48,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:48,834 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:48,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 18:42:48,837 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:48,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:48,840 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:48,840 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:48,840 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x3) = 1*z - 1*x3 Supporting invariants [] [2025-04-26 18:42:48,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:48,846 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:48,857 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:48,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:42:48,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:42:48,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:48,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:48,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:48,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:48,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:48,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:48,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:48,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:48,875 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:48,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:48,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:42:48,887 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 [2025-04-26 18:42:48,887 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2701 states and 8362 transitions. cyclomatic complexity: 6036 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:49,004 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2701 states and 8362 transitions. cyclomatic complexity: 6036. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 7267 states and 22454 transitions. Complement of second has 6 states. [2025-04-26 18:42:49,005 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:42:49,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:49,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2025-04-26 18:42:49,006 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 79 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 18:42:49,006 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:49,006 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 79 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 18:42:49,006 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:49,006 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 79 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 18:42:49,007 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:49,007 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7267 states and 22454 transitions. [2025-04-26 18:42:49,165 INFO L131 ngComponentsAnalysis]: Automaton has 84 accepting balls. 198 [2025-04-26 18:42:49,224 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7267 states to 4067 states and 12295 transitions. [2025-04-26 18:42:49,225 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1148 [2025-04-26 18:42:49,229 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1357 [2025-04-26 18:42:49,230 INFO L74 IsDeterministic]: Start isDeterministic. Operand 4067 states and 12295 transitions. [2025-04-26 18:42:49,230 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:49,230 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4067 states and 12295 transitions. [2025-04-26 18:42:49,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4067 states and 12295 transitions. [2025-04-26 18:42:49,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4067 to 3803. [2025-04-26 18:42:49,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3803 states, 3803 states have (on average 2.9939521430449645) internal successors, (in total 11386), 3802 states have internal predecessors, (11386), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:49,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3803 states to 3803 states and 11386 transitions. [2025-04-26 18:42:49,332 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3803 states and 11386 transitions. [2025-04-26 18:42:49,333 INFO L438 stractBuchiCegarLoop]: Abstraction has 3803 states and 11386 transitions. [2025-04-26 18:42:49,333 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:42:49,333 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3803 states and 11386 transitions. [2025-04-26 18:42:49,353 INFO L131 ngComponentsAnalysis]: Automaton has 84 accepting balls. 198 [2025-04-26 18:42:49,353 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:49,353 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:49,353 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:42:49,353 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:49,354 INFO L752 eck$LassoCheckResult]: Stem: "[99] $Ultimate##0-->L27: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[78] L27-->L29: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[102] L12-->L36: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[80] L29-->L27: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[105] L13-->L45: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[77] L27-->thread1FINAL: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" "[108] L14-->L54: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" "[81] L36-->thread2FINAL: Formula: (<= v_z_4 v_x2_4) InVars {x2=v_x2_4, z=v_z_4} OutVars{x2=v_x2_4, z=v_z_4} AuxVars[] AssignedVars[]" "[85] L45-->thread3FINAL: Formula: (<= v_z_6 v_x3_4) InVars {x3=v_x3_4, z=v_z_6} OutVars{x3=v_x3_4, z=v_z_6} AuxVars[] AssignedVars[]" [2025-04-26 18:42:49,354 INFO L754 eck$LassoCheckResult]: Loop: "[90] L54-->L56: Formula: (< v_x4_1 v_z_7) InVars {x4=v_x4_1, z=v_z_7} OutVars{x4=v_x4_1, z=v_z_7} AuxVars[] AssignedVars[]" "[92] L56-->L54: Formula: (= (+ v_x4_3 1) v_x4_2) InVars {x4=v_x4_3} OutVars{x4=v_x4_2} AuxVars[] AssignedVars[x4]" [2025-04-26 18:42:49,355 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:49,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1819829226, now seen corresponding path program 1 times [2025-04-26 18:42:49,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:49,355 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497829807] [2025-04-26 18:42:49,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:49,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:49,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:42:49,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:42:49,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:49,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:49,361 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:49,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:42:49,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:42:49,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:49,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:49,365 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:49,366 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:49,366 INFO L85 PathProgramCache]: Analyzing trace with hash 3843, now seen corresponding path program 1 times [2025-04-26 18:42:49,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:49,366 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174364369] [2025-04-26 18:42:49,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:49,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:49,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:49,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:49,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:49,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:49,369 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:49,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:49,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:49,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:49,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:49,371 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:49,373 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:49,373 INFO L85 PathProgramCache]: Analyzing trace with hash -804193832, now seen corresponding path program 1 times [2025-04-26 18:42:49,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:49,373 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708063589] [2025-04-26 18:42:49,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:49,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:49,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:42:49,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:42:49,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:49,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:49,382 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:49,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:42:49,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:42:49,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:49,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:49,392 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:49,405 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:49,405 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:49,405 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:49,405 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:49,405 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:49,405 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:49,405 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:49,405 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:49,405 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_5.c.bpl_petrified1_Iteration4_Loop [2025-04-26 18:42:49,405 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:49,405 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:49,406 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:49,422 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:49,422 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:49,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:49,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:49,424 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:49,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 18:42:49,427 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:49,427 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:49,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:49,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:49,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:49,445 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:49,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 18:42:49,448 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:49,448 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:49,516 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:49,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 18:42:49,520 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:49,521 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:49,521 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:49,521 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:49,521 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:49,521 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:49,521 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:49,521 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:49,521 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_5.c.bpl_petrified1_Iteration4_Loop [2025-04-26 18:42:49,521 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:49,521 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:49,522 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:49,537 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:49,537 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:49,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:49,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:49,539 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:49,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 18:42:49,542 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 [2025-04-26 18:42:49,551 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:49,552 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:49,552 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:49,552 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:49,552 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:49,553 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:49,553 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:49,555 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:49,559 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:42:49,559 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:49,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:49,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:49,561 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:49,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 18:42:49,563 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:49,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:49,566 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:49,566 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:49,566 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x4) = 1*z - 1*x4 Supporting invariants [] [2025-04-26 18:42:49,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:49,573 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:49,583 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:49,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:42:49,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:42:49,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:49,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:49,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:49,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:49,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:49,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:49,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:49,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:49,606 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:49,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:49,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:42:49,620 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 [2025-04-26 18:42:49,620 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3803 states and 11386 transitions. cyclomatic complexity: 7984 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:49,782 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3803 states and 11386 transitions. cyclomatic complexity: 7984. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 7044 states and 20597 transitions. Complement of second has 6 states. [2025-04-26 18:42:49,782 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:42:49,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:49,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2025-04-26 18:42:49,783 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 88 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 18:42:49,783 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:49,783 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 88 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 18:42:49,783 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:49,783 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 88 transitions. Stem has 9 letters. Loop has 4 letters. [2025-04-26 18:42:49,784 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:49,784 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7044 states and 20597 transitions. [2025-04-26 18:42:49,831 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 62 [2025-04-26 18:42:49,866 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7044 states to 4273 states and 12284 transitions. [2025-04-26 18:42:49,866 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1213 [2025-04-26 18:42:49,870 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1352 [2025-04-26 18:42:49,870 INFO L74 IsDeterministic]: Start isDeterministic. Operand 4273 states and 12284 transitions. [2025-04-26 18:42:49,870 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:49,870 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4273 states and 12284 transitions. [2025-04-26 18:42:49,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4273 states and 12284 transitions. [2025-04-26 18:42:49,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4273 to 4001. [2025-04-26 18:42:49,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4001 states, 4001 states have (on average 2.9185203699075233) internal successors, (in total 11677), 4000 states have internal predecessors, (11677), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:49,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4001 states to 4001 states and 11677 transitions. [2025-04-26 18:42:49,949 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4001 states and 11677 transitions. [2025-04-26 18:42:49,950 INFO L438 stractBuchiCegarLoop]: Abstraction has 4001 states and 11677 transitions. [2025-04-26 18:42:49,950 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:42:49,950 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4001 states and 11677 transitions. [2025-04-26 18:42:49,963 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 62 [2025-04-26 18:42:49,964 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:49,964 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:49,964 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:42:49,964 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:49,965 INFO L752 eck$LassoCheckResult]: Stem: "[99] $Ultimate##0-->L27: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[78] L27-->L29: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[102] L12-->L36: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[80] L29-->L27: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[105] L13-->L45: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[77] L27-->thread1FINAL: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" "[108] L14-->L54: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" "[81] L36-->thread2FINAL: Formula: (<= v_z_4 v_x2_4) InVars {x2=v_x2_4, z=v_z_4} OutVars{x2=v_x2_4, z=v_z_4} AuxVars[] AssignedVars[]" "[111] L15-->L63: Formula: (and (= v_thread5Thread1of1ForFork4_thidvar4_2 5) (= v_thread5Thread1of1ForFork4_thidvar1_2 5) (= v_thread5Thread1of1ForFork4_thidvar0_2 5) (= v_thread5Thread1of1ForFork4_thidvar3_2 5) (= v_thread5Thread1of1ForFork4_thidvar2_2 5)) InVars {} OutVars{thread5Thread1of1ForFork4_thidvar0=v_thread5Thread1of1ForFork4_thidvar0_2, thread5Thread1of1ForFork4_thidvar1=v_thread5Thread1of1ForFork4_thidvar1_2, thread5Thread1of1ForFork4_thidvar2=v_thread5Thread1of1ForFork4_thidvar2_2, thread5Thread1of1ForFork4_thidvar3=v_thread5Thread1of1ForFork4_thidvar3_2, thread5Thread1of1ForFork4_thidvar4=v_thread5Thread1of1ForFork4_thidvar4_2} AuxVars[] AssignedVars[thread5Thread1of1ForFork4_thidvar0, thread5Thread1of1ForFork4_thidvar1, thread5Thread1of1ForFork4_thidvar2, thread5Thread1of1ForFork4_thidvar3, thread5Thread1of1ForFork4_thidvar4]" "[85] L45-->thread3FINAL: Formula: (<= v_z_6 v_x3_4) InVars {x3=v_x3_4, z=v_z_6} OutVars{x3=v_x3_4, z=v_z_6} AuxVars[] AssignedVars[]" "[89] L54-->thread4FINAL: Formula: (<= v_z_8 v_x4_4) InVars {x4=v_x4_4, z=v_z_8} OutVars{x4=v_x4_4, z=v_z_8} AuxVars[] AssignedVars[]" [2025-04-26 18:42:49,965 INFO L754 eck$LassoCheckResult]: Loop: "[94] L63-->L65: Formula: (< v_x5_1 v_z_9) InVars {x5=v_x5_1, z=v_z_9} OutVars{x5=v_x5_1, z=v_z_9} AuxVars[] AssignedVars[]" "[96] L65-->L63: Formula: (= v_x5_2 (+ v_x5_3 1)) InVars {x5=v_x5_3} OutVars{x5=v_x5_2} AuxVars[] AssignedVars[x5]" [2025-04-26 18:42:49,965 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:49,965 INFO L85 PathProgramCache]: Analyzing trace with hash -804169004, now seen corresponding path program 1 times [2025-04-26 18:42:49,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:49,965 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804633866] [2025-04-26 18:42:49,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:49,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:49,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:42:49,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:42:49,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:49,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:49,970 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:49,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:42:49,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:42:49,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:49,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:49,976 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:49,976 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:49,976 INFO L85 PathProgramCache]: Analyzing trace with hash 3971, now seen corresponding path program 1 times [2025-04-26 18:42:49,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:49,977 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630366372] [2025-04-26 18:42:49,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:49,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:49,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:49,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:49,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:49,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:49,982 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:49,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:49,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:49,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:49,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:49,984 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:49,987 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:49,987 INFO L85 PathProgramCache]: Analyzing trace with hash 287703446, now seen corresponding path program 1 times [2025-04-26 18:42:49,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:49,987 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255619114] [2025-04-26 18:42:49,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:49,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:49,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:42:49,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:42:49,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:49,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:49,994 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:49,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:42:49,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:42:49,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:49,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:50,001 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:50,015 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:50,015 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:50,015 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:50,015 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:50,015 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:50,015 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:50,015 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:50,015 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:50,015 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_5.c.bpl_petrified1_Iteration5_Loop [2025-04-26 18:42:50,015 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:50,015 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:50,016 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:50,029 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:50,029 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:50,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:50,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:50,031 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:50,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 18:42:50,034 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:50,034 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:50,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-04-26 18:42:50,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:50,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:50,052 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:50,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 18:42:50,054 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:50,055 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:50,116 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:50,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:50,120 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:50,121 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:50,121 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:50,121 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:50,121 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:50,121 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:50,121 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:50,121 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:50,121 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_5.c.bpl_petrified1_Iteration5_Loop [2025-04-26 18:42:50,121 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:50,121 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:50,122 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:50,139 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:50,139 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:50,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:50,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:50,141 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:50,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 18:42:50,144 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 [2025-04-26 18:42:50,154 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:50,154 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:50,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:50,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:50,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:50,156 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:50,156 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:50,157 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:50,160 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:42:50,160 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:42:50,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:50,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:50,167 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:50,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 18:42:50,168 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:50,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-04-26 18:42:50,171 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:50,171 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:50,172 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x5) = 1*z - 1*x5 Supporting invariants [] [2025-04-26 18:42:50,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:50,178 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:50,191 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:50,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:42:50,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:42:50,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:50,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:50,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:50,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:50,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:50,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:50,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:50,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:50,215 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:50,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:50,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:42:50,230 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 [2025-04-26 18:42:50,230 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 4001 states and 11677 transitions. cyclomatic complexity: 8085 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:50,379 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 4001 states and 11677 transitions. cyclomatic complexity: 8085. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 7538 states and 21226 transitions. Complement of second has 6 states. [2025-04-26 18:42:50,380 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:42:50,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:50,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2025-04-26 18:42:50,382 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 18:42:50,382 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:50,382 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 13 letters. Loop has 2 letters. [2025-04-26 18:42:50,382 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:50,382 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 11 letters. Loop has 4 letters. [2025-04-26 18:42:50,382 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:50,382 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7538 states and 21226 transitions. [2025-04-26 18:42:50,423 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:42:50,423 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7538 states to 0 states and 0 transitions. [2025-04-26 18:42:50,423 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:42:50,423 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:42:50,423 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:42:50,423 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:42:50,423 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:50,423 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:50,423 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:50,423 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 18:42:50,424 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:42:50,424 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:42:50,424 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:42:50,435 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 18:42:50,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 18:42:50,436 INFO L201 PluginConnector]: Adding new model indep_loops_5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:42:50 BoogieIcfgContainer [2025-04-26 18:42:50,436 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:42:50,437 INFO L158 Benchmark]: Toolchain (without parser) took 4346.89ms. Allocated memory was 155.2MB in the beginning and 289.4MB in the end (delta: 134.2MB). Free memory was 82.7MB in the beginning and 132.5MB in the end (delta: -49.9MB). Peak memory consumption was 89.6MB. Max. memory is 8.0GB. [2025-04-26 18:42:50,437 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.15ms. Allocated memory is still 155.2MB. Free memory is still 83.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:50,437 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.94ms. Allocated memory is still 155.2MB. Free memory was 82.7MB in the beginning and 80.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:50,437 INFO L158 Benchmark]: Boogie Preprocessor took 27.52ms. Allocated memory is still 155.2MB. Free memory was 80.7MB in the beginning and 79.7MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:42:50,438 INFO L158 Benchmark]: RCFGBuilder took 179.46ms. Allocated memory is still 155.2MB. Free memory was 79.7MB in the beginning and 70.4MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:42:50,438 INFO L158 Benchmark]: BuchiAutomizer took 4107.09ms. Allocated memory was 155.2MB in the beginning and 289.4MB in the end (delta: 134.2MB). Free memory was 70.3MB in the beginning and 132.5MB in the end (delta: -62.2MB). Peak memory consumption was 77.1MB. Max. memory is 8.0GB. [2025-04-26 18:42:50,439 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.15ms. Allocated memory is still 155.2MB. Free memory is still 83.6MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.94ms. Allocated memory is still 155.2MB. Free memory was 82.7MB in the beginning and 80.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 27.52ms. Allocated memory is still 155.2MB. Free memory was 80.7MB in the beginning and 79.7MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 179.46ms. Allocated memory is still 155.2MB. Free memory was 79.7MB in the beginning and 70.4MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 4107.09ms. Allocated memory was 155.2MB in the beginning and 289.4MB in the end (delta: 134.2MB). Free memory was 70.3MB in the beginning and 132.5MB in the end (delta: -62.2MB). Peak memory consumption was 77.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.9s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 1.3s. Construction of modules took 0.2s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.4s AutomataMinimizationTime, 4 MinimizatonAttempts, 1248 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.5s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 280 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 275 mSDsluCounter, 251 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 123 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 365 IncrementalHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 128 mSDtfsCounter, 365 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT5 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 42ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s InitialAbstractionConstructionTime: 0.5s InitialAbstraction: Time to compute Ample Reduction [ms]: 499, Number of transitions in reduction automaton: 5336, Number of states in reduction automaton: 1707, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (0 trivial, 5 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x1 + z and consists of 4 locations. One deterministic module has affine ranking function z + -1 * x2 and consists of 4 locations. One deterministic module has affine ranking function -1 * x3 + z and consists of 4 locations. One deterministic module has affine ranking function -1 * x4 + z and consists of 4 locations. One deterministic module has affine ranking function -1 * x5 + z and consists of 4 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:42:50,454 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...