/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_minus1_5.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:58:17,045 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:58:17,098 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:58:17,102 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:58:17,102 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:58:17,102 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:58:17,102 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:58:17,123 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:58:17,124 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:58:17,124 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:58:17,125 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:58:17,125 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:58:17,125 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:58:17,125 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:58:17,126 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:58:17,126 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:58:17,126 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:58:17,126 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:58:17,126 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:58:17,126 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:58:17,126 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:58:17,126 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:58:17,126 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:58:17,126 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:58:17,126 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:58:17,126 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:58:17,126 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:58:17,126 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:58:17,126 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:58:17,126 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:58:17,126 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:58:17,127 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:58:17,127 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:58:17,127 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:58:17,127 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:58:17,127 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:58:17,127 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:58:17,127 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:58:17,127 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:58:17,127 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:58:17,127 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:58:17,127 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:58:17,127 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:58:17,384 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:58:17,391 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:58:17,392 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:58:17,393 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:58:17,394 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:58:17,396 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/4_plus_thr/indep_loops_minus1_5.c.bpl [2025-04-26 16:58:17,397 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/4_plus_thr/indep_loops_minus1_5.c.bpl' [2025-04-26 16:58:17,414 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:58:17,415 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:58:17,415 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:58:17,415 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:58:17,415 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:58:17,423 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "indep_loops_minus1_5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:17" (1/1) ... [2025-04-26 16:58:17,443 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "indep_loops_minus1_5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:17" (1/1) ... [2025-04-26 16:58:17,448 INFO L138 Inliner]: procedures = 6, calls = 5, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:58:17,449 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:58:17,450 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:58:17,450 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:58:17,450 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:58:17,455 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "indep_loops_minus1_5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:17" (1/1) ... [2025-04-26 16:58:17,455 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "indep_loops_minus1_5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:17" (1/1) ... [2025-04-26 16:58:17,456 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "indep_loops_minus1_5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:17" (1/1) ... [2025-04-26 16:58:17,456 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "indep_loops_minus1_5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:17" (1/1) ... [2025-04-26 16:58:17,457 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "indep_loops_minus1_5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:17" (1/1) ... [2025-04-26 16:58:17,457 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "indep_loops_minus1_5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:17" (1/1) ... [2025-04-26 16:58:17,460 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "indep_loops_minus1_5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:17" (1/1) ... [2025-04-26 16:58:17,460 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "indep_loops_minus1_5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:17" (1/1) ... [2025-04-26 16:58:17,460 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "indep_loops_minus1_5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:17" (1/1) ... [2025-04-26 16:58:17,466 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:58:17,469 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:58:17,470 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:58:17,470 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:58:17,471 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "indep_loops_minus1_5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:17" (1/1) ... [2025-04-26 16:58:17,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:58:17,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:17,494 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 16:58:17,496 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 16:58:17,515 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:58:17,515 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:58:17,515 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:58:17,515 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:58:17,516 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:58:17,516 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:58:17,516 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:58:17,516 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:58:17,516 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:58:17,516 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:58:17,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:58:17,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:58:17,516 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 16:58:17,516 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 16:58:17,516 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 16:58:17,516 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2025-04-26 16:58:17,516 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-04-26 16:58:17,516 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-04-26 16:58:17,517 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 16:58:17,554 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:58:17,556 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:58:17,631 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:58:17,631 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:58:17,640 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:58:17,640 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:58:17,641 INFO L201 PluginConnector]: Adding new model indep_loops_minus1_5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:58:17 BoogieIcfgContainer [2025-04-26 16:58:17,641 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:58:17,641 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:58:17,642 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:58:17,647 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:58:17,651 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:58:17,651 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "indep_loops_minus1_5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:17" (1/2) ... [2025-04-26 16:58:17,652 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@602fa8f and model type indep_loops_minus1_5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:58:17, skipping insertion in model container [2025-04-26 16:58:17,653 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:58:17,653 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "indep_loops_minus1_5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:58:17" (2/2) ... [2025-04-26 16:58:17,654 INFO L376 chiAutomizerObserver]: Analyzing ICFG indep_loops_minus1_5.c.bpl [2025-04-26 16:58:17,706 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2025-04-26 16:58:17,736 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:58:17,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:58:17,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:17,739 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 16:58:17,742 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 16:58:17,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 42 transitions, 119 flow [2025-04-26 16:58:17,819 INFO L116 PetriNetUnfolderBase]: 5/32 cut-off events. [2025-04-26 16:58:17,821 INFO L117 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-04-26 16:58:17,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 32 events. 5/32 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 63 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2025-04-26 16:58:17,824 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 42 transitions, 119 flow [2025-04-26 16:58:17,826 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 32 transitions, 94 flow [2025-04-26 16:58:17,826 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 43 places, 32 transitions, 94 flow [2025-04-26 16:58:17,831 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:58:18,319 WARN L140 AmpleReduction]: Number of pruned transitions: 3824 [2025-04-26 16:58:18,319 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:58:18,319 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 939 [2025-04-26 16:58:18,319 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:28 [2025-04-26 16:58:18,320 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:1127 [2025-04-26 16:58:18,320 WARN L145 AmpleReduction]: Times succ was already a loop node:1721 [2025-04-26 16:58:18,321 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:331 [2025-04-26 16:58:18,321 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:58:18,331 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 2095 states, 2094 states have (on average 3.0659025787965617) internal successors, (in total 6420), 2094 states have internal predecessors, (6420), 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 16:58:18,337 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:58:18,337 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:58:18,337 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:58:18,338 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:58:18,338 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:58:18,338 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:58:18,338 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:58:18,338 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:58:18,344 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 2095 states, 2094 states have (on average 3.0659025787965617) internal successors, (in total 6420), 2094 states have internal predecessors, (6420), 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 16:58:18,413 INFO L131 ngComponentsAnalysis]: Automaton has 377 accepting balls. 1931 [2025-04-26 16:58:18,413 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:18,414 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:18,416 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-04-26 16:58:18,417 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:58:18,417 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:58:18,421 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 2095 states, 2094 states have (on average 3.0659025787965617) internal successors, (in total 6420), 2094 states have internal predecessors, (6420), 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 16:58:18,450 INFO L131 ngComponentsAnalysis]: Automaton has 377 accepting balls. 1931 [2025-04-26 16:58:18,450 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:18,450 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:18,451 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-04-26 16:58:18,451 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:58:18,455 INFO L752 eck$LassoCheckResult]: Stem: "[102] $Ultimate##0-->L27: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:58:18,455 INFO L754 eck$LassoCheckResult]: Loop: "[80] 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[]" "[82] 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 16:58:18,460 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:18,461 INFO L85 PathProgramCache]: Analyzing trace with hash 133, now seen corresponding path program 1 times [2025-04-26 16:58:18,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:18,466 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464477187] [2025-04-26 16:58:18,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:18,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:18,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:58:18,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:58:18,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:18,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:18,512 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:18,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:58:18,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:58:18,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:18,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:18,526 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:18,529 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:18,529 INFO L85 PathProgramCache]: Analyzing trace with hash 3523, now seen corresponding path program 1 times [2025-04-26 16:58:18,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:18,529 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017949868] [2025-04-26 16:58:18,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:18,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:18,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:18,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:18,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:18,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:18,539 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:18,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:18,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:18,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:18,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:18,545 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:18,546 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:18,546 INFO L85 PathProgramCache]: Analyzing trace with hash 130375, now seen corresponding path program 1 times [2025-04-26 16:58:18,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:18,546 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189580253] [2025-04-26 16:58:18,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:18,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:18,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:58:18,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:58:18,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:18,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:18,550 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:18,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:58:18,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:58:18,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:18,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:18,553 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:18,612 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:18,614 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:18,614 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:18,614 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:18,614 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:58:18,614 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:18,614 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:18,614 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:18,615 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_5.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:58:18,615 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:18,615 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:18,624 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:18,682 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:18,683 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:58:18,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:18,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:18,686 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 16:58:18,688 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 16:58:18,689 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:18,689 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:18,706 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 16:58:18,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:18,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:18,708 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 16:58:18,709 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 16:58:18,710 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:18,710 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:18,777 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:58:18,781 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 16:58:18,782 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:18,782 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:18,782 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:18,782 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:18,782 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:58:18,782 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:18,782 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:18,782 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:18,782 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_5.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:58:18,782 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:18,782 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:18,783 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:18,803 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:18,806 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:58:18,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:18,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:18,809 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 16:58:18,811 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 16:58:18,813 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 16:58:18,824 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:18,824 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:18,825 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:18,825 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:18,825 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:18,830 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:18,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:18,836 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:58:18,840 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:58:18,840 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:58:18,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:18,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:18,845 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 16:58:18,846 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 16:58:18,846 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:58:18,849 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:58:18,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 16:58:18,850 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:58:18,850 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:58:18,850 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, z) = -1*x1 + 1*z Supporting invariants [] [2025-04-26 16:58:18,855 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 16:58:18,857 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:58:18,883 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:18,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:58:18,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:58:18,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:18,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:18,893 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:58:18,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:18,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:18,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:18,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:18,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:18,907 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:58:18,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:18,927 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 16:58:18,949 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 16:58:18,954 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 2095 states, 2094 states have (on average 3.0659025787965617) internal successors, (in total 6420), 2094 states have internal predecessors, (6420), 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 16:58:19,142 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 2095 states, 2094 states have (on average 3.0659025787965617) internal successors, (in total 6420), 2094 states have internal predecessors, (6420), 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 5507 states and 17702 transitions. Complement of second has 6 states. [2025-04-26 16:58:19,144 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 16:58:19,146 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 16:58:19,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2025-04-26 16:58:19,154 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 75 transitions. Stem has 1 letters. Loop has 2 letters. [2025-04-26 16:58:19,154 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:19,154 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 75 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 16:58:19,154 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:19,156 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 75 transitions. Stem has 1 letters. Loop has 4 letters. [2025-04-26 16:58:19,156 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:19,157 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5507 states and 17702 transitions. [2025-04-26 16:58:19,215 INFO L131 ngComponentsAnalysis]: Automaton has 288 accepting balls. 1153 [2025-04-26 16:58:19,284 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5507 states to 3410 states and 10708 transitions. [2025-04-26 16:58:19,285 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1503 [2025-04-26 16:58:19,291 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2286 [2025-04-26 16:58:19,292 INFO L74 IsDeterministic]: Start isDeterministic. Operand 3410 states and 10708 transitions. [2025-04-26 16:58:19,292 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:58:19,292 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3410 states and 10708 transitions. [2025-04-26 16:58:19,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3410 states and 10708 transitions. [2025-04-26 16:58:19,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3410 to 2692. [2025-04-26 16:58:19,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2692 states, 2692 states have (on average 3.2429420505200595) internal successors, (in total 8730), 2691 states have internal predecessors, (8730), 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 16:58:19,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2692 states to 2692 states and 8730 transitions. [2025-04-26 16:58:19,423 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2692 states and 8730 transitions. [2025-04-26 16:58:19,424 INFO L438 stractBuchiCegarLoop]: Abstraction has 2692 states and 8730 transitions. [2025-04-26 16:58:19,424 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:58:19,424 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2692 states and 8730 transitions. [2025-04-26 16:58:19,438 INFO L131 ngComponentsAnalysis]: Automaton has 288 accepting balls. 1153 [2025-04-26 16:58:19,438 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:19,438 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:19,439 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:58:19,439 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:58:19,439 INFO L752 eck$LassoCheckResult]: Stem: "[102] $Ultimate##0-->L27: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[79] 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[]" "[81] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[105] 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 16:58:19,439 INFO L754 eck$LassoCheckResult]: Loop: "[84] 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[]" "[86] 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 16:58:19,440 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:19,440 INFO L85 PathProgramCache]: Analyzing trace with hash 4040738, now seen corresponding path program 1 times [2025-04-26 16:58:19,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:19,440 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969277566] [2025-04-26 16:58:19,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:19,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:19,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:58:19,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:58:19,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:19,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:19,446 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:19,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:58:19,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:58:19,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:19,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:19,448 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:19,450 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:19,450 INFO L85 PathProgramCache]: Analyzing trace with hash 3651, now seen corresponding path program 1 times [2025-04-26 16:58:19,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:19,450 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007158943] [2025-04-26 16:58:19,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:19,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:19,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:19,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:19,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:19,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:19,454 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:19,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:19,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:19,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:19,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:19,457 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:19,457 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:19,457 INFO L85 PathProgramCache]: Analyzing trace with hash -411815388, now seen corresponding path program 1 times [2025-04-26 16:58:19,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:19,457 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752505869] [2025-04-26 16:58:19,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:19,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:19,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:58:19,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:58:19,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:19,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:19,464 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:19,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:58:19,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:58:19,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:19,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:19,470 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:19,489 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:19,490 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:19,490 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:19,490 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:19,490 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:58:19,490 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:19,490 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:19,490 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:19,490 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_5.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:58:19,490 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:19,490 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:19,490 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:19,509 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:19,509 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:58:19,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:19,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:19,512 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 16:58:19,513 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 16:58:19,514 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:19,514 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:19,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:19,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:19,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:19,533 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 16:58:19,534 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 16:58:19,535 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:19,536 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:19,598 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:58:19,602 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 16:58:19,603 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:19,603 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:19,603 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:19,603 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:19,603 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:58:19,603 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:19,603 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:19,603 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:19,603 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_5.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:58:19,603 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:19,603 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:19,607 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:19,627 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:19,627 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:58:19,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:19,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:19,629 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 16:58:19,631 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 16:58:19,633 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 16:58:19,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:19,642 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:19,643 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:19,643 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:19,643 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:19,643 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:19,643 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:19,645 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:58:19,648 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:58:19,648 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:58:19,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:19,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:19,650 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 16:58:19,651 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 16:58:19,651 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:58:19,654 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 16:58:19,654 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:58:19,654 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:58:19,654 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x2) = 1*z - 1*x2 Supporting invariants [] [2025-04-26 16:58:19,659 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 16:58:19,660 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:58:19,672 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:19,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:58:19,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:58:19,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:19,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:19,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:58:19,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:19,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:19,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:19,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:19,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:19,687 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:58:19,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:19,700 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 16:58:19,701 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 16:58:19,701 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2692 states and 8730 transitions. cyclomatic complexity: 6431 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 16:58:19,872 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2692 states and 8730 transitions. cyclomatic complexity: 6431. 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 7393 states and 23645 transitions. Complement of second has 6 states. [2025-04-26 16:58:19,872 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 16:58:19,873 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 16:58:19,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2025-04-26 16:58:19,873 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 77 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:58:19,873 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:19,873 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 77 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:58:19,873 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:19,873 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 77 transitions. Stem has 4 letters. Loop has 4 letters. [2025-04-26 16:58:19,873 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:19,873 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7393 states and 23645 transitions. [2025-04-26 16:58:19,961 INFO L131 ngComponentsAnalysis]: Automaton has 205 accepting balls. 621 [2025-04-26 16:58:20,001 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7393 states to 4723 states and 14830 transitions. [2025-04-26 16:58:20,002 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1633 [2025-04-26 16:58:20,008 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2216 [2025-04-26 16:58:20,008 INFO L74 IsDeterministic]: Start isDeterministic. Operand 4723 states and 14830 transitions. [2025-04-26 16:58:20,008 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:58:20,008 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4723 states and 14830 transitions. [2025-04-26 16:58:20,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4723 states and 14830 transitions. [2025-04-26 16:58:20,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4723 to 4137. [2025-04-26 16:58:20,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4137 states, 4137 states have (on average 3.2168237853517043) internal successors, (in total 13308), 4136 states have internal predecessors, (13308), 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 16:58:20,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4137 states to 4137 states and 13308 transitions. [2025-04-26 16:58:20,248 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4137 states and 13308 transitions. [2025-04-26 16:58:20,248 INFO L438 stractBuchiCegarLoop]: Abstraction has 4137 states and 13308 transitions. [2025-04-26 16:58:20,248 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:58:20,248 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4137 states and 13308 transitions. [2025-04-26 16:58:20,269 INFO L131 ngComponentsAnalysis]: Automaton has 205 accepting balls. 621 [2025-04-26 16:58:20,269 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:20,269 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:20,270 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:58:20,270 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:58:20,270 INFO L752 eck$LassoCheckResult]: Stem: "[102] $Ultimate##0-->L27: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[80] 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[]" "[105] 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]" "[82] L29-->L27: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[108] 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]" "[79] 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[]" "[83] 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[]" [2025-04-26 16:58:20,271 INFO L754 eck$LassoCheckResult]: Loop: "[88] 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[]" "[90] 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 16:58:20,271 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:20,271 INFO L85 PathProgramCache]: Analyzing trace with hash 168756252, now seen corresponding path program 1 times [2025-04-26 16:58:20,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:20,271 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86011641] [2025-04-26 16:58:20,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:20,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:20,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:58:20,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:58:20,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:20,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:20,276 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:20,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:58:20,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:58:20,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:20,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:20,280 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:20,280 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:20,280 INFO L85 PathProgramCache]: Analyzing trace with hash 3779, now seen corresponding path program 1 times [2025-04-26 16:58:20,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:20,280 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530658303] [2025-04-26 16:58:20,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:20,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:20,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:20,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:20,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:20,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:20,283 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:20,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:20,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:20,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:20,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:20,285 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:20,285 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:20,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1033996258, now seen corresponding path program 1 times [2025-04-26 16:58:20,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:20,285 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3250765] [2025-04-26 16:58:20,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:20,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:20,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:58:20,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:58:20,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:20,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:20,290 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:20,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:58:20,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:58:20,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:20,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:20,294 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:20,311 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:20,311 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:20,311 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:20,311 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:20,311 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:58:20,311 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:20,311 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:20,311 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:20,311 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_5.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:58:20,311 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:20,311 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:20,312 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:20,329 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:20,329 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:58:20,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:20,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:20,331 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 16:58:20,333 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 16:58:20,335 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:20,335 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:20,351 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 16:58:20,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:20,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:20,355 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 16:58:20,356 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 16:58:20,359 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:20,359 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:20,427 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:58:20,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 16:58:20,432 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:20,432 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:20,432 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:20,432 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:20,432 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:58:20,432 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:20,432 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:20,432 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:20,432 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_5.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:58:20,432 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:20,432 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:20,433 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:20,450 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:20,450 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:58:20,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:20,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:20,452 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 16:58:20,454 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 16:58:20,455 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 16:58:20,466 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:20,466 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:20,466 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:20,466 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:20,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:20,467 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:20,467 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:20,469 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:58:20,472 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:58:20,472 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:58:20,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:20,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:20,474 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 16:58:20,475 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 16:58:20,476 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:58:20,479 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 16:58:20,480 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:58:20,480 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:58:20,480 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x3) = 1*z - 1*x3 Supporting invariants [] [2025-04-26 16:58:20,486 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 16:58:20,487 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:58:20,498 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:20,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:58:20,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:58:20,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:20,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:20,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:58:20,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:20,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:20,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:20,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:20,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:20,519 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:58:20,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:20,532 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 16:58:20,533 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 16:58:20,533 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 4137 states and 13308 transitions. cyclomatic complexity: 9606 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 16:58:20,675 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 4137 states and 13308 transitions. cyclomatic complexity: 9606. 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 7877 states and 24412 transitions. Complement of second has 6 states. [2025-04-26 16:58:20,675 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 16:58:20,676 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 16:58:20,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2025-04-26 16:58:20,677 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 92 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 16:58:20,677 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:20,677 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 92 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 16:58:20,677 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:20,677 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 92 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 16:58:20,677 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:20,677 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7877 states and 24412 transitions. [2025-04-26 16:58:20,752 INFO L131 ngComponentsAnalysis]: Automaton has 151 accepting balls. 343 [2025-04-26 16:58:20,845 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7877 states to 6079 states and 18608 transitions. [2025-04-26 16:58:20,846 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2089 [2025-04-26 16:58:20,854 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2568 [2025-04-26 16:58:20,854 INFO L74 IsDeterministic]: Start isDeterministic. Operand 6079 states and 18608 transitions. [2025-04-26 16:58:20,854 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:58:20,854 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6079 states and 18608 transitions. [2025-04-26 16:58:20,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6079 states and 18608 transitions. [2025-04-26 16:58:20,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6079 to 5413. [2025-04-26 16:58:20,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5413 states, 5413 states have (on average 3.192869019028265) internal successors, (in total 17283), 5412 states have internal predecessors, (17283), 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 16:58:20,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5413 states to 5413 states and 17283 transitions. [2025-04-26 16:58:20,972 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5413 states and 17283 transitions. [2025-04-26 16:58:20,972 INFO L438 stractBuchiCegarLoop]: Abstraction has 5413 states and 17283 transitions. [2025-04-26 16:58:20,972 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:58:20,972 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5413 states and 17283 transitions. [2025-04-26 16:58:20,996 INFO L131 ngComponentsAnalysis]: Automaton has 149 accepting balls. 339 [2025-04-26 16:58:20,996 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:20,996 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:20,996 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2025-04-26 16:58:20,996 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:58:20,997 INFO L752 eck$LassoCheckResult]: Stem: "[102] $Ultimate##0-->L27: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[80] 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[]" "[105] 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]" "[82] L29-->L27: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[108] 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]" "[80] 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[]" "[111] 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]" "[82] L29-->L27: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[114] L15-->L64: 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]" [2025-04-26 16:58:20,997 INFO L754 eck$LassoCheckResult]: Loop: "[97] L64-->L66: Formula: (< v_x5_3 v_z_9) InVars {x5=v_x5_3, z=v_z_9} OutVars{x5=v_x5_3, z=v_z_9} AuxVars[] AssignedVars[]" "[99] L66-->L64: Formula: (= (+ v_x5_5 1) v_x5_4) InVars {x5=v_x5_5} OutVars{x5=v_x5_4} AuxVars[] AssignedVars[x5]" [2025-04-26 16:58:20,997 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:20,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1033939721, now seen corresponding path program 1 times [2025-04-26 16:58:20,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:20,997 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065246839] [2025-04-26 16:58:20,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:20,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:20,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:58:21,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:58:21,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:21,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:21,003 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:21,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:58:21,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:58:21,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:21,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:21,012 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:21,012 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:21,012 INFO L85 PathProgramCache]: Analyzing trace with hash 4067, now seen corresponding path program 1 times [2025-04-26 16:58:21,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:21,013 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667272914] [2025-04-26 16:58:21,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:21,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:21,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:21,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:21,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:21,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:21,015 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:21,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:21,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:21,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:21,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:21,017 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:21,018 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:21,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1478623399, now seen corresponding path program 1 times [2025-04-26 16:58:21,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:21,018 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36611191] [2025-04-26 16:58:21,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:21,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:21,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:58:21,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:58:21,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:21,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:21,023 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:21,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:58:21,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:58:21,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:21,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:21,035 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:21,058 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:21,058 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:21,058 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:21,058 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:21,058 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:58:21,059 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:21,059 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:21,059 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:21,059 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_5.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:58:21,059 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:21,059 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:21,059 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:21,077 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:21,078 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:58:21,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:21,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:21,080 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 16:58:21,082 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 16:58:21,083 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:21,084 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:21,102 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 16:58:21,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:21,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:21,104 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 16:58:21,105 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 16:58:21,107 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:21,107 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:21,173 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:58:21,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:21,178 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:21,178 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:21,178 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:21,178 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:21,178 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:58:21,179 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:21,179 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:21,179 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:21,179 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_5.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:58:21,179 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:21,179 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:21,179 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:21,195 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:21,195 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:58:21,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:21,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:21,197 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 16:58:21,243 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 16:58:21,243 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 16:58:21,254 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:21,254 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:21,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:21,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:21,254 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:21,255 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:21,255 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:21,257 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:58:21,260 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:58:21,260 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:58:21,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:21,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:21,262 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 16:58:21,263 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 16:58:21,264 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:58:21,267 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 16:58:21,268 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:58:21,268 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:58:21,268 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x5) = 1*z - 1*x5 Supporting invariants [] [2025-04-26 16:58:21,273 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 16:58:21,274 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:58:21,285 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:21,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:58:21,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:58:21,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:21,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:21,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:58:21,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:21,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:21,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:21,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:21,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:21,308 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:58:21,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:21,318 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 16:58:21,319 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 16:58:21,319 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 5413 states and 17283 transitions. cyclomatic complexity: 12347 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 16:58:21,464 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 5413 states and 17283 transitions. cyclomatic complexity: 12347. 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 16346 states and 53664 transitions. Complement of second has 6 states. [2025-04-26 16:58:21,464 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 16:58:21,465 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 16:58:21,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2025-04-26 16:58:21,465 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 92 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 16:58:21,465 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:21,465 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 92 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 16:58:21,465 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:21,465 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 92 transitions. Stem has 9 letters. Loop has 4 letters. [2025-04-26 16:58:21,465 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:21,465 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16346 states and 53664 transitions. [2025-04-26 16:58:21,623 INFO L131 ngComponentsAnalysis]: Automaton has 39 accepting balls. 117 [2025-04-26 16:58:21,680 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16346 states to 7993 states and 26199 transitions. [2025-04-26 16:58:21,680 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2115 [2025-04-26 16:58:21,685 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2315 [2025-04-26 16:58:21,685 INFO L74 IsDeterministic]: Start isDeterministic. Operand 7993 states and 26199 transitions. [2025-04-26 16:58:21,685 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:58:21,685 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7993 states and 26199 transitions. [2025-04-26 16:58:21,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7993 states and 26199 transitions. [2025-04-26 16:58:21,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7993 to 7475. [2025-04-26 16:58:21,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7475 states, 7475 states have (on average 3.297926421404682) internal successors, (in total 24652), 7474 states have internal predecessors, (24652), 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 16:58:22,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7475 states to 7475 states and 24652 transitions. [2025-04-26 16:58:22,041 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7475 states and 24652 transitions. [2025-04-26 16:58:22,041 INFO L438 stractBuchiCegarLoop]: Abstraction has 7475 states and 24652 transitions. [2025-04-26 16:58:22,041 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:58:22,041 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7475 states and 24652 transitions. [2025-04-26 16:58:22,080 INFO L131 ngComponentsAnalysis]: Automaton has 39 accepting balls. 117 [2025-04-26 16:58:22,081 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:22,081 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:22,081 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:58:22,081 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:58:22,082 INFO L752 eck$LassoCheckResult]: Stem: "[102] $Ultimate##0-->L27: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[80] 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[]" "[105] 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]" "[82] L29-->L27: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[108] 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]" "[79] 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[]" "[111] 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]" "[83] 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[]" "[87] 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 16:58:22,082 INFO L754 eck$LassoCheckResult]: Loop: "[92] 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[]" "[94] L56-->L57: Formula: (= (+ v_x4_3 1) v_x4_2) InVars {x4=v_x4_3} OutVars{x4=v_x4_2} AuxVars[] AssignedVars[x4]" "[95] L57-->L54: Formula: (= v_x5_1 (+ v_x5_2 1)) InVars {x5=v_x5_2} OutVars{x5=v_x5_1} AuxVars[] AssignedVars[x5]" [2025-04-26 16:58:22,082 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:22,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1033969508, now seen corresponding path program 1 times [2025-04-26 16:58:22,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:22,083 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226655827] [2025-04-26 16:58:22,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:22,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:22,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:58:22,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:58:22,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:22,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:22,088 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:22,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:58:22,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:58:22,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:22,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:22,092 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:22,093 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:22,093 INFO L85 PathProgramCache]: Analyzing trace with hash 121212, now seen corresponding path program 1 times [2025-04-26 16:58:22,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:22,093 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014463634] [2025-04-26 16:58:22,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:22,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:22,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:58:22,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:58:22,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:22,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:22,095 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:22,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:58:22,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:58:22,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:22,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:22,098 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:22,098 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:22,098 INFO L85 PathProgramCache]: Analyzing trace with hash 519925505, now seen corresponding path program 1 times [2025-04-26 16:58:22,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:22,098 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714346612] [2025-04-26 16:58:22,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:22,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:22,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:58:22,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:58:22,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:22,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:22,102 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:22,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:58:22,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:58:22,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:22,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:22,106 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:22,124 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:22,124 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:22,124 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:22,124 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:22,124 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:58:22,124 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:22,124 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:22,124 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:22,124 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_5.c.bpl_petrified1_Iteration5_Loop [2025-04-26 16:58:22,124 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:22,124 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:22,125 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:22,129 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:22,156 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:22,156 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:58:22,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:22,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:22,159 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 16:58:22,160 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 16:58:22,161 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:22,161 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:22,178 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 16:58:22,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:22,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:22,180 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 16:58:22,180 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 16:58:22,182 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:22,182 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:22,246 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:58:22,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-04-26 16:58:22,250 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:22,251 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:22,251 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:22,251 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:22,251 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:58:22,251 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:22,251 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:22,251 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:22,251 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_5.c.bpl_petrified1_Iteration5_Loop [2025-04-26 16:58:22,251 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:22,251 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:22,252 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:22,259 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:22,279 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:22,279 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:58:22,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:22,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:22,282 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 16:58:22,283 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 16:58:22,284 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 16:58:22,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:22,295 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:22,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:22,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:22,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:22,296 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:22,297 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:22,300 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:58:22,302 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:58:22,302 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:58:22,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:22,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:22,304 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 16:58:22,305 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 16:58:22,306 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:58:22,308 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 16:58:22,309 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:58:22,309 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:58:22,309 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x4) = 1*z - 1*x4 Supporting invariants [] [2025-04-26 16:58:22,314 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 16:58:22,314 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:58:22,331 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:22,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:58:22,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:58:22,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:22,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:22,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:58:22,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:22,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:58:22,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:58:22,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:22,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:22,352 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:58:22,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:22,403 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 16:58:22,404 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:58:22,404 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7475 states and 24652 transitions. cyclomatic complexity: 17544 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (in total 12), 4 states have internal predecessors, (12), 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 16:58:22,564 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7475 states and 24652 transitions. cyclomatic complexity: 17544. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (in total 12), 4 states have internal predecessors, (12), 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 14217 states and 43779 transitions. Complement of second has 6 states. [2025-04-26 16:58:22,565 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 16:58:22,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (in total 12), 4 states have internal predecessors, (12), 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 16:58:22,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2025-04-26 16:58:22,565 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 83 transitions. Stem has 9 letters. Loop has 3 letters. [2025-04-26 16:58:22,566 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:22,566 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 83 transitions. Stem has 12 letters. Loop has 3 letters. [2025-04-26 16:58:22,566 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:22,566 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 83 transitions. Stem has 9 letters. Loop has 6 letters. [2025-04-26 16:58:22,566 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:22,566 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14217 states and 43779 transitions. [2025-04-26 16:58:22,725 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:58:22,725 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14217 states to 0 states and 0 transitions. [2025-04-26 16:58:22,725 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:58:22,725 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:58:22,725 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:58:22,725 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:58:22,726 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:58:22,726 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:58:22,726 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:58:22,726 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:58:22,726 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:58:22,726 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:58:22,726 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:58:22,736 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 16:58:22,736 INFO L201 PluginConnector]: Adding new model indep_loops_minus1_5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:58:22 BoogieIcfgContainer [2025-04-26 16:58:22,736 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:58:22,737 INFO L158 Benchmark]: Toolchain (without parser) took 5322.46ms. Allocated memory was 159.4MB in the beginning and 595.6MB in the end (delta: 436.2MB). Free memory was 85.8MB in the beginning and 349.7MB in the end (delta: -264.0MB). Peak memory consumption was 175.0MB. Max. memory is 8.0GB. [2025-04-26 16:58:22,738 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.81ms. Allocated memory is still 159.4MB. Free memory is still 86.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:58:22,739 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.25ms. Allocated memory is still 159.4MB. Free memory was 85.8MB in the beginning and 83.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:58:22,739 INFO L158 Benchmark]: Boogie Preprocessor took 16.12ms. Allocated memory is still 159.4MB. Free memory was 83.8MB in the beginning and 82.8MB in the end (delta: 961.2kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:58:22,739 INFO L158 Benchmark]: RCFGBuilder took 171.39ms. Allocated memory is still 159.4MB. Free memory was 82.7MB in the beginning and 73.5MB in the end (delta: 9.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 16:58:22,739 INFO L158 Benchmark]: BuchiAutomizer took 5095.05ms. Allocated memory was 159.4MB in the beginning and 595.6MB in the end (delta: 436.2MB). Free memory was 73.4MB in the beginning and 349.7MB in the end (delta: -276.3MB). Peak memory consumption was 162.4MB. Max. memory is 8.0GB. [2025-04-26 16:58:22,740 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.81ms. Allocated memory is still 159.4MB. Free memory is still 86.6MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.25ms. Allocated memory is still 159.4MB. Free memory was 85.8MB in the beginning and 83.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 16.12ms. Allocated memory is still 159.4MB. Free memory was 83.8MB in the beginning and 82.8MB in the end (delta: 961.2kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 171.39ms. Allocated memory is still 159.4MB. Free memory was 82.7MB in the beginning and 73.5MB in the end (delta: 9.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 5095.05ms. Allocated memory was 159.4MB in the beginning and 595.6MB in the end (delta: 436.2MB). Free memory was 73.4MB in the beginning and 349.7MB in the end (delta: -276.3MB). Peak memory consumption was 162.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.9s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 1.3s. Construction of modules took 0.2s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.8s AutomataMinimizationTime, 4 MinimizatonAttempts, 2488 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.7s 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, 297 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 292 mSDsluCounter, 280 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 134 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 360 IncrementalHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 146 mSDtfsCounter, 360 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT5 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital13 mio100 ax100 hnf100 lsp94 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 43ms 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]: 588, Number of transitions in reduction automaton: 6420, Number of states in reduction automaton: 2095, 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 * x5 + z and consists of 4 locations. One deterministic module has affine ranking function -1 * x4 + 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 16:58:22,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...