/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/3_thr/ie2.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:42:29,445 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:42:29,499 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:42:29,504 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:42:29,506 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:42:29,506 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:42:29,506 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:42:29,520 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:42:29,521 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:42:29,521 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:42:29,521 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:42:29,521 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:42:29,521 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:42:29,521 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:42:29,522 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:42:29,522 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:42:29,522 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:42:29,522 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:42:29,522 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:42:29,522 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:42:29,523 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:42:29,523 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:42:29,523 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:42:29,524 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:42:29,524 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:42:29,524 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:42:29,524 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:42:29,524 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:42:29,524 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:42:29,524 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:42:29,524 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:42:29,524 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:42:29,524 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:42:29,524 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:42:29,524 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:42:29,524 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:42:29,524 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:42:29,524 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:42:29,524 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:42:29,524 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:42:29,525 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:42:29,525 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:42:29,525 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:42:29,863 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:42:29,872 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:42:29,874 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:42:29,875 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:42:29,875 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:42:29,876 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/3_thr/ie2.c.bpl [2025-04-26 18:42:29,876 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/3_thr/ie2.c.bpl' [2025-04-26 18:42:29,887 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:42:29,888 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:42:29,888 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:42:29,888 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:42:29,888 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:42:29,895 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ie2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:29" (1/1) ... [2025-04-26 18:42:29,916 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ie2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:29" (1/1) ... [2025-04-26 18:42:29,920 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:42:29,921 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:42:29,922 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:42:29,922 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:42:29,922 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:42:29,926 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ie2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:29" (1/1) ... [2025-04-26 18:42:29,927 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ie2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:29" (1/1) ... [2025-04-26 18:42:29,929 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ie2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:29" (1/1) ... [2025-04-26 18:42:29,929 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ie2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:29" (1/1) ... [2025-04-26 18:42:29,932 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "ie2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:29" (1/1) ... [2025-04-26 18:42:29,932 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ie2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:29" (1/1) ... [2025-04-26 18:42:29,934 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ie2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:29" (1/1) ... [2025-04-26 18:42:29,935 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "ie2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:29" (1/1) ... [2025-04-26 18:42:29,935 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ie2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:29" (1/1) ... [2025-04-26 18:42:29,942 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:42:29,943 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:42:29,943 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:42:29,943 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:42:29,943 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ie2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:29" (1/1) ... [2025-04-26 18:42:29,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:42:29,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:29,962 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:29,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 18:42:29,984 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:42:29,984 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:42:29,985 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:42:29,985 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:42:29,985 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:42:29,985 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:42:29,985 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 18:42:29,985 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:42:29,985 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:42:29,985 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:42:29,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:42:29,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:42:29,986 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 18:42:30,025 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:42:30,027 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:42:30,126 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:42:30,126 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:42:30,134 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:42:30,134 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:42:30,135 INFO L201 PluginConnector]: Adding new model ie2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:42:30 BoogieIcfgContainer [2025-04-26 18:42:30,135 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:42:30,135 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:42:30,135 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:42:30,141 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:42:30,141 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:42:30,141 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "ie2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:29" (1/2) ... [2025-04-26 18:42:30,142 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6a3f8588 and model type ie2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:42:30, skipping insertion in model container [2025-04-26 18:42:30,142 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:42:30,143 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "ie2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:42:30" (2/2) ... [2025-04-26 18:42:30,144 INFO L376 chiAutomizerObserver]: Analyzing ICFG ie2.c.bpl [2025-04-26 18:42:30,204 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 18:42:30,239 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:42:30,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:42:30,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:30,243 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:30,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 18:42:30,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 41 transitions, 103 flow [2025-04-26 18:42:30,317 INFO L116 PetriNetUnfolderBase]: 6/35 cut-off events. [2025-04-26 18:42:30,319 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 18:42:30,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 35 events. 6/35 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 70 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2025-04-26 18:42:30,324 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 41 transitions, 103 flow [2025-04-26 18:42:30,329 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 35 transitions, 88 flow [2025-04-26 18:42:30,330 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 39 places, 35 transitions, 88 flow [2025-04-26 18:42:30,330 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 39 places, 35 transitions, 88 flow [2025-04-26 18:42:30,403 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 660 states, 659 states have (on average 3.3110773899848254) internal successors, (in total 2182), 659 states have internal predecessors, (2182), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:30,406 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 660 states, 659 states have (on average 3.3110773899848254) internal successors, (in total 2182), 659 states have internal predecessors, (2182), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:30,408 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:42:30,647 WARN L140 AmpleReduction]: Number of pruned transitions: 728 [2025-04-26 18:42:30,647 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:42:30,648 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 166 [2025-04-26 18:42:30,648 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:93 [2025-04-26 18:42:30,648 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:363 [2025-04-26 18:42:30,648 WARN L145 AmpleReduction]: Times succ was already a loop node:378 [2025-04-26 18:42:30,648 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:35 [2025-04-26 18:42:30,648 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:42:30,649 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 623 states, 622 states have (on average 2.1318327974276525) internal successors, (in total 1326), 622 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:30,679 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:42:30,679 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:42:30,679 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:42:30,680 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:42:30,680 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:42:30,680 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:42:30,680 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:42:30,680 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:42:30,683 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 623 states, 622 states have (on average 2.1318327974276525) internal successors, (in total 1326), 622 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:30,720 INFO L131 ngComponentsAnalysis]: Automaton has 135 accepting balls. 404 [2025-04-26 18:42:30,720 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:30,720 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:30,724 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:42:30,724 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:30,724 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:42:30,726 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 623 states, 622 states have (on average 2.1318327974276525) internal successors, (in total 1326), 622 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:30,737 INFO L131 ngComponentsAnalysis]: Automaton has 135 accepting balls. 404 [2025-04-26 18:42:30,737 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:30,737 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:30,737 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:42:30,737 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:30,741 INFO L752 eck$LassoCheckResult]: Stem: "[85] $Ultimate##0-->L15: Formula: (= v_x2_10 0) InVars {} OutVars{x2=v_x2_10} AuxVars[] AssignedVars[x2]" "[120] L15-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 18:42:30,741 INFO L754 eck$LassoCheckResult]: Loop: "[92] L26-->L28: Formula: (< v_x1_1 v_z1_1) InVars {x1=v_x1_1, z1=v_z1_1} OutVars{x1=v_x1_1, z1=v_z1_1} AuxVars[] AssignedVars[]" "[94] L28-->L26: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" [2025-04-26 18:42:30,745 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:30,745 INFO L85 PathProgramCache]: Analyzing trace with hash 3716, now seen corresponding path program 1 times [2025-04-26 18:42:30,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:30,750 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415374416] [2025-04-26 18:42:30,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:30,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:30,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:30,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:30,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:30,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:30,798 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:30,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:30,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:30,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:30,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:30,811 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:30,812 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:30,812 INFO L85 PathProgramCache]: Analyzing trace with hash 3907, now seen corresponding path program 1 times [2025-04-26 18:42:30,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:30,813 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046446191] [2025-04-26 18:42:30,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:30,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:30,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:30,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:30,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:30,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:30,821 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:30,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:30,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:30,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:30,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:30,824 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:30,825 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:30,825 INFO L85 PathProgramCache]: Analyzing trace with hash 3574022, now seen corresponding path program 1 times [2025-04-26 18:42:30,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:30,825 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914527054] [2025-04-26 18:42:30,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:30,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:30,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:30,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:30,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:30,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:30,828 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:30,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:30,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:30,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:30,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:30,831 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:30,888 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:30,889 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:30,889 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:30,889 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:30,889 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:30,889 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:30,889 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:30,889 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:30,889 INFO L132 ssoRankerPreferences]: Filename of dumped script: ie2.c.bpl_petrified1_Iteration1_Loop [2025-04-26 18:42:30,889 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:30,890 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:30,900 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:30,961 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:30,961 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:30,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:30,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:30,965 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:30,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 18:42:30,968 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:30,969 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:30,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 18:42:30,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:30,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:30,990 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:30,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 18:42:30,991 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:30,991 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:31,057 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:31,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:31,061 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:31,061 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:31,061 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:31,061 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:31,061 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:31,061 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:31,061 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:31,062 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:31,062 INFO L132 ssoRankerPreferences]: Filename of dumped script: ie2.c.bpl_petrified1_Iteration1_Loop [2025-04-26 18:42:31,062 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:31,062 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:31,062 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:31,085 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:31,088 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:31,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:31,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:31,091 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:31,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 18:42:31,093 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:42:31,105 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:31,105 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:31,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:31,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:31,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:31,110 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:31,111 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:31,116 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:31,122 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:42:31,123 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:31,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:31,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:31,127 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:31,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 18:42:31,129 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:31,132 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 18:42:31,133 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 18:42:31,133 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:31,134 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:31,134 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z1, x1) = 1*z1 - 1*x1 Supporting invariants [] [2025-04-26 18:42:31,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 18:42:31,142 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:31,163 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:31,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:31,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:31,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:31,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:31,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:31,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:31,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:31,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:31,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:31,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:31,186 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:31,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:31,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:42:31,226 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:42:31,229 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 623 states, 622 states have (on average 2.1318327974276525) internal successors, (in total 1326), 622 states have internal predecessors, (1326), 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.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:31,371 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 623 states, 622 states have (on average 2.1318327974276525) internal successors, (in total 1326), 622 states have internal predecessors, (1326), 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.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 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 1490 states and 3363 transitions. Complement of second has 6 states. [2025-04-26 18:42:31,376 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:42:31,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:31,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2025-04-26 18:42:31,384 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 78 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 18:42:31,385 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:31,385 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 78 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 18:42:31,385 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:31,385 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 78 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 18:42:31,385 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:31,386 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1490 states and 3363 transitions. [2025-04-26 18:42:31,399 INFO L131 ngComponentsAnalysis]: Automaton has 134 accepting balls. 366 [2025-04-26 18:42:31,409 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1490 states to 946 states and 2180 transitions. [2025-04-26 18:42:31,410 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 601 [2025-04-26 18:42:31,411 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 727 [2025-04-26 18:42:31,412 INFO L74 IsDeterministic]: Start isDeterministic. Operand 946 states and 2180 transitions. [2025-04-26 18:42:31,412 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:31,412 INFO L218 hiAutomatonCegarLoop]: Abstraction has 946 states and 2180 transitions. [2025-04-26 18:42:31,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states and 2180 transitions. [2025-04-26 18:42:31,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 823. [2025-04-26 18:42:31,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 823 states, 823 states have (on average 2.330498177399757) internal successors, (in total 1918), 822 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:31,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1918 transitions. [2025-04-26 18:42:31,469 INFO L240 hiAutomatonCegarLoop]: Abstraction has 823 states and 1918 transitions. [2025-04-26 18:42:31,469 INFO L438 stractBuchiCegarLoop]: Abstraction has 823 states and 1918 transitions. [2025-04-26 18:42:31,469 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:42:31,469 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 823 states and 1918 transitions. [2025-04-26 18:42:31,473 INFO L131 ngComponentsAnalysis]: Automaton has 134 accepting balls. 366 [2025-04-26 18:42:31,473 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:31,473 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:31,473 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 18:42:31,473 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:31,473 INFO L752 eck$LassoCheckResult]: Stem: "[85] $Ultimate##0-->L15: Formula: (= v_x2_10 0) InVars {} OutVars{x2=v_x2_10} AuxVars[] AssignedVars[x2]" "[120] L15-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[123] L15-1-->L41: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-04-26 18:42:31,473 INFO L754 eck$LassoCheckResult]: Loop: "[101] L41-->L43: Formula: (< v_x3_5 v_z2_1) InVars {z2=v_z2_1, x3=v_x3_5} OutVars{z2=v_z2_1, x3=v_x3_5} AuxVars[] AssignedVars[]" "[103] L43-->L41: Formula: (= (+ v_x3_7 1) v_x3_6) InVars {x3=v_x3_7} OutVars{x3=v_x3_6} AuxVars[] AssignedVars[x3]" [2025-04-26 18:42:31,474 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:31,474 INFO L85 PathProgramCache]: Analyzing trace with hash 115319, now seen corresponding path program 1 times [2025-04-26 18:42:31,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:31,474 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458557973] [2025-04-26 18:42:31,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:31,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:31,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:31,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:31,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:31,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:31,477 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:31,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:31,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:31,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:31,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:31,479 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:31,479 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:31,479 INFO L85 PathProgramCache]: Analyzing trace with hash 4195, now seen corresponding path program 1 times [2025-04-26 18:42:31,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:31,479 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111667623] [2025-04-26 18:42:31,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:31,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:31,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:31,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:31,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:31,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:31,485 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:31,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:31,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:31,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:31,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:31,487 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:31,487 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:31,487 INFO L85 PathProgramCache]: Analyzing trace with hash 110824793, now seen corresponding path program 1 times [2025-04-26 18:42:31,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:31,487 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276233628] [2025-04-26 18:42:31,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:31,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:31,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:31,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:31,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:31,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:31,492 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:31,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:31,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:31,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:31,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:31,500 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:31,515 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:31,515 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:31,515 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:31,515 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:31,515 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:31,516 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:31,516 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:31,516 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:31,516 INFO L132 ssoRankerPreferences]: Filename of dumped script: ie2.c.bpl_petrified1_Iteration2_Loop [2025-04-26 18:42:31,516 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:31,516 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:31,516 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:31,537 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:31,537 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:31,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:31,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:31,539 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:31,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 18:42:31,542 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:31,542 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:31,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 18:42:31,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:31,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:31,560 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:31,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 18:42:31,564 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:31,564 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:31,627 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:31,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 18:42:31,631 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:31,631 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:31,631 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:31,631 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:31,631 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:31,632 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:31,632 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:31,632 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:31,632 INFO L132 ssoRankerPreferences]: Filename of dumped script: ie2.c.bpl_petrified1_Iteration2_Loop [2025-04-26 18:42:31,632 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:31,632 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:31,632 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:31,650 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:31,650 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:31,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:31,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:31,652 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:31,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 18:42:31,654 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:42:31,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:31,665 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:31,665 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:31,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:31,665 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:31,667 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:31,667 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:31,672 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:31,675 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:42:31,675 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:42:31,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:31,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:31,678 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:31,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 18:42:31,681 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:31,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:31,685 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:31,685 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:31,685 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z2, x3) = 1*z2 - 1*x3 Supporting invariants [] [2025-04-26 18:42:31,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 18:42:31,691 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:31,703 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:31,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:31,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:31,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:31,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:31,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:31,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:31,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:31,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:31,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:31,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:31,722 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:31,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:31,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:42:31,737 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:42:31,737 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 823 states and 1918 transitions. cyclomatic complexity: 1260 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:31,811 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 823 states and 1918 transitions. cyclomatic complexity: 1260. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 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 2073 states and 5005 transitions. Complement of second has 6 states. [2025-04-26 18:42:31,812 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:42:31,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:31,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2025-04-26 18:42:31,812 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 85 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 18:42:31,813 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:31,813 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 85 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 18:42:31,813 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:31,813 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 85 transitions. Stem has 3 letters. Loop has 4 letters. [2025-04-26 18:42:31,813 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:31,813 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2073 states and 5005 transitions. [2025-04-26 18:42:31,847 INFO L131 ngComponentsAnalysis]: Automaton has 120 accepting balls. 304 [2025-04-26 18:42:31,859 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2073 states to 1313 states and 3217 transitions. [2025-04-26 18:42:31,859 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 646 [2025-04-26 18:42:31,861 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 779 [2025-04-26 18:42:31,861 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1313 states and 3217 transitions. [2025-04-26 18:42:31,861 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:31,861 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1313 states and 3217 transitions. [2025-04-26 18:42:31,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1313 states and 3217 transitions. [2025-04-26 18:42:31,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1313 to 1181. [2025-04-26 18:42:31,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1181 states, 1181 states have (on average 2.5012701100762067) internal successors, (in total 2954), 1180 states have internal predecessors, (2954), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:31,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 1181 states and 2954 transitions. [2025-04-26 18:42:31,884 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1181 states and 2954 transitions. [2025-04-26 18:42:31,884 INFO L438 stractBuchiCegarLoop]: Abstraction has 1181 states and 2954 transitions. [2025-04-26 18:42:31,884 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:42:31,884 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1181 states and 2954 transitions. [2025-04-26 18:42:31,889 INFO L131 ngComponentsAnalysis]: Automaton has 120 accepting balls. 304 [2025-04-26 18:42:31,889 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:31,889 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:31,889 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 18:42:31,890 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:31,890 INFO L752 eck$LassoCheckResult]: Stem: "[85] $Ultimate##0-->L15: Formula: (= v_x2_10 0) InVars {} OutVars{x2=v_x2_10} AuxVars[] AssignedVars[x2]" "[120] L15-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[123] L15-1-->L41: 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]" "[126] L16-->L56: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" [2025-04-26 18:42:31,890 INFO L754 eck$LassoCheckResult]: Loop: "[110] L56-->L58: Formula: (< v_x4_5 v_z3_1) InVars {x4=v_x4_5, z3=v_z3_1} OutVars{x4=v_x4_5, z3=v_z3_1} AuxVars[] AssignedVars[]" "[112] L58-->L56: Formula: (= v_x4_6 (+ v_x4_7 1)) InVars {x4=v_x4_7} OutVars{x4=v_x4_6} AuxVars[] AssignedVars[x4]" [2025-04-26 18:42:31,890 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:31,890 INFO L85 PathProgramCache]: Analyzing trace with hash 3575015, now seen corresponding path program 1 times [2025-04-26 18:42:31,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:31,890 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423584939] [2025-04-26 18:42:31,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:31,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:31,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:31,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:31,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:31,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:31,895 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:31,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:31,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:31,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:31,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:31,898 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:31,898 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:31,898 INFO L85 PathProgramCache]: Analyzing trace with hash 4483, now seen corresponding path program 1 times [2025-04-26 18:42:31,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:31,898 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013790941] [2025-04-26 18:42:31,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:31,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:31,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:31,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:31,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:31,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:31,905 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:31,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:31,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:31,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:31,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:31,909 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:31,909 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:31,909 INFO L85 PathProgramCache]: Analyzing trace with hash -859374359, now seen corresponding path program 1 times [2025-04-26 18:42:31,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:31,909 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318716992] [2025-04-26 18:42:31,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:31,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:31,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:42:31,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:42:31,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:31,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:31,916 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:31,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:42:31,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:42:31,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:31,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:31,921 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:31,938 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:31,938 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:31,938 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:31,938 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:31,938 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:31,938 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:31,938 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:31,938 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:31,938 INFO L132 ssoRankerPreferences]: Filename of dumped script: ie2.c.bpl_petrified1_Iteration3_Loop [2025-04-26 18:42:31,938 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:31,938 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:31,939 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:31,955 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:31,955 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:31,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:31,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:31,957 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:31,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 18:42:31,960 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:31,960 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:31,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 18:42:31,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:31,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:31,980 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:31,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 18:42:31,982 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:31,982 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:32,051 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:32,055 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 18:42:32,056 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:32,056 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:32,056 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:32,056 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:32,056 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:32,056 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:32,056 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:32,056 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:32,056 INFO L132 ssoRankerPreferences]: Filename of dumped script: ie2.c.bpl_petrified1_Iteration3_Loop [2025-04-26 18:42:32,056 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:32,056 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:32,057 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:32,075 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:32,075 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:32,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:32,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:32,078 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:32,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 18:42:32,080 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:42:32,090 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:32,090 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:32,091 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:32,091 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:32,091 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:32,092 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:32,092 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:32,094 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:32,098 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:42:32,098 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:32,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:32,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:32,100 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:32,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 18:42:32,103 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:32,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:32,108 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:32,108 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:32,108 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x4, z3) = -1*x4 + 1*z3 Supporting invariants [] [2025-04-26 18:42:32,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 18:42:32,114 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:32,127 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:32,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:32,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:32,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:32,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:32,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:32,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:32,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:32,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:32,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:32,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:32,142 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:32,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:32,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:42:32,155 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:42:32,155 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1181 states and 2954 transitions. cyclomatic complexity: 1972 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:32,221 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1181 states and 2954 transitions. cyclomatic complexity: 1972. 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 2967 states and 7587 transitions. Complement of second has 6 states. [2025-04-26 18:42:32,221 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:42:32,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:32,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2025-04-26 18:42:32,222 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 91 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 18:42:32,222 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:32,222 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 91 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 18:42:32,222 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:32,222 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 91 transitions. Stem has 4 letters. Loop has 4 letters. [2025-04-26 18:42:32,222 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:32,222 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2967 states and 7587 transitions. [2025-04-26 18:42:32,244 INFO L131 ngComponentsAnalysis]: Automaton has 112 accepting balls. 266 [2025-04-26 18:42:32,259 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2967 states to 1802 states and 4719 transitions. [2025-04-26 18:42:32,260 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 730 [2025-04-26 18:42:32,261 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 821 [2025-04-26 18:42:32,261 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1802 states and 4719 transitions. [2025-04-26 18:42:32,261 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:32,261 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1802 states and 4719 transitions. [2025-04-26 18:42:32,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states and 4719 transitions. [2025-04-26 18:42:32,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1681. [2025-04-26 18:42:32,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1681 states, 1681 states have (on average 2.6353361094586556) internal successors, (in total 4430), 1680 states have internal predecessors, (4430), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:32,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1681 states to 1681 states and 4430 transitions. [2025-04-26 18:42:32,317 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1681 states and 4430 transitions. [2025-04-26 18:42:32,317 INFO L438 stractBuchiCegarLoop]: Abstraction has 1681 states and 4430 transitions. [2025-04-26 18:42:32,317 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:42:32,317 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1681 states and 4430 transitions. [2025-04-26 18:42:32,325 INFO L131 ngComponentsAnalysis]: Automaton has 112 accepting balls. 266 [2025-04-26 18:42:32,326 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:32,326 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:32,326 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 18:42:32,326 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:32,326 INFO L752 eck$LassoCheckResult]: Stem: "[85] $Ultimate##0-->L15: Formula: (= v_x2_10 0) InVars {} OutVars{x2=v_x2_10} AuxVars[] AssignedVars[x2]" "[120] L15-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[91] L26-->L30: Formula: (<= v_z1_2 v_x1_4) InVars {x1=v_x1_4, z1=v_z1_2} OutVars{x1=v_x1_4, z1=v_z1_2} AuxVars[] AssignedVars[]" "[93] L30-->L31: Formula: (= v_x2_1 (+ v_x2_2 1)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" "[95] L31-->L32-1: Formula: (<= 3 v_x2_3) InVars {x2=v_x2_3} OutVars{x2=v_x2_3} AuxVars[] AssignedVars[]" [2025-04-26 18:42:32,326 INFO L754 eck$LassoCheckResult]: Loop: "[97] L32-1-->L34: Formula: (< v_x3_1 v_z1_3) InVars {x3=v_x3_1, z1=v_z1_3} OutVars{x3=v_x3_1, z1=v_z1_3} AuxVars[] AssignedVars[]" "[99] L34-->L32-1: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" [2025-04-26 18:42:32,327 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:32,327 INFO L85 PathProgramCache]: Analyzing trace with hash 110793785, now seen corresponding path program 1 times [2025-04-26 18:42:32,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:32,327 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697417043] [2025-04-26 18:42:32,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:32,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:32,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:32,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:32,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:32,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:32,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:42:32,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:42:32,383 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697417043] [2025-04-26 18:42:32,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697417043] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:42:32,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:42:32,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 18:42:32,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908397969] [2025-04-26 18:42:32,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:42:32,389 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:42:32,389 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:32,389 INFO L85 PathProgramCache]: Analyzing trace with hash 4067, now seen corresponding path program 1 times [2025-04-26 18:42:32,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:32,389 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872590296] [2025-04-26 18:42:32,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:32,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:32,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:32,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:32,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:32,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:32,393 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:32,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:32,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:32,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:32,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:32,395 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:32,409 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:32,409 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:32,409 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:32,409 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:32,409 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:32,409 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:32,409 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:32,409 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:32,409 INFO L132 ssoRankerPreferences]: Filename of dumped script: ie2.c.bpl_petrified1_Iteration4_Loop [2025-04-26 18:42:32,409 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:32,410 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:32,410 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:32,426 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:32,426 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:32,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:32,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:32,428 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:32,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 18:42:32,431 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:32,431 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:32,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 18:42:32,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:32,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:32,451 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:32,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 18:42:32,453 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:32,453 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:32,525 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:32,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 18:42:32,530 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:32,530 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:32,530 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:32,530 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:32,530 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:32,530 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:32,530 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:32,530 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:32,530 INFO L132 ssoRankerPreferences]: Filename of dumped script: ie2.c.bpl_petrified1_Iteration4_Loop [2025-04-26 18:42:32,530 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:32,530 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:32,531 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:32,547 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:32,547 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:32,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:32,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:32,550 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:32,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 18:42:32,553 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:42:32,563 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:32,564 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:32,564 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:32,564 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:32,564 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:32,564 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:32,564 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:32,566 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:32,568 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:42:32,568 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:32,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:32,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:32,570 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:32,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 18:42:32,572 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:32,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-04-26 18:42:32,575 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:32,575 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:32,575 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z1, x3) = 1*z1 - 1*x3 Supporting invariants [] [2025-04-26 18:42:32,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:32,581 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:32,595 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:32,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:32,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:32,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:32,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:32,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:32,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:32,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:32,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:32,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:32,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:32,612 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:32,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:32,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:42:32,625 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:42:32,625 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1681 states and 4430 transitions. cyclomatic complexity: 2999 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:32,712 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1681 states and 4430 transitions. cyclomatic complexity: 2999. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 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 3497 states and 9285 transitions. Complement of second has 6 states. [2025-04-26 18:42:32,713 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:42:32,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:32,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2025-04-26 18:42:32,715 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 97 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 18:42:32,715 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:32,715 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 97 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 18:42:32,715 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:32,716 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 97 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 18:42:32,716 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:32,716 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3497 states and 9285 transitions. [2025-04-26 18:42:32,746 INFO L131 ngComponentsAnalysis]: Automaton has 61 accepting balls. 132 [2025-04-26 18:42:32,764 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3497 states to 2378 states and 6349 transitions. [2025-04-26 18:42:32,765 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 669 [2025-04-26 18:42:32,767 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 776 [2025-04-26 18:42:32,767 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2378 states and 6349 transitions. [2025-04-26 18:42:32,768 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:32,768 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2378 states and 6349 transitions. [2025-04-26 18:42:32,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2378 states and 6349 transitions. [2025-04-26 18:42:32,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2378 to 2166. [2025-04-26 18:42:32,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2166 states, 2166 states have (on average 2.744690674053555) internal successors, (in total 5945), 2165 states have internal predecessors, (5945), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:32,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2166 states to 2166 states and 5945 transitions. [2025-04-26 18:42:32,816 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2166 states and 5945 transitions. [2025-04-26 18:42:32,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:42:32,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 18:42:32,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-26 18:42:32,827 INFO L87 Difference]: Start difference. First operand 2166 states and 5945 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:32,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:42:32,868 INFO L93 Difference]: Finished difference Result 1277 states and 3172 transitions. [2025-04-26 18:42:32,868 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1277 states and 3172 transitions. [2025-04-26 18:42:32,877 INFO L131 ngComponentsAnalysis]: Automaton has 47 accepting balls. 104 [2025-04-26 18:42:32,885 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1277 states to 1277 states and 3172 transitions. [2025-04-26 18:42:32,885 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 488 [2025-04-26 18:42:32,886 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 488 [2025-04-26 18:42:32,886 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1277 states and 3172 transitions. [2025-04-26 18:42:32,886 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:32,886 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1277 states and 3172 transitions. [2025-04-26 18:42:32,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states and 3172 transitions. [2025-04-26 18:42:32,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 1277. [2025-04-26 18:42:32,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1277 states, 1277 states have (on average 2.4839467501957713) internal successors, (in total 3172), 1276 states have internal predecessors, (3172), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:32,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1277 states to 1277 states and 3172 transitions. [2025-04-26 18:42:32,913 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1277 states and 3172 transitions. [2025-04-26 18:42:32,914 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 18:42:32,916 INFO L438 stractBuchiCegarLoop]: Abstraction has 1277 states and 3172 transitions. [2025-04-26 18:42:32,916 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:42:32,916 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1277 states and 3172 transitions. [2025-04-26 18:42:32,923 INFO L131 ngComponentsAnalysis]: Automaton has 47 accepting balls. 104 [2025-04-26 18:42:32,924 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:32,924 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:32,924 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:42:32,924 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:32,925 INFO L752 eck$LassoCheckResult]: Stem: "[85] $Ultimate##0-->L15: Formula: (= v_x2_10 0) InVars {} OutVars{x2=v_x2_10} AuxVars[] AssignedVars[x2]" "[120] L15-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[123] L15-1-->L41: 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]" "[100] L41-->L45: Formula: (<= v_z2_2 v_x3_8) InVars {z2=v_z2_2, x3=v_x3_8} OutVars{z2=v_z2_2, x3=v_x3_8} AuxVars[] AssignedVars[]" "[102] L45-->L46: Formula: (= (+ v_x2_5 1) v_x2_4) InVars {x2=v_x2_5} OutVars{x2=v_x2_4} AuxVars[] AssignedVars[x2]" "[91] L26-->L30: Formula: (<= v_z1_2 v_x1_4) InVars {x1=v_x1_4, z1=v_z1_2} OutVars{x1=v_x1_4, z1=v_z1_2} AuxVars[] AssignedVars[]" "[93] L30-->L31: Formula: (= v_x2_1 (+ v_x2_2 1)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" "[104] L46-->L47-1: Formula: (<= 3 v_x2_6) InVars {x2=v_x2_6} OutVars{x2=v_x2_6} AuxVars[] AssignedVars[]" [2025-04-26 18:42:32,925 INFO L754 eck$LassoCheckResult]: Loop: "[106] L47-1-->L49: Formula: (< v_x4_1 v_z2_3) InVars {x4=v_x4_1, z2=v_z2_3} OutVars{x4=v_x4_1, z2=v_z2_3} AuxVars[] AssignedVars[]" "[108] L49-->L47-1: Formula: (= (+ v_x4_3 1) v_x4_2) InVars {x4=v_x4_3} OutVars{x4=v_x4_2} AuxVars[] AssignedVars[x4]" [2025-04-26 18:42:32,925 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:32,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1249305235, now seen corresponding path program 1 times [2025-04-26 18:42:32,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:32,925 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412267414] [2025-04-26 18:42:32,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:32,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:32,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:42:32,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:42:32,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:32,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:32,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:42:32,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:42:32,964 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412267414] [2025-04-26 18:42:32,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412267414] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:42:32,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:42:32,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:42:32,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600368371] [2025-04-26 18:42:32,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:42:32,965 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:42:32,965 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:32,965 INFO L85 PathProgramCache]: Analyzing trace with hash 4355, now seen corresponding path program 1 times [2025-04-26 18:42:32,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:32,965 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145668280] [2025-04-26 18:42:32,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:32,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:32,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:32,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:32,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:32,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:32,968 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:32,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:32,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:32,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:32,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:32,970 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:32,981 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:32,981 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:32,981 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:32,981 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:32,981 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:32,981 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:32,981 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:32,981 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:32,981 INFO L132 ssoRankerPreferences]: Filename of dumped script: ie2.c.bpl_petrified1_Iteration5_Loop [2025-04-26 18:42:32,981 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:32,981 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:32,982 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:32,997 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:32,997 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:32,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:32,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:32,999 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:33,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 18:42:33,002 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:33,002 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:33,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-04-26 18:42:33,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:33,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:33,021 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:33,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 18:42:33,024 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:33,024 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:33,087 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:33,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:33,092 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:33,092 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:33,092 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:33,092 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:33,092 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:33,092 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:33,092 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:33,092 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:33,092 INFO L132 ssoRankerPreferences]: Filename of dumped script: ie2.c.bpl_petrified1_Iteration5_Loop [2025-04-26 18:42:33,092 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:33,092 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:33,093 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:33,112 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:33,113 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:33,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:33,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:33,114 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:33,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 18:42:33,118 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:42:33,128 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:33,128 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:33,128 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:33,128 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:33,128 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:33,129 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:33,129 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:33,131 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:33,133 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:42:33,133 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:42:33,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:33,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:33,135 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:33,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 18:42:33,138 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:33,141 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 18:42:33,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:33,142 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:33,142 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:33,142 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z2, x4) = 1*z2 - 1*x4 Supporting invariants [] [2025-04-26 18:42:33,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:33,149 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:33,160 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:33,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:42:33,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:42:33,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:33,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:33,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:33,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:33,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:33,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:33,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:33,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:33,182 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:33,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:33,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:42:33,195 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:42:33,195 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1277 states and 3172 transitions. cyclomatic complexity: 2077 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:33,254 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1277 states and 3172 transitions. cyclomatic complexity: 2077. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 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 2471 states and 6032 transitions. Complement of second has 6 states. [2025-04-26 18:42:33,254 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:42:33,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:33,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2025-04-26 18:42:33,256 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 96 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 18:42:33,256 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:33,256 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 96 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 18:42:33,256 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:33,256 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 96 transitions. Stem has 8 letters. Loop has 4 letters. [2025-04-26 18:42:33,256 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:33,256 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2471 states and 6032 transitions. [2025-04-26 18:42:33,271 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 38 [2025-04-26 18:42:33,280 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2471 states to 1528 states and 3750 transitions. [2025-04-26 18:42:33,281 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 384 [2025-04-26 18:42:33,281 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 427 [2025-04-26 18:42:33,281 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1528 states and 3750 transitions. [2025-04-26 18:42:33,281 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:33,281 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1528 states and 3750 transitions. [2025-04-26 18:42:33,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1528 states and 3750 transitions. [2025-04-26 18:42:33,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1528 to 1447. [2025-04-26 18:42:33,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1447 states, 1447 states have (on average 2.4485141672425708) internal successors, (in total 3543), 1446 states have internal predecessors, (3543), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:33,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1447 states and 3543 transitions. [2025-04-26 18:42:33,331 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1447 states and 3543 transitions. [2025-04-26 18:42:33,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:42:33,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 18:42:33,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-26 18:42:33,332 INFO L87 Difference]: Start difference. First operand 1447 states and 3543 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (in total 8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:33,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:42:33,364 INFO L93 Difference]: Finished difference Result 409 states and 1069 transitions. [2025-04-26 18:42:33,364 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 409 states and 1069 transitions. [2025-04-26 18:42:33,366 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 14 [2025-04-26 18:42:33,368 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 409 states to 363 states and 915 transitions. [2025-04-26 18:42:33,368 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 118 [2025-04-26 18:42:33,368 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 118 [2025-04-26 18:42:33,369 INFO L74 IsDeterministic]: Start isDeterministic. Operand 363 states and 915 transitions. [2025-04-26 18:42:33,369 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:33,369 INFO L218 hiAutomatonCegarLoop]: Abstraction has 363 states and 915 transitions. [2025-04-26 18:42:33,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states and 915 transitions. [2025-04-26 18:42:33,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2025-04-26 18:42:33,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 363 states have (on average 2.520661157024793) internal successors, (in total 915), 362 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:33,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 915 transitions. [2025-04-26 18:42:33,374 INFO L240 hiAutomatonCegarLoop]: Abstraction has 363 states and 915 transitions. [2025-04-26 18:42:33,374 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 18:42:33,374 INFO L438 stractBuchiCegarLoop]: Abstraction has 363 states and 915 transitions. [2025-04-26 18:42:33,374 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 18:42:33,374 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 363 states and 915 transitions. [2025-04-26 18:42:33,376 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 14 [2025-04-26 18:42:33,376 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:33,376 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:33,376 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:42:33,376 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:33,377 INFO L752 eck$LassoCheckResult]: Stem: "[85] $Ultimate##0-->L15: Formula: (= v_x2_10 0) InVars {} OutVars{x2=v_x2_10} AuxVars[] AssignedVars[x2]" "[120] L15-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[123] L15-1-->L41: 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]" "[100] L41-->L45: Formula: (<= v_z2_2 v_x3_8) InVars {z2=v_z2_2, x3=v_x3_8} OutVars{z2=v_z2_2, x3=v_x3_8} AuxVars[] AssignedVars[]" "[102] L45-->L46: Formula: (= (+ v_x2_5 1) v_x2_4) InVars {x2=v_x2_5} OutVars{x2=v_x2_4} AuxVars[] AssignedVars[x2]" "[91] L26-->L30: Formula: (<= v_z1_2 v_x1_4) InVars {x1=v_x1_4, z1=v_z1_2} OutVars{x1=v_x1_4, z1=v_z1_2} AuxVars[] AssignedVars[]" "[93] L30-->L31: Formula: (= v_x2_1 (+ v_x2_2 1)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" "[126] L16-->L56: 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]" "[109] L56-->L60: Formula: (<= v_z3_2 v_x4_8) InVars {x4=v_x4_8, z3=v_z3_2} OutVars{x4=v_x4_8, z3=v_z3_2} AuxVars[] AssignedVars[]" "[111] L60-->L61: Formula: (= v_x2_7 (+ v_x2_8 1)) InVars {x2=v_x2_8} OutVars{x2=v_x2_7} AuxVars[] AssignedVars[x2]" "[95] L31-->L32-1: Formula: (<= 3 v_x2_3) InVars {x2=v_x2_3} OutVars{x2=v_x2_3} AuxVars[] AssignedVars[]" "[96] L32-1-->thread1FINAL: Formula: (<= v_z1_4 v_x3_4) InVars {x3=v_x3_4, z1=v_z1_4} OutVars{x3=v_x3_4, z1=v_z1_4} AuxVars[] AssignedVars[]" "[104] L46-->L47-1: Formula: (<= 3 v_x2_6) InVars {x2=v_x2_6} OutVars{x2=v_x2_6} AuxVars[] AssignedVars[]" "[105] L47-1-->thread2FINAL: Formula: (<= v_z2_4 v_x4_4) InVars {x4=v_x4_4, z2=v_z2_4} OutVars{x4=v_x4_4, z2=v_z2_4} AuxVars[] AssignedVars[]" "[113] L61-->L62-1: Formula: (<= 3 v_x2_9) InVars {x2=v_x2_9} OutVars{x2=v_x2_9} AuxVars[] AssignedVars[]" [2025-04-26 18:42:33,377 INFO L754 eck$LassoCheckResult]: Loop: "[115] L62-1-->L64: Formula: (< v_x1_5 v_z3_3) InVars {x1=v_x1_5, z3=v_z3_3} OutVars{x1=v_x1_5, z3=v_z3_3} AuxVars[] AssignedVars[]" "[117] L64-->L62-1: Formula: (= (+ v_x1_7 1) v_x1_6) InVars {x1=v_x1_7} OutVars{x1=v_x1_6} AuxVars[] AssignedVars[x1]" [2025-04-26 18:42:33,377 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:33,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1585491766, now seen corresponding path program 1 times [2025-04-26 18:42:33,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:33,377 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149223346] [2025-04-26 18:42:33,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:33,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:33,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:42:33,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:42:33,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:33,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:33,386 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:33,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:42:33,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:42:33,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:33,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:33,395 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:33,396 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:33,396 INFO L85 PathProgramCache]: Analyzing trace with hash 4643, now seen corresponding path program 1 times [2025-04-26 18:42:33,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:33,396 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608462723] [2025-04-26 18:42:33,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:33,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:33,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:33,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:33,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:33,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:33,401 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:33,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:33,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:33,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:33,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:33,404 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:33,405 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:33,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1055806636, now seen corresponding path program 1 times [2025-04-26 18:42:33,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:33,405 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408358653] [2025-04-26 18:42:33,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:33,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:33,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 18:42:33,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 18:42:33,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:33,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:33,409 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:33,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 18:42:33,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 18:42:33,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:33,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:33,417 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:33,431 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:33,431 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:33,432 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:33,432 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:33,432 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:33,432 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:33,432 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:33,432 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:33,432 INFO L132 ssoRankerPreferences]: Filename of dumped script: ie2.c.bpl_petrified1_Iteration6_Loop [2025-04-26 18:42:33,432 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:33,432 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:33,432 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:33,456 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:33,456 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:33,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:33,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:33,459 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:33,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 18:42:33,464 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:33,465 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:33,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:33,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:33,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:33,488 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:33,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-04-26 18:42:33,490 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:33,490 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:33,555 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:33,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-04-26 18:42:33,560 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:33,560 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:33,560 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:33,560 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:33,560 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:33,561 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:33,561 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:33,561 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:33,561 INFO L132 ssoRankerPreferences]: Filename of dumped script: ie2.c.bpl_petrified1_Iteration6_Loop [2025-04-26 18:42:33,561 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:33,561 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:33,561 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:33,574 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:33,574 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:33,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:33,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:33,576 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:33,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-04-26 18:42:33,579 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:42:33,589 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:33,589 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:33,589 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:33,589 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:33,589 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:33,591 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:33,591 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:33,596 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:33,598 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:42:33,598 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:42:33,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:33,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:33,600 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:33,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-04-26 18:42:33,603 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:33,606 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 18:42:33,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:33,606 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:33,606 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:33,606 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z3, x1) = 1*z3 - 1*x1 Supporting invariants [] [2025-04-26 18:42:33,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:33,613 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:33,623 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:33,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:42:33,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:42:33,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:33,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:33,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:33,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:33,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:33,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:33,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:33,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:33,657 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:33,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:33,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:42:33,669 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:42:33,670 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 363 states and 915 transitions. cyclomatic complexity: 602 Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:33,691 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 363 states and 915 transitions. cyclomatic complexity: 602. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 states have internal predecessors, (17), 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 509 states and 1215 transitions. Complement of second has 6 states. [2025-04-26 18:42:33,691 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:42:33,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:33,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2025-04-26 18:42:33,692 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 59 transitions. Stem has 15 letters. Loop has 2 letters. [2025-04-26 18:42:33,692 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:33,692 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 59 transitions. Stem has 17 letters. Loop has 2 letters. [2025-04-26 18:42:33,692 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:33,692 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 59 transitions. Stem has 15 letters. Loop has 4 letters. [2025-04-26 18:42:33,692 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:33,692 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 509 states and 1215 transitions. [2025-04-26 18:42:33,694 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:42:33,694 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 509 states to 0 states and 0 transitions. [2025-04-26 18:42:33,694 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:42:33,694 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:42:33,695 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:42:33,695 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:42:33,695 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:33,695 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:33,695 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:33,695 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 18:42:33,695 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:42:33,695 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:42:33,695 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:42:33,705 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 18:42:33,706 INFO L201 PluginConnector]: Adding new model ie2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:42:33 BoogieIcfgContainer [2025-04-26 18:42:33,706 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:42:33,707 INFO L158 Benchmark]: Toolchain (without parser) took 3818.93ms. Allocated memory was 155.2MB in the beginning and 272.6MB in the end (delta: 117.4MB). Free memory was 82.9MB in the beginning and 168.3MB in the end (delta: -85.5MB). Peak memory consumption was 38.3MB. Max. memory is 8.0GB. [2025-04-26 18:42:33,707 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.14ms. Allocated memory is still 155.2MB. Free memory is still 83.8MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:33,707 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.07ms. Allocated memory is still 155.2MB. Free memory was 82.9MB in the beginning and 81.1MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:42:33,707 INFO L158 Benchmark]: Boogie Preprocessor took 20.40ms. Allocated memory is still 155.2MB. Free memory was 80.9MB in the beginning and 80.0MB in the end (delta: 908.4kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:33,707 INFO L158 Benchmark]: RCFGBuilder took 192.28ms. Allocated memory is still 155.2MB. Free memory was 80.0MB in the beginning and 70.3MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:42:33,707 INFO L158 Benchmark]: BuchiAutomizer took 3570.56ms. Allocated memory was 155.2MB in the beginning and 272.6MB in the end (delta: 117.4MB). Free memory was 70.1MB in the beginning and 168.3MB in the end (delta: -98.3MB). Peak memory consumption was 25.7MB. Max. memory is 8.0GB. [2025-04-26 18:42:33,708 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.14ms. Allocated memory is still 155.2MB. Free memory is still 83.8MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.07ms. Allocated memory is still 155.2MB. Free memory was 82.9MB in the beginning and 81.1MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.40ms. Allocated memory is still 155.2MB. Free memory was 80.9MB in the beginning and 80.0MB in the end (delta: 908.4kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 192.28ms. Allocated memory is still 155.2MB. Free memory was 80.0MB in the beginning and 70.3MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 3570.56ms. Allocated memory was 155.2MB in the beginning and 272.6MB in the end (delta: 117.4MB). Free memory was 70.1MB in the beginning and 168.3MB in the end (delta: -98.3MB). Peak memory consumption was 25.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.4s and 7 iterations. TraceHistogramMax:1. Analysis of lassos took 1.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 7. Automata minimization 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 669 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [6, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 445 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 439 mSDsluCounter, 673 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 345 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 275 IncrementalHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 328 mSDtfsCounter, 275 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT4 conc0 concLT0 SILN0 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 45ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s InitialAbstractionConstructionTime: 0.4s InitialAbstraction: Time to compute Ample Reduction [ms]: 416, Number of transitions in reduction automaton: 1326, Number of states in reduction automaton: 623, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (2 trivial, 6 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x1 + z1 and consists of 4 locations. One deterministic module has affine ranking function -1 * x3 + z2 and consists of 4 locations. One deterministic module has affine ranking function -1 * x4 + z3 and consists of 4 locations. One deterministic module has affine ranking function -1 * x3 + z1 and consists of 4 locations. One deterministic module has affine ranking function -1 * x4 + z2 and consists of 4 locations. One deterministic module has affine ranking function -1 * x1 + z3 and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:42:33,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...