/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 ../../../trunk/examples/concurrent/bpl/POPL2023/map-aggr-update1-3modifiers.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:53:37,700 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:53:37,739 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:53:37,742 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:53:37,742 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:53:37,742 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:53:37,742 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:53:37,758 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:53:37,758 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:53:37,758 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:53:37,759 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:53:37,759 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:53:37,759 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:53:37,759 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:53:37,759 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:53:37,759 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:53:37,759 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:53:37,759 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:53:37,759 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:53:37,759 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:53:37,759 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:53:37,759 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:53:37,759 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:53:37,759 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:53:37,759 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:53:37,760 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:53:37,760 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:53:37,760 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:53:37,760 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:53:37,760 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:53:37,760 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:53:37,760 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:53:37,760 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:53:37,760 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:53:37,760 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:53:37,760 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:53:37,760 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:53:37,760 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:53:37,760 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:53:37,760 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:53:37,760 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:53:37,761 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:53:37,761 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:53:37,975 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:53:37,981 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:53:37,983 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:53:37,983 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:53:37,984 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:53:37,985 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-aggr-update1-3modifiers.bpl [2025-04-26 16:53:37,985 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-aggr-update1-3modifiers.bpl' [2025-04-26 16:53:38,004 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:53:38,006 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:53:38,006 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:53:38,006 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:53:38,006 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:53:38,014 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "map-aggr-update1-3modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:38" (1/1) ... [2025-04-26 16:53:38,034 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "map-aggr-update1-3modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:38" (1/1) ... [2025-04-26 16:53:38,041 INFO L138 Inliner]: procedures = 4, calls = 5, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:53:38,042 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:53:38,043 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:53:38,043 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:53:38,043 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:53:38,048 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "map-aggr-update1-3modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:38" (1/1) ... [2025-04-26 16:53:38,049 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "map-aggr-update1-3modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:38" (1/1) ... [2025-04-26 16:53:38,051 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "map-aggr-update1-3modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:38" (1/1) ... [2025-04-26 16:53:38,051 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "map-aggr-update1-3modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:38" (1/1) ... [2025-04-26 16:53:38,052 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "map-aggr-update1-3modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:38" (1/1) ... [2025-04-26 16:53:38,053 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "map-aggr-update1-3modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:38" (1/1) ... [2025-04-26 16:53:38,058 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "map-aggr-update1-3modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:38" (1/1) ... [2025-04-26 16:53:38,062 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "map-aggr-update1-3modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:38" (1/1) ... [2025-04-26 16:53:38,063 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "map-aggr-update1-3modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:38" (1/1) ... [2025-04-26 16:53:38,074 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:53:38,075 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:53:38,075 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:53:38,075 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:53:38,076 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "map-aggr-update1-3modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:38" (1/1) ... [2025-04-26 16:53:38,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:53:38,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:38,102 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:38,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 16:53:38,128 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:53:38,128 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:53:38,128 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:53:38,128 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:53:38,128 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:53:38,128 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:53:38,128 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:53:38,128 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:53:38,129 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:53:38,129 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:53:38,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:53:38,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:53:38,129 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:53:38,167 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:53:38,168 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:53:38,277 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:53:38,277 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:53:38,286 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:53:38,286 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:53:38,286 INFO L201 PluginConnector]: Adding new model map-aggr-update1-3modifiers.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:53:38 BoogieIcfgContainer [2025-04-26 16:53:38,286 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:53:38,288 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:53:38,288 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:53:38,293 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:53:38,293 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:53:38,293 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-aggr-update1-3modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:38" (1/2) ... [2025-04-26 16:53:38,294 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4048fbc9 and model type map-aggr-update1-3modifiers.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:53:38, skipping insertion in model container [2025-04-26 16:53:38,295 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:53:38,295 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-aggr-update1-3modifiers.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:53:38" (2/2) ... [2025-04-26 16:53:38,296 INFO L376 chiAutomizerObserver]: Analyzing ICFG map-aggr-update1-3modifiers.bpl [2025-04-26 16:53:38,364 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2025-04-26 16:53:38,405 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:53:38,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:53:38,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:38,408 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:38,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 16:53:38,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 60 transitions, 155 flow [2025-04-26 16:53:38,482 INFO L116 PetriNetUnfolderBase]: 7/50 cut-off events. [2025-04-26 16:53:38,486 INFO L117 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-04-26 16:53:38,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 50 events. 7/50 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 134 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2025-04-26 16:53:38,492 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 60 transitions, 155 flow [2025-04-26 16:53:38,496 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 50 transitions, 130 flow [2025-04-26 16:53:38,496 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 59 places, 50 transitions, 130 flow [2025-04-26 16:53:38,501 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:53:39,706 WARN L140 AmpleReduction]: Number of pruned transitions: 20030 [2025-04-26 16:53:39,707 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:53:39,707 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 1623 [2025-04-26 16:53:39,707 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:51 [2025-04-26 16:53:39,707 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:5152 [2025-04-26 16:53:39,707 WARN L145 AmpleReduction]: Times succ was already a loop node:1264 [2025-04-26 16:53:39,707 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:3970 [2025-04-26 16:53:39,707 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:53:39,733 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 6827 states, 6825 states have (on average 2.282051282051282) internal successors, (in total 15575), 6826 states have internal predecessors, (15575), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:39,741 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:53:39,741 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:53:39,741 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:53:39,741 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:53:39,741 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:53:39,741 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:53:39,741 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:53:39,742 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:53:39,757 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 6827 states, 6825 states have (on average 2.282051282051282) internal successors, (in total 15575), 6826 states have internal predecessors, (15575), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:39,874 INFO L131 ngComponentsAnalysis]: Automaton has 391 accepting balls. 5333 [2025-04-26 16:53:39,874 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:39,874 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:39,879 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:53:39,880 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:53:39,880 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:53:39,895 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 6827 states, 6825 states have (on average 2.282051282051282) internal successors, (in total 15575), 6826 states have internal predecessors, (15575), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:39,991 INFO L131 ngComponentsAnalysis]: Automaton has 391 accepting balls. 5333 [2025-04-26 16:53:39,991 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:39,991 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:39,991 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:53:39,991 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:53:39,996 INFO L752 eck$LassoCheckResult]: Stem: "[90] $Ultimate##0-->L34: Formula: (and (<= 0 v_ULTIMATE.start_m_1) (< v_ULTIMATE.start_m_1 v_N_7)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} AuxVars[] AssignedVars[]" "[140] L34-->$Ultimate##0: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0, thread1Thread1of1ForFork2_i]" "[96] $Ultimate##0-->L55-1: Formula: (= v_thread1Thread1of1ForFork2_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_i]" [2025-04-26 16:53:39,997 INFO L754 eck$LassoCheckResult]: Loop: "[98] L55-1-->L56: Formula: (< v_thread1Thread1of1ForFork2_i_5 v_N_1) InVars {N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} OutVars{N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} AuxVars[] AssignedVars[]" "[100] L56-->L57: Formula: (= v_A_1 (store v_A_2 v_thread1Thread1of1ForFork2_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork2_i_7))) (ite (< .cse0 0) 0 .cse0)))) InVars {A=v_A_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} AuxVars[] AssignedVars[A]" "[101] L57-->L55-1: Formula: (= v_thread1Thread1of1ForFork2_i_10 (+ v_thread1Thread1of1ForFork2_i_9 1)) InVars {thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_9} OutVars{thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_i]" [2025-04-26 16:53:40,000 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:40,000 INFO L85 PathProgramCache]: Analyzing trace with hash 120717, now seen corresponding path program 1 times [2025-04-26 16:53:40,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:40,005 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431342748] [2025-04-26 16:53:40,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:40,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:40,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:40,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:40,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:40,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:40,059 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:40,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:40,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:40,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:40,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:40,076 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:40,078 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:40,079 INFO L85 PathProgramCache]: Analyzing trace with hash 127170, now seen corresponding path program 1 times [2025-04-26 16:53:40,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:40,079 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555346957] [2025-04-26 16:53:40,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:40,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:40,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:40,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:40,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:40,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:40,095 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:40,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:40,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:40,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:40,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:40,105 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:40,106 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:40,106 INFO L85 PathProgramCache]: Analyzing trace with hash -698589770, now seen corresponding path program 1 times [2025-04-26 16:53:40,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:40,106 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90531677] [2025-04-26 16:53:40,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:40,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:40,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:53:40,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:53:40,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:40,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:40,119 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:40,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:53:40,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:53:40,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:40,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:40,131 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:40,339 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:53:40,340 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:53:40,340 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:53:40,340 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:53:40,340 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:53:40,340 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:40,341 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:53:40,341 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:53:40,341 INFO L132 ssoRankerPreferences]: Filename of dumped script: map-aggr-update1-3modifiers.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:53:40,341 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:53:40,341 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:53:40,352 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:40,386 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:40,442 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:53:40,446 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:53:40,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:40,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:40,450 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:40,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:53:40,453 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:40,466 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:40,467 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:53:40,467 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:40,468 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:40,468 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:40,472 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:53:40,472 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:53:40,474 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:40,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:40,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:40,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:40,483 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:40,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:53:40,486 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:40,496 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:40,497 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:40,497 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:40,497 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:40,504 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:40,504 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:40,512 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:53:40,529 INFO L436 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-04-26 16:53:40,529 INFO L437 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 16:53:40,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:40,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:40,533 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:40,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:53:40,535 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:53:40,554 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 16:53:40,554 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:53:40,554 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:53:40,555 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, thread1Thread1of1ForFork2_i) = 1*N - 1*thread1Thread1of1ForFork2_i Supporting invariants [] [2025-04-26 16:53:40,563 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 16:53:40,566 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:53:40,594 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:40,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:40,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:40,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:40,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:40,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:53:40,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:40,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:40,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:40,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:40,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:40,621 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:53:40,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:40,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:53:40,665 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:53:40,675 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 6827 states, 6825 states have (on average 2.282051282051282) internal successors, (in total 15575), 6826 states have internal predecessors, (15575), 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 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:40,981 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 6827 states, 6825 states have (on average 2.282051282051282) internal successors, (in total 15575), 6826 states have internal predecessors, (15575), 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 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 15734 states and 35733 transitions. Complement of second has 6 states. [2025-04-26 16:53:40,984 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:53:40,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:40,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2025-04-26 16:53:40,992 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 115 transitions. Stem has 3 letters. Loop has 3 letters. [2025-04-26 16:53:40,994 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:40,994 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 115 transitions. Stem has 6 letters. Loop has 3 letters. [2025-04-26 16:53:40,995 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:40,995 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 115 transitions. Stem has 3 letters. Loop has 6 letters. [2025-04-26 16:53:40,995 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:40,995 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15734 states and 35733 transitions. [2025-04-26 16:53:41,224 INFO L131 ngComponentsAnalysis]: Automaton has 230 accepting balls. 1118 [2025-04-26 16:53:41,321 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15734 states to 9225 states and 20482 transitions. [2025-04-26 16:53:41,322 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2158 [2025-04-26 16:53:41,339 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4208 [2025-04-26 16:53:41,340 INFO L74 IsDeterministic]: Start isDeterministic. Operand 9225 states and 20482 transitions. [2025-04-26 16:53:41,340 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:41,340 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9225 states and 20482 transitions. [2025-04-26 16:53:41,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9225 states and 20482 transitions. [2025-04-26 16:53:41,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9225 to 7945. [2025-04-26 16:53:41,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7945 states, 7945 states have (on average 2.3208307111390813) internal successors, (in total 18439), 7944 states have internal predecessors, (18439), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:41,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7945 states to 7945 states and 18439 transitions. [2025-04-26 16:53:41,659 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7945 states and 18439 transitions. [2025-04-26 16:53:41,659 INFO L438 stractBuchiCegarLoop]: Abstraction has 7945 states and 18439 transitions. [2025-04-26 16:53:41,659 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:53:41,659 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7945 states and 18439 transitions. [2025-04-26 16:53:41,703 INFO L131 ngComponentsAnalysis]: Automaton has 230 accepting balls. 1118 [2025-04-26 16:53:41,704 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:41,704 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:41,704 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:41,705 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:53:41,705 INFO L752 eck$LassoCheckResult]: Stem: "[90] $Ultimate##0-->L34: Formula: (and (<= 0 v_ULTIMATE.start_m_1) (< v_ULTIMATE.start_m_1 v_N_7)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} AuxVars[] AssignedVars[]" "[140] L34-->$Ultimate##0: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0, thread1Thread1of1ForFork2_i]" "[96] $Ultimate##0-->L55-1: Formula: (= v_thread1Thread1of1ForFork2_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_i]" "[97] L55-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork2_i_3) InVars {N=v_N_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_3} OutVars{N=v_N_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_3} AuxVars[] AssignedVars[]" "[99] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[143] L34-1-->$Ultimate##0: Formula: (and (= v_thread2Thread1of1ForFork3_thidvar0_2 2) (= v_thread2Thread1of1ForFork3_thidvar1_2 2)) InVars {} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_20, thread2Thread1of1ForFork3_thidvar0=v_thread2Thread1of1ForFork3_thidvar0_2, thread2Thread1of1ForFork3_thidvar1=v_thread2Thread1of1ForFork3_thidvar1_2, thread2Thread1of1ForFork3_cnt=v_thread2Thread1of1ForFork3_cnt_12} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_j, thread2Thread1of1ForFork3_thidvar0, thread2Thread1of1ForFork3_thidvar1, thread2Thread1of1ForFork3_cnt]" "[102] $Ultimate##0-->L68: Formula: (= v_thread2Thread1of1ForFork3_cnt_1 0) InVars {} OutVars{thread2Thread1of1ForFork3_cnt=v_thread2Thread1of1ForFork3_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_cnt]" "[103] L68-->L69-1: Formula: (= v_thread2Thread1of1ForFork3_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_j]" [2025-04-26 16:53:41,705 INFO L754 eck$LassoCheckResult]: Loop: "[105] L69-1-->L70: Formula: (< v_thread2Thread1of1ForFork3_j_5 v_N_4) InVars {thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_5, N=v_N_4} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_5, N=v_N_4} AuxVars[] AssignedVars[]" "[108] L70-->L70-2: Formula: (<= (select v_A_4 v_thread2Thread1of1ForFork3_j_9) 0) InVars {A=v_A_4, thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_9} OutVars{A=v_A_4, thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_9} AuxVars[] AssignedVars[]" "[111] L70-2-->L73-1: Formula: (<= (select v_B_2 v_thread2Thread1of1ForFork3_j_13) 0) InVars {thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_13, B=v_B_2} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_13, B=v_B_2} AuxVars[] AssignedVars[]" "[113] L73-1-->L69-1: Formula: (= (+ v_thread2Thread1of1ForFork3_j_15 1) v_thread2Thread1of1ForFork3_j_16) InVars {thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_15} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_16} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_j]" [2025-04-26 16:53:41,706 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:41,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1330780479, now seen corresponding path program 1 times [2025-04-26 16:53:41,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:41,706 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350901881] [2025-04-26 16:53:41,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:41,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:41,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:53:41,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:53:41,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:41,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:41,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:53:41,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:53:41,763 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350901881] [2025-04-26 16:53:41,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350901881] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:53:41,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:53:41,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:53:41,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213318311] [2025-04-26 16:53:41,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:53:41,768 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:53:41,768 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:41,768 INFO L85 PathProgramCache]: Analyzing trace with hash 4158918, now seen corresponding path program 1 times [2025-04-26 16:53:41,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:41,768 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975839965] [2025-04-26 16:53:41,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:41,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:41,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:53:41,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:53:41,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:41,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:41,775 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:41,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:53:41,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:53:41,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:41,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:41,782 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:41,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:53:41,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:53:41,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-26 16:53:41,812 INFO L87 Difference]: Start difference. First operand 7945 states and 18439 transitions. cyclomatic complexity: 10869 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 3 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 16:53:41,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:53:41,956 INFO L93 Difference]: Finished difference Result 7945 states and 18438 transitions. [2025-04-26 16:53:41,956 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7945 states and 18438 transitions. [2025-04-26 16:53:42,017 INFO L131 ngComponentsAnalysis]: Automaton has 230 accepting balls. 1118 [2025-04-26 16:53:42,081 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7945 states to 7945 states and 18438 transitions. [2025-04-26 16:53:42,081 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2928 [2025-04-26 16:53:42,088 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2928 [2025-04-26 16:53:42,088 INFO L74 IsDeterministic]: Start isDeterministic. Operand 7945 states and 18438 transitions. [2025-04-26 16:53:42,090 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:42,090 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7945 states and 18438 transitions. [2025-04-26 16:53:42,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7945 states and 18438 transitions. [2025-04-26 16:53:42,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7945 to 7945. [2025-04-26 16:53:42,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7945 states, 7945 states have (on average 2.320704845814978) internal successors, (in total 18438), 7944 states have internal predecessors, (18438), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:42,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7945 states to 7945 states and 18438 transitions. [2025-04-26 16:53:42,291 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7945 states and 18438 transitions. [2025-04-26 16:53:42,292 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 16:53:42,292 INFO L438 stractBuchiCegarLoop]: Abstraction has 7945 states and 18438 transitions. [2025-04-26 16:53:42,292 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:53:42,292 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7945 states and 18438 transitions. [2025-04-26 16:53:42,336 INFO L131 ngComponentsAnalysis]: Automaton has 230 accepting balls. 1118 [2025-04-26 16:53:42,336 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:42,336 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:42,338 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:42,338 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:53:42,339 INFO L752 eck$LassoCheckResult]: Stem: "[90] $Ultimate##0-->L34: Formula: (and (<= 0 v_ULTIMATE.start_m_1) (< v_ULTIMATE.start_m_1 v_N_7)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} AuxVars[] AssignedVars[]" "[140] L34-->$Ultimate##0: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0, thread1Thread1of1ForFork2_i]" "[96] $Ultimate##0-->L55-1: Formula: (= v_thread1Thread1of1ForFork2_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_i]" "[98] L55-1-->L56: Formula: (< v_thread1Thread1of1ForFork2_i_5 v_N_1) InVars {N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} OutVars{N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} AuxVars[] AssignedVars[]" "[100] L56-->L57: Formula: (= v_A_1 (store v_A_2 v_thread1Thread1of1ForFork2_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork2_i_7))) (ite (< .cse0 0) 0 .cse0)))) InVars {A=v_A_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} AuxVars[] AssignedVars[A]" "[101] L57-->L55-1: Formula: (= v_thread1Thread1of1ForFork2_i_10 (+ v_thread1Thread1of1ForFork2_i_9 1)) InVars {thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_9} OutVars{thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_i]" "[97] L55-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork2_i_3) InVars {N=v_N_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_3} OutVars{N=v_N_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_3} AuxVars[] AssignedVars[]" "[99] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[143] L34-1-->$Ultimate##0: Formula: (and (= v_thread2Thread1of1ForFork3_thidvar0_2 2) (= v_thread2Thread1of1ForFork3_thidvar1_2 2)) InVars {} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_20, thread2Thread1of1ForFork3_thidvar0=v_thread2Thread1of1ForFork3_thidvar0_2, thread2Thread1of1ForFork3_thidvar1=v_thread2Thread1of1ForFork3_thidvar1_2, thread2Thread1of1ForFork3_cnt=v_thread2Thread1of1ForFork3_cnt_12} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_j, thread2Thread1of1ForFork3_thidvar0, thread2Thread1of1ForFork3_thidvar1, thread2Thread1of1ForFork3_cnt]" "[102] $Ultimate##0-->L68: Formula: (= v_thread2Thread1of1ForFork3_cnt_1 0) InVars {} OutVars{thread2Thread1of1ForFork3_cnt=v_thread2Thread1of1ForFork3_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_cnt]" "[103] L68-->L69-1: Formula: (= v_thread2Thread1of1ForFork3_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_j]" [2025-04-26 16:53:42,339 INFO L754 eck$LassoCheckResult]: Loop: "[105] L69-1-->L70: Formula: (< v_thread2Thread1of1ForFork3_j_5 v_N_4) InVars {thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_5, N=v_N_4} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_5, N=v_N_4} AuxVars[] AssignedVars[]" "[108] L70-->L70-2: Formula: (<= (select v_A_4 v_thread2Thread1of1ForFork3_j_9) 0) InVars {A=v_A_4, thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_9} OutVars{A=v_A_4, thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_9} AuxVars[] AssignedVars[]" "[111] L70-2-->L73-1: Formula: (<= (select v_B_2 v_thread2Thread1of1ForFork3_j_13) 0) InVars {thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_13, B=v_B_2} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_13, B=v_B_2} AuxVars[] AssignedVars[]" "[113] L73-1-->L69-1: Formula: (= (+ v_thread2Thread1of1ForFork3_j_15 1) v_thread2Thread1of1ForFork3_j_16) InVars {thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_15} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_16} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_j]" [2025-04-26 16:53:42,339 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:42,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1309814216, now seen corresponding path program 1 times [2025-04-26 16:53:42,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:42,340 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996444981] [2025-04-26 16:53:42,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:42,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:42,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:53:42,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:53:42,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:42,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:42,356 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:42,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:53:42,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:53:42,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:42,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:42,365 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:42,365 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:42,366 INFO L85 PathProgramCache]: Analyzing trace with hash 4158918, now seen corresponding path program 2 times [2025-04-26 16:53:42,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:42,366 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383969564] [2025-04-26 16:53:42,366 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:53:42,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:42,373 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:53:42,374 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:53:42,378 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:53:42,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:42,379 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:42,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:53:42,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:53:42,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:42,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:42,383 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:42,384 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:42,384 INFO L85 PathProgramCache]: Analyzing trace with hash -2047126403, now seen corresponding path program 1 times [2025-04-26 16:53:42,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:42,385 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626368018] [2025-04-26 16:53:42,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:42,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:42,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:53:42,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:53:42,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:42,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:42,399 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:42,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:53:42,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:53:42,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:42,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:42,415 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:42,585 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:53:42,585 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:53:42,585 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:53:42,585 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:53:42,585 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:53:42,585 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:42,585 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:53:42,585 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:53:42,585 INFO L132 ssoRankerPreferences]: Filename of dumped script: map-aggr-update1-3modifiers.bpl_petrified1_Iteration3_Lasso [2025-04-26 16:53:42,585 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:53:42,585 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:53:42,587 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:42,591 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:42,593 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:42,596 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:42,693 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:42,697 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:42,866 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:53:42,867 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:53:42,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:42,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:42,870 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:42,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:53:42,872 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:42,884 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:42,884 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:42,884 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:42,884 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:42,887 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:42,887 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:42,890 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:42,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 16:53:42,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:42,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:42,898 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:42,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:53:42,901 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:42,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:42,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:42,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:42,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:42,914 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:42,914 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:42,918 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:42,924 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 16:53:42,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:42,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:42,926 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:42,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:53:42,929 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:42,939 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:42,939 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:42,939 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:42,939 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:42,941 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:42,941 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:42,944 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:42,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:42,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:42,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:42,951 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:42,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:53:42,953 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:42,963 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:42,963 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:53:42,963 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:42,963 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:42,963 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:42,967 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:53:42,967 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:53:42,968 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:42,974 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 16:53:42,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:42,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:42,976 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:42,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:53:42,977 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:42,987 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:42,987 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:53:42,987 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:42,987 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:42,993 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-04-26 16:53:42,993 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:42,997 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:43,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:43,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:43,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:43,006 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:43,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:53:43,009 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:43,019 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:43,019 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:43,019 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:43,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:43,025 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:43,025 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:43,031 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:53:43,046 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:53:43,047 INFO L437 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 16:53:43,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:43,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:43,050 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:43,098 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:53:43,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 16:53:43,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:43,117 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:53:43,117 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:53:43,117 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork3_j, N) = -1*thread2Thread1of1ForFork3_j + 1*N Supporting invariants [] [2025-04-26 16:53:43,124 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 16:53:43,125 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:53:43,136 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:43,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:53:43,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:53:43,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:43,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:43,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:53:43,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:43,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:53:43,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:53:43,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:43,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:43,178 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:53:43,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:43,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:53:43,196 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:53:43,196 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7945 states and 18438 transitions. cyclomatic complexity: 10868 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:43,400 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7945 states and 18438 transitions. cyclomatic complexity: 10868. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 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 17127 states and 38982 transitions. Complement of second has 6 states. [2025-04-26 16:53:43,401 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:53:43,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:43,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2025-04-26 16:53:43,403 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 110 transitions. Stem has 11 letters. Loop has 4 letters. [2025-04-26 16:53:43,403 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:43,403 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 110 transitions. Stem has 15 letters. Loop has 4 letters. [2025-04-26 16:53:43,403 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:43,403 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 110 transitions. Stem has 11 letters. Loop has 8 letters. [2025-04-26 16:53:43,403 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:43,404 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17127 states and 38982 transitions. [2025-04-26 16:53:43,504 INFO L131 ngComponentsAnalysis]: Automaton has 183 accepting balls. 736 [2025-04-26 16:53:43,594 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17127 states to 12434 states and 27957 transitions. [2025-04-26 16:53:43,594 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3751 [2025-04-26 16:53:43,603 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4133 [2025-04-26 16:53:43,604 INFO L74 IsDeterministic]: Start isDeterministic. Operand 12434 states and 27957 transitions. [2025-04-26 16:53:43,604 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:43,604 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12434 states and 27957 transitions. [2025-04-26 16:53:43,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12434 states and 27957 transitions. [2025-04-26 16:53:43,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12434 to 12073. [2025-04-26 16:53:43,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12073 states, 12073 states have (on average 2.2571026256936966) internal successors, (in total 27250), 12072 states have internal predecessors, (27250), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:43,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12073 states to 12073 states and 27250 transitions. [2025-04-26 16:53:43,925 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12073 states and 27250 transitions. [2025-04-26 16:53:43,925 INFO L438 stractBuchiCegarLoop]: Abstraction has 12073 states and 27250 transitions. [2025-04-26 16:53:43,925 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:53:43,925 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12073 states and 27250 transitions. [2025-04-26 16:53:43,961 INFO L131 ngComponentsAnalysis]: Automaton has 183 accepting balls. 736 [2025-04-26 16:53:43,962 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:43,962 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:43,962 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:43,962 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:53:43,963 INFO L752 eck$LassoCheckResult]: Stem: "[90] $Ultimate##0-->L34: Formula: (and (<= 0 v_ULTIMATE.start_m_1) (< v_ULTIMATE.start_m_1 v_N_7)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} AuxVars[] AssignedVars[]" "[140] L34-->$Ultimate##0: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0, thread1Thread1of1ForFork2_i]" "[96] $Ultimate##0-->L55-1: Formula: (= v_thread1Thread1of1ForFork2_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_i]" "[98] L55-1-->L56: Formula: (< v_thread1Thread1of1ForFork2_i_5 v_N_1) InVars {N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} OutVars{N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} AuxVars[] AssignedVars[]" "[100] L56-->L57: Formula: (= v_A_1 (store v_A_2 v_thread1Thread1of1ForFork2_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork2_i_7))) (ite (< .cse0 0) 0 .cse0)))) InVars {A=v_A_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} AuxVars[] AssignedVars[A]" "[101] L57-->L55-1: Formula: (= v_thread1Thread1of1ForFork2_i_10 (+ v_thread1Thread1of1ForFork2_i_9 1)) InVars {thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_9} OutVars{thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_i]" "[97] L55-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork2_i_3) InVars {N=v_N_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_3} OutVars{N=v_N_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_3} AuxVars[] AssignedVars[]" "[99] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[143] L34-1-->$Ultimate##0: Formula: (and (= v_thread2Thread1of1ForFork3_thidvar0_2 2) (= v_thread2Thread1of1ForFork3_thidvar1_2 2)) InVars {} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_20, thread2Thread1of1ForFork3_thidvar0=v_thread2Thread1of1ForFork3_thidvar0_2, thread2Thread1of1ForFork3_thidvar1=v_thread2Thread1of1ForFork3_thidvar1_2, thread2Thread1of1ForFork3_cnt=v_thread2Thread1of1ForFork3_cnt_12} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_j, thread2Thread1of1ForFork3_thidvar0, thread2Thread1of1ForFork3_thidvar1, thread2Thread1of1ForFork3_cnt]" "[102] $Ultimate##0-->L68: Formula: (= v_thread2Thread1of1ForFork3_cnt_1 0) InVars {} OutVars{thread2Thread1of1ForFork3_cnt=v_thread2Thread1of1ForFork3_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_cnt]" "[103] L68-->L69-1: Formula: (= v_thread2Thread1of1ForFork3_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_j]" "[104] L69-1-->thread2FINAL: Formula: (<= v_N_3 v_thread2Thread1of1ForFork3_j_3) InVars {thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_3, N=v_N_3} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_3, N=v_N_3} AuxVars[] AssignedVars[]" "[106] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[146] L35-->$Ultimate##0: Formula: (and (= v_thread3Thread1of1ForFork4_thidvar0_2 3) (= v_thread3Thread1of1ForFork4_thidvar1_2 3) (= v_thread3Thread1of1ForFork4_thidvar2_2 3)) InVars {} OutVars{thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_14, thread3Thread1of1ForFork4_thidvar0=v_thread3Thread1of1ForFork4_thidvar0_2, thread3Thread1of1ForFork4_thidvar1=v_thread3Thread1of1ForFork4_thidvar1_2, thread3Thread1of1ForFork4_thidvar2=v_thread3Thread1of1ForFork4_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork4_k, thread3Thread1of1ForFork4_thidvar0, thread3Thread1of1ForFork4_thidvar1, thread3Thread1of1ForFork4_thidvar2]" "[114] $Ultimate##0-->L87-1: Formula: (= v_thread3Thread1of1ForFork4_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork4_k]" [2025-04-26 16:53:43,963 INFO L754 eck$LassoCheckResult]: Loop: "[116] L87-1-->L88: Formula: (< v_thread3Thread1of1ForFork4_k_5 v_N_5) InVars {thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_5, N=v_N_5} AuxVars[] AssignedVars[]" "[118] L88-->L89: Formula: (= (store v_B_4 v_thread3Thread1of1ForFork4_k_7 v_thread3Thread1of1ForFork4_k_7) v_B_3) InVars {thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_7, B=v_B_4} OutVars{thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_7, B=v_B_3} AuxVars[] AssignedVars[B]" "[119] L89-->L87-1: Formula: (= (+ v_thread3Thread1of1ForFork4_k_9 1) v_thread3Thread1of1ForFork4_k_10) InVars {thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_9} OutVars{thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_10} AuxVars[] AssignedVars[thread3Thread1of1ForFork4_k]" [2025-04-26 16:53:43,963 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:43,963 INFO L85 PathProgramCache]: Analyzing trace with hash -2047157030, now seen corresponding path program 1 times [2025-04-26 16:53:43,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:43,963 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818056561] [2025-04-26 16:53:43,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:43,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:43,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:53:43,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:53:43,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:43,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:44,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-26 16:53:44,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:53:44,028 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818056561] [2025-04-26 16:53:44,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818056561] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:53:44,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:53:44,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:53:44,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880785475] [2025-04-26 16:53:44,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:53:44,028 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:53:44,029 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:44,029 INFO L85 PathProgramCache]: Analyzing trace with hash 145044, now seen corresponding path program 1 times [2025-04-26 16:53:44,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:44,029 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952693515] [2025-04-26 16:53:44,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:44,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:44,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:44,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:44,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:44,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:44,035 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:44,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:44,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:44,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:44,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:44,039 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:44,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:53:44,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:53:44,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-26 16:53:44,057 INFO L87 Difference]: Start difference. First operand 12073 states and 27250 transitions. cyclomatic complexity: 15660 Second operand has 4 states, 4 states have (on average 3.75) internal successors, (in total 15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:44,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:53:44,269 INFO L93 Difference]: Finished difference Result 21035 states and 47006 transitions. [2025-04-26 16:53:44,269 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21035 states and 47006 transitions. [2025-04-26 16:53:44,386 INFO L131 ngComponentsAnalysis]: Automaton has 203 accepting balls. 820 [2025-04-26 16:53:44,510 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21035 states to 21035 states and 47006 transitions. [2025-04-26 16:53:44,510 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6215 [2025-04-26 16:53:44,523 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6215 [2025-04-26 16:53:44,523 INFO L74 IsDeterministic]: Start isDeterministic. Operand 21035 states and 47006 transitions. [2025-04-26 16:53:44,524 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:44,524 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21035 states and 47006 transitions. [2025-04-26 16:53:44,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21035 states and 47006 transitions. [2025-04-26 16:53:44,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21035 to 12999. [2025-04-26 16:53:44,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12999 states, 12999 states have (on average 2.2425571197784446) internal successors, (in total 29151), 12998 states have internal predecessors, (29151), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:45,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12999 states to 12999 states and 29151 transitions. [2025-04-26 16:53:45,000 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12999 states and 29151 transitions. [2025-04-26 16:53:45,001 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 16:53:45,001 INFO L438 stractBuchiCegarLoop]: Abstraction has 12999 states and 29151 transitions. [2025-04-26 16:53:45,001 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:53:45,002 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12999 states and 29151 transitions. [2025-04-26 16:53:45,063 INFO L131 ngComponentsAnalysis]: Automaton has 183 accepting balls. 736 [2025-04-26 16:53:45,063 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:45,063 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:45,064 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:45,064 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:53:45,065 INFO L752 eck$LassoCheckResult]: Stem: "[90] $Ultimate##0-->L34: Formula: (and (<= 0 v_ULTIMATE.start_m_1) (< v_ULTIMATE.start_m_1 v_N_7)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} AuxVars[] AssignedVars[]" "[140] L34-->$Ultimate##0: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0, thread1Thread1of1ForFork2_i]" "[96] $Ultimate##0-->L55-1: Formula: (= v_thread1Thread1of1ForFork2_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_i]" "[98] L55-1-->L56: Formula: (< v_thread1Thread1of1ForFork2_i_5 v_N_1) InVars {N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} OutVars{N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} AuxVars[] AssignedVars[]" "[100] L56-->L57: Formula: (= v_A_1 (store v_A_2 v_thread1Thread1of1ForFork2_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork2_i_7))) (ite (< .cse0 0) 0 .cse0)))) InVars {A=v_A_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} AuxVars[] AssignedVars[A]" "[101] L57-->L55-1: Formula: (= v_thread1Thread1of1ForFork2_i_10 (+ v_thread1Thread1of1ForFork2_i_9 1)) InVars {thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_9} OutVars{thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_i]" "[97] L55-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork2_i_3) InVars {N=v_N_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_3} OutVars{N=v_N_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_3} AuxVars[] AssignedVars[]" "[99] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[143] L34-1-->$Ultimate##0: Formula: (and (= v_thread2Thread1of1ForFork3_thidvar0_2 2) (= v_thread2Thread1of1ForFork3_thidvar1_2 2)) InVars {} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_20, thread2Thread1of1ForFork3_thidvar0=v_thread2Thread1of1ForFork3_thidvar0_2, thread2Thread1of1ForFork3_thidvar1=v_thread2Thread1of1ForFork3_thidvar1_2, thread2Thread1of1ForFork3_cnt=v_thread2Thread1of1ForFork3_cnt_12} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_j, thread2Thread1of1ForFork3_thidvar0, thread2Thread1of1ForFork3_thidvar1, thread2Thread1of1ForFork3_cnt]" "[102] $Ultimate##0-->L68: Formula: (= v_thread2Thread1of1ForFork3_cnt_1 0) InVars {} OutVars{thread2Thread1of1ForFork3_cnt=v_thread2Thread1of1ForFork3_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_cnt]" "[103] L68-->L69-1: Formula: (= v_thread2Thread1of1ForFork3_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_j]" "[105] L69-1-->L70: Formula: (< v_thread2Thread1of1ForFork3_j_5 v_N_4) InVars {thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_5, N=v_N_4} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_5, N=v_N_4} AuxVars[] AssignedVars[]" "[108] L70-->L70-2: Formula: (<= (select v_A_4 v_thread2Thread1of1ForFork3_j_9) 0) InVars {A=v_A_4, thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_9} OutVars{A=v_A_4, thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_9} AuxVars[] AssignedVars[]" "[146] L35-->$Ultimate##0: Formula: (and (= v_thread3Thread1of1ForFork4_thidvar0_2 3) (= v_thread3Thread1of1ForFork4_thidvar1_2 3) (= v_thread3Thread1of1ForFork4_thidvar2_2 3)) InVars {} OutVars{thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_14, thread3Thread1of1ForFork4_thidvar0=v_thread3Thread1of1ForFork4_thidvar0_2, thread3Thread1of1ForFork4_thidvar1=v_thread3Thread1of1ForFork4_thidvar1_2, thread3Thread1of1ForFork4_thidvar2=v_thread3Thread1of1ForFork4_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork4_k, thread3Thread1of1ForFork4_thidvar0, thread3Thread1of1ForFork4_thidvar1, thread3Thread1of1ForFork4_thidvar2]" "[114] $Ultimate##0-->L87-1: Formula: (= v_thread3Thread1of1ForFork4_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork4_k]" [2025-04-26 16:53:45,065 INFO L754 eck$LassoCheckResult]: Loop: "[116] L87-1-->L88: Formula: (< v_thread3Thread1of1ForFork4_k_5 v_N_5) InVars {thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_5, N=v_N_5} AuxVars[] AssignedVars[]" "[118] L88-->L89: Formula: (= (store v_B_4 v_thread3Thread1of1ForFork4_k_7 v_thread3Thread1of1ForFork4_k_7) v_B_3) InVars {thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_7, B=v_B_4} OutVars{thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_7, B=v_B_3} AuxVars[] AssignedVars[B]" "[119] L89-->L87-1: Formula: (= (+ v_thread3Thread1of1ForFork4_k_9 1) v_thread3Thread1of1ForFork4_k_10) InVars {thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_9} OutVars{thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_10} AuxVars[] AssignedVars[thread3Thread1of1ForFork4_k]" [2025-04-26 16:53:45,065 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:45,065 INFO L85 PathProgramCache]: Analyzing trace with hash -2047125317, now seen corresponding path program 1 times [2025-04-26 16:53:45,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:45,065 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654339978] [2025-04-26 16:53:45,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:45,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:45,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:53:45,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:53:45,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:45,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:45,072 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:45,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:53:45,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:53:45,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:45,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:45,079 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:45,079 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:45,079 INFO L85 PathProgramCache]: Analyzing trace with hash 145044, now seen corresponding path program 2 times [2025-04-26 16:53:45,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:45,079 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080572022] [2025-04-26 16:53:45,079 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:53:45,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:45,085 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:45,086 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:45,086 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:53:45,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:45,086 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:45,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:45,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:45,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:45,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:45,089 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:45,089 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:45,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1669567590, now seen corresponding path program 1 times [2025-04-26 16:53:45,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:45,089 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165656705] [2025-04-26 16:53:45,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:45,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:45,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:53:45,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:53:45,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:45,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:45,101 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:45,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:53:45,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:53:45,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:45,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:45,115 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:45,297 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:53:45,298 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:53:45,298 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:53:45,298 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:53:45,298 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:53:45,298 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:45,298 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:53:45,298 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:53:45,298 INFO L132 ssoRankerPreferences]: Filename of dumped script: map-aggr-update1-3modifiers.bpl_petrified1_Iteration5_Lasso [2025-04-26 16:53:45,298 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:53:45,298 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:53:45,299 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:45,302 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:45,304 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:45,306 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:45,309 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:45,311 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:45,313 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:45,333 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:45,335 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:45,337 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:45,339 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:45,458 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:53:45,458 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:53:45,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:45,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:45,461 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:45,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 16:53:45,463 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:45,473 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:45,473 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:45,473 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:45,473 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:45,475 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:45,475 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:45,480 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:45,486 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 16:53:45,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:45,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:45,489 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:45,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 16:53:45,549 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:45,560 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:45,560 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:45,560 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:45,560 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:45,561 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:45,562 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:45,564 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:45,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 16:53:45,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:45,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:45,572 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:45,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 16:53:45,574 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:45,584 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:45,584 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:45,584 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:45,584 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:45,586 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:45,586 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:45,589 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:45,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:45,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:45,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:45,596 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:45,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 16:53:45,601 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:45,611 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:45,611 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:45,611 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:45,611 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:45,612 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:45,612 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:45,614 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:45,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:45,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:45,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:45,622 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:45,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 16:53:45,625 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:45,634 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:45,635 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:45,635 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:45,635 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:45,636 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:45,636 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:45,638 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:45,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:45,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:45,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:45,646 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:45,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 16:53:45,649 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:45,659 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:45,659 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:45,659 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:45,659 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:45,660 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:45,660 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:45,676 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:45,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:45,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:45,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:45,713 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:45,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 16:53:45,715 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:45,725 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:45,725 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:45,725 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:45,725 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:45,727 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:45,727 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:45,730 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:45,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-04-26 16:53:45,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:45,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:45,738 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:45,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 16:53:45,739 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:45,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:45,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:45,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:45,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:45,750 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:45,750 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:45,752 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:45,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-04-26 16:53:45,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:45,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:45,761 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:45,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 16:53:45,763 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:45,773 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:45,773 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:45,773 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:45,773 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:45,775 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:45,775 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:45,778 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:45,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:45,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:45,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:45,787 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:45,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 16:53:45,792 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:45,802 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:45,802 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:45,802 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:45,802 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:45,804 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:45,804 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:45,806 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:45,812 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 16:53:45,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:45,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:45,815 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 16:53:45,816 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 16:53:45,817 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:45,828 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:45,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:45,828 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:45,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:45,832 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:45,832 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:45,836 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:53:45,846 INFO L436 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-04-26 16:53:45,846 INFO L437 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 16:53:45,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:45,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:45,848 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 16:53:45,849 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 16:53:45,850 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:53:45,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:45,868 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:53:45,868 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:53:45,868 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread3Thread1of1ForFork4_k, N) = -1*thread3Thread1of1ForFork4_k + 1*N Supporting invariants [] [2025-04-26 16:53:45,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-04-26 16:53:45,875 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:53:45,885 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:45,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:53:45,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:53:45,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:45,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:45,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:53:45,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:45,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:45,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:45,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:45,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:45,917 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:53:45,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:45,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:53:45,932 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:53:45,933 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12999 states and 29151 transitions. cyclomatic complexity: 16667 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (in total 18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:46,117 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12999 states and 29151 transitions. cyclomatic complexity: 16667. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (in total 18), 3 states have internal predecessors, (18), 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 28019 states and 61429 transitions. Complement of second has 6 states. [2025-04-26 16:53:46,117 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:53:46,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (in total 18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:46,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2025-04-26 16:53:46,118 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 116 transitions. Stem has 15 letters. Loop has 3 letters. [2025-04-26 16:53:46,118 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:46,118 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 116 transitions. Stem has 18 letters. Loop has 3 letters. [2025-04-26 16:53:46,118 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:46,118 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 116 transitions. Stem has 15 letters. Loop has 6 letters. [2025-04-26 16:53:46,118 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:46,118 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28019 states and 61429 transitions. [2025-04-26 16:53:46,380 INFO L131 ngComponentsAnalysis]: Automaton has 132 accepting balls. 460 [2025-04-26 16:53:46,486 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28019 states to 19734 states and 42668 transitions. [2025-04-26 16:53:46,486 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5080 [2025-04-26 16:53:46,496 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5354 [2025-04-26 16:53:46,497 INFO L74 IsDeterministic]: Start isDeterministic. Operand 19734 states and 42668 transitions. [2025-04-26 16:53:46,497 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:46,497 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19734 states and 42668 transitions. [2025-04-26 16:53:46,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19734 states and 42668 transitions. [2025-04-26 16:53:46,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19734 to 19267. [2025-04-26 16:53:46,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19267 states, 19267 states have (on average 2.179529765921005) internal successors, (in total 41993), 19266 states have internal predecessors, (41993), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:46,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19267 states to 19267 states and 41993 transitions. [2025-04-26 16:53:46,783 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19267 states and 41993 transitions. [2025-04-26 16:53:46,783 INFO L438 stractBuchiCegarLoop]: Abstraction has 19267 states and 41993 transitions. [2025-04-26 16:53:46,783 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:53:46,783 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19267 states and 41993 transitions. [2025-04-26 16:53:46,865 INFO L131 ngComponentsAnalysis]: Automaton has 132 accepting balls. 460 [2025-04-26 16:53:46,866 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:46,866 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:46,866 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:46,866 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:53:46,867 INFO L752 eck$LassoCheckResult]: Stem: "[90] $Ultimate##0-->L34: Formula: (and (<= 0 v_ULTIMATE.start_m_1) (< v_ULTIMATE.start_m_1 v_N_7)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} AuxVars[] AssignedVars[]" "[140] L34-->$Ultimate##0: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0, thread1Thread1of1ForFork2_i]" "[96] $Ultimate##0-->L55-1: Formula: (= v_thread1Thread1of1ForFork2_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_i]" "[98] L55-1-->L56: Formula: (< v_thread1Thread1of1ForFork2_i_5 v_N_1) InVars {N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} OutVars{N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} AuxVars[] AssignedVars[]" "[100] L56-->L57: Formula: (= v_A_1 (store v_A_2 v_thread1Thread1of1ForFork2_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork2_i_7))) (ite (< .cse0 0) 0 .cse0)))) InVars {A=v_A_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} AuxVars[] AssignedVars[A]" "[101] L57-->L55-1: Formula: (= v_thread1Thread1of1ForFork2_i_10 (+ v_thread1Thread1of1ForFork2_i_9 1)) InVars {thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_9} OutVars{thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_i]" "[97] L55-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork2_i_3) InVars {N=v_N_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_3} OutVars{N=v_N_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_3} AuxVars[] AssignedVars[]" "[99] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[143] L34-1-->$Ultimate##0: Formula: (and (= v_thread2Thread1of1ForFork3_thidvar0_2 2) (= v_thread2Thread1of1ForFork3_thidvar1_2 2)) InVars {} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_20, thread2Thread1of1ForFork3_thidvar0=v_thread2Thread1of1ForFork3_thidvar0_2, thread2Thread1of1ForFork3_thidvar1=v_thread2Thread1of1ForFork3_thidvar1_2, thread2Thread1of1ForFork3_cnt=v_thread2Thread1of1ForFork3_cnt_12} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_j, thread2Thread1of1ForFork3_thidvar0, thread2Thread1of1ForFork3_thidvar1, thread2Thread1of1ForFork3_cnt]" "[102] $Ultimate##0-->L68: Formula: (= v_thread2Thread1of1ForFork3_cnt_1 0) InVars {} OutVars{thread2Thread1of1ForFork3_cnt=v_thread2Thread1of1ForFork3_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_cnt]" "[103] L68-->L69-1: Formula: (= v_thread2Thread1of1ForFork3_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_j]" "[105] L69-1-->L70: Formula: (< v_thread2Thread1of1ForFork3_j_5 v_N_4) InVars {thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_5, N=v_N_4} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_5, N=v_N_4} AuxVars[] AssignedVars[]" "[108] L70-->L70-2: Formula: (<= (select v_A_4 v_thread2Thread1of1ForFork3_j_9) 0) InVars {A=v_A_4, thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_9} OutVars{A=v_A_4, thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_9} AuxVars[] AssignedVars[]" "[146] L35-->$Ultimate##0: Formula: (and (= v_thread3Thread1of1ForFork4_thidvar0_2 3) (= v_thread3Thread1of1ForFork4_thidvar1_2 3) (= v_thread3Thread1of1ForFork4_thidvar2_2 3)) InVars {} OutVars{thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_14, thread3Thread1of1ForFork4_thidvar0=v_thread3Thread1of1ForFork4_thidvar0_2, thread3Thread1of1ForFork4_thidvar1=v_thread3Thread1of1ForFork4_thidvar1_2, thread3Thread1of1ForFork4_thidvar2=v_thread3Thread1of1ForFork4_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork4_k, thread3Thread1of1ForFork4_thidvar0, thread3Thread1of1ForFork4_thidvar1, thread3Thread1of1ForFork4_thidvar2]" "[114] $Ultimate##0-->L87-1: Formula: (= v_thread3Thread1of1ForFork4_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork4_k]" "[116] L87-1-->L88: Formula: (< v_thread3Thread1of1ForFork4_k_5 v_N_5) InVars {thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_5, N=v_N_5} AuxVars[] AssignedVars[]" "[134] L36-->$Ultimate##0: Formula: (and (= 4 v_thread3Thread1of1ForFork0_thidvar1_2) (= 4 v_thread3Thread1of1ForFork0_thidvar0_2) (= 4 v_thread3Thread1of1ForFork0_thidvar2_2) (= 4 v_thread3Thread1of1ForFork0_thidvar3_2)) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_14, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_2, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k, thread3Thread1of1ForFork0_thidvar3, thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0]" "[120] $Ultimate##0-->L87-1: Formula: (= v_thread3Thread1of1ForFork0_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k]" [2025-04-26 16:53:46,867 INFO L754 eck$LassoCheckResult]: Loop: "[122] L87-1-->L88: Formula: (< v_thread3Thread1of1ForFork0_k_5 v_N_5) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} AuxVars[] AssignedVars[]" "[124] L88-->L89: Formula: (= (store v_B_4 v_thread3Thread1of1ForFork0_k_7 v_thread3Thread1of1ForFork0_k_7) v_B_3) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_7, B=v_B_4} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_7, B=v_B_3} AuxVars[] AssignedVars[B]" "[125] L89-->L87-1: Formula: (= v_thread3Thread1of1ForFork0_k_10 (+ v_thread3Thread1of1ForFork0_k_9 1)) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_9} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_10} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k]" [2025-04-26 16:53:46,867 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:46,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1669567093, now seen corresponding path program 1 times [2025-04-26 16:53:46,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:46,867 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021215137] [2025-04-26 16:53:46,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:46,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:46,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:53:46,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:53:46,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:46,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:46,879 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:46,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:53:46,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:53:46,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:46,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:46,892 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:46,893 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:46,893 INFO L85 PathProgramCache]: Analyzing trace with hash 151002, now seen corresponding path program 1 times [2025-04-26 16:53:46,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:46,893 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462883017] [2025-04-26 16:53:46,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:46,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:46,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:46,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:46,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:46,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:46,899 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:46,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:46,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:46,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:46,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:46,905 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:46,905 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:46,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1943108624, now seen corresponding path program 1 times [2025-04-26 16:53:46,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:46,905 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359578721] [2025-04-26 16:53:46,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:46,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:46,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 16:53:46,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 16:53:46,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:46,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:46,917 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:46,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 16:53:46,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 16:53:46,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:46,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:46,933 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:47,270 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:53:47,271 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:53:47,271 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:53:47,271 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:53:47,271 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:53:47,271 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:47,271 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:53:47,271 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:53:47,271 INFO L132 ssoRankerPreferences]: Filename of dumped script: map-aggr-update1-3modifiers.bpl_petrified1_Iteration6_Lasso [2025-04-26 16:53:47,271 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:53:47,271 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:53:47,272 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:47,275 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:47,277 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:47,279 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:47,281 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:47,284 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:47,286 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:47,288 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:47,290 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:47,292 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:47,294 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:47,296 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:47,298 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:47,308 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:47,310 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:47,312 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:47,453 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:53:47,453 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:53:47,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:47,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:47,455 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 16:53:47,456 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 16:53:47,457 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:47,467 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:47,468 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:47,468 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:47,468 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:47,469 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:47,469 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:47,472 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:47,478 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 16:53:47,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:47,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:47,480 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 16:53:47,481 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 16:53:47,486 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:47,497 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:47,497 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:47,497 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:47,497 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:47,499 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:47,499 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:47,502 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:47,507 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 16:53:47,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:47,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:47,509 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:47,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-04-26 16:53:47,511 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:47,521 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:47,521 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:47,521 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:47,521 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:47,522 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:47,522 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:47,524 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:47,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-04-26 16:53:47,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:47,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:47,531 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:47,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-04-26 16:53:47,532 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:47,542 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:47,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:47,542 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:47,542 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:47,543 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:47,543 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:47,545 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:47,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:47,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:47,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:47,553 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:47,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-04-26 16:53:47,555 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:47,564 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:47,564 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:47,564 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:47,564 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:47,565 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:47,565 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:47,567 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:47,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-04-26 16:53:47,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:47,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:47,575 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:47,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-04-26 16:53:47,577 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:47,587 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:47,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:47,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:47,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:47,589 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:47,589 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:47,591 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:47,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-04-26 16:53:47,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:47,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:47,598 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:47,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-04-26 16:53:47,601 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:47,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:47,612 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:47,612 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:47,612 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:47,613 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:47,613 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:47,616 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:47,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-04-26 16:53:47,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:47,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:47,624 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:47,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-04-26 16:53:47,626 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:47,636 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:47,636 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:47,636 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:47,636 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:47,637 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:47,637 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:47,639 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:47,645 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-04-26 16:53:47,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:47,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:47,647 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:47,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-04-26 16:53:47,649 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:47,659 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:47,659 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:47,659 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:47,659 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:47,660 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:47,660 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:47,662 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:47,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-04-26 16:53:47,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:47,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:47,669 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:47,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-04-26 16:53:47,671 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:47,681 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:47,681 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:47,681 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:47,681 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:47,682 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:47,682 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:47,684 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:47,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-04-26 16:53:47,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:47,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:47,692 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:47,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-04-26 16:53:47,693 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:47,703 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:47,703 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:47,703 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:47,703 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:47,704 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:47,704 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:47,706 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:47,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-04-26 16:53:47,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:47,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:47,713 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:47,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-04-26 16:53:47,715 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:47,725 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:47,725 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:47,725 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:47,725 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:47,726 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:47,726 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:47,728 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:47,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-04-26 16:53:47,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:47,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:47,735 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:47,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-04-26 16:53:47,737 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:47,746 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:47,747 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:47,747 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:47,747 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:47,749 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:47,749 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:47,753 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:53:47,758 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 16:53:47,759 INFO L437 ModelExtractionUtils]: 4 out of 13 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-04-26 16:53:47,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:47,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:47,760 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:47,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-04-26 16:53:47,762 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:53:47,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2025-04-26 16:53:47,777 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:53:47,778 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:53:47,778 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread3Thread1of1ForFork0_k, N) = -1*thread3Thread1of1ForFork0_k + 1*N Supporting invariants [] [2025-04-26 16:53:47,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-04-26 16:53:47,784 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:53:47,793 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:47,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:53:47,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:53:47,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:47,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:47,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:53:47,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:47,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:47,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:47,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:47,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:47,829 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:53:47,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:47,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:53:47,842 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:53:47,842 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19267 states and 41993 transitions. cyclomatic complexity: 23460 Second operand has 3 states, 3 states have (on average 7.0) internal successors, (in total 21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:48,058 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19267 states and 41993 transitions. cyclomatic complexity: 23460. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (in total 21), 3 states have internal predecessors, (21), 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 40403 states and 86523 transitions. Complement of second has 6 states. [2025-04-26 16:53:48,058 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:53:48,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (in total 21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:48,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2025-04-26 16:53:48,059 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 120 transitions. Stem has 18 letters. Loop has 3 letters. [2025-04-26 16:53:48,059 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:48,059 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 120 transitions. Stem has 21 letters. Loop has 3 letters. [2025-04-26 16:53:48,059 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:48,059 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 120 transitions. Stem has 18 letters. Loop has 6 letters. [2025-04-26 16:53:48,059 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:48,059 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40403 states and 86523 transitions. [2025-04-26 16:53:48,400 INFO L131 ngComponentsAnalysis]: Automaton has 71 accepting balls. 213 [2025-04-26 16:53:48,533 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40403 states to 24548 states and 51650 transitions. [2025-04-26 16:53:48,533 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5694 [2025-04-26 16:53:48,543 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5881 [2025-04-26 16:53:48,543 INFO L74 IsDeterministic]: Start isDeterministic. Operand 24548 states and 51650 transitions. [2025-04-26 16:53:48,543 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:48,543 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24548 states and 51650 transitions. [2025-04-26 16:53:48,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24548 states and 51650 transitions. [2025-04-26 16:53:48,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24548 to 24051. [2025-04-26 16:53:49,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24051 states, 24051 states have (on average 2.1190802877219244) internal successors, (in total 50966), 24050 states have internal predecessors, (50966), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:49,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24051 states to 24051 states and 50966 transitions. [2025-04-26 16:53:49,079 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24051 states and 50966 transitions. [2025-04-26 16:53:49,079 INFO L438 stractBuchiCegarLoop]: Abstraction has 24051 states and 50966 transitions. [2025-04-26 16:53:49,079 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 16:53:49,079 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24051 states and 50966 transitions. [2025-04-26 16:53:49,175 INFO L131 ngComponentsAnalysis]: Automaton has 71 accepting balls. 213 [2025-04-26 16:53:49,176 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:49,176 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:49,176 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:49,176 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:53:49,177 INFO L752 eck$LassoCheckResult]: Stem: "[90] $Ultimate##0-->L34: Formula: (and (<= 0 v_ULTIMATE.start_m_1) (< v_ULTIMATE.start_m_1 v_N_7)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} AuxVars[] AssignedVars[]" "[140] L34-->$Ultimate##0: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0, thread1Thread1of1ForFork2_i]" "[96] $Ultimate##0-->L55-1: Formula: (= v_thread1Thread1of1ForFork2_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_i]" "[98] L55-1-->L56: Formula: (< v_thread1Thread1of1ForFork2_i_5 v_N_1) InVars {N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} OutVars{N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} AuxVars[] AssignedVars[]" "[100] L56-->L57: Formula: (= v_A_1 (store v_A_2 v_thread1Thread1of1ForFork2_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork2_i_7))) (ite (< .cse0 0) 0 .cse0)))) InVars {A=v_A_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} AuxVars[] AssignedVars[A]" "[101] L57-->L55-1: Formula: (= v_thread1Thread1of1ForFork2_i_10 (+ v_thread1Thread1of1ForFork2_i_9 1)) InVars {thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_9} OutVars{thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_i]" "[97] L55-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork2_i_3) InVars {N=v_N_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_3} OutVars{N=v_N_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_3} AuxVars[] AssignedVars[]" "[99] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[143] L34-1-->$Ultimate##0: Formula: (and (= v_thread2Thread1of1ForFork3_thidvar0_2 2) (= v_thread2Thread1of1ForFork3_thidvar1_2 2)) InVars {} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_20, thread2Thread1of1ForFork3_thidvar0=v_thread2Thread1of1ForFork3_thidvar0_2, thread2Thread1of1ForFork3_thidvar1=v_thread2Thread1of1ForFork3_thidvar1_2, thread2Thread1of1ForFork3_cnt=v_thread2Thread1of1ForFork3_cnt_12} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_j, thread2Thread1of1ForFork3_thidvar0, thread2Thread1of1ForFork3_thidvar1, thread2Thread1of1ForFork3_cnt]" "[102] $Ultimate##0-->L68: Formula: (= v_thread2Thread1of1ForFork3_cnt_1 0) InVars {} OutVars{thread2Thread1of1ForFork3_cnt=v_thread2Thread1of1ForFork3_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_cnt]" "[103] L68-->L69-1: Formula: (= v_thread2Thread1of1ForFork3_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_j]" "[105] L69-1-->L70: Formula: (< v_thread2Thread1of1ForFork3_j_5 v_N_4) InVars {thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_5, N=v_N_4} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_5, N=v_N_4} AuxVars[] AssignedVars[]" "[108] L70-->L70-2: Formula: (<= (select v_A_4 v_thread2Thread1of1ForFork3_j_9) 0) InVars {A=v_A_4, thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_9} OutVars{A=v_A_4, thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_9} AuxVars[] AssignedVars[]" "[146] L35-->$Ultimate##0: Formula: (and (= v_thread3Thread1of1ForFork4_thidvar0_2 3) (= v_thread3Thread1of1ForFork4_thidvar1_2 3) (= v_thread3Thread1of1ForFork4_thidvar2_2 3)) InVars {} OutVars{thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_14, thread3Thread1of1ForFork4_thidvar0=v_thread3Thread1of1ForFork4_thidvar0_2, thread3Thread1of1ForFork4_thidvar1=v_thread3Thread1of1ForFork4_thidvar1_2, thread3Thread1of1ForFork4_thidvar2=v_thread3Thread1of1ForFork4_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork4_k, thread3Thread1of1ForFork4_thidvar0, thread3Thread1of1ForFork4_thidvar1, thread3Thread1of1ForFork4_thidvar2]" "[114] $Ultimate##0-->L87-1: Formula: (= v_thread3Thread1of1ForFork4_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork4_k]" "[116] L87-1-->L88: Formula: (< v_thread3Thread1of1ForFork4_k_5 v_N_5) InVars {thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_5, N=v_N_5} AuxVars[] AssignedVars[]" "[134] L36-->$Ultimate##0: Formula: (and (= 4 v_thread3Thread1of1ForFork0_thidvar1_2) (= 4 v_thread3Thread1of1ForFork0_thidvar0_2) (= 4 v_thread3Thread1of1ForFork0_thidvar2_2) (= 4 v_thread3Thread1of1ForFork0_thidvar3_2)) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_14, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_2, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k, thread3Thread1of1ForFork0_thidvar3, thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0]" "[120] $Ultimate##0-->L87-1: Formula: (= v_thread3Thread1of1ForFork0_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k]" "[122] L87-1-->L88: Formula: (< v_thread3Thread1of1ForFork0_k_5 v_N_5) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} AuxVars[] AssignedVars[]" "[137] L37-->$Ultimate##0: Formula: (and (= 5 v_thread3Thread1of1ForFork1_thidvar1_2) (= 5 v_thread3Thread1of1ForFork1_thidvar2_2) (= 5 v_thread3Thread1of1ForFork1_thidvar3_2) (= 5 v_thread3Thread1of1ForFork1_thidvar0_2) (= 5 v_thread3Thread1of1ForFork1_thidvar4_2)) InVars {} OutVars{thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_14, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_2, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_2, thread3Thread1of1ForFork1_thidvar4=v_thread3Thread1of1ForFork1_thidvar4_2, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_2, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_k, thread3Thread1of1ForFork1_thidvar0, thread3Thread1of1ForFork1_thidvar3, thread3Thread1of1ForFork1_thidvar4, thread3Thread1of1ForFork1_thidvar1, thread3Thread1of1ForFork1_thidvar2]" "[126] $Ultimate##0-->L87-1: Formula: (= v_thread3Thread1of1ForFork1_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_k]" "[128] L87-1-->L88: Formula: (< v_thread3Thread1of1ForFork1_k_5 v_N_5) InVars {N=v_N_5, thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_5} OutVars{N=v_N_5, thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_5} AuxVars[] AssignedVars[]" "[147] thread1EXIT-->L39: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_4) InVars {thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[]" [2025-04-26 16:53:49,177 INFO L754 eck$LassoCheckResult]: Loop: "[130] L88-->L89: Formula: (= v_B_3 (store v_B_4 v_thread3Thread1of1ForFork1_k_7 v_thread3Thread1of1ForFork1_k_7)) InVars {thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_7, B=v_B_4} OutVars{thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_7, B=v_B_3} AuxVars[] AssignedVars[B]" "[131] L89-->L87-1: Formula: (= (+ v_thread3Thread1of1ForFork1_k_9 1) v_thread3Thread1of1ForFork1_k_10) InVars {thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_9} OutVars{thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_10} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_k]" "[128] L87-1-->L88: Formula: (< v_thread3Thread1of1ForFork1_k_5 v_N_5) InVars {N=v_N_5, thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_5} OutVars{N=v_N_5, thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_5} AuxVars[] AssignedVars[]" [2025-04-26 16:53:49,177 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:49,177 INFO L85 PathProgramCache]: Analyzing trace with hash -982993737, now seen corresponding path program 1 times [2025-04-26 16:53:49,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:49,177 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145027429] [2025-04-26 16:53:49,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:49,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:49,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-26 16:53:49,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-26 16:53:49,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:49,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:49,185 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:49,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-26 16:53:49,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-26 16:53:49,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:49,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:49,194 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:49,194 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:49,194 INFO L85 PathProgramCache]: Analyzing trace with hash 158910, now seen corresponding path program 1 times [2025-04-26 16:53:49,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:49,194 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570744477] [2025-04-26 16:53:49,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:49,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:49,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:49,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:49,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:49,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:49,199 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:49,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:49,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:49,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:49,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:49,201 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:49,201 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:49,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1279265720, now seen corresponding path program 1 times [2025-04-26 16:53:49,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:49,201 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148656334] [2025-04-26 16:53:49,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:49,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:49,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 16:53:49,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:53:49,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:49,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:49,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:53:49,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:53:49,291 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148656334] [2025-04-26 16:53:49,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148656334] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 16:53:49,291 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910519627] [2025-04-26 16:53:49,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:49,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 16:53:49,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:49,298 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-26 16:53:49,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2025-04-26 16:53:49,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 16:53:49,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:53:49,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:49,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:49,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-26 16:53:49,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:49,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:53:49,387 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-26 16:53:49,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:53:49,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910519627] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-26 16:53:49,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-26 16:53:49,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2025-04-26 16:53:49,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140180988] [2025-04-26 16:53:49,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-26 16:53:49,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:53:49,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-26 16:53:49,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-04-26 16:53:49,441 INFO L87 Difference]: Start difference. First operand 24051 states and 50966 transitions. cyclomatic complexity: 27850 Second operand has 10 states, 9 states have (on average 4.111111111111111) internal successors, (in total 37), 10 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:49,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:53:49,764 INFO L93 Difference]: Finished difference Result 24986 states and 52345 transitions. [2025-04-26 16:53:49,764 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24986 states and 52345 transitions. [2025-04-26 16:53:49,897 INFO L131 ngComponentsAnalysis]: Automaton has 71 accepting balls. 213 [2025-04-26 16:53:50,017 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24986 states to 24069 states and 50990 transitions. [2025-04-26 16:53:50,017 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5693 [2025-04-26 16:53:50,029 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5693 [2025-04-26 16:53:50,030 INFO L74 IsDeterministic]: Start isDeterministic. Operand 24069 states and 50990 transitions. [2025-04-26 16:53:50,030 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:50,030 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24069 states and 50990 transitions. [2025-04-26 16:53:50,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24069 states and 50990 transitions. [2025-04-26 16:53:50,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24069 to 24057. [2025-04-26 16:53:50,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24057 states, 24057 states have (on average 2.118842748472378) internal successors, (in total 50973), 24056 states have internal predecessors, (50973), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:50,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24057 states to 24057 states and 50973 transitions. [2025-04-26 16:53:50,497 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24057 states and 50973 transitions. [2025-04-26 16:53:50,497 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-26 16:53:50,497 INFO L438 stractBuchiCegarLoop]: Abstraction has 24057 states and 50973 transitions. [2025-04-26 16:53:50,498 INFO L340 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-04-26 16:53:50,498 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24057 states and 50973 transitions. [2025-04-26 16:53:50,581 INFO L131 ngComponentsAnalysis]: Automaton has 71 accepting balls. 213 [2025-04-26 16:53:50,581 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:50,581 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:50,582 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:50,582 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:53:50,582 INFO L752 eck$LassoCheckResult]: Stem: "[90] $Ultimate##0-->L34: Formula: (and (<= 0 v_ULTIMATE.start_m_1) (< v_ULTIMATE.start_m_1 v_N_7)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} AuxVars[] AssignedVars[]" "[140] L34-->$Ultimate##0: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0, thread1Thread1of1ForFork2_i]" "[96] $Ultimate##0-->L55-1: Formula: (= v_thread1Thread1of1ForFork2_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_i]" "[98] L55-1-->L56: Formula: (< v_thread1Thread1of1ForFork2_i_5 v_N_1) InVars {N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} OutVars{N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} AuxVars[] AssignedVars[]" "[100] L56-->L57: Formula: (= v_A_1 (store v_A_2 v_thread1Thread1of1ForFork2_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork2_i_7))) (ite (< .cse0 0) 0 .cse0)))) InVars {A=v_A_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} AuxVars[] AssignedVars[A]" "[101] L57-->L55-1: Formula: (= v_thread1Thread1of1ForFork2_i_10 (+ v_thread1Thread1of1ForFork2_i_9 1)) InVars {thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_9} OutVars{thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_i]" "[98] L55-1-->L56: Formula: (< v_thread1Thread1of1ForFork2_i_5 v_N_1) InVars {N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} OutVars{N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} AuxVars[] AssignedVars[]" "[100] L56-->L57: Formula: (= v_A_1 (store v_A_2 v_thread1Thread1of1ForFork2_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork2_i_7))) (ite (< .cse0 0) 0 .cse0)))) InVars {A=v_A_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} AuxVars[] AssignedVars[A]" "[101] L57-->L55-1: Formula: (= v_thread1Thread1of1ForFork2_i_10 (+ v_thread1Thread1of1ForFork2_i_9 1)) InVars {thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_9} OutVars{thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_i]" "[97] L55-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork2_i_3) InVars {N=v_N_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_3} OutVars{N=v_N_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_3} AuxVars[] AssignedVars[]" "[99] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[143] L34-1-->$Ultimate##0: Formula: (and (= v_thread2Thread1of1ForFork3_thidvar0_2 2) (= v_thread2Thread1of1ForFork3_thidvar1_2 2)) InVars {} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_20, thread2Thread1of1ForFork3_thidvar0=v_thread2Thread1of1ForFork3_thidvar0_2, thread2Thread1of1ForFork3_thidvar1=v_thread2Thread1of1ForFork3_thidvar1_2, thread2Thread1of1ForFork3_cnt=v_thread2Thread1of1ForFork3_cnt_12} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_j, thread2Thread1of1ForFork3_thidvar0, thread2Thread1of1ForFork3_thidvar1, thread2Thread1of1ForFork3_cnt]" "[102] $Ultimate##0-->L68: Formula: (= v_thread2Thread1of1ForFork3_cnt_1 0) InVars {} OutVars{thread2Thread1of1ForFork3_cnt=v_thread2Thread1of1ForFork3_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_cnt]" "[103] L68-->L69-1: Formula: (= v_thread2Thread1of1ForFork3_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_j]" "[105] L69-1-->L70: Formula: (< v_thread2Thread1of1ForFork3_j_5 v_N_4) InVars {thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_5, N=v_N_4} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_5, N=v_N_4} AuxVars[] AssignedVars[]" "[108] L70-->L70-2: Formula: (<= (select v_A_4 v_thread2Thread1of1ForFork3_j_9) 0) InVars {A=v_A_4, thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_9} OutVars{A=v_A_4, thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_9} AuxVars[] AssignedVars[]" "[146] L35-->$Ultimate##0: Formula: (and (= v_thread3Thread1of1ForFork4_thidvar0_2 3) (= v_thread3Thread1of1ForFork4_thidvar1_2 3) (= v_thread3Thread1of1ForFork4_thidvar2_2 3)) InVars {} OutVars{thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_14, thread3Thread1of1ForFork4_thidvar0=v_thread3Thread1of1ForFork4_thidvar0_2, thread3Thread1of1ForFork4_thidvar1=v_thread3Thread1of1ForFork4_thidvar1_2, thread3Thread1of1ForFork4_thidvar2=v_thread3Thread1of1ForFork4_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork4_k, thread3Thread1of1ForFork4_thidvar0, thread3Thread1of1ForFork4_thidvar1, thread3Thread1of1ForFork4_thidvar2]" "[114] $Ultimate##0-->L87-1: Formula: (= v_thread3Thread1of1ForFork4_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork4_k]" "[116] L87-1-->L88: Formula: (< v_thread3Thread1of1ForFork4_k_5 v_N_5) InVars {thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_5, N=v_N_5} AuxVars[] AssignedVars[]" "[134] L36-->$Ultimate##0: Formula: (and (= 4 v_thread3Thread1of1ForFork0_thidvar1_2) (= 4 v_thread3Thread1of1ForFork0_thidvar0_2) (= 4 v_thread3Thread1of1ForFork0_thidvar2_2) (= 4 v_thread3Thread1of1ForFork0_thidvar3_2)) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_14, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_2, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k, thread3Thread1of1ForFork0_thidvar3, thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0]" "[120] $Ultimate##0-->L87-1: Formula: (= v_thread3Thread1of1ForFork0_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k]" "[122] L87-1-->L88: Formula: (< v_thread3Thread1of1ForFork0_k_5 v_N_5) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} AuxVars[] AssignedVars[]" "[137] L37-->$Ultimate##0: Formula: (and (= 5 v_thread3Thread1of1ForFork1_thidvar1_2) (= 5 v_thread3Thread1of1ForFork1_thidvar2_2) (= 5 v_thread3Thread1of1ForFork1_thidvar3_2) (= 5 v_thread3Thread1of1ForFork1_thidvar0_2) (= 5 v_thread3Thread1of1ForFork1_thidvar4_2)) InVars {} OutVars{thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_14, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_2, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_2, thread3Thread1of1ForFork1_thidvar4=v_thread3Thread1of1ForFork1_thidvar4_2, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_2, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_k, thread3Thread1of1ForFork1_thidvar0, thread3Thread1of1ForFork1_thidvar3, thread3Thread1of1ForFork1_thidvar4, thread3Thread1of1ForFork1_thidvar1, thread3Thread1of1ForFork1_thidvar2]" "[126] $Ultimate##0-->L87-1: Formula: (= v_thread3Thread1of1ForFork1_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_k]" "[128] L87-1-->L88: Formula: (< v_thread3Thread1of1ForFork1_k_5 v_N_5) InVars {N=v_N_5, thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_5} OutVars{N=v_N_5, thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_5} AuxVars[] AssignedVars[]" "[147] thread1EXIT-->L39: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_4) InVars {thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[]" [2025-04-26 16:53:50,582 INFO L754 eck$LassoCheckResult]: Loop: "[130] L88-->L89: Formula: (= v_B_3 (store v_B_4 v_thread3Thread1of1ForFork1_k_7 v_thread3Thread1of1ForFork1_k_7)) InVars {thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_7, B=v_B_4} OutVars{thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_7, B=v_B_3} AuxVars[] AssignedVars[B]" "[131] L89-->L87-1: Formula: (= (+ v_thread3Thread1of1ForFork1_k_9 1) v_thread3Thread1of1ForFork1_k_10) InVars {thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_9} OutVars{thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_10} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_k]" "[128] L87-1-->L88: Formula: (< v_thread3Thread1of1ForFork1_k_5 v_N_5) InVars {N=v_N_5, thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_5} OutVars{N=v_N_5, thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_5} AuxVars[] AssignedVars[]" [2025-04-26 16:53:50,583 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:50,583 INFO L85 PathProgramCache]: Analyzing trace with hash -3961760, now seen corresponding path program 2 times [2025-04-26 16:53:50,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:50,583 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144696190] [2025-04-26 16:53:50,583 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:53:50,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:50,586 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-26 16:53:50,589 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:53:50,589 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:53:50,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:50,589 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:50,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 16:53:50,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:53:50,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:50,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:50,596 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:50,596 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:50,596 INFO L85 PathProgramCache]: Analyzing trace with hash 158910, now seen corresponding path program 2 times [2025-04-26 16:53:50,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:50,596 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481522716] [2025-04-26 16:53:50,596 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:53:50,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:50,598 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:50,599 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:50,599 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:53:50,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:50,599 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:50,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:50,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:50,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:50,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:50,600 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:50,601 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:50,601 INFO L85 PathProgramCache]: Analyzing trace with hash -2060546049, now seen corresponding path program 2 times [2025-04-26 16:53:50,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:50,601 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036686357] [2025-04-26 16:53:50,601 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:53:50,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:50,603 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-26 16:53:50,610 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-26 16:53:50,610 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:53:50,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:50,610 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:50,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-26 16:53:50,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-26 16:53:50,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:50,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:50,731 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:51,082 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:53:51,082 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:53:51,082 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:53:51,082 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:53:51,082 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:53:51,082 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:51,082 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:53:51,082 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:53:51,082 INFO L132 ssoRankerPreferences]: Filename of dumped script: map-aggr-update1-3modifiers.bpl_petrified1_Iteration8_Lasso [2025-04-26 16:53:51,082 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:53:51,082 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:53:51,084 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:51,086 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:51,178 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:51,180 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:51,181 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:51,183 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:51,184 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:51,188 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:51,190 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:51,191 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:51,193 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:51,198 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:51,200 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:51,202 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:51,206 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:51,207 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:51,209 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:51,212 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:51,216 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:51,224 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:51,226 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:51,228 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:51,230 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:51,437 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:53:51,438 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:53:51,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:51,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:51,440 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:51,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-04-26 16:53:51,442 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:51,452 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:51,452 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:51,452 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:51,452 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:51,453 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:51,453 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:51,455 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:51,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2025-04-26 16:53:51,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:51,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:51,464 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:51,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-04-26 16:53:51,465 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:51,475 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:51,475 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:53:51,475 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:51,475 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:51,477 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-04-26 16:53:51,477 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:51,480 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:51,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2025-04-26 16:53:51,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:51,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:51,487 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:51,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-04-26 16:53:51,489 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:51,499 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:51,499 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:51,499 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:51,499 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:51,501 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:51,501 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:51,503 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:51,509 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2025-04-26 16:53:51,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:51,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:51,511 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:51,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-04-26 16:53:51,512 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:51,522 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:51,522 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:51,522 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:51,522 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:51,523 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:51,523 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:51,525 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:51,531 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2025-04-26 16:53:51,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:51,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:51,533 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:51,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-04-26 16:53:51,534 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:51,544 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:51,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:51,544 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:51,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:51,545 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:51,545 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:51,547 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:51,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2025-04-26 16:53:51,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:51,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:51,554 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:51,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-04-26 16:53:51,556 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:51,565 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:51,566 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:51,566 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:51,566 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:51,567 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:51,567 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:51,569 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:51,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2025-04-26 16:53:51,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:51,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:51,577 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:51,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-04-26 16:53:51,578 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:51,588 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:51,588 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:51,588 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:51,588 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:51,589 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:51,589 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:51,591 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:51,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2025-04-26 16:53:51,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:51,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:51,598 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:51,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-04-26 16:53:51,600 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:51,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:51,610 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:51,610 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:51,610 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:51,611 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:51,611 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:51,614 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:51,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2025-04-26 16:53:51,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:51,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:51,621 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:51,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-04-26 16:53:51,623 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:51,632 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:51,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:51,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:51,632 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:51,634 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:51,634 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:51,637 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:51,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:51,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:51,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:51,645 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:51,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-04-26 16:53:51,647 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:51,657 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:51,657 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:51,657 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:51,657 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:51,658 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:51,658 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:51,661 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:51,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:51,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:51,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:51,668 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:51,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2025-04-26 16:53:51,670 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:51,680 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:51,680 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:51,680 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:51,680 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:51,681 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:51,681 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:51,683 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:51,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2025-04-26 16:53:51,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:51,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:51,690 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:51,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2025-04-26 16:53:51,692 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:51,701 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:51,701 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:51,701 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:51,701 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:51,702 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:51,702 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:51,704 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:51,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2025-04-26 16:53:51,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:51,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:51,714 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:51,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2025-04-26 16:53:51,716 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:51,726 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:51,726 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:51,726 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:51,726 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:51,727 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:51,727 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:51,729 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:51,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2025-04-26 16:53:51,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:51,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:51,736 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:51,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2025-04-26 16:53:51,738 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:51,748 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:51,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:51,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:51,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:51,749 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:51,749 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:51,752 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:51,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2025-04-26 16:53:51,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:51,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:51,759 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:51,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2025-04-26 16:53:51,760 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:51,770 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:51,771 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:51,771 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:51,771 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:51,772 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:51,772 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:51,774 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:51,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:51,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:51,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:51,781 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:51,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2025-04-26 16:53:51,782 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:51,792 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:51,792 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:51,792 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:51,792 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:51,794 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:51,794 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:51,796 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:51,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2025-04-26 16:53:51,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:51,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:51,806 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:51,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2025-04-26 16:53:51,808 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:51,818 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:51,819 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:51,819 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:51,819 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:51,819 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:51,819 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:51,822 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:51,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2025-04-26 16:53:51,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:51,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:51,829 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:51,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2025-04-26 16:53:51,831 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:51,841 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:51,841 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:51,841 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:51,841 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:51,842 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:51,842 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:51,844 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:51,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2025-04-26 16:53:51,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:51,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:51,852 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:51,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2025-04-26 16:53:51,853 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:51,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:51,863 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:53:51,863 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:51,863 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:51,863 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:51,863 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:53:51,863 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:53:51,864 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:51,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:51,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:51,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:51,873 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:51,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2025-04-26 16:53:51,874 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:51,884 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:51,884 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:51,884 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:51,884 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:51,886 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:51,886 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:51,890 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:53:51,898 INFO L436 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-04-26 16:53:51,898 INFO L437 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 16:53:51,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:51,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:51,900 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:51,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2025-04-26 16:53:51,902 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:53:51,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2025-04-26 16:53:51,918 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:53:51,918 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:53:51,918 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread3Thread1of1ForFork1_k, N) = -1*thread3Thread1of1ForFork1_k + 1*N Supporting invariants [] [2025-04-26 16:53:51,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2025-04-26 16:53:51,926 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:53:51,932 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:51,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 16:53:51,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:53:51,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:51,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:51,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:53:51,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:51,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:51,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:51,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:51,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:51,970 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:53:51,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:51,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:53:51,976 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:53:51,976 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24057 states and 50973 transitions. cyclomatic complexity: 27851 Second operand has 4 states, 4 states have (on average 6.5) internal successors, (in total 26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:52,198 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24057 states and 50973 transitions. cyclomatic complexity: 27851. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (in total 26), 4 states have internal predecessors, (26), 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 24964 states and 52612 transitions. Complement of second has 6 states. [2025-04-26 16:53:52,199 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:53:52,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (in total 26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:52,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2025-04-26 16:53:52,200 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 92 transitions. Stem has 26 letters. Loop has 3 letters. [2025-04-26 16:53:52,200 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:52,200 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 92 transitions. Stem has 29 letters. Loop has 3 letters. [2025-04-26 16:53:52,200 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:52,200 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 92 transitions. Stem has 26 letters. Loop has 6 letters. [2025-04-26 16:53:52,200 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:52,200 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24964 states and 52612 transitions. [2025-04-26 16:53:52,384 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 120 [2025-04-26 16:53:52,497 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24964 states to 20470 states and 42802 transitions. [2025-04-26 16:53:52,497 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4355 [2025-04-26 16:53:52,505 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4419 [2025-04-26 16:53:52,505 INFO L74 IsDeterministic]: Start isDeterministic. Operand 20470 states and 42802 transitions. [2025-04-26 16:53:52,505 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:52,505 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20470 states and 42802 transitions. [2025-04-26 16:53:52,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20470 states and 42802 transitions. [2025-04-26 16:53:52,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20470 to 20089. [2025-04-26 16:53:52,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20089 states, 20089 states have (on average 2.1116531435113743) internal successors, (in total 42421), 20088 states have internal predecessors, (42421), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:52,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20089 states to 20089 states and 42421 transitions. [2025-04-26 16:53:52,860 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20089 states and 42421 transitions. [2025-04-26 16:53:52,860 INFO L438 stractBuchiCegarLoop]: Abstraction has 20089 states and 42421 transitions. [2025-04-26 16:53:52,861 INFO L340 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-04-26 16:53:52,861 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20089 states and 42421 transitions. [2025-04-26 16:53:52,944 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 120 [2025-04-26 16:53:52,944 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:52,944 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:52,945 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:52,945 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:53:52,945 INFO L752 eck$LassoCheckResult]: Stem: "[90] $Ultimate##0-->L34: Formula: (and (<= 0 v_ULTIMATE.start_m_1) (< v_ULTIMATE.start_m_1 v_N_7)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} AuxVars[] AssignedVars[]" "[140] L34-->$Ultimate##0: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0, thread1Thread1of1ForFork2_i]" "[96] $Ultimate##0-->L55-1: Formula: (= v_thread1Thread1of1ForFork2_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_i]" "[98] L55-1-->L56: Formula: (< v_thread1Thread1of1ForFork2_i_5 v_N_1) InVars {N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} OutVars{N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} AuxVars[] AssignedVars[]" "[100] L56-->L57: Formula: (= v_A_1 (store v_A_2 v_thread1Thread1of1ForFork2_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork2_i_7))) (ite (< .cse0 0) 0 .cse0)))) InVars {A=v_A_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} AuxVars[] AssignedVars[A]" "[143] L34-1-->$Ultimate##0: Formula: (and (= v_thread2Thread1of1ForFork3_thidvar0_2 2) (= v_thread2Thread1of1ForFork3_thidvar1_2 2)) InVars {} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_20, thread2Thread1of1ForFork3_thidvar0=v_thread2Thread1of1ForFork3_thidvar0_2, thread2Thread1of1ForFork3_thidvar1=v_thread2Thread1of1ForFork3_thidvar1_2, thread2Thread1of1ForFork3_cnt=v_thread2Thread1of1ForFork3_cnt_12} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_j, thread2Thread1of1ForFork3_thidvar0, thread2Thread1of1ForFork3_thidvar1, thread2Thread1of1ForFork3_cnt]" "[102] $Ultimate##0-->L68: Formula: (= v_thread2Thread1of1ForFork3_cnt_1 0) InVars {} OutVars{thread2Thread1of1ForFork3_cnt=v_thread2Thread1of1ForFork3_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_cnt]" "[101] L57-->L55-1: Formula: (= v_thread1Thread1of1ForFork2_i_10 (+ v_thread1Thread1of1ForFork2_i_9 1)) InVars {thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_9} OutVars{thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_i]" "[98] L55-1-->L56: Formula: (< v_thread1Thread1of1ForFork2_i_5 v_N_1) InVars {N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} OutVars{N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} AuxVars[] AssignedVars[]" "[146] L35-->$Ultimate##0: Formula: (and (= v_thread3Thread1of1ForFork4_thidvar0_2 3) (= v_thread3Thread1of1ForFork4_thidvar1_2 3) (= v_thread3Thread1of1ForFork4_thidvar2_2 3)) InVars {} OutVars{thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_14, thread3Thread1of1ForFork4_thidvar0=v_thread3Thread1of1ForFork4_thidvar0_2, thread3Thread1of1ForFork4_thidvar1=v_thread3Thread1of1ForFork4_thidvar1_2, thread3Thread1of1ForFork4_thidvar2=v_thread3Thread1of1ForFork4_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork4_k, thread3Thread1of1ForFork4_thidvar0, thread3Thread1of1ForFork4_thidvar1, thread3Thread1of1ForFork4_thidvar2]" "[114] $Ultimate##0-->L87-1: Formula: (= v_thread3Thread1of1ForFork4_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork4_k]" "[100] L56-->L57: Formula: (= v_A_1 (store v_A_2 v_thread1Thread1of1ForFork2_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork2_i_7))) (ite (< .cse0 0) 0 .cse0)))) InVars {A=v_A_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} AuxVars[] AssignedVars[A]" "[101] L57-->L55-1: Formula: (= v_thread1Thread1of1ForFork2_i_10 (+ v_thread1Thread1of1ForFork2_i_9 1)) InVars {thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_9} OutVars{thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_i]" "[134] L36-->$Ultimate##0: Formula: (and (= 4 v_thread3Thread1of1ForFork0_thidvar1_2) (= 4 v_thread3Thread1of1ForFork0_thidvar0_2) (= 4 v_thread3Thread1of1ForFork0_thidvar2_2) (= 4 v_thread3Thread1of1ForFork0_thidvar3_2)) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_14, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_2, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k, thread3Thread1of1ForFork0_thidvar3, thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0]" "[120] $Ultimate##0-->L87-1: Formula: (= v_thread3Thread1of1ForFork0_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k]" "[98] L55-1-->L56: Formula: (< v_thread1Thread1of1ForFork2_i_5 v_N_1) InVars {N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} OutVars{N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} AuxVars[] AssignedVars[]" "[100] L56-->L57: Formula: (= v_A_1 (store v_A_2 v_thread1Thread1of1ForFork2_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork2_i_7))) (ite (< .cse0 0) 0 .cse0)))) InVars {A=v_A_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} AuxVars[] AssignedVars[A]" "[137] L37-->$Ultimate##0: Formula: (and (= 5 v_thread3Thread1of1ForFork1_thidvar1_2) (= 5 v_thread3Thread1of1ForFork1_thidvar2_2) (= 5 v_thread3Thread1of1ForFork1_thidvar3_2) (= 5 v_thread3Thread1of1ForFork1_thidvar0_2) (= 5 v_thread3Thread1of1ForFork1_thidvar4_2)) InVars {} OutVars{thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_14, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_2, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_2, thread3Thread1of1ForFork1_thidvar4=v_thread3Thread1of1ForFork1_thidvar4_2, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_2, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_k, thread3Thread1of1ForFork1_thidvar0, thread3Thread1of1ForFork1_thidvar3, thread3Thread1of1ForFork1_thidvar4, thread3Thread1of1ForFork1_thidvar1, thread3Thread1of1ForFork1_thidvar2]" "[126] $Ultimate##0-->L87-1: Formula: (= v_thread3Thread1of1ForFork1_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_k]" "[101] L57-->L55-1: Formula: (= v_thread1Thread1of1ForFork2_i_10 (+ v_thread1Thread1of1ForFork2_i_9 1)) InVars {thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_9} OutVars{thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_i]" "[97] L55-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork2_i_3) InVars {N=v_N_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_3} OutVars{N=v_N_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_3} AuxVars[] AssignedVars[]" "[103] L68-->L69-1: Formula: (= v_thread2Thread1of1ForFork3_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_j]" "[105] L69-1-->L70: Formula: (< v_thread2Thread1of1ForFork3_j_5 v_N_4) InVars {thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_5, N=v_N_4} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_5, N=v_N_4} AuxVars[] AssignedVars[]" "[108] L70-->L70-2: Formula: (<= (select v_A_4 v_thread2Thread1of1ForFork3_j_9) 0) InVars {A=v_A_4, thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_9} OutVars{A=v_A_4, thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_9} AuxVars[] AssignedVars[]" "[128] L87-1-->L88: Formula: (< v_thread3Thread1of1ForFork1_k_5 v_N_5) InVars {N=v_N_5, thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_5} OutVars{N=v_N_5, thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_5} AuxVars[] AssignedVars[]" "[122] L87-1-->L88: Formula: (< v_thread3Thread1of1ForFork0_k_5 v_N_5) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} AuxVars[] AssignedVars[]" "[115] L87-1-->thread3FINAL: Formula: (<= v_N_6 v_thread3Thread1of1ForFork4_k_3) InVars {thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_3, N=v_N_6} OutVars{thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_3, N=v_N_6} AuxVars[] AssignedVars[]" [2025-04-26 16:53:52,945 INFO L754 eck$LassoCheckResult]: Loop: "[130] L88-->L89: Formula: (= v_B_3 (store v_B_4 v_thread3Thread1of1ForFork1_k_7 v_thread3Thread1of1ForFork1_k_7)) InVars {thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_7, B=v_B_4} OutVars{thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_7, B=v_B_3} AuxVars[] AssignedVars[B]" "[131] L89-->L87-1: Formula: (= (+ v_thread3Thread1of1ForFork1_k_9 1) v_thread3Thread1of1ForFork1_k_10) InVars {thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_9} OutVars{thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_10} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_k]" "[128] L87-1-->L88: Formula: (< v_thread3Thread1of1ForFork1_k_5 v_N_5) InVars {N=v_N_5, thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_5} OutVars{N=v_N_5, thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_5} AuxVars[] AssignedVars[]" [2025-04-26 16:53:52,945 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:52,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1811798376, now seen corresponding path program 1 times [2025-04-26 16:53:52,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:52,946 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574286679] [2025-04-26 16:53:52,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:52,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:52,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-26 16:53:52,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-26 16:53:52,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:52,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:53,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:53:53,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:53:53,006 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574286679] [2025-04-26 16:53:53,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574286679] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:53:53,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:53:53,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:53:53,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659563581] [2025-04-26 16:53:53,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:53:53,006 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:53:53,006 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:53,006 INFO L85 PathProgramCache]: Analyzing trace with hash 158910, now seen corresponding path program 3 times [2025-04-26 16:53:53,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:53,006 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483541562] [2025-04-26 16:53:53,007 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:53:53,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:53,009 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:53,010 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:53,010 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:53:53,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:53,010 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:53,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:53,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:53,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:53,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:53,012 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:53,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:53:53,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:53:53,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-26 16:53:53,031 INFO L87 Difference]: Start difference. First operand 20089 states and 42421 transitions. cyclomatic complexity: 23069 Second operand has 4 states, 3 states have (on average 8.0) internal successors, (in total 24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:53,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:53:53,243 INFO L93 Difference]: Finished difference Result 34960 states and 73621 transitions. [2025-04-26 16:53:53,243 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34960 states and 73621 transitions. [2025-04-26 16:53:53,586 INFO L131 ngComponentsAnalysis]: Automaton has 53 accepting balls. 159 [2025-04-26 16:53:53,746 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34960 states to 34864 states and 73424 transitions. [2025-04-26 16:53:53,746 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7402 [2025-04-26 16:53:53,760 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7410 [2025-04-26 16:53:53,761 INFO L74 IsDeterministic]: Start isDeterministic. Operand 34864 states and 73424 transitions. [2025-04-26 16:53:53,761 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:53,761 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34864 states and 73424 transitions. [2025-04-26 16:53:53,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34864 states and 73424 transitions. [2025-04-26 16:53:54,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34864 to 22451. [2025-04-26 16:53:54,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22451 states, 22451 states have (on average 2.1187029530978574) internal successors, (in total 47567), 22450 states have internal predecessors, (47567), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:54,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22451 states to 22451 states and 47567 transitions. [2025-04-26 16:53:54,243 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22451 states and 47567 transitions. [2025-04-26 16:53:54,243 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 16:53:54,244 INFO L438 stractBuchiCegarLoop]: Abstraction has 22451 states and 47567 transitions. [2025-04-26 16:53:54,244 INFO L340 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-04-26 16:53:54,244 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22451 states and 47567 transitions. [2025-04-26 16:53:54,315 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 120 [2025-04-26 16:53:54,316 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:54,316 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:54,316 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:54,316 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:53:54,317 INFO L752 eck$LassoCheckResult]: Stem: "[90] $Ultimate##0-->L34: Formula: (and (<= 0 v_ULTIMATE.start_m_1) (< v_ULTIMATE.start_m_1 v_N_7)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} AuxVars[] AssignedVars[]" "[140] L34-->$Ultimate##0: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0, thread1Thread1of1ForFork2_i]" "[96] $Ultimate##0-->L55-1: Formula: (= v_thread1Thread1of1ForFork2_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_i]" "[98] L55-1-->L56: Formula: (< v_thread1Thread1of1ForFork2_i_5 v_N_1) InVars {N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} OutVars{N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} AuxVars[] AssignedVars[]" "[100] L56-->L57: Formula: (= v_A_1 (store v_A_2 v_thread1Thread1of1ForFork2_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork2_i_7))) (ite (< .cse0 0) 0 .cse0)))) InVars {A=v_A_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} AuxVars[] AssignedVars[A]" "[143] L34-1-->$Ultimate##0: Formula: (and (= v_thread2Thread1of1ForFork3_thidvar0_2 2) (= v_thread2Thread1of1ForFork3_thidvar1_2 2)) InVars {} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_20, thread2Thread1of1ForFork3_thidvar0=v_thread2Thread1of1ForFork3_thidvar0_2, thread2Thread1of1ForFork3_thidvar1=v_thread2Thread1of1ForFork3_thidvar1_2, thread2Thread1of1ForFork3_cnt=v_thread2Thread1of1ForFork3_cnt_12} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_j, thread2Thread1of1ForFork3_thidvar0, thread2Thread1of1ForFork3_thidvar1, thread2Thread1of1ForFork3_cnt]" "[102] $Ultimate##0-->L68: Formula: (= v_thread2Thread1of1ForFork3_cnt_1 0) InVars {} OutVars{thread2Thread1of1ForFork3_cnt=v_thread2Thread1of1ForFork3_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_cnt]" "[101] L57-->L55-1: Formula: (= v_thread1Thread1of1ForFork2_i_10 (+ v_thread1Thread1of1ForFork2_i_9 1)) InVars {thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_9} OutVars{thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_i]" "[98] L55-1-->L56: Formula: (< v_thread1Thread1of1ForFork2_i_5 v_N_1) InVars {N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} OutVars{N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} AuxVars[] AssignedVars[]" "[146] L35-->$Ultimate##0: Formula: (and (= v_thread3Thread1of1ForFork4_thidvar0_2 3) (= v_thread3Thread1of1ForFork4_thidvar1_2 3) (= v_thread3Thread1of1ForFork4_thidvar2_2 3)) InVars {} OutVars{thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_14, thread3Thread1of1ForFork4_thidvar0=v_thread3Thread1of1ForFork4_thidvar0_2, thread3Thread1of1ForFork4_thidvar1=v_thread3Thread1of1ForFork4_thidvar1_2, thread3Thread1of1ForFork4_thidvar2=v_thread3Thread1of1ForFork4_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork4_k, thread3Thread1of1ForFork4_thidvar0, thread3Thread1of1ForFork4_thidvar1, thread3Thread1of1ForFork4_thidvar2]" "[114] $Ultimate##0-->L87-1: Formula: (= v_thread3Thread1of1ForFork4_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork4_k]" "[100] L56-->L57: Formula: (= v_A_1 (store v_A_2 v_thread1Thread1of1ForFork2_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork2_i_7))) (ite (< .cse0 0) 0 .cse0)))) InVars {A=v_A_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} AuxVars[] AssignedVars[A]" "[101] L57-->L55-1: Formula: (= v_thread1Thread1of1ForFork2_i_10 (+ v_thread1Thread1of1ForFork2_i_9 1)) InVars {thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_9} OutVars{thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_i]" "[134] L36-->$Ultimate##0: Formula: (and (= 4 v_thread3Thread1of1ForFork0_thidvar1_2) (= 4 v_thread3Thread1of1ForFork0_thidvar0_2) (= 4 v_thread3Thread1of1ForFork0_thidvar2_2) (= 4 v_thread3Thread1of1ForFork0_thidvar3_2)) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_14, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_2, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k, thread3Thread1of1ForFork0_thidvar3, thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0]" "[120] $Ultimate##0-->L87-1: Formula: (= v_thread3Thread1of1ForFork0_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k]" "[98] L55-1-->L56: Formula: (< v_thread1Thread1of1ForFork2_i_5 v_N_1) InVars {N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} OutVars{N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} AuxVars[] AssignedVars[]" "[100] L56-->L57: Formula: (= v_A_1 (store v_A_2 v_thread1Thread1of1ForFork2_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork2_i_7))) (ite (< .cse0 0) 0 .cse0)))) InVars {A=v_A_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} AuxVars[] AssignedVars[A]" "[137] L37-->$Ultimate##0: Formula: (and (= 5 v_thread3Thread1of1ForFork1_thidvar1_2) (= 5 v_thread3Thread1of1ForFork1_thidvar2_2) (= 5 v_thread3Thread1of1ForFork1_thidvar3_2) (= 5 v_thread3Thread1of1ForFork1_thidvar0_2) (= 5 v_thread3Thread1of1ForFork1_thidvar4_2)) InVars {} OutVars{thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_14, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_2, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_2, thread3Thread1of1ForFork1_thidvar4=v_thread3Thread1of1ForFork1_thidvar4_2, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_2, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_k, thread3Thread1of1ForFork1_thidvar0, thread3Thread1of1ForFork1_thidvar3, thread3Thread1of1ForFork1_thidvar4, thread3Thread1of1ForFork1_thidvar1, thread3Thread1of1ForFork1_thidvar2]" "[126] $Ultimate##0-->L87-1: Formula: (= v_thread3Thread1of1ForFork1_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_k]" "[101] L57-->L55-1: Formula: (= v_thread1Thread1of1ForFork2_i_10 (+ v_thread1Thread1of1ForFork2_i_9 1)) InVars {thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_9} OutVars{thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_i]" "[97] L55-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork2_i_3) InVars {N=v_N_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_3} OutVars{N=v_N_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_3} AuxVars[] AssignedVars[]" "[103] L68-->L69-1: Formula: (= v_thread2Thread1of1ForFork3_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_j]" "[105] L69-1-->L70: Formula: (< v_thread2Thread1of1ForFork3_j_5 v_N_4) InVars {thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_5, N=v_N_4} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_5, N=v_N_4} AuxVars[] AssignedVars[]" "[108] L70-->L70-2: Formula: (<= (select v_A_4 v_thread2Thread1of1ForFork3_j_9) 0) InVars {A=v_A_4, thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_9} OutVars{A=v_A_4, thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_9} AuxVars[] AssignedVars[]" "[128] L87-1-->L88: Formula: (< v_thread3Thread1of1ForFork1_k_5 v_N_5) InVars {N=v_N_5, thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_5} OutVars{N=v_N_5, thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_5} AuxVars[] AssignedVars[]" "[122] L87-1-->L88: Formula: (< v_thread3Thread1of1ForFork0_k_5 v_N_5) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} AuxVars[] AssignedVars[]" "[116] L87-1-->L88: Formula: (< v_thread3Thread1of1ForFork4_k_5 v_N_5) InVars {thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_5, N=v_N_5} AuxVars[] AssignedVars[]" [2025-04-26 16:53:54,317 INFO L754 eck$LassoCheckResult]: Loop: "[130] L88-->L89: Formula: (= v_B_3 (store v_B_4 v_thread3Thread1of1ForFork1_k_7 v_thread3Thread1of1ForFork1_k_7)) InVars {thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_7, B=v_B_4} OutVars{thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_7, B=v_B_3} AuxVars[] AssignedVars[B]" "[131] L89-->L87-1: Formula: (= (+ v_thread3Thread1of1ForFork1_k_9 1) v_thread3Thread1of1ForFork1_k_10) InVars {thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_9} OutVars{thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_10} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_k]" "[128] L87-1-->L88: Formula: (< v_thread3Thread1of1ForFork1_k_5 v_N_5) InVars {N=v_N_5, thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_5} OutVars{N=v_N_5, thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_5} AuxVars[] AssignedVars[]" [2025-04-26 16:53:54,317 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:54,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1811798375, now seen corresponding path program 1 times [2025-04-26 16:53:54,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:54,317 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012188238] [2025-04-26 16:53:54,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:54,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:54,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-26 16:53:54,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-26 16:53:54,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:54,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:54,329 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:54,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-26 16:53:54,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-26 16:53:54,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:54,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:54,344 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:54,345 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:54,345 INFO L85 PathProgramCache]: Analyzing trace with hash 158910, now seen corresponding path program 4 times [2025-04-26 16:53:54,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:54,345 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171399518] [2025-04-26 16:53:54,345 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:53:54,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:54,347 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 3 statements into 2 equivalence classes. [2025-04-26 16:53:54,348 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:54,348 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:53:54,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:54,348 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:54,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:54,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:54,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:54,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:54,350 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:54,350 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:54,350 INFO L85 PathProgramCache]: Analyzing trace with hash -431251674, now seen corresponding path program 1 times [2025-04-26 16:53:54,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:54,350 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990985217] [2025-04-26 16:53:54,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:54,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:54,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-26 16:53:54,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-26 16:53:54,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:54,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:54,357 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:54,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-26 16:53:54,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-26 16:53:54,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:54,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:54,365 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:54,830 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:53:54,831 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:53:54,831 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:53:54,831 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:53:54,831 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:53:54,831 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:54,831 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:53:54,831 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:53:54,831 INFO L132 ssoRankerPreferences]: Filename of dumped script: map-aggr-update1-3modifiers.bpl_petrified1_Iteration10_Lasso [2025-04-26 16:53:54,831 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:53:54,831 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:53:54,848 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:54,850 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:54,853 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:54,855 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:54,857 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:54,859 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:54,860 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:54,862 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:54,864 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:54,866 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:54,867 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:54,869 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:54,871 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:54,877 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:54,879 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:54,880 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:54,882 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:54,884 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:54,888 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:54,889 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:54,890 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:56,308 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:56,309 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:56,604 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:53:56,604 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:53:56,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:56,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:56,606 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:56,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2025-04-26 16:53:56,608 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:56,618 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:56,618 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:56,618 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:56,618 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:56,619 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:56,619 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:56,622 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:56,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2025-04-26 16:53:56,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:56,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:56,629 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:56,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2025-04-26 16:53:56,631 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:56,640 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:56,640 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:56,640 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:56,640 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:56,641 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:56,641 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:56,643 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:56,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:56,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:56,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:56,651 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:56,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2025-04-26 16:53:56,653 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:56,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:56,662 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:56,662 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:56,662 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:56,666 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:56,667 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:56,669 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:56,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:56,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:56,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:56,677 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:56,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2025-04-26 16:53:56,680 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:56,690 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:56,690 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:56,690 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:56,690 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:56,691 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:56,691 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:56,694 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:56,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2025-04-26 16:53:56,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:56,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:56,701 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:56,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2025-04-26 16:53:56,702 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:56,712 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:56,712 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:56,712 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:56,712 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:56,713 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:56,713 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:56,715 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:56,720 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2025-04-26 16:53:56,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:56,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:56,722 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:56,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2025-04-26 16:53:56,724 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:56,733 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:56,733 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:56,733 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:56,734 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:56,734 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:56,734 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:56,737 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:56,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2025-04-26 16:53:56,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:56,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:56,745 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:56,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2025-04-26 16:53:56,747 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:56,757 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:56,758 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:56,758 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:56,758 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:56,758 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:56,758 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:56,761 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:56,766 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2025-04-26 16:53:56,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:56,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:56,769 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:56,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2025-04-26 16:53:56,770 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:56,780 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:56,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:56,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:56,780 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:56,781 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:56,781 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:56,783 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:56,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:56,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:56,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:56,790 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:56,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2025-04-26 16:53:56,793 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:56,802 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:56,802 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:56,802 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:56,802 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:56,803 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:56,803 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:56,805 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:56,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2025-04-26 16:53:56,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:56,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:56,813 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:56,896 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:56,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2025-04-26 16:53:56,906 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:56,906 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:56,906 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:56,906 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:56,907 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:56,907 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:56,909 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:56,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2025-04-26 16:53:56,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:56,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:56,916 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:56,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2025-04-26 16:53:56,918 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:56,927 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:56,928 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:56,928 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:56,928 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:56,929 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:56,929 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:56,931 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:56,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:56,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:56,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:56,938 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:56,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2025-04-26 16:53:56,940 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:56,950 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:56,950 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:56,950 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:56,950 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:56,951 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:56,951 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:56,953 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:56,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:56,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:56,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:56,960 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:56,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2025-04-26 16:53:56,965 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:56,974 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:56,974 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:53:56,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:56,974 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:56,974 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:56,975 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:53:56,975 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:53:56,976 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:56,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:56,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:56,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:56,983 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:56,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2025-04-26 16:53:56,986 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:56,995 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:56,995 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:56,995 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:56,995 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:56,997 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:56,997 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:57,001 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:53:57,010 INFO L436 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-04-26 16:53:57,010 INFO L437 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 16:53:57,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:57,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:57,012 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:57,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2025-04-26 16:53:57,013 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:53:57,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2025-04-26 16:53:57,028 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:53:57,028 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:53:57,028 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread3Thread1of1ForFork1_k, N) = -1*thread3Thread1of1ForFork1_k + 1*N Supporting invariants [] [2025-04-26 16:53:57,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2025-04-26 16:53:57,035 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:53:57,043 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:57,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-26 16:53:57,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-26 16:53:57,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:57,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:57,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:53:57,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:57,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:57,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:57,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:57,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:57,082 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:53:57,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:57,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:53:57,088 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:53:57,088 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22451 states and 47567 transitions. cyclomatic complexity: 25952 Second operand has 4 states, 4 states have (on average 6.0) internal successors, (in total 24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:57,423 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22451 states and 47567 transitions. cyclomatic complexity: 25952. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (in total 24), 4 states have internal predecessors, (24), 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 70069 states and 148340 transitions. Complement of second has 7 states. [2025-04-26 16:53:57,423 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:53:57,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (in total 24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:57,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2025-04-26 16:53:57,424 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 116 transitions. Stem has 27 letters. Loop has 3 letters. [2025-04-26 16:53:57,424 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:57,424 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 116 transitions. Stem has 30 letters. Loop has 3 letters. [2025-04-26 16:53:57,424 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:57,424 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 116 transitions. Stem has 27 letters. Loop has 6 letters. [2025-04-26 16:53:57,424 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:57,424 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70069 states and 148340 transitions. [2025-04-26 16:53:57,879 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 120 [2025-04-26 16:53:57,977 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70069 states to 21722 states and 45261 transitions. [2025-04-26 16:53:57,978 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4587 [2025-04-26 16:53:57,984 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4608 [2025-04-26 16:53:57,984 INFO L74 IsDeterministic]: Start isDeterministic. Operand 21722 states and 45261 transitions. [2025-04-26 16:53:57,984 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:57,984 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21722 states and 45261 transitions. [2025-04-26 16:53:58,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21722 states and 45261 transitions. [2025-04-26 16:53:58,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21722 to 21096. [2025-04-26 16:53:58,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21096 states, 21096 states have (on average 2.1118221463784606) internal successors, (in total 44551), 21095 states have internal predecessors, (44551), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:58,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21096 states to 21096 states and 44551 transitions. [2025-04-26 16:53:58,576 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21096 states and 44551 transitions. [2025-04-26 16:53:58,576 INFO L438 stractBuchiCegarLoop]: Abstraction has 21096 states and 44551 transitions. [2025-04-26 16:53:58,576 INFO L340 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-04-26 16:53:58,576 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21096 states and 44551 transitions. [2025-04-26 16:53:58,647 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 120 [2025-04-26 16:53:58,648 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:58,648 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:58,648 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:58,648 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:53:58,649 INFO L752 eck$LassoCheckResult]: Stem: "[90] $Ultimate##0-->L34: Formula: (and (<= 0 v_ULTIMATE.start_m_1) (< v_ULTIMATE.start_m_1 v_N_7)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} AuxVars[] AssignedVars[]" "[140] L34-->$Ultimate##0: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0, thread1Thread1of1ForFork2_i]" "[96] $Ultimate##0-->L55-1: Formula: (= v_thread1Thread1of1ForFork2_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_i]" "[98] L55-1-->L56: Formula: (< v_thread1Thread1of1ForFork2_i_5 v_N_1) InVars {N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} OutVars{N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} AuxVars[] AssignedVars[]" "[100] L56-->L57: Formula: (= v_A_1 (store v_A_2 v_thread1Thread1of1ForFork2_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork2_i_7))) (ite (< .cse0 0) 0 .cse0)))) InVars {A=v_A_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} AuxVars[] AssignedVars[A]" "[143] L34-1-->$Ultimate##0: Formula: (and (= v_thread2Thread1of1ForFork3_thidvar0_2 2) (= v_thread2Thread1of1ForFork3_thidvar1_2 2)) InVars {} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_20, thread2Thread1of1ForFork3_thidvar0=v_thread2Thread1of1ForFork3_thidvar0_2, thread2Thread1of1ForFork3_thidvar1=v_thread2Thread1of1ForFork3_thidvar1_2, thread2Thread1of1ForFork3_cnt=v_thread2Thread1of1ForFork3_cnt_12} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_j, thread2Thread1of1ForFork3_thidvar0, thread2Thread1of1ForFork3_thidvar1, thread2Thread1of1ForFork3_cnt]" "[102] $Ultimate##0-->L68: Formula: (= v_thread2Thread1of1ForFork3_cnt_1 0) InVars {} OutVars{thread2Thread1of1ForFork3_cnt=v_thread2Thread1of1ForFork3_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_cnt]" "[101] L57-->L55-1: Formula: (= v_thread1Thread1of1ForFork2_i_10 (+ v_thread1Thread1of1ForFork2_i_9 1)) InVars {thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_9} OutVars{thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_i]" "[98] L55-1-->L56: Formula: (< v_thread1Thread1of1ForFork2_i_5 v_N_1) InVars {N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} OutVars{N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} AuxVars[] AssignedVars[]" "[146] L35-->$Ultimate##0: Formula: (and (= v_thread3Thread1of1ForFork4_thidvar0_2 3) (= v_thread3Thread1of1ForFork4_thidvar1_2 3) (= v_thread3Thread1of1ForFork4_thidvar2_2 3)) InVars {} OutVars{thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_14, thread3Thread1of1ForFork4_thidvar0=v_thread3Thread1of1ForFork4_thidvar0_2, thread3Thread1of1ForFork4_thidvar1=v_thread3Thread1of1ForFork4_thidvar1_2, thread3Thread1of1ForFork4_thidvar2=v_thread3Thread1of1ForFork4_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork4_k, thread3Thread1of1ForFork4_thidvar0, thread3Thread1of1ForFork4_thidvar1, thread3Thread1of1ForFork4_thidvar2]" "[114] $Ultimate##0-->L87-1: Formula: (= v_thread3Thread1of1ForFork4_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork4_k]" "[100] L56-->L57: Formula: (= v_A_1 (store v_A_2 v_thread1Thread1of1ForFork2_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork2_i_7))) (ite (< .cse0 0) 0 .cse0)))) InVars {A=v_A_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} AuxVars[] AssignedVars[A]" "[101] L57-->L55-1: Formula: (= v_thread1Thread1of1ForFork2_i_10 (+ v_thread1Thread1of1ForFork2_i_9 1)) InVars {thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_9} OutVars{thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_i]" "[97] L55-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork2_i_3) InVars {N=v_N_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_3} OutVars{N=v_N_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_3} AuxVars[] AssignedVars[]" "[103] L68-->L69-1: Formula: (= v_thread2Thread1of1ForFork3_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_j]" "[105] L69-1-->L70: Formula: (< v_thread2Thread1of1ForFork3_j_5 v_N_4) InVars {thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_5, N=v_N_4} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_5, N=v_N_4} AuxVars[] AssignedVars[]" "[108] L70-->L70-2: Formula: (<= (select v_A_4 v_thread2Thread1of1ForFork3_j_9) 0) InVars {A=v_A_4, thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_9} OutVars{A=v_A_4, thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_9} AuxVars[] AssignedVars[]" "[111] L70-2-->L73-1: Formula: (<= (select v_B_2 v_thread2Thread1of1ForFork3_j_13) 0) InVars {thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_13, B=v_B_2} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_13, B=v_B_2} AuxVars[] AssignedVars[]" "[113] L73-1-->L69-1: Formula: (= (+ v_thread2Thread1of1ForFork3_j_15 1) v_thread2Thread1of1ForFork3_j_16) InVars {thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_15} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_16} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_j]" "[104] L69-1-->thread2FINAL: Formula: (<= v_N_3 v_thread2Thread1of1ForFork3_j_3) InVars {thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_3, N=v_N_3} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_3, N=v_N_3} AuxVars[] AssignedVars[]" "[116] L87-1-->L88: Formula: (< v_thread3Thread1of1ForFork4_k_5 v_N_5) InVars {thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_5, N=v_N_5} AuxVars[] AssignedVars[]" "[118] L88-->L89: Formula: (= (store v_B_4 v_thread3Thread1of1ForFork4_k_7 v_thread3Thread1of1ForFork4_k_7) v_B_3) InVars {thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_7, B=v_B_4} OutVars{thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_7, B=v_B_3} AuxVars[] AssignedVars[B]" "[134] L36-->$Ultimate##0: Formula: (and (= 4 v_thread3Thread1of1ForFork0_thidvar1_2) (= 4 v_thread3Thread1of1ForFork0_thidvar0_2) (= 4 v_thread3Thread1of1ForFork0_thidvar2_2) (= 4 v_thread3Thread1of1ForFork0_thidvar3_2)) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_14, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_2, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k, thread3Thread1of1ForFork0_thidvar3, thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0]" "[120] $Ultimate##0-->L87-1: Formula: (= v_thread3Thread1of1ForFork0_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k]" "[122] L87-1-->L88: Formula: (< v_thread3Thread1of1ForFork0_k_5 v_N_5) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} AuxVars[] AssignedVars[]" "[124] L88-->L89: Formula: (= (store v_B_4 v_thread3Thread1of1ForFork0_k_7 v_thread3Thread1of1ForFork0_k_7) v_B_3) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_7, B=v_B_4} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_7, B=v_B_3} AuxVars[] AssignedVars[B]" "[137] L37-->$Ultimate##0: Formula: (and (= 5 v_thread3Thread1of1ForFork1_thidvar1_2) (= 5 v_thread3Thread1of1ForFork1_thidvar2_2) (= 5 v_thread3Thread1of1ForFork1_thidvar3_2) (= 5 v_thread3Thread1of1ForFork1_thidvar0_2) (= 5 v_thread3Thread1of1ForFork1_thidvar4_2)) InVars {} OutVars{thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_14, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_2, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_2, thread3Thread1of1ForFork1_thidvar4=v_thread3Thread1of1ForFork1_thidvar4_2, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_2, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_k, thread3Thread1of1ForFork1_thidvar0, thread3Thread1of1ForFork1_thidvar3, thread3Thread1of1ForFork1_thidvar4, thread3Thread1of1ForFork1_thidvar1, thread3Thread1of1ForFork1_thidvar2]" "[126] $Ultimate##0-->L87-1: Formula: (= v_thread3Thread1of1ForFork1_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_k]" [2025-04-26 16:53:58,649 INFO L754 eck$LassoCheckResult]: Loop: "[128] L87-1-->L88: Formula: (< v_thread3Thread1of1ForFork1_k_5 v_N_5) InVars {N=v_N_5, thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_5} OutVars{N=v_N_5, thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_5} AuxVars[] AssignedVars[]" "[130] L88-->L89: Formula: (= v_B_3 (store v_B_4 v_thread3Thread1of1ForFork1_k_7 v_thread3Thread1of1ForFork1_k_7)) InVars {thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_7, B=v_B_4} OutVars{thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_7, B=v_B_3} AuxVars[] AssignedVars[B]" "[131] L89-->L87-1: Formula: (= (+ v_thread3Thread1of1ForFork1_k_9 1) v_thread3Thread1of1ForFork1_k_10) InVars {thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_9} OutVars{thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_10} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_k]" [2025-04-26 16:53:58,650 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:58,650 INFO L85 PathProgramCache]: Analyzing trace with hash -366776668, now seen corresponding path program 1 times [2025-04-26 16:53:58,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:58,650 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042626331] [2025-04-26 16:53:58,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:58,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:58,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-26 16:53:58,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-26 16:53:58,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:58,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:58,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:53:58,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:53:58,730 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042626331] [2025-04-26 16:53:58,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042626331] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 16:53:58,730 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866565872] [2025-04-26 16:53:58,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:58,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 16:53:58,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:58,732 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-26 16:53:58,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Waiting until timeout for monitored process [2025-04-26 16:53:58,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-26 16:53:58,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-26 16:53:58,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:58,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:58,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-26 16:53:58,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:58,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:53:58,794 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-26 16:53:58,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:53:58,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866565872] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-26 16:53:58,830 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-26 16:53:58,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2025-04-26 16:53:58,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936267412] [2025-04-26 16:53:58,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-26 16:53:58,830 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:53:58,830 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:58,830 INFO L85 PathProgramCache]: Analyzing trace with hash 156960, now seen corresponding path program 5 times [2025-04-26 16:53:58,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:58,831 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062264522] [2025-04-26 16:53:58,831 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 16:53:58,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:58,833 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:58,833 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:58,833 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:53:58,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:58,833 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:58,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:58,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:58,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:58,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:58,835 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:58,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:53:58,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-26 16:53:58,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-26 16:53:58,851 INFO L87 Difference]: Start difference. First operand 21096 states and 44551 transitions. cyclomatic complexity: 24299 Second operand has 10 states, 10 states have (on average 3.9) internal successors, (in total 39), 10 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:59,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:53:59,311 INFO L93 Difference]: Finished difference Result 48575 states and 102229 transitions. [2025-04-26 16:53:59,311 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48575 states and 102229 transitions. [2025-04-26 16:53:59,571 INFO L131 ngComponentsAnalysis]: Automaton has 48 accepting balls. 144 [2025-04-26 16:53:59,774 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48575 states to 47510 states and 100100 transitions. [2025-04-26 16:53:59,774 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9349 [2025-04-26 16:53:59,789 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9349 [2025-04-26 16:53:59,789 INFO L74 IsDeterministic]: Start isDeterministic. Operand 47510 states and 100100 transitions. [2025-04-26 16:53:59,789 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:59,789 INFO L218 hiAutomatonCegarLoop]: Abstraction has 47510 states and 100100 transitions. [2025-04-26 16:53:59,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47510 states and 100100 transitions. [2025-04-26 16:54:00,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47510 to 30750. [2025-04-26 16:54:00,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30750 states, 30750 states have (on average 2.118081300813008) internal successors, (in total 65131), 30749 states have internal predecessors, (65131), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:00,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30750 states to 30750 states and 65131 transitions. [2025-04-26 16:54:00,558 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30750 states and 65131 transitions. [2025-04-26 16:54:00,558 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-26 16:54:00,559 INFO L438 stractBuchiCegarLoop]: Abstraction has 30750 states and 65131 transitions. [2025-04-26 16:54:00,559 INFO L340 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-04-26 16:54:00,559 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30750 states and 65131 transitions. [2025-04-26 16:54:00,811 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 120 [2025-04-26 16:54:00,811 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:00,811 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:00,812 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:00,812 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:54:00,812 INFO L752 eck$LassoCheckResult]: Stem: "[90] $Ultimate##0-->L34: Formula: (and (<= 0 v_ULTIMATE.start_m_1) (< v_ULTIMATE.start_m_1 v_N_7)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} AuxVars[] AssignedVars[]" "[140] L34-->$Ultimate##0: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0, thread1Thread1of1ForFork2_i]" "[96] $Ultimate##0-->L55-1: Formula: (= v_thread1Thread1of1ForFork2_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_i]" "[98] L55-1-->L56: Formula: (< v_thread1Thread1of1ForFork2_i_5 v_N_1) InVars {N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} OutVars{N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} AuxVars[] AssignedVars[]" "[100] L56-->L57: Formula: (= v_A_1 (store v_A_2 v_thread1Thread1of1ForFork2_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork2_i_7))) (ite (< .cse0 0) 0 .cse0)))) InVars {A=v_A_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} AuxVars[] AssignedVars[A]" "[143] L34-1-->$Ultimate##0: Formula: (and (= v_thread2Thread1of1ForFork3_thidvar0_2 2) (= v_thread2Thread1of1ForFork3_thidvar1_2 2)) InVars {} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_20, thread2Thread1of1ForFork3_thidvar0=v_thread2Thread1of1ForFork3_thidvar0_2, thread2Thread1of1ForFork3_thidvar1=v_thread2Thread1of1ForFork3_thidvar1_2, thread2Thread1of1ForFork3_cnt=v_thread2Thread1of1ForFork3_cnt_12} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_j, thread2Thread1of1ForFork3_thidvar0, thread2Thread1of1ForFork3_thidvar1, thread2Thread1of1ForFork3_cnt]" "[102] $Ultimate##0-->L68: Formula: (= v_thread2Thread1of1ForFork3_cnt_1 0) InVars {} OutVars{thread2Thread1of1ForFork3_cnt=v_thread2Thread1of1ForFork3_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_cnt]" "[101] L57-->L55-1: Formula: (= v_thread1Thread1of1ForFork2_i_10 (+ v_thread1Thread1of1ForFork2_i_9 1)) InVars {thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_9} OutVars{thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_i]" "[98] L55-1-->L56: Formula: (< v_thread1Thread1of1ForFork2_i_5 v_N_1) InVars {N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} OutVars{N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} AuxVars[] AssignedVars[]" "[146] L35-->$Ultimate##0: Formula: (and (= v_thread3Thread1of1ForFork4_thidvar0_2 3) (= v_thread3Thread1of1ForFork4_thidvar1_2 3) (= v_thread3Thread1of1ForFork4_thidvar2_2 3)) InVars {} OutVars{thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_14, thread3Thread1of1ForFork4_thidvar0=v_thread3Thread1of1ForFork4_thidvar0_2, thread3Thread1of1ForFork4_thidvar1=v_thread3Thread1of1ForFork4_thidvar1_2, thread3Thread1of1ForFork4_thidvar2=v_thread3Thread1of1ForFork4_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork4_k, thread3Thread1of1ForFork4_thidvar0, thread3Thread1of1ForFork4_thidvar1, thread3Thread1of1ForFork4_thidvar2]" "[114] $Ultimate##0-->L87-1: Formula: (= v_thread3Thread1of1ForFork4_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork4_k]" "[100] L56-->L57: Formula: (= v_A_1 (store v_A_2 v_thread1Thread1of1ForFork2_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork2_i_7))) (ite (< .cse0 0) 0 .cse0)))) InVars {A=v_A_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} AuxVars[] AssignedVars[A]" "[101] L57-->L55-1: Formula: (= v_thread1Thread1of1ForFork2_i_10 (+ v_thread1Thread1of1ForFork2_i_9 1)) InVars {thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_9} OutVars{thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_i]" "[116] L87-1-->L88: Formula: (< v_thread3Thread1of1ForFork4_k_5 v_N_5) InVars {thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_5, N=v_N_5} AuxVars[] AssignedVars[]" "[98] L55-1-->L56: Formula: (< v_thread1Thread1of1ForFork2_i_5 v_N_1) InVars {N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} OutVars{N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} AuxVars[] AssignedVars[]" "[100] L56-->L57: Formula: (= v_A_1 (store v_A_2 v_thread1Thread1of1ForFork2_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork2_i_7))) (ite (< .cse0 0) 0 .cse0)))) InVars {A=v_A_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} AuxVars[] AssignedVars[A]" "[134] L36-->$Ultimate##0: Formula: (and (= 4 v_thread3Thread1of1ForFork0_thidvar1_2) (= 4 v_thread3Thread1of1ForFork0_thidvar0_2) (= 4 v_thread3Thread1of1ForFork0_thidvar2_2) (= 4 v_thread3Thread1of1ForFork0_thidvar3_2)) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_14, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_2, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k, thread3Thread1of1ForFork0_thidvar3, thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0]" "[120] $Ultimate##0-->L87-1: Formula: (= v_thread3Thread1of1ForFork0_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k]" "[101] L57-->L55-1: Formula: (= v_thread1Thread1of1ForFork2_i_10 (+ v_thread1Thread1of1ForFork2_i_9 1)) InVars {thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_9} OutVars{thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_i]" "[98] L55-1-->L56: Formula: (< v_thread1Thread1of1ForFork2_i_5 v_N_1) InVars {N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} OutVars{N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} AuxVars[] AssignedVars[]" "[137] L37-->$Ultimate##0: Formula: (and (= 5 v_thread3Thread1of1ForFork1_thidvar1_2) (= 5 v_thread3Thread1of1ForFork1_thidvar2_2) (= 5 v_thread3Thread1of1ForFork1_thidvar3_2) (= 5 v_thread3Thread1of1ForFork1_thidvar0_2) (= 5 v_thread3Thread1of1ForFork1_thidvar4_2)) InVars {} OutVars{thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_14, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_2, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_2, thread3Thread1of1ForFork1_thidvar4=v_thread3Thread1of1ForFork1_thidvar4_2, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_2, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_k, thread3Thread1of1ForFork1_thidvar0, thread3Thread1of1ForFork1_thidvar3, thread3Thread1of1ForFork1_thidvar4, thread3Thread1of1ForFork1_thidvar1, thread3Thread1of1ForFork1_thidvar2]" "[126] $Ultimate##0-->L87-1: Formula: (= v_thread3Thread1of1ForFork1_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_k]" "[100] L56-->L57: Formula: (= v_A_1 (store v_A_2 v_thread1Thread1of1ForFork2_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork2_i_7))) (ite (< .cse0 0) 0 .cse0)))) InVars {A=v_A_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} AuxVars[] AssignedVars[A]" "[101] L57-->L55-1: Formula: (= v_thread1Thread1of1ForFork2_i_10 (+ v_thread1Thread1of1ForFork2_i_9 1)) InVars {thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_9} OutVars{thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_i]" "[122] L87-1-->L88: Formula: (< v_thread3Thread1of1ForFork0_k_5 v_N_5) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} AuxVars[] AssignedVars[]" "[97] L55-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork2_i_3) InVars {N=v_N_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_3} OutVars{N=v_N_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_3} AuxVars[] AssignedVars[]" "[103] L68-->L69-1: Formula: (= v_thread2Thread1of1ForFork3_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_j]" "[105] L69-1-->L70: Formula: (< v_thread2Thread1of1ForFork3_j_5 v_N_4) InVars {thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_5, N=v_N_4} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_5, N=v_N_4} AuxVars[] AssignedVars[]" "[108] L70-->L70-2: Formula: (<= (select v_A_4 v_thread2Thread1of1ForFork3_j_9) 0) InVars {A=v_A_4, thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_9} OutVars{A=v_A_4, thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_9} AuxVars[] AssignedVars[]" [2025-04-26 16:54:00,812 INFO L754 eck$LassoCheckResult]: Loop: "[128] L87-1-->L88: Formula: (< v_thread3Thread1of1ForFork1_k_5 v_N_5) InVars {N=v_N_5, thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_5} OutVars{N=v_N_5, thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_5} AuxVars[] AssignedVars[]" "[130] L88-->L89: Formula: (= v_B_3 (store v_B_4 v_thread3Thread1of1ForFork1_k_7 v_thread3Thread1of1ForFork1_k_7)) InVars {thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_7, B=v_B_4} OutVars{thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_7, B=v_B_3} AuxVars[] AssignedVars[B]" "[131] L89-->L87-1: Formula: (= (+ v_thread3Thread1of1ForFork1_k_9 1) v_thread3Thread1of1ForFork1_k_10) InVars {thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_9} OutVars{thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_10} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_k]" [2025-04-26 16:54:00,813 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:00,813 INFO L85 PathProgramCache]: Analyzing trace with hash -113896564, now seen corresponding path program 1 times [2025-04-26 16:54:00,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:00,813 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544402399] [2025-04-26 16:54:00,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:00,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:00,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-26 16:54:00,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-26 16:54:00,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:00,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:00,823 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:00,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-26 16:54:00,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-26 16:54:00,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:00,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:00,834 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:00,834 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:00,834 INFO L85 PathProgramCache]: Analyzing trace with hash 156960, now seen corresponding path program 6 times [2025-04-26 16:54:00,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:00,834 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989890851] [2025-04-26 16:54:00,834 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-26 16:54:00,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:00,836 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:00,837 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:00,837 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-26 16:54:00,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:00,837 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:00,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:00,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:00,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:00,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:00,843 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:00,844 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:00,844 INFO L85 PathProgramCache]: Analyzing trace with hash -68247115, now seen corresponding path program 2 times [2025-04-26 16:54:00,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:00,844 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850769642] [2025-04-26 16:54:00,844 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:54:00,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:00,848 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 1 equivalence classes. [2025-04-26 16:54:00,853 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-26 16:54:00,853 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:54:00,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:00,853 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:00,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-26 16:54:00,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-26 16:54:00,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:00,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:00,861 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:01,723 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:01,723 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:01,724 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:01,724 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:01,724 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:01,724 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:01,724 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:01,724 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:01,724 INFO L132 ssoRankerPreferences]: Filename of dumped script: map-aggr-update1-3modifiers.bpl_petrified1_Iteration12_Lasso [2025-04-26 16:54:01,724 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:01,724 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:01,849 WARN L176 XnfTransformerHelper]: Simplifying conjunction of 66307 disjunctions. This might take some time... Received shutdown request... [2025-04-26 16:58:18,651 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-26 16:58:18,655 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-26 16:58:18,657 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-26 16:58:18,658 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-26 16:58:18,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:18,671 INFO L201 PluginConnector]: Adding new model map-aggr-update1-3modifiers.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:58:18 BoogieIcfgContainer [2025-04-26 16:58:18,671 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:58:18,672 INFO L158 Benchmark]: Toolchain (without parser) took 280666.09ms. Allocated memory was 163.6MB in the beginning and 4.3GB in the end (delta: 4.1GB). Free memory was 91.5MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 3.7GB. Max. memory is 8.0GB. [2025-04-26 16:58:18,672 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.16ms. Allocated memory is still 163.6MB. Free memory is still 92.5MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:58:18,672 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.45ms. Allocated memory is still 163.6MB. Free memory was 91.5MB in the beginning and 89.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:58:18,672 INFO L158 Benchmark]: Boogie Preprocessor took 30.95ms. Allocated memory is still 163.6MB. Free memory was 89.6MB in the beginning and 88.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:58:18,672 INFO L158 Benchmark]: RCFGBuilder took 211.63ms. Allocated memory is still 163.6MB. Free memory was 88.5MB in the beginning and 78.8MB in the end (delta: 9.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 16:58:18,673 INFO L158 Benchmark]: BuchiAutomizer took 280383.37ms. Allocated memory was 163.6MB in the beginning and 4.3GB in the end (delta: 4.1GB). Free memory was 78.6MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 3.7GB. Max. memory is 8.0GB. [2025-04-26 16:58:18,674 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.16ms. Allocated memory is still 163.6MB. Free memory is still 92.5MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.45ms. Allocated memory is still 163.6MB. Free memory was 91.5MB in the beginning and 89.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 30.95ms. Allocated memory is still 163.6MB. Free memory was 89.6MB in the beginning and 88.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 211.63ms. Allocated memory is still 163.6MB. Free memory was 88.5MB in the beginning and 78.8MB in the end (delta: 9.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 280383.37ms. Allocated memory was 163.6MB in the beginning and 4.3GB in the end (delta: 4.1GB). Free memory was 78.6MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 3.7GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 280.2s and 12 iterations. TraceHistogramMax:4. Analysis of lassos took 265.7s. Construction of modules took 0.4s. Büchi inclusion checks took 6.7s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 11. Automata minimization 4.8s AutomataMinimizationTime, 11 MinimizatonAttempts, 40833 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 3.7s Buchi closure took 0.1s. 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, 1134 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1128 mSDsluCounter, 1155 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 640 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 910 IncrementalHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 515 mSDtfsCounter, 910 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU4 SILI0 SILT0 lasso6 LassoPreprocessingBenchmarks: Lassos: inital140 mio100 ax100 hnf100 lsp1100 ukn31 mio100 lsp112 div100 bol100 ite100 ukn100 eq147 hnf97 smp77 dnf247 smp69 tf101 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 22ms VariablesStem: 3 VariablesLoop: 1 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 1.3s InitialAbstraction: Time to compute Ample Reduction [ms]: 1309, Number of transitions in reduction automaton: 15575, Number of states in reduction automaton: 6827, Underlying: - StatisticsResult: Constructed decomposition of program Decomposition not yet finished - TimeoutResult: Timeout (de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction) Buchi Automizer is unable to decide termination: Timeout while BuchiAutomatonCegarLoop was analyzing lasso (stem: length 30 TraceHistMax 4 loop: length 4 TraceHistMax 1),while LassoBuilder was applying LassoPartitioneer to lasso for termination ,while CnfTransformerHelper was XNF transformer was simplifying 66307 disjunctions. . RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown