/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-comp.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:53:48,186 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:53:48,232 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:53:48,237 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:53:48,237 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:53:48,237 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:48,237 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:53:48,259 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:53:48,260 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:53:48,260 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:53:48,260 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:53:48,260 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:53:48,260 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:53:48,260 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:53:48,260 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:53:48,260 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:53:48,261 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:53:48,261 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:53:48,261 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:53:48,261 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:53:48,261 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:53:48,261 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:53:48,261 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:53:48,261 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:53:48,261 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:53:48,261 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:53:48,261 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:53:48,261 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:53:48,261 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:53:48,263 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:53:48,263 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:53:48,263 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:53:48,263 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:53:48,263 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:53:48,263 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:53:48,263 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:53:48,263 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:53:48,263 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:53:48,264 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:53:48,264 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:53:48,264 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:53:48,264 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:53:48,264 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:53:48,483 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:53:48,490 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:53:48,492 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:53:48,492 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:53:48,494 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:53:48,496 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-comp.bpl [2025-04-26 16:53:48,496 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-comp.bpl' [2025-04-26 16:53:48,512 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:53:48,513 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:53:48,514 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:53:48,514 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:53:48,514 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:53:48,521 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:48" (1/1) ... [2025-04-26 16:53:48,545 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:48" (1/1) ... [2025-04-26 16:53:48,550 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:53:48,551 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:53:48,552 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:53:48,552 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:53:48,552 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:53:48,556 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:48" (1/1) ... [2025-04-26 16:53:48,557 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:48" (1/1) ... [2025-04-26 16:53:48,559 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:48" (1/1) ... [2025-04-26 16:53:48,559 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:48" (1/1) ... [2025-04-26 16:53:48,561 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:48" (1/1) ... [2025-04-26 16:53:48,562 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:48" (1/1) ... [2025-04-26 16:53:48,564 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:48" (1/1) ... [2025-04-26 16:53:48,565 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:48" (1/1) ... [2025-04-26 16:53:48,565 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:48" (1/1) ... [2025-04-26 16:53:48,575 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:53:48,576 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:53:48,576 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:53:48,576 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:53:48,576 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:48" (1/1) ... [2025-04-26 16:53:48,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:53:48,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:48,598 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:48,602 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:48,624 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:53:48,624 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:53:48,624 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:53:48,624 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:53:48,624 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:53:48,624 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:53:48,624 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:53:48,624 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:53:48,624 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:53:48,624 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:53:48,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:53:48,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:53:48,625 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:48,660 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:53:48,661 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:53:48,736 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:53:48,737 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:53:48,743 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:53:48,744 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:53:48,744 INFO L201 PluginConnector]: Adding new model map-comp.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:53:48 BoogieIcfgContainer [2025-04-26 16:53:48,744 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:53:48,749 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:53:48,749 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:53:48,753 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:53:48,754 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:53:48,754 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:48" (1/2) ... [2025-04-26 16:53:48,755 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@65d132e1 and model type map-comp.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:53:48, skipping insertion in model container [2025-04-26 16:53:48,755 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:53:48,755 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-comp.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:53:48" (2/2) ... [2025-04-26 16:53:48,756 INFO L376 chiAutomizerObserver]: Analyzing ICFG map-comp.bpl [2025-04-26 16:53:48,815 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 16:53:48,856 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:53:48,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:53:48,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:48,860 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:48,861 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:48,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 35 transitions, 91 flow [2025-04-26 16:53:48,936 INFO L116 PetriNetUnfolderBase]: 3/29 cut-off events. [2025-04-26 16:53:48,938 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 16:53:48,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 29 events. 3/29 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 56 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 24. Up to 2 conditions per place. [2025-04-26 16:53:48,941 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 35 transitions, 91 flow [2025-04-26 16:53:48,946 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 29 transitions, 76 flow [2025-04-26 16:53:48,947 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 36 places, 29 transitions, 76 flow [2025-04-26 16:53:48,952 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:53:49,078 WARN L140 AmpleReduction]: Number of pruned transitions: 230 [2025-04-26 16:53:49,078 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:53:49,078 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 52 [2025-04-26 16:53:49,078 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:23 [2025-04-26 16:53:49,079 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:127 [2025-04-26 16:53:49,079 WARN L145 AmpleReduction]: Times succ was already a loop node:17 [2025-04-26 16:53:49,079 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:89 [2025-04-26 16:53:49,079 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:53:49,081 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 203 states, 201 states have (on average 1.7611940298507462) internal successors, (in total 354), 202 states have internal predecessors, (354), 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,086 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:53:49,086 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:53:49,086 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:53:49,087 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:53:49,087 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:53:49,087 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:53:49,087 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:53:49,087 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:53:49,089 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 203 states, 201 states have (on average 1.7611940298507462) internal successors, (in total 354), 202 states have internal predecessors, (354), 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,101 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 165 [2025-04-26 16:53:49,102 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:49,102 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:49,105 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:53:49,105 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:53:49,105 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:53:49,105 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 203 states, 201 states have (on average 1.7611940298507462) internal successors, (in total 354), 202 states have internal predecessors, (354), 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,113 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 165 [2025-04-26 16:53:49,113 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:49,113 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:49,114 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:53:49,114 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:53:49,118 INFO L752 eck$LassoCheckResult]: Stem: "[65] $Ultimate##0-->L16: Formula: (and (< v_k_3 v_N_7) (<= 0 v_k_3)) InVars {k=v_k_3, N=v_N_7} OutVars{k=v_k_3, N=v_N_7} AuxVars[] AssignedVars[]" "[41] L16-->L18: Formula: (= v_B_5 v_A_7) InVars {A=v_A_7} OutVars{A=v_A_7, B=v_B_5} AuxVars[] AssignedVars[B]" "[90] L18-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_i]" "[70] $Ultimate##0-->L34-1: Formula: (= v_thread1Thread1of1ForFork0_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i]" [2025-04-26 16:53:49,118 INFO L754 eck$LassoCheckResult]: Loop: "[72] L34-1-->L35: Formula: (< v_thread1Thread1of1ForFork0_i_5 v_N_1) InVars {thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_5, N=v_N_1} AuxVars[] AssignedVars[]" "[74] L35-->L36: Formula: (= v_A_1 (store v_A_2 v_thread1Thread1of1ForFork0_i_7 (+ (select v_A_2 v_thread1Thread1of1ForFork0_i_7) 1))) InVars {A=v_A_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_7} AuxVars[] AssignedVars[A]" "[75] L36-->L34-1: Formula: (= v_thread1Thread1of1ForFork0_i_10 (+ v_thread1Thread1of1ForFork0_i_9 1)) InVars {thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_9} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i]" [2025-04-26 16:53:49,121 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:49,121 INFO L85 PathProgramCache]: Analyzing trace with hash 2902197, now seen corresponding path program 1 times [2025-04-26 16:53:49,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:49,126 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583815518] [2025-04-26 16:53:49,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:49,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:49,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:53:49,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:53:49,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:49,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:49,184 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:49,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 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 4 of 4 statements. [2025-04-26 16:53:49,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:49,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:49,208 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:49,210 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:49,210 INFO L85 PathProgramCache]: Analyzing trace with hash 101352, now seen corresponding path program 1 times [2025-04-26 16:53:49,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:49,211 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757756051] [2025-04-26 16:53:49,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:49,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:49,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:49,225 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,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:49,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:49,225 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:49,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:49,232 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,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:49,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:49,236 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:49,238 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:49,238 INFO L85 PathProgramCache]: Analyzing trace with hash 560076468, now seen corresponding path program 1 times [2025-04-26 16:53:49,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:49,238 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424662949] [2025-04-26 16:53:49,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:49,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:49,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:53:49,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:53:49,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:49,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:49,253 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:49,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:53:49,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:53:49,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:49,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:49,264 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:49,399 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:53:49,399 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:53:49,400 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:53:49,400 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:53:49,400 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:53:49,400 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:49,400 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:53:49,400 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:53:49,400 INFO L132 ssoRankerPreferences]: Filename of dumped script: map-comp.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:53:49,400 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:53:49,400 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:53:49,430 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:49,459 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:49,538 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:53:49,553 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:53:49,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:49,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:49,563 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:49,565 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:49,569 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:49,581 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:49,581 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:53:49,581 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:49,582 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:49,582 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:49,585 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:53:49,586 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:53:49,588 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:49,594 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:49,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:49,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:49,596 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:49,598 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:49,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:49,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:49,610 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:53:49,611 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:49,611 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:49,611 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:49,612 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:53:49,612 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:53:49,614 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:49,620 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:49,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:49,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:49,623 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:49,624 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:49,627 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:49,637 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:49,638 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:49,638 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:49,638 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:49,644 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:49,644 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:49,655 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:53:49,671 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:53:49,671 INFO L437 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 16:53:49,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:49,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:49,694 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:49,696 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:49,697 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:53:49,718 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:49,718 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:53:49,718 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:53:49,719 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork0_i, N) = -1*thread1Thread1of1ForFork0_i + 1*N Supporting invariants [] [2025-04-26 16:53:49,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:49,727 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:53:49,745 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:49,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:53:49,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:53:49,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:49,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:49,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:53:49,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:49,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:49,768 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,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:49,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:49,769 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:53:49,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:49,798 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:49,811 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:49,813 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 203 states, 201 states have (on average 1.7611940298507462) internal successors, (in total 354), 202 states have internal predecessors, (354), 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.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:49,921 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 203 states, 201 states have (on average 1.7611940298507462) internal successors, (in total 354), 202 states have internal predecessors, (354), 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.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 445 states and 795 transitions. Complement of second has 6 states. [2025-04-26 16:53:49,922 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:49,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:49,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2025-04-26 16:53:49,927 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 56 transitions. Stem has 4 letters. Loop has 3 letters. [2025-04-26 16:53:49,928 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:49,928 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 56 transitions. Stem has 7 letters. Loop has 3 letters. [2025-04-26 16:53:49,928 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:49,928 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 56 transitions. Stem has 4 letters. Loop has 6 letters. [2025-04-26 16:53:49,928 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:49,929 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 445 states and 795 transitions. [2025-04-26 16:53:49,941 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 72 [2025-04-26 16:53:49,949 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 445 states to 222 states and 387 transitions. [2025-04-26 16:53:49,953 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2025-04-26 16:53:49,954 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 126 [2025-04-26 16:53:49,954 INFO L74 IsDeterministic]: Start isDeterministic. Operand 222 states and 387 transitions. [2025-04-26 16:53:49,954 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:49,954 INFO L218 hiAutomatonCegarLoop]: Abstraction has 222 states and 387 transitions. [2025-04-26 16:53:49,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states and 387 transitions. [2025-04-26 16:53:49,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 194. [2025-04-26 16:53:49,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 194 states have (on average 1.7525773195876289) internal successors, (in total 340), 193 states have internal predecessors, (340), 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,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 340 transitions. [2025-04-26 16:53:49,983 INFO L240 hiAutomatonCegarLoop]: Abstraction has 194 states and 340 transitions. [2025-04-26 16:53:49,983 INFO L438 stractBuchiCegarLoop]: Abstraction has 194 states and 340 transitions. [2025-04-26 16:53:49,983 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:53:49,983 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 194 states and 340 transitions. [2025-04-26 16:53:49,984 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 72 [2025-04-26 16:53:49,984 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:49,984 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:49,985 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:49,985 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:53:49,985 INFO L752 eck$LassoCheckResult]: Stem: "[65] $Ultimate##0-->L16: Formula: (and (< v_k_3 v_N_7) (<= 0 v_k_3)) InVars {k=v_k_3, N=v_N_7} OutVars{k=v_k_3, N=v_N_7} AuxVars[] AssignedVars[]" "[41] L16-->L18: Formula: (= v_B_5 v_A_7) InVars {A=v_A_7} OutVars{A=v_A_7, B=v_B_5} AuxVars[] AssignedVars[B]" "[90] L18-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_i]" "[70] $Ultimate##0-->L34-1: Formula: (= v_thread1Thread1of1ForFork0_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i]" "[71] L34-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork0_i_3) InVars {thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_3, N=v_N_2} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_3, N=v_N_2} AuxVars[] AssignedVars[]" "[73] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[93] L18-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_14, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_i, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[76] $Ultimate##0-->L46-1: Formula: (= v_thread2Thread1of1ForFork1_i_1 0) InVars {} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_i]" [2025-04-26 16:53:49,985 INFO L754 eck$LassoCheckResult]: Loop: "[78] L46-1-->L47: Formula: (< v_thread2Thread1of1ForFork1_i_5 v_N_4) InVars {thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_5, N=v_N_4} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_5, N=v_N_4} AuxVars[] AssignedVars[]" "[80] L47-->L48: Formula: (= (store v_A_4 v_thread2Thread1of1ForFork1_i_7 (+ 2 (select v_A_4 v_thread2Thread1of1ForFork1_i_7))) v_A_3) InVars {A=v_A_4, thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_7} OutVars{A=v_A_3, thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_7} AuxVars[] AssignedVars[A]" "[81] L48-->L46-1: Formula: (= (+ v_thread2Thread1of1ForFork1_i_9 1) v_thread2Thread1of1ForFork1_i_10) InVars {thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_9} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_10} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_i]" [2025-04-26 16:53:49,986 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:49,986 INFO L85 PathProgramCache]: Analyzing trace with hash 182471206, now seen corresponding path program 1 times [2025-04-26 16:53:49,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:49,986 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309333272] [2025-04-26 16:53:49,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:49,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:49,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:53:49,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:53:49,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:49,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:50,043 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:50,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:53:50,043 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309333272] [2025-04-26 16:53:50,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309333272] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:53:50,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:53:50,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:53:50,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522548240] [2025-04-26 16:53:50,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:53:50,048 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:53:50,049 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:50,049 INFO L85 PathProgramCache]: Analyzing trace with hash 107310, now seen corresponding path program 1 times [2025-04-26 16:53:50,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:50,052 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466278483] [2025-04-26 16:53:50,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:50,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:50,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:50,057 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,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:50,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:50,057 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:50,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:50,061 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,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:50,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:50,062 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:50,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:53:50,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:53:50,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-26 16:53:50,089 INFO L87 Difference]: Start difference. First operand 194 states and 340 transitions. cyclomatic complexity: 173 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:50,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:53:50,140 INFO L93 Difference]: Finished difference Result 194 states and 339 transitions. [2025-04-26 16:53:50,140 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 194 states and 339 transitions. [2025-04-26 16:53:50,142 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 72 [2025-04-26 16:53:50,147 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 194 states to 194 states and 339 transitions. [2025-04-26 16:53:50,147 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 98 [2025-04-26 16:53:50,147 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 98 [2025-04-26 16:53:50,147 INFO L74 IsDeterministic]: Start isDeterministic. Operand 194 states and 339 transitions. [2025-04-26 16:53:50,148 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:50,148 INFO L218 hiAutomatonCegarLoop]: Abstraction has 194 states and 339 transitions. [2025-04-26 16:53:50,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states and 339 transitions. [2025-04-26 16:53:50,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2025-04-26 16:53:50,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 194 states have (on average 1.7474226804123711) internal successors, (in total 339), 193 states have internal predecessors, (339), 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,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 339 transitions. [2025-04-26 16:53:50,164 INFO L240 hiAutomatonCegarLoop]: Abstraction has 194 states and 339 transitions. [2025-04-26 16:53:50,165 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 16:53:50,166 INFO L438 stractBuchiCegarLoop]: Abstraction has 194 states and 339 transitions. [2025-04-26 16:53:50,166 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:53:50,166 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 194 states and 339 transitions. [2025-04-26 16:53:50,167 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 72 [2025-04-26 16:53:50,167 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:50,167 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:50,168 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:50,168 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:53:50,168 INFO L752 eck$LassoCheckResult]: Stem: "[65] $Ultimate##0-->L16: Formula: (and (< v_k_3 v_N_7) (<= 0 v_k_3)) InVars {k=v_k_3, N=v_N_7} OutVars{k=v_k_3, N=v_N_7} AuxVars[] AssignedVars[]" "[41] L16-->L18: Formula: (= v_B_5 v_A_7) InVars {A=v_A_7} OutVars{A=v_A_7, B=v_B_5} AuxVars[] AssignedVars[B]" "[90] L18-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_i]" "[70] $Ultimate##0-->L34-1: Formula: (= v_thread1Thread1of1ForFork0_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i]" "[72] L34-1-->L35: Formula: (< v_thread1Thread1of1ForFork0_i_5 v_N_1) InVars {thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_5, N=v_N_1} AuxVars[] AssignedVars[]" "[74] L35-->L36: Formula: (= v_A_1 (store v_A_2 v_thread1Thread1of1ForFork0_i_7 (+ (select v_A_2 v_thread1Thread1of1ForFork0_i_7) 1))) InVars {A=v_A_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_7} AuxVars[] AssignedVars[A]" "[93] L18-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_14, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_i, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[76] $Ultimate##0-->L46-1: Formula: (= v_thread2Thread1of1ForFork1_i_1 0) InVars {} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_i]" "[75] L36-->L34-1: Formula: (= v_thread1Thread1of1ForFork0_i_10 (+ v_thread1Thread1of1ForFork0_i_9 1)) InVars {thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_9} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i]" "[71] L34-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork0_i_3) InVars {thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_3, N=v_N_2} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_3, N=v_N_2} AuxVars[] AssignedVars[]" [2025-04-26 16:53:50,168 INFO L754 eck$LassoCheckResult]: Loop: "[78] L46-1-->L47: Formula: (< v_thread2Thread1of1ForFork1_i_5 v_N_4) InVars {thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_5, N=v_N_4} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_5, N=v_N_4} AuxVars[] AssignedVars[]" "[80] L47-->L48: Formula: (= (store v_A_4 v_thread2Thread1of1ForFork1_i_7 (+ 2 (select v_A_4 v_thread2Thread1of1ForFork1_i_7))) v_A_3) InVars {A=v_A_4, thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_7} OutVars{A=v_A_3, thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_7} AuxVars[] AssignedVars[A]" "[81] L48-->L46-1: Formula: (= (+ v_thread2Thread1of1ForFork1_i_9 1) v_thread2Thread1of1ForFork1_i_10) InVars {thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_9} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_10} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_i]" [2025-04-26 16:53:50,171 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:50,171 INFO L85 PathProgramCache]: Analyzing trace with hash -709275102, now seen corresponding path program 1 times [2025-04-26 16:53:50,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:50,171 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101384479] [2025-04-26 16:53:50,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:50,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:50,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:53:50,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:53:50,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:50,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:50,181 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:50,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:53:50,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:53:50,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:50,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:50,197 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:50,198 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:50,198 INFO L85 PathProgramCache]: Analyzing trace with hash 107310, now seen corresponding path program 2 times [2025-04-26 16:53:50,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:50,198 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560012912] [2025-04-26 16:53:50,198 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:53:50,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:50,203 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:50,204 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,204 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:53:50,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:50,204 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:50,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:50,209 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,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:50,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:50,210 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:50,211 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:50,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1224610157, now seen corresponding path program 1 times [2025-04-26 16:53:50,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:50,211 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488848884] [2025-04-26 16:53:50,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:50,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:50,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:53:50,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:53:50,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:50,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:50,230 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:50,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:53:50,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:53:50,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:50,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:50,236 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:50,346 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:53:50,346 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:53:50,346 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:53:50,346 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:53:50,346 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:53:50,346 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:50,346 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:53:50,346 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:53:50,346 INFO L132 ssoRankerPreferences]: Filename of dumped script: map-comp.bpl_petrified1_Iteration3_Lasso [2025-04-26 16:53:50,346 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:53:50,346 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:53:50,347 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:50,351 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:50,353 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:50,406 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:50,409 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:50,487 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:53:50,487 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:53:50,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:50,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:50,490 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:50,491 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:50,493 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:50,504 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:50,504 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:50,504 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:50,504 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:50,506 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:50,506 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:50,510 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:50,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:50,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:50,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:50,518 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:50,520 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:50,521 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:50,531 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:50,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:50,532 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:50,532 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:50,534 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:50,534 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:50,538 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:50,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 16:53:50,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:50,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:50,554 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:50,556 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:50,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:50,567 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:50,567 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:50,567 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:50,567 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:50,570 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:50,570 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:50,576 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:50,583 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:50,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:50,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:50,585 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:50,586 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:50,588 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:50,599 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:50,599 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:50,599 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:50,599 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:50,602 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:50,602 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:50,608 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:53:50,626 INFO L436 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2025-04-26 16:53:50,626 INFO L437 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-04-26 16:53:50,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:50,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:50,628 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:50,638 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:50,639 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:53:50,661 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:50,661 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:53:50,661 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:53:50,661 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork1_i, N) = -1*thread2Thread1of1ForFork1_i + 1*N Supporting invariants [] [2025-04-26 16:53:50,671 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:50,672 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:53:50,686 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:50,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:53:50,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:53:50,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:50,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:50,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:53:50,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:50,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:50,711 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,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:50,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:50,711 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:53:50,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:50,731 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:50,731 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:50,731 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 194 states and 339 transitions. cyclomatic complexity: 172 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:50,796 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 194 states and 339 transitions. cyclomatic complexity: 172. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 465 states and 847 transitions. Complement of second has 7 states. [2025-04-26 16:53:50,797 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:50,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:50,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2025-04-26 16:53:50,798 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 61 transitions. Stem has 10 letters. Loop has 3 letters. [2025-04-26 16:53:50,798 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:50,798 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 61 transitions. Stem has 13 letters. Loop has 3 letters. [2025-04-26 16:53:50,798 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:50,799 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 61 transitions. Stem has 10 letters. Loop has 6 letters. [2025-04-26 16:53:50,799 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:50,799 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 465 states and 847 transitions. [2025-04-26 16:53:50,806 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 69 [2025-04-26 16:53:50,809 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 465 states to 307 states and 525 transitions. [2025-04-26 16:53:50,809 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 136 [2025-04-26 16:53:50,809 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 169 [2025-04-26 16:53:50,809 INFO L74 IsDeterministic]: Start isDeterministic. Operand 307 states and 525 transitions. [2025-04-26 16:53:50,809 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:50,810 INFO L218 hiAutomatonCegarLoop]: Abstraction has 307 states and 525 transitions. [2025-04-26 16:53:50,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states and 525 transitions. [2025-04-26 16:53:50,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 254. [2025-04-26 16:53:50,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 254 states have (on average 1.7755905511811023) internal successors, (in total 451), 253 states have internal predecessors, (451), 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,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 451 transitions. [2025-04-26 16:53:50,827 INFO L240 hiAutomatonCegarLoop]: Abstraction has 254 states and 451 transitions. [2025-04-26 16:53:50,827 INFO L438 stractBuchiCegarLoop]: Abstraction has 254 states and 451 transitions. [2025-04-26 16:53:50,827 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:53:50,827 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 254 states and 451 transitions. [2025-04-26 16:53:50,828 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 54 [2025-04-26 16:53:50,828 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:50,828 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:50,832 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:50,832 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:53:50,833 INFO L752 eck$LassoCheckResult]: Stem: "[65] $Ultimate##0-->L16: Formula: (and (< v_k_3 v_N_7) (<= 0 v_k_3)) InVars {k=v_k_3, N=v_N_7} OutVars{k=v_k_3, N=v_N_7} AuxVars[] AssignedVars[]" "[41] L16-->L18: Formula: (= v_B_5 v_A_7) InVars {A=v_A_7} OutVars{A=v_A_7, B=v_B_5} AuxVars[] AssignedVars[B]" "[90] L18-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_i]" "[70] $Ultimate##0-->L34-1: Formula: (= v_thread1Thread1of1ForFork0_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i]" "[72] L34-1-->L35: Formula: (< v_thread1Thread1of1ForFork0_i_5 v_N_1) InVars {thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_5, N=v_N_1} AuxVars[] AssignedVars[]" "[74] L35-->L36: Formula: (= v_A_1 (store v_A_2 v_thread1Thread1of1ForFork0_i_7 (+ (select v_A_2 v_thread1Thread1of1ForFork0_i_7) 1))) InVars {A=v_A_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_7} AuxVars[] AssignedVars[A]" "[75] L36-->L34-1: Formula: (= v_thread1Thread1of1ForFork0_i_10 (+ v_thread1Thread1of1ForFork0_i_9 1)) InVars {thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_9} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i]" "[71] L34-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork0_i_3) InVars {thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_3, N=v_N_2} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_3, N=v_N_2} AuxVars[] AssignedVars[]" "[73] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[93] L18-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_14, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_i, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[76] $Ultimate##0-->L46-1: Formula: (= v_thread2Thread1of1ForFork1_i_1 0) InVars {} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_i]" [2025-04-26 16:53:50,833 INFO L754 eck$LassoCheckResult]: Loop: "[78] L46-1-->L47: Formula: (< v_thread2Thread1of1ForFork1_i_5 v_N_4) InVars {thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_5, N=v_N_4} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_5, N=v_N_4} AuxVars[] AssignedVars[]" "[80] L47-->L48: Formula: (= (store v_A_4 v_thread2Thread1of1ForFork1_i_7 (+ 2 (select v_A_4 v_thread2Thread1of1ForFork1_i_7))) v_A_3) InVars {A=v_A_4, thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_7} OutVars{A=v_A_3, thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_7} AuxVars[] AssignedVars[A]" "[81] L48-->L46-1: Formula: (= (+ v_thread2Thread1of1ForFork1_i_9 1) v_thread2Thread1of1ForFork1_i_10) InVars {thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_9} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_10} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_i]" [2025-04-26 16:53:50,833 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:50,833 INFO L85 PathProgramCache]: Analyzing trace with hash -529465179, now seen corresponding path program 1 times [2025-04-26 16:53:50,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:50,833 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055806577] [2025-04-26 16:53:50,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:50,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:50,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:53:50,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:53:50,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:50,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:50,840 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:50,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:53:50,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:53:50,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:50,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:50,846 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:50,847 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:50,847 INFO L85 PathProgramCache]: Analyzing trace with hash 107310, now seen corresponding path program 3 times [2025-04-26 16:53:50,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:50,847 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674793129] [2025-04-26 16:53:50,847 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:53:50,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:50,850 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:50,851 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:50,851 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:53:50,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:50,851 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:50,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:50,853 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,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:50,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:50,854 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:50,855 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:50,855 INFO L85 PathProgramCache]: Analyzing trace with hash 2117808138, now seen corresponding path program 1 times [2025-04-26 16:53:50,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:50,855 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874784952] [2025-04-26 16:53:50,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:50,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:50,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:53:50,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:53:50,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:50,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:50,863 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:50,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:53:50,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:53:50,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:50,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:50,868 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:50,950 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:53:50,950 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:53:50,950 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:53:50,950 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:53:50,950 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:53:50,950 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:50,950 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:53:50,950 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:53:50,950 INFO L132 ssoRankerPreferences]: Filename of dumped script: map-comp.bpl_petrified1_Iteration4_Lasso [2025-04-26 16:53:50,951 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:53:50,951 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:53:50,951 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:50,998 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:51,000 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:51,006 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:51,008 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:51,088 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:53:51,088 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:53:51,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:51,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:51,090 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:51,092 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:51,093 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:51,104 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:51,104 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:51,104 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:51,104 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:51,110 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:51,110 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:51,118 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:53:51,128 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 16:53:51,128 INFO L437 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 16:53:51,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:51,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:51,130 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:51,132 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:51,133 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:53:51,149 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:51,149 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:53:51,149 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:53:51,150 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork1_i, N) = -1*thread2Thread1of1ForFork1_i + 1*N Supporting invariants [] [2025-04-26 16:53:51,155 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:51,156 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:53:51,165 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:51,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:53:51,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:53:51,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:51,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:51,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:53:51,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:51,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:51,190 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,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:51,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:51,191 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:53:51,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:51,205 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,206 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,206 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 254 states and 451 transitions. cyclomatic complexity: 223 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 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:51,247 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 254 states and 451 transitions. cyclomatic complexity: 223. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 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 530 states and 970 transitions. Complement of second has 6 states. [2025-04-26 16:53:51,249 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:51,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 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:51,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2025-04-26 16:53:51,250 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 53 transitions. Stem has 11 letters. Loop has 3 letters. [2025-04-26 16:53:51,250 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:51,250 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 53 transitions. Stem has 14 letters. Loop has 3 letters. [2025-04-26 16:53:51,251 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:51,251 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 53 transitions. Stem has 11 letters. Loop has 6 letters. [2025-04-26 16:53:51,251 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:51,251 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 530 states and 970 transitions. [2025-04-26 16:53:51,258 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 21 [2025-04-26 16:53:51,260 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 530 states to 298 states and 533 transitions. [2025-04-26 16:53:51,260 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 66 [2025-04-26 16:53:51,262 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 110 [2025-04-26 16:53:51,262 INFO L74 IsDeterministic]: Start isDeterministic. Operand 298 states and 533 transitions. [2025-04-26 16:53:51,262 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:51,262 INFO L218 hiAutomatonCegarLoop]: Abstraction has 298 states and 533 transitions. [2025-04-26 16:53:51,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states and 533 transitions. [2025-04-26 16:53:51,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 245. [2025-04-26 16:53:51,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 245 states have (on average 1.8081632653061224) internal successors, (in total 443), 244 states have internal predecessors, (443), 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:51,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 443 transitions. [2025-04-26 16:53:51,273 INFO L240 hiAutomatonCegarLoop]: Abstraction has 245 states and 443 transitions. [2025-04-26 16:53:51,273 INFO L438 stractBuchiCegarLoop]: Abstraction has 245 states and 443 transitions. [2025-04-26 16:53:51,273 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:53:51,273 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 245 states and 443 transitions. [2025-04-26 16:53:51,274 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 21 [2025-04-26 16:53:51,274 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:51,274 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:51,274 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:51,274 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:53:51,276 INFO L752 eck$LassoCheckResult]: Stem: "[65] $Ultimate##0-->L16: Formula: (and (< v_k_3 v_N_7) (<= 0 v_k_3)) InVars {k=v_k_3, N=v_N_7} OutVars{k=v_k_3, N=v_N_7} AuxVars[] AssignedVars[]" "[41] L16-->L18: Formula: (= v_B_5 v_A_7) InVars {A=v_A_7} OutVars{A=v_A_7, B=v_B_5} AuxVars[] AssignedVars[B]" "[90] L18-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_i]" "[70] $Ultimate##0-->L34-1: Formula: (= v_thread1Thread1of1ForFork0_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i]" "[72] L34-1-->L35: Formula: (< v_thread1Thread1of1ForFork0_i_5 v_N_1) InVars {thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_5, N=v_N_1} AuxVars[] AssignedVars[]" "[74] L35-->L36: Formula: (= v_A_1 (store v_A_2 v_thread1Thread1of1ForFork0_i_7 (+ (select v_A_2 v_thread1Thread1of1ForFork0_i_7) 1))) InVars {A=v_A_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_7} AuxVars[] AssignedVars[A]" "[75] L36-->L34-1: Formula: (= v_thread1Thread1of1ForFork0_i_10 (+ v_thread1Thread1of1ForFork0_i_9 1)) InVars {thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_9} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i]" "[71] L34-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork0_i_3) InVars {thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_3, N=v_N_2} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_3, N=v_N_2} AuxVars[] AssignedVars[]" "[73] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[93] L18-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_14, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_i, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[76] $Ultimate##0-->L46-1: Formula: (= v_thread2Thread1of1ForFork1_i_1 0) InVars {} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_i]" "[77] L46-1-->thread2FINAL: Formula: (<= v_N_3 v_thread2Thread1of1ForFork1_i_3) InVars {thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_3, N=v_N_3} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_3, N=v_N_3} AuxVars[] AssignedVars[]" "[79] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[96] L19-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_14, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_i, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[82] $Ultimate##0-->L58-1: Formula: (= v_thread3Thread1of1ForFork2_i_1 0) InVars {} OutVars{thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_i]" [2025-04-26 16:53:51,276 INFO L754 eck$LassoCheckResult]: Loop: "[84] L58-1-->L59: Formula: (< v_thread3Thread1of1ForFork2_i_5 v_N_5) InVars {thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_5, N=v_N_5} OutVars{thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_5, N=v_N_5} AuxVars[] AssignedVars[]" "[86] L59-->L60: Formula: (= v_B_1 (store v_B_2 v_thread3Thread1of1ForFork2_i_7 (+ 3 (select v_B_2 v_thread3Thread1of1ForFork2_i_7)))) InVars {thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_7, B=v_B_2} OutVars{thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_7, B=v_B_1} AuxVars[] AssignedVars[B]" "[87] L60-->L58-1: Formula: (= v_thread3Thread1of1ForFork2_i_10 (+ v_thread3Thread1of1ForFork2_i_9 1)) InVars {thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_9} OutVars{thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_10} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_i]" [2025-04-26 16:53:51,277 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:51,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1227512633, now seen corresponding path program 1 times [2025-04-26 16:53:51,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:51,277 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130454849] [2025-04-26 16:53:51,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:51,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:51,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:53:51,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:53:51,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:51,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:51,315 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:51,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:53:51,315 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130454849] [2025-04-26 16:53:51,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130454849] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:53:51,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:53:51,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:53:51,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751707084] [2025-04-26 16:53:51,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:53:51,315 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:53:51,316 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:51,316 INFO L85 PathProgramCache]: Analyzing trace with hash 113268, now seen corresponding path program 1 times [2025-04-26 16:53:51,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:51,316 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130382875] [2025-04-26 16:53:51,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:51,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:51,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:51,320 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,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:51,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:51,320 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:51,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:51,322 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,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:51,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:51,324 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:51,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:53:51,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:53:51,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-26 16:53:51,342 INFO L87 Difference]: Start difference. First operand 245 states and 443 transitions. cyclomatic complexity: 219 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:51,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:53:51,370 INFO L93 Difference]: Finished difference Result 292 states and 516 transitions. [2025-04-26 16:53:51,370 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 292 states and 516 transitions. [2025-04-26 16:53:51,371 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 21 [2025-04-26 16:53:51,374 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 292 states to 270 states and 487 transitions. [2025-04-26 16:53:51,374 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 90 [2025-04-26 16:53:51,375 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2025-04-26 16:53:51,375 INFO L74 IsDeterministic]: Start isDeterministic. Operand 270 states and 487 transitions. [2025-04-26 16:53:51,375 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:51,376 INFO L218 hiAutomatonCegarLoop]: Abstraction has 270 states and 487 transitions. [2025-04-26 16:53:51,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states and 487 transitions. [2025-04-26 16:53:51,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 245. [2025-04-26 16:53:51,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 245 states have (on average 1.8040816326530613) internal successors, (in total 442), 244 states have internal predecessors, (442), 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:51,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 442 transitions. [2025-04-26 16:53:51,384 INFO L240 hiAutomatonCegarLoop]: Abstraction has 245 states and 442 transitions. [2025-04-26 16:53:51,386 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 16:53:51,386 INFO L438 stractBuchiCegarLoop]: Abstraction has 245 states and 442 transitions. [2025-04-26 16:53:51,386 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:53:51,386 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 245 states and 442 transitions. [2025-04-26 16:53:51,387 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 21 [2025-04-26 16:53:51,387 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:51,387 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:51,388 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:51,388 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:53:51,388 INFO L752 eck$LassoCheckResult]: Stem: "[65] $Ultimate##0-->L16: Formula: (and (< v_k_3 v_N_7) (<= 0 v_k_3)) InVars {k=v_k_3, N=v_N_7} OutVars{k=v_k_3, N=v_N_7} AuxVars[] AssignedVars[]" "[41] L16-->L18: Formula: (= v_B_5 v_A_7) InVars {A=v_A_7} OutVars{A=v_A_7, B=v_B_5} AuxVars[] AssignedVars[B]" "[90] L18-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_i]" "[70] $Ultimate##0-->L34-1: Formula: (= v_thread1Thread1of1ForFork0_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i]" "[72] L34-1-->L35: Formula: (< v_thread1Thread1of1ForFork0_i_5 v_N_1) InVars {thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_5, N=v_N_1} AuxVars[] AssignedVars[]" "[74] L35-->L36: Formula: (= v_A_1 (store v_A_2 v_thread1Thread1of1ForFork0_i_7 (+ (select v_A_2 v_thread1Thread1of1ForFork0_i_7) 1))) InVars {A=v_A_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_7} AuxVars[] AssignedVars[A]" "[93] L18-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_14, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_i, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[76] $Ultimate##0-->L46-1: Formula: (= v_thread2Thread1of1ForFork1_i_1 0) InVars {} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_i]" "[75] L36-->L34-1: Formula: (= v_thread1Thread1of1ForFork0_i_10 (+ v_thread1Thread1of1ForFork0_i_9 1)) InVars {thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_9} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i]" "[71] L34-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork0_i_3) InVars {thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_3, N=v_N_2} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_3, N=v_N_2} AuxVars[] AssignedVars[]" "[78] L46-1-->L47: Formula: (< v_thread2Thread1of1ForFork1_i_5 v_N_4) InVars {thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_5, N=v_N_4} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_5, N=v_N_4} AuxVars[] AssignedVars[]" "[80] L47-->L48: Formula: (= (store v_A_4 v_thread2Thread1of1ForFork1_i_7 (+ 2 (select v_A_4 v_thread2Thread1of1ForFork1_i_7))) v_A_3) InVars {A=v_A_4, thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_7} OutVars{A=v_A_3, thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_7} AuxVars[] AssignedVars[A]" "[96] L19-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_14, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_i, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[82] $Ultimate##0-->L58-1: Formula: (= v_thread3Thread1of1ForFork2_i_1 0) InVars {} OutVars{thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_i]" "[81] L48-->L46-1: Formula: (= (+ v_thread2Thread1of1ForFork1_i_9 1) v_thread2Thread1of1ForFork1_i_10) InVars {thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_9} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_10} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_i]" "[77] L46-1-->thread2FINAL: Formula: (<= v_N_3 v_thread2Thread1of1ForFork1_i_3) InVars {thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_3, N=v_N_3} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_3, N=v_N_3} AuxVars[] AssignedVars[]" [2025-04-26 16:53:51,388 INFO L754 eck$LassoCheckResult]: Loop: "[84] L58-1-->L59: Formula: (< v_thread3Thread1of1ForFork2_i_5 v_N_5) InVars {thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_5, N=v_N_5} OutVars{thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_5, N=v_N_5} AuxVars[] AssignedVars[]" "[86] L59-->L60: Formula: (= v_B_1 (store v_B_2 v_thread3Thread1of1ForFork2_i_7 (+ 3 (select v_B_2 v_thread3Thread1of1ForFork2_i_7)))) InVars {thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_7, B=v_B_2} OutVars{thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_7, B=v_B_1} AuxVars[] AssignedVars[B]" "[87] L60-->L58-1: Formula: (= v_thread3Thread1of1ForFork2_i_10 (+ v_thread3Thread1of1ForFork2_i_9 1)) InVars {thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_9} OutVars{thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_10} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_i]" [2025-04-26 16:53:51,391 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:51,391 INFO L85 PathProgramCache]: Analyzing trace with hash 909503218, now seen corresponding path program 1 times [2025-04-26 16:53:51,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:51,391 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516429175] [2025-04-26 16:53:51,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:51,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:51,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:53:51,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:53:51,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:51,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:51,406 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:51,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:53:51,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:53:51,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:51,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:51,416 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:51,416 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:51,416 INFO L85 PathProgramCache]: Analyzing trace with hash 113268, now seen corresponding path program 2 times [2025-04-26 16:53:51,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:51,416 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886742870] [2025-04-26 16:53:51,416 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:53:51,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:51,422 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:51,423 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:51,423 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:53:51,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:51,423 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:51,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:51,424 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,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:51,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:51,427 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:51,428 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:51,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1938219549, now seen corresponding path program 1 times [2025-04-26 16:53:51,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:51,428 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057572627] [2025-04-26 16:53:51,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:51,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:51,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:53:51,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:53:51,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:51,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:51,446 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:51,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:53:51,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:53:51,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:51,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:51,459 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:51,611 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:53:51,611 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:53:51,611 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:53:51,611 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:53:51,611 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:53:51,611 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:51,611 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:53:51,611 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:53:51,611 INFO L132 ssoRankerPreferences]: Filename of dumped script: map-comp.bpl_petrified1_Iteration6_Lasso [2025-04-26 16:53:51,611 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:53:51,611 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:53:51,612 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:51,614 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:51,616 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:51,618 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:51,620 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:51,668 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:51,670 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:51,671 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:51,673 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:51,760 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:53:51,761 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:53:51,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:51,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:51,763 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:51,764 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:51,767 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,777 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:51,777 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:51,777 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:51,777 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:51,778 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:51,778 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:51,781 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:51,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:51,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:51,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:51,788 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:51,789 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:51,790 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,800 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:51,801 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:51,801 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:51,801 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:51,802 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:51,802 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:51,804 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:51,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 16:53:51,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:51,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:51,813 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:51,814 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:51,815 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,825 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:51,825 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:51,825 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:51,825 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:51,826 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:51,827 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:51,829 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:51,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 16:53:51,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:51,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:51,837 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:51,838 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:51,839 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,849 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:51,849 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:51,849 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:51,849 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:51,850 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:51,850 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:51,855 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:51,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-04-26 16:53:51,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:51,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:51,863 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:51,864 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:51,865 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,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:51,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:51,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:51,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:51,878 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:51,878 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:51,882 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:53:51,887 INFO L436 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-04-26 16:53:51,887 INFO L437 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 16:53:51,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:51,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:51,889 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:51,891 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:51,891 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:53:51,908 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:51,908 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:53:51,908 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:53:51,908 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread3Thread1of1ForFork2_i, N) = -1*thread3Thread1of1ForFork2_i + 1*N Supporting invariants [] [2025-04-26 16:53:51,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-04-26 16:53:51,915 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:53:51,927 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:51,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:53:51,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:53:51,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:51,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:51,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:53:51,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:51,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:51,953 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,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:51,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:51,954 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:53:51,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:51,966 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,966 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,966 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 245 states and 442 transitions. cyclomatic complexity: 218 Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (in total 19), 3 states have internal predecessors, (19), 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,003 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 245 states and 442 transitions. cyclomatic complexity: 218. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (in total 19), 3 states have internal predecessors, (19), 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 445 states and 774 transitions. Complement of second has 7 states. [2025-04-26 16:53:52,003 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,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (in total 19), 3 states have internal predecessors, (19), 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,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2025-04-26 16:53:52,004 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 52 transitions. Stem has 16 letters. Loop has 3 letters. [2025-04-26 16:53:52,004 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:52,004 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 52 transitions. Stem has 19 letters. Loop has 3 letters. [2025-04-26 16:53:52,004 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:52,004 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 52 transitions. Stem has 16 letters. Loop has 6 letters. [2025-04-26 16:53:52,004 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:52,004 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 445 states and 774 transitions. [2025-04-26 16:53:52,007 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 21 [2025-04-26 16:53:52,007 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 445 states to 110 states and 167 transitions. [2025-04-26 16:53:52,008 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2025-04-26 16:53:52,008 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2025-04-26 16:53:52,008 INFO L74 IsDeterministic]: Start isDeterministic. Operand 110 states and 167 transitions. [2025-04-26 16:53:52,008 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:52,008 INFO L218 hiAutomatonCegarLoop]: Abstraction has 110 states and 167 transitions. [2025-04-26 16:53:52,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states and 167 transitions. [2025-04-26 16:53:52,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 105. [2025-04-26 16:53:52,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 105 states have (on average 1.542857142857143) internal successors, (in total 162), 104 states have internal predecessors, (162), 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,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 162 transitions. [2025-04-26 16:53:52,010 INFO L240 hiAutomatonCegarLoop]: Abstraction has 105 states and 162 transitions. [2025-04-26 16:53:52,010 INFO L438 stractBuchiCegarLoop]: Abstraction has 105 states and 162 transitions. [2025-04-26 16:53:52,010 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 16:53:52,010 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 105 states and 162 transitions. [2025-04-26 16:53:52,011 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 21 [2025-04-26 16:53:52,011 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:52,011 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:52,011 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:52,011 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:53:52,012 INFO L752 eck$LassoCheckResult]: Stem: "[65] $Ultimate##0-->L16: Formula: (and (< v_k_3 v_N_7) (<= 0 v_k_3)) InVars {k=v_k_3, N=v_N_7} OutVars{k=v_k_3, N=v_N_7} AuxVars[] AssignedVars[]" "[41] L16-->L18: Formula: (= v_B_5 v_A_7) InVars {A=v_A_7} OutVars{A=v_A_7, B=v_B_5} AuxVars[] AssignedVars[B]" "[90] L18-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_i]" "[70] $Ultimate##0-->L34-1: Formula: (= v_thread1Thread1of1ForFork0_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i]" "[72] L34-1-->L35: Formula: (< v_thread1Thread1of1ForFork0_i_5 v_N_1) InVars {thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_5, N=v_N_1} AuxVars[] AssignedVars[]" "[74] L35-->L36: Formula: (= v_A_1 (store v_A_2 v_thread1Thread1of1ForFork0_i_7 (+ (select v_A_2 v_thread1Thread1of1ForFork0_i_7) 1))) InVars {A=v_A_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_7} AuxVars[] AssignedVars[A]" "[75] L36-->L34-1: Formula: (= v_thread1Thread1of1ForFork0_i_10 (+ v_thread1Thread1of1ForFork0_i_9 1)) InVars {thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_9} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i]" "[71] L34-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork0_i_3) InVars {thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_3, N=v_N_2} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_3, N=v_N_2} AuxVars[] AssignedVars[]" "[73] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[93] L18-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_14, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_i, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[76] $Ultimate##0-->L46-1: Formula: (= v_thread2Thread1of1ForFork1_i_1 0) InVars {} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_i]" "[78] L46-1-->L47: Formula: (< v_thread2Thread1of1ForFork1_i_5 v_N_4) InVars {thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_5, N=v_N_4} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_5, N=v_N_4} AuxVars[] AssignedVars[]" "[80] L47-->L48: Formula: (= (store v_A_4 v_thread2Thread1of1ForFork1_i_7 (+ 2 (select v_A_4 v_thread2Thread1of1ForFork1_i_7))) v_A_3) InVars {A=v_A_4, thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_7} OutVars{A=v_A_3, thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_7} AuxVars[] AssignedVars[A]" "[81] L48-->L46-1: Formula: (= (+ v_thread2Thread1of1ForFork1_i_9 1) v_thread2Thread1of1ForFork1_i_10) InVars {thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_9} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_10} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_i]" "[77] L46-1-->thread2FINAL: Formula: (<= v_N_3 v_thread2Thread1of1ForFork1_i_3) InVars {thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_3, N=v_N_3} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_3, N=v_N_3} AuxVars[] AssignedVars[]" "[79] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[96] L19-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_14, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_i, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[82] $Ultimate##0-->L58-1: Formula: (= v_thread3Thread1of1ForFork2_i_1 0) InVars {} OutVars{thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_i]" [2025-04-26 16:53:52,012 INFO L754 eck$LassoCheckResult]: Loop: "[84] L58-1-->L59: Formula: (< v_thread3Thread1of1ForFork2_i_5 v_N_5) InVars {thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_5, N=v_N_5} OutVars{thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_5, N=v_N_5} AuxVars[] AssignedVars[]" "[86] L59-->L60: Formula: (= v_B_1 (store v_B_2 v_thread3Thread1of1ForFork2_i_7 (+ 3 (select v_B_2 v_thread3Thread1of1ForFork2_i_7)))) InVars {thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_7, B=v_B_2} OutVars{thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_7, B=v_B_1} AuxVars[] AssignedVars[B]" "[87] L60-->L58-1: Formula: (= v_thread3Thread1of1ForFork2_i_10 (+ v_thread3Thread1of1ForFork2_i_9 1)) InVars {thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_9} OutVars{thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_10} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_i]" [2025-04-26 16:53:52,012 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:52,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1915465698, now seen corresponding path program 1 times [2025-04-26 16:53:52,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:52,012 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187412145] [2025-04-26 16:53:52,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:52,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:52,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:53:52,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:53:52,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:52,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:52,018 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:52,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:53:52,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:53:52,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:52,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:52,023 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:52,023 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:52,024 INFO L85 PathProgramCache]: Analyzing trace with hash 113268, now seen corresponding path program 3 times [2025-04-26 16:53:52,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:52,024 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748480422] [2025-04-26 16:53:52,024 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:53:52,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:52,025 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:52,026 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:52,026 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:53:52,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:52,027 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:52,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:52,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:52,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:52,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:52,028 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:52,029 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:52,029 INFO L85 PathProgramCache]: Analyzing trace with hash -703030985, now seen corresponding path program 1 times [2025-04-26 16:53:52,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:52,029 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48818944] [2025-04-26 16:53:52,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:52,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:52,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 16:53:52,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 16:53:52,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:52,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:52,036 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:52,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 16:53:52,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 16:53:52,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:52,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:52,042 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:52,166 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:53:52,167 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:53:52,167 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:53:52,167 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:53:52,167 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:53:52,167 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:52,167 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:53:52,167 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:53:52,167 INFO L132 ssoRankerPreferences]: Filename of dumped script: map-comp.bpl_petrified1_Iteration7_Lasso [2025-04-26 16:53:52,167 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:53:52,167 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:53:52,168 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:52,170 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:52,172 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:52,174 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:52,176 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:52,178 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:52,180 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:52,182 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:52,185 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:52,317 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:53:52,317 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:53:52,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:52,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:52,321 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:52,322 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:52,323 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:52,333 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:52,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:52,333 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:52,333 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:52,334 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:52,334 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:52,337 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:52,344 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:52,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:52,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:52,347 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:52,347 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:52,348 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:52,360 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:52,360 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:52,360 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:52,360 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:52,362 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:52,362 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:52,366 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:52,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-04-26 16:53:52,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:52,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:52,374 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:52,376 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:52,377 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:52,388 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:52,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:52,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:52,388 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:52,390 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:52,390 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:52,394 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:52,400 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:52,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:52,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:52,403 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:52,406 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:52,407 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:52,417 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:52,418 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:52,418 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:52,418 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:52,419 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:52,419 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:52,422 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:52,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:52,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:52,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:52,431 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:52,433 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:52,433 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:52,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:52,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:52,444 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:52,444 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:52,445 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:52,445 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:52,447 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:52,453 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:52,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:52,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:52,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:52,457 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:52,458 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:52,468 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:52,468 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:52,468 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:52,468 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:52,469 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:52,469 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:52,472 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:52,477 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:52,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:52,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:52,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:52,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:52,483 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:52,493 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:52,493 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:52,493 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:52,493 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:52,494 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:52,494 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:52,496 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:52,502 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:52,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:52,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:52,504 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:52,506 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:52,507 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:52,517 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:52,517 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:52,517 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:52,517 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:52,518 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:52,518 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:52,521 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:52,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:52,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:52,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:52,529 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:52,531 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:52,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:52,542 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:52,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:52,542 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:52,542 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:52,544 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:52,544 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:52,548 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:52,554 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:52,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:52,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:52,556 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:52,558 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:52,559 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:52,569 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:52,569 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:52,569 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:52,569 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:52,571 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:52,571 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:52,576 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:53:52,582 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:53:52,582 INFO L437 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 16:53:52,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:52,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:52,585 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:52,586 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:52,587 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:53:52,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:52,604 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:53:52,604 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:53:52,604 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread3Thread1of1ForFork2_i, N) = -1*thread3Thread1of1ForFork2_i + 1*N Supporting invariants [] [2025-04-26 16:53:52,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:52,612 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:53:52,626 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:52,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:53:52,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:53:52,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:52,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:52,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:53:52,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:52,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:52,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:52,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:52,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:52,666 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:53:52,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:52,680 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:52,680 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:52,681 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 105 states and 162 transitions. cyclomatic complexity: 73 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:52,709 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 105 states and 162 transitions. cyclomatic complexity: 73. 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 156 states and 245 transitions. Complement of second has 6 states. [2025-04-26 16:53:52,710 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,710 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:52,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2025-04-26 16:53:52,711 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 38 transitions. Stem has 18 letters. Loop has 3 letters. [2025-04-26 16:53:52,711 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:52,711 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 38 transitions. Stem has 21 letters. Loop has 3 letters. [2025-04-26 16:53:52,711 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:52,711 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 38 transitions. Stem has 18 letters. Loop has 6 letters. [2025-04-26 16:53:52,712 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:52,712 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 156 states and 245 transitions. [2025-04-26 16:53:52,712 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:53:52,713 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 156 states to 0 states and 0 transitions. [2025-04-26 16:53:52,713 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:53:52,713 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:53:52,713 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:53:52,713 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:53:52,713 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:53:52,713 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:53:52,713 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:53:52,713 INFO L340 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-04-26 16:53:52,713 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:53:52,713 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:53:52,713 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:53:52,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 16:53:52,727 INFO L201 PluginConnector]: Adding new model map-comp.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:53:52 BoogieIcfgContainer [2025-04-26 16:53:52,727 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:53:52,728 INFO L158 Benchmark]: Toolchain (without parser) took 4214.48ms. Allocated memory is still 142.6MB. Free memory was 72.2MB in the beginning and 84.1MB in the end (delta: -11.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:53:52,728 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.20ms. Allocated memory is still 142.6MB. Free memory is still 72.8MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:53:52,728 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.97ms. Allocated memory is still 142.6MB. Free memory was 72.2MB in the beginning and 70.3MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:53:52,728 INFO L158 Benchmark]: Boogie Preprocessor took 22.99ms. Allocated memory is still 142.6MB. Free memory was 70.3MB in the beginning and 69.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:53:52,728 INFO L158 Benchmark]: RCFGBuilder took 168.53ms. Allocated memory is still 142.6MB. Free memory was 69.2MB in the beginning and 59.7MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:53:52,729 INFO L158 Benchmark]: BuchiAutomizer took 3978.36ms. Allocated memory is still 142.6MB. Free memory was 59.7MB in the beginning and 84.1MB in the end (delta: -24.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:53:52,729 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.20ms. Allocated memory is still 142.6MB. Free memory is still 72.8MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.97ms. Allocated memory is still 142.6MB. Free memory was 72.2MB in the beginning and 70.3MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.99ms. Allocated memory is still 142.6MB. Free memory was 70.3MB in the beginning and 69.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 168.53ms. Allocated memory is still 142.6MB. Free memory was 69.2MB in the beginning and 59.7MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 3978.36ms. Allocated memory is still 142.6MB. Free memory was 59.7MB in the beginning and 84.1MB in the end (delta: -24.4MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.8s and 8 iterations. TraceHistogramMax:1. Analysis of lassos took 2.7s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 6. Automata minimization 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 164 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 276 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 271 mSDsluCounter, 268 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 112 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 234 IncrementalHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 156 mSDtfsCounter, 234 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU2 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital61 mio100 ax100 hnf100 lsp77 ukn79 mio100 lsp70 div100 bol100 ite100 ukn100 eq142 hnf92 smp100 dnf100 smp100 tf102 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 97ms VariablesStem: 3 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 227, Number of transitions in reduction automaton: 354, Number of states in reduction automaton: 203, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (2 trivial, 5 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * i + N and consists of 4 locations. One deterministic module has affine ranking function -1 * i + N and consists of 4 locations. One deterministic module has affine ranking function -1 * i + N and consists of 4 locations. One deterministic module has affine ranking function -1 * i + N and consists of 4 locations. One deterministic module has affine ranking function -1 * i + N and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 4 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:53:52,743 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...